论文信息 - Preemptable malleable task scheduling problem

Preemptable malleable task scheduling problem

The problem of optimal scheduling n independent malleable tasks in a parallel processor system is studied. It is assumed that an execution of any task can be preempted and the number of processors allocated to the same task can change during its execution. We present a rectangle packing algorithm, which converts an optimal solution for the relaxed problem, in which the number of processors allocated to a task is not required to be integer, into an optimal solution for the original problem in O(n) time.

Jacek Blazewicz | Denis Trystram | Jan Weglarz | Mikhail Y. Kovalyov | Maciej Machowiak

[1] Jacek Blazewicz,et al. Scheduling Malleable Tasks on Parallel Processors to Minimize the Makespan , 2004, Ann. Oper. Res..

[2] Pierre Kuonen,et al. Parallel Computer Architectures for Commodity Computing , 1999 .

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

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

[5] Larry Rudolph,et al. Parallel Job Scheduling: Issues and Approaches , 1995, JSSPP.

[6] Klaus H. Ecker,et al. Scheduling Computer and Manufacturing Processes , 2001 .

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

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