An equivalent network for divisible load scheduling in nonblocking mode of communication

Suresh, S and Mani, V and Omkar, SN and Kim, HJ (2005) An equivalent network for divisible load scheduling in nonblocking mode of communication. In: Computers & Mathematics with Applications, 49 (9-10). pp. 1413-1431.

Preview

PDF A108.pdf Download (531kB)

Abstract

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.

Item Type:	Journal Article
Publication:	Computers & Mathematics with Applications
Publisher:	Pergamon-Elsevier Science Ltd
Additional Information:	Copyright for this article belongs to Elsevier.
Keywords:	Divisible loads;Single-level tree network;Blocking and nonblocking mode of communication;Equivalent network;Processing time
Department/Centre:	Division of Mechanical Sciences > Aerospace Engineering(Formerly Aeronautical Engineering)
Date Deposited:	08 Aug 2005
Last Modified:	19 Sep 2010 04:19
URI:	http://eprints.iisc.ac.in/id/eprint/3492

Actions (login required)

View Item