Real-Time Systems

, Volume 1, Issue 1, pp 27–60

Aperiodic task scheduling for Hard-Real-Time systems

Authors

  • Brinkley Sprunt
    • Department of Electrical and Computer EngineeringCarnegie Mellon University
  • Lui Sha
    • Department of Computer ScienceCarnegie Mellon University
    • Software Engineering InstituteCarnegie Mellon University
  • John Lehoczky
    • Department of StatisticsCarnegie Mellon University
Article

DOI: 10.1007/BF02341920

Cite this article as:
Sprunt, B., Sha, L. & Lehoczky, J. Real-Time Syst (1989) 1: 27. doi:10.1007/BF02341920

Abstract

A real-time system consists of both aperiodic and periodic tasks. Periodic tasks have regular arrival times and hard deadlines. Aperiodic tasks have irregular arrival times and either soft or hard deadlines. In this article, we present a new algorithm, the Sporadic Server algorithm, which greatly improves response times for soft deadline aperiodic tasks and can guarantee hard deadlines for both periodic and aperiodic tasks. The operation of the Sporadic Server algorithm, its performance, and schedulability analysis are discussed and compared with previously published aperiodic service algorithms.

Copyright information

© Kluwer Academic Publishers 1989