A linear time approximation algorithm for multiprocessor scheduling
Purchase on Springer.com
$39.95 / €34.95 / £29.95*
Rent the article at a discountRent now
* Final gross prices may vary according to local VAT.
Givenn jobs andm identical processors anO(n) approximation algorithm is presented which tries to determine a nonpreemptive schedule with minimum finish time. Ifr is the number of jobs placed onto the processor with maximum finish time, then the worst case ratio of the new algorithm's finish time to the optimal solution is shown to be less thanrm/(rm−m+1). Extensive empirical results show that the new algorithm is competitive with the LPT algorithm in terms of quality of solution and faster in terms of computing time.
- E. G. Coffman, M. R. Garey, and D. S. Johnson,An application of bin-packing to multiprocessor scheduling, SIAM J. Comput., vol. 7, no. 1, Feb. 1978, 1–17. CrossRef
- E. G. Coffman and Ravi Sethi,A generalized bound on LPT scheduling, Revue française d'automatique informatique recherche operationelle, vol. 10, no. 5, May 1976, pp. 17–25.
- E. G. Coffman, ed.,Computer and job/shop scheduling theory, John Wiley, New York, 1976.
- M. R. Garey and D. S. Johnson,Computers and intractability, Freeman, San Francisco, 1979.
- R. L. Graham,Bounds on multiprocessing timing anomalies, SIAM J. Appl. Math. 17 (1969), pp. 416–429. CrossRef
- E. Horowitz and S. Sahni,Fundamentals of data structures, Computer Science Press, Potomac Md. 1976.
- E. Horowitz and S. Sahni,Fundamentals of computer algorithms. Computer Science Press, Potomac Md. 1978.
- J. D. Ullman,Complexity of sequencing problems, Computer and Job/shop scheduling theory, E. G. Coffman, ed. John Wiley, New York, 1976, Chap. 4.
- J. H. Ahrens and U. Dieter,A combinatorial method for the generation of normally distributed random numbers, Math. Comp., vol. 27, Oct. 1973, 927–937.
- A linear time approximation algorithm for multiprocessor scheduling
BIT Numerical Mathematics
Volume 19, Issue 3 , pp 312-320
- Cover Date
- Print ISSN
- Online ISSN
- Kluwer Academic Publishers
- Additional Links
- minimum finish time
- approximation algorithm
- Industry Sectors