Divisible load scheduling in single-level tree networks: Optimal sequencing and arrangement in the nonblocking mode of communication

Kim, HJ and Mani, V (2003) Divisible load scheduling in single-level tree networks: Optimal sequencing and arrangement in the nonblocking mode of communication. In: Computers & Mathematics with Applications, 46 (10-11). pp. 1611-1623.

PDF sdarticle17.pdf - Published Version Restricted to Registered users only Download (1MB) | Request a copy

Abstract

The problem of scheduling divisible loads in a single-level tree network is considered. All the earlier studies in divisible load scheduling consider the blocking mode of communication. In this paper, the nonblocking mode of communication is considered. Closed-form expression for the processing time in the nonblocking mode of communication is derived. Using this closed-form expression, this paper analytically proves a number of significant results on load sequencing and processor-link arrangement in a single-level tree network. It is shown that the performance measures of interest such as the processing time, idle time, and utilization of processors are better in the nonblocking mode of communication than in the blocking mode of communication

Item Type:	Journal Article
Publication:	Computers & Mathematics with Applications
Publisher:	Elsevier Science
Additional Information:	Copyright of this article belongs to Elsevier Science
Keywords:	Divisible loads; Nonblocking mode of communication; Processing time; Optimal load sequence; Single-level tree network.
Department/Centre:	Division of Mechanical Sciences > Aerospace Engineering(Formerly Aeronautical Engineering)
Date Deposited:	18 May 2009 10:37
Last Modified:	19 Sep 2010 04:53
URI:	http://eprints.iisc.ac.in/id/eprint/16810

Actions (login required)

View Item