论文信息 - Approximation Algorithms for Scheduling Independent Malleable Tasks

Approximation Algorithms for Scheduling Independent Malleable Tasks

Malleable tasks consist in considering the tasks of a parallel program as large computational units that may be themselves parallelized. In this paper we investigate the problem of scheduling a set of n independent malleable tasks on a m processors system, starting from the continuous version of the problem.

[1] Ronald L. Graham,et al. Bounds for certain multiprocessing anomalies , 1966 .

[2] Philip S. Yu,et al. Approximate algorithms scheduling parallelizable tasks , 1992, SPAA '92.

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

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

[5] G. N. Srinivasa Prasanna,et al. The optimal control approach to generalized multiprocessor scheduling , 2005, Algorithmica.

[6] A. Steinberg,et al. A Strip-Packing Algorithm with Absolute Performance Bound 2 , 1997, SIAM J. Comput..

[7] Denis Trystram,et al. Efficient approximation algorithms for scheduling malleable tasks , 1999, SPAA '99.

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

[9] Walter Ludwig,et al. Algorithms for scheduling malleable and nonmalleable parallel tasks , 1996, Technical Report / University of Wisconsin, Madison / Computer Sciences Department.