Aperiodic task scheduling for Hard-Real-Time systems

Brinkley Sprunt, Lui Sha, John Lehoczky

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish (US)
Pages (from-to)27-60
Number of pages34
JournalReal-Time Systems: The International Journal of Time-Critical Computing Systems
Issue number1
StatePublished - Jun 1989
Externally publishedYes

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Modeling and Simulation
  • Computer Science Applications
  • Computer Networks and Communications
  • Control and Optimization
  • Electrical and Electronic Engineering


Dive into the research topics of 'Aperiodic task scheduling for Hard-Real-Time systems'. Together they form a unique fingerprint.

Cite this