Thumbnail
Access Restriction
Subscribed

Author Burns, A. ♦ Wellings, A. J.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Computer programming, programs & data
Abstract Ada 2005 has introduced a version of Baker's Stack Resource Protocol called the Preemption Level Control Protocol in order to support EDF scheduling. Baker's protocol is, however, a general protocol that can be used with a range of scheduling algorithms, for example any static job-level algorithm such as static values or a modified least laxity algorithm. This paper investigates the changes that would be needed to Ada 2005 to allow it to support user-defined scheduling, where the user can implement any scheduling approach that is compatible with Baker's algorithm.
Description Affiliation: University of York, Heslington, York, UK (Wellings, A. J.; Burns, A.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1989-04-01
Publisher Place New York
Journal ACM SIGAda Ada Letters (ALET)
Volume Number 30
Issue Number 1
Page Count 9
Starting Page 116
Ending Page 124


Open content in new tab

   Open content in new tab
Source: ACM Digital Library