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

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.