A Level Algorithm for Preemptive Scheduling

@article{Horvath1977ALA,
  title={A Level Algorithm for Preemptive Scheduling},
  author={Edward C. Horvath and Shui Lam and Ravi Sethi},
  journal={J. ACM},
  year={1977},
  volume={24},
  pages={32-43}
}
Muntz and Coffman give a level algorithm that constructs optimal preemptive schedules on identical processors when the task system is a tree or when there are only two processors available. Their algorithm is adapted here to handle processors of different speeds. The new algorithm is optimal for independent tasks on any number of processors and for arbitrary task systems on two processors, but not on three or more processors, even for trees. By taking the algorithm as a heuristic on m… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 79 CITATIONS, ESTIMATED 31% COVERAGE

79 Citations

0246'78'88'99'10
Citations per Year
Semantic Scholar estimates that this publication has 79 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…