A Simple Linear-Time Approximation Algorithm for Multi-processor Job Scheduling on Four Processors

Multiprocessor job scheduling problem has become increasingly interesting, for both theoretical study and practical applications. Theoretical study of the problem has made significant progress recently, which, however, seems not to imply practical algorithms for the problem, yet. Practical algorithms have been developed only for systems with three processors and the techniques seem difficult to extend to systems with more than three processors. This paper offers new observations and introduces new techniques for the multiprocessor job scheduling problem on systems with four processors. A very simple and practical linear time approximation algorithm of ratio bounded by 1:5 is developed for the multi-processor job scheduling problem P4|fix|Cmax, which significantly improves previous results. Our techniques are also useful for multiprocessor job scheduling problems on systems with more than four processors.

[1]  Leslie A. Hall,et al.  Approximation algorithms for scheduling , 1996 .

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

[3]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[4]  Uday S. Karmarkar,et al.  Simultaneous Resource Scheduling to Minimize Weighted Flow Times , 1989, Oper. Res..

[5]  Zsolt Tuza,et al.  Efficiency and effectiveness of normal schedules on three dedicated processors , 1997, Discret. Math..

[6]  Jianer Chen,et al.  A Polynomial Time Approximation Scheme for General Multiprocessor Job Scheduling , 2001, SIAM J. Comput..

[7]  Henryk Krawczyk,et al.  An Approximation Algorithm for Diagnostic Test Scheduling in Multicomputer Systems , 1985, IEEE Transactions on Computers.

[8]  Michael Pinedo,et al.  Current trends in deterministic scheduling , 1997, Ann. Oper. Res..

[9]  Han Hoogeveen,et al.  Complexity of Scheduling Multiprocessor Tasks with Prespecified Processor Allocations , 1994, Discret. Appl. Math..

[10]  Evripidis Bampis,et al.  Scheduling Independent Multiprocessor Tasks , 1997, ESA.

[11]  Lucio Bianco,et al.  Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors , 1995, Ann. Oper. Res..

[12]  Dorit S. Hochbaum,et al.  Approximation Algorithms for NP-Hard Problems , 1996 .

[13]  Jacek Blazewicz,et al.  Scheduling multiprocessor tasks of three dedicated processors information processing letters 41 (5) (1992) 275–280 , 1994 .

[14]  Michel X. Goemans,et al.  An Approximation Algorithm for Scheduling on Three Dedicated Machines , 1995, Discret. Appl. Math..

[15]  Jacek Blazewicz,et al.  Scheduling Multiprocessor Tasks on Three Dedicated Processors , 1992, Inf. Process. Lett..

[16]  Jianer Chen,et al.  General Multiprocessor Task Scheduling , 1999 .

[17]  Jacek Blazewicz,et al.  Corrigendum: Scheduling Multiprocessor Tasks on Three Dedicated Processors , 1994, Information Processing Letters.

[18]  Xiaoqiang Cai,et al.  Scheduling one and two-processor tasks on two parallel processors , 1999 .

[19]  Jianer Chen,et al.  A polynomial time approximation scheme for general multiprocessor job scheduling (extended abstract) , 1999, STOC '99.

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