An equivalent network for divisible load scheduling in nonblocking mode of communication
Scheduling divisible loads in nonblocking mode of communication in a single-level tree network is considered. For this scheduling problem, an equivalent single-level tree network in blocking mode of communication is derived. This equivalent network can be easily obtained by changing the speed parameters of the processors in the network. The advantages of this equivalent network are that we can easily obtain the results on when to distribute the load to processors in the network, optimal sequencing and arrangement of processors and the effect of start-up time in nonblocking mode of communication. Numerical examples are presented for ease of understanding the equivalent network concept. (c) 2005 Elsevier Ltd. All rights reserved.
equivalent network divisible loads single-level tree network blocking and nonblocking mode of communication processing time