is presented to minimize the makespan of divisible workloads in parallel computing. A three-stage model is proposed and takes communication latency and computation start-up time into consideration. The algorithm provides a method to generate a near-optimal number of scheduling rounds. Close-form equations are given through analyzing a specific time sequence of load distribution
and then the bisection method
combined with back-forward adjustment
is used to get an asymptotically optimal number of scheduling rounds
which make the computation time overlap the communication time as much as possible and reduce the makespan. Simulation results show that the algorithm can find a near-optimal number of scheduling rounds under different network parameters. Compared with the classical algorithms such as FIFO and LIFO
the DCMR has higher adaptability. When the computation time dominates the communication time
the algorithm can keep the makespan at a rather low level which is about 1.1 times of the ideal time.
KANG Yu, YAN Xiangguo, ZHENG Chongxun, et al. Design and realization for a medical image visualization grid platform [J]. Journal of Xi'an Jiaotong University, 2007, 41(8): 1000-1002
KWANGIL K, ROBERTAZZI T G. Signature search time evaluation in flat file databases [J]. IEEE Trans on Aerospace and Electronic Systems,2008, 44(2): 493-502.
HUNG T G, ROBERTAZZI T G. Scheduling nonlinear computational loads [J]. IEEE Trans on Aerospace and Electronic Systems, 2008, 44(3): 1169-1182.
BHARADWAJ V, GHOSE D, MAN V. Multi-installment load distribution in tree networks with delays[J]. IEEE Trans on Aerospace and Electronic Systems, 1995, 31(2): 555-567.
BHARADWAJ V, GHOSE D, MAN V, et al. Scheduling divisible loads in parallel and distributed systems [M]. Los Alemitos, USA: IEEE Computer Society, 1996.
HAGERUP T. Allocating independent tasks to parallel processors: an experimental study [J]. Journal of Parallel and Distributed Computing, 1996,11(17):1-33.
BEAUMONT O, LEGRAND A, ROBERT Y. Scheduling divisible workloads on heterogeneous platforms[J]. Parallel Computing, 2003, 29(9):1121-1152.
YANG Y, RAADT K, CASANOVA H. Multiround algorithms for scheduling divisible loads[J]. IEEE Trans on Parallel and Distributed Systems, 2005, 16(11): 1092-1102.