Optimal Multi-installments Algorithm for Divisible Load Scheduling

Authors:
Shang Mingsheng;Sun Shixin
Affiliations:
University of Electronic Science and Technology, China;University of Electronic Science and Technology, China
Venue:
HPCASIA '05 Proceedings of the Eighth International Conference on High-Performance Computing in Asia-Pacific Region
Year:
2005

Citing 6
Cited 3

Optimal Scheduling Algorithms for Communication Constrained Parallel Processing

Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
Ten Reasons to Use Divisible Load Theory

Computer
UMR: A Multi-Round Algorithm for Scheduling Divisible Workloads

IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Scheduling divisible workloads on heterogeneous platforms

Parallel Computing - Parallel matrix algorithms and applications (PMAA '02)
Divisible Load Theory: A New Paradigm for Load Scheduling in Distributed Systems

Cluster Computing
Scheduling Divisible Loads on Star and Tree Networks: Results and Open Problems

IEEE Transactions on Parallel and Distributed Systems

Multi-round scheduling for divisible loads on the heterogeneous cluster systems of multi-core computers

Proceedings of the 2nd International Conference on Interaction Sciences: Information Technology, Culture and Human
A method for scheduling heterogeneous multi-installment systems

ACIIDS'11 Proceedings of the Third international conference on Intelligent information and database systems - Volume Part II
New method for scheduling heterogeneous multi-installment systems

Future Generation Computer Systems

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper, we study optimal algorithms for scheduling divisible load on a star network in multiinstallments, with the objective to minimize the processing time. Firstly, we consider approach based on linear programming. We found that optimal load sizes of each installment are determined by the number of processor and the rate of processor power to the communication speed. If the number of processor is given, we derive the optimal installments. And for achieving optimal processing time it is preferable to use more processors rather than more installments. Next, we consider optimal parameters of periodic multi-installment algorithm. For a given computation system, we derive the analytic expression of optimal installments. We further prove that, for large-scale workloads, any algorithm which keeps the communication link busy is asymptotically optimal, which gives a way to determine how many processors should be involved in processing.