Article

BIT Numerical Mathematics

, Volume 19, Issue 3, pp 312-320

First online:

A linear time approximation algorithm for multiprocessor scheduling

  • Greg FinnAffiliated withComputer Science Department, University of Southern California
  • , Ellis HorowitzAffiliated withComputer Science Department, University of Southern California

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

Abstract

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/(rmm+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.

Key words

scheduling minimum finish time approximation algorithm