Deadline Scheduling

  1. Lookup NU author(s)
  2. Professor Brian Randell
Author(s)Randell B, Zweig E, Lehman M
Publication type Report
Series Title
Report NumberRC 1842
Full text is not currently available for this publication.
The paper presents the results of an investigation, by means of simulation, of a variety of multiprocessor scheduling algorithms. The algorithms investigated included two that used job priority levels, and two that involved the specification of job deadlines. Thus changing relative job urgency with the passage of time would be reflected by periodic rescheduling. The evaluation of all algorithms was with with respect to their ability to meet deadlines.
InstitutionIBM T.J. Watson Research Center
Place PublishedYorktown Heights, NY, USA
ActionsLink to this publication