Scheduling divisible workloads on heterogeneous platforms

In this paper, we discuss several algorithms for scheduling divisible workloads on heterogeneous systems. Our main contributions are (i) new optimality results for single-round algorithms and (ii) the design of an asymptotically optimal multi-round algorithm. This multi-round algorithm automatically performs resource selection, a difficult task that was previously left to the user. Because it is periodic, it is simpler to implement, and more robust to changes in the speeds of the processors and/or communication links. On the theoretical side, to the best of our knowledge, this is the first published result assessing the absolute performance of a multi-round algorithm. On the practical side, extensive simulations reveal that our multi-round algorithm outperforms existing solutions on a large variety of platforms, especially when the communication-to-computation ratio is not very high (the difficult case).

[1]  Anoop Gupta,et al.  Parallel computer architecture - a hardware / software approach , 1998 .

[2]  Bruce W. Char,et al.  Maple V Library Reference Manual , 1992, Springer New York.

[3]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[4]  Hesham H. Ali,et al.  Task scheduling in parallel and distributed systems , 1994, Prentice Hall series in innovative technology.

[5]  Giorgio Gambosi,et al.  Complexity and Approximation , 1999, Springer Berlin Heidelberg.

[6]  Giorgio Gambosi,et al.  Complexity and approximation: combinatorial optimization problems and their approximability properties , 1999 .

[7]  Francine Berman,et al.  Using Effective Network Views to Promote Distributed Application Performance , 1999, PDPTA.

[8]  Arnold L. Rosenberg,et al.  Sharing partitionable workloads in heterogeneous NOWs: greedier is not better , 2001, Proceedings 42nd IEEE Symposium on Foundations of Computer Science.

[9]  Henri Casanova,et al.  Simgrid: a toolkit for the simulation of application scheduling , 2001, Proceedings First IEEE/ACM International Symposium on Cluster Computing and the Grid.

[10]  Thomas G. Robertazzi,et al.  Parallel Processor Configuration Design with Processing/Transmission Costs , 2000, IEEE Trans. Computers.

[11]  Z Liu,et al.  Scheduling Theory and its Applications , 1997 .

[12]  Thomas G. Robertazzi,et al.  Optimizing Computing Costs Using Divisible Load Analysis , 1998, IEEE Trans. Parallel Distributed Syst..

[13]  Maciej Drozdowski,et al.  Selected problems of scheduling tasks in multiprocessor computer systems , 1997 .

[14]  Thomas G. Robertazzi,et al.  Closed Form Solutions for Bus and Tree Networks of Processors Load Sharing A Divisible Job , 1993, 1993 International Conference on Parallel Processing - ICPP'93.

[15]  Yakup Paker,et al.  Optimal Scheduling Algorithms for Communication Constrained Parallel Processing , 2002, Euro-Par.

[16]  Torben Hagerup,et al.  Allocating Independent Tasks to Parallel Processors: An Experimental Study , 1996, J. Parallel Distributed Comput..

[17]  D. Turgay Altilar,et al.  An optimal scheduling algorithm for parallel video processing , 1998, Proceedings. IEEE International Conference on Multimedia Computing and Systems (Cat. No.98TB100241).

[18]  Jacek Blazewicz,et al.  Divisible task scheduling - Concept and verification , 1999, Parallel Comput..

[19]  Richard P. Martin,et al.  Modeling communication pipeline latency , 1998, SIGMETRICS '98/PERFORMANCE '98.

[20]  Larry Carter,et al.  Bandwidth-centric allocation of independent tasks on heterogeneous platforms , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.

[21]  Henri Casanova,et al.  Parameter Sweeps on the Grid with APST , 2003 .

[22]  Edith Schonberg,et al.  Factoring: a method for scheduling parallel loops , 1992 .

[23]  Mounir Hamdi,et al.  Parallel Image Processing Applications on a Network of Workstations , 1995, Parallel Comput..

[24]  Debasish Ghose,et al.  Scheduling Divisible Loads in Parallel and Distributed Systems , 1996 .