Issue No.04 - April (2006 vol.55)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2006.58
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.
Scheduling, resource allocation, parallel computing.
Mikhail Y. Kovalyov, Maciej Machowiak, Denis Trystram, Jan Weglarz, "Preemptable Malleable Task Scheduling Problem", IEEE Transactions on Computers, vol.55, no. 4, pp. 486-490, April 2006, doi:10.1109/TC.2006.58