This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Preemptable Malleable Task Scheduling Problem
April 2006 (vol. 55 no. 4)
pp. 486-490
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.

[1] J. Blazewicz, M. Drabowski, and J. Weglarz, “Scheduling Multiprocessor Tasks to Minimize Schedule Length,” IEEE Trans. Computers, vol. 35, pp. 389-393, 1986.
[2] J. Blazewicz, K. Ecker, E. Pesch, G. Schmidt, and J. Weglarz, Scheduling Computer and Manufacturing Processes. Berlin and New York: Springer, 1996.
[3] Handbook on Parallel and Distributed Processing, J. Blazewicz, K. Ecker, B. Plateau, and D. Trystram, eds. Berlin and New York: Springer, 2000.
[4] J. Blazewicz, M.Y. Kovalyov, M. Machowiak, D. Trystram, and J. Weglarz, “Malleable Task Scheduling to Minimize the Makespan,” Annals of Operations Research, vol. 129, pp. 65-80, 2004.
[5] D.E. Culler, J.P. Singh, and A. Gupta, Parallel Computer Architecture. Morgan Kaufman, 1999.
[6] D. Feitelson and L. Rudolph, “Parallel Jobs Scheduling: Issues and Approaches,” Lecture Notes in Computer Science, vol. 949, pp. 1-18, 1995.
[7] W.T. Ludwig, “Algorithms for Scheduling Malleable and Nonmalleable Parallel Tasks,” PhD thesis, Dept. of Computer Science, Univ. of Wisconsin-Madison, 1995.
[8] G. Mounie, C. Rapine, and D. Trystram, “A 3/2 Dual Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks,” Technical Report IMAG, 2000.
[9] J. Weglarz, “Modelling and Control of Dynamic Resource Allocation Project Scheduling Systems,” Optimization and Control of Dynamic Operational ResearchModels, S.G. Tzafestas, ed., Amsterdam: North-Holland, 1982.

Index Terms:
Scheduling, resource allocation, parallel computing.
Citation:
Jacek Blazewicz, 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
Usage of this product signifies your acceptance of the Terms of Use.