Skip to main content
Article thumbnail
Location of Repository

real-time scheduling: the deadline-monotonic approach

By N. C. Audsley, A. Burns, M. F. Richardson and A. J. Wellings

Abstract

ABSTRACT. The scheduling of processes to meet deadlines is a difficult problem often simplified by placing severe restrictions upon the timing characteristics of individual processes. One restriction often introduced is that processes must have deadline equal to period. This paper investigates schedulability tests for sets of periodic processes whose deadlines are permitted to be less than their period. Such a relaxation enables sporadic processes to be directly incorporated without alteration to the process model. Following an introduction outlining the constraints associated with existing scheduling approaches and associated schedulability tests, the deadline-monotonic approach is introduced. New schedulability tests are derived which vary in computational complexity. The tests are shown to be directly applicable to the scheduling of sporadic processes

Topics: deadlines, mathematical analysis, real-computer computer
Year: 1991
OAI identifier: oai:CiteSeerX.psu:10.1.1.135.1223
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cs.cmu.edu/~ssaewon... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.