Improved methods for divisible load distribution on d‐dimensional hypercube using multi‐installment

Abstract

In divisible load distribution, the classic hypercube method distributes divisible load such that each layer transmits one load fraction to the next layer. This classic load distribution method provides only one communication period at each layer, resulting in too much communication idle‐time on each layer. In this paper, we propose two algorithms which use pipelined communication with multi‐installments to solve the communication idle‐time problem and to achieve better performance. The closed form solutions to the function of parallel execution time and speedup for a d‐dimensional hypercube, based on the proposed methods, are also derived.