Efficient Parallel Scheduling of Malleable Tasks

We give an $O(n + \min\{n,m\} \log{m})$ work algorithm for scheduling $n$ tasks with flexible amount of parallelism on $m$ processors, provided the speedup functions of the tasks are concave. We give efficient parallelizations of the algorithm that run in polylogarithmic time. Previous algorithms were sequential and required quadratic work. This is in some sense a best-possible result since the problem is NP-hard for more general speedup functions.

[1]  Jacek Blazewicz,et al.  Preemptable malleable task scheduling problem , 2006, IEEE Transactions on Computers.

[2]  Donald B. Johnson,et al.  The Complexity of Selection and Ranking in X+Y and Matrices with Sorted Columns , 1982, J. Comput. Syst. Sci..

[3]  S. Sitharama Iyengar,et al.  Introduction to parallel algorithms , 1998, Wiley series on parallel and distributed computing.

[4]  Eric Ruppert,et al.  Finding the k Shortest Paths in Parallel , 1997, Algorithmica.

[5]  Donald B. Johnson,et al.  Selecting the Kth element in X + Y and X_1 + X_2 + ... + X_m , 1978, SIAM J. Comput..

[6]  Joseph JáJá,et al.  An Introduction to Parallel Algorithms , 1992 .

[7]  Joseph Y.-T. Leung,et al.  Complexity of Scheduling Parallel Task Systems , 1989, SIAM J. Discret. Math..

[8]  Yacov Y. Haimes.  Optimisation and Control of Dynamic Operational Research Models , 1983 .

[9]  Richard Cole,et al.  Parallel merge sort , 1988, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[10]  Robert McNaughton,et al.  Scheduling with Deadlines and Loss Functions , 1959 .

[11]  Klaus Jansen,et al.  Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks , 1999, SODA '99.

[12]  Denis Trystram,et al.  A 3/2-Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks , 2007, SIAM J. Comput..

[13]  Maciej Drozdowski.  On the complexity of multiprocessor task scheduling , 1995 .

[14]  Prasoon Tiwari,et al.  Scheduling malleable and nonmalleable parallel tasks , 1994, SODA '94.

[15]  J. Davenport.  Editor , 1960 .

[16]  Jacek Blazewicz,et al.  Scheduling Multiprocessor Tasks to Minimize Schedule Length , 1986, IEEE Transactions on Computers.

[17]  Richard J. Anderson,et al.  Parallel Approximation Algorithms for Bin Packing , 1988, Inf. Comput..

[18]  Hong Shen.  Optimal parallel weighted multiselection , 2002, 2002 IEEE Region 10 Conference on Computers, Communications, Control and Power Engineering. TENCOM '02. Proceedings..

[19]  W. D. Ray.  Optimisation and Control of Dynamic Operational Research Models , 1983 .

[20]  Klaus Jansen,et al.  Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial Time Approximation Scheme , 2004, Algorithmica.