Aperiodic task scheduling for Hard-Real-Time systems

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.

DOI: 10.1007/BF02341920

20 Figures and Tables

0204060'92'95'98'01'04'07'10'13'16
Citations per Year

981 Citations

Semantic Scholar estimates that this publication has 981 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Sprunt1989AperiodicTS, title={Aperiodic task scheduling for Hard-Real-Time systems}, author={Brinkley Sprunt and Lui Sha and John P. Lehoczky}, journal={Real-Time Systems}, year={1989}, volume={1}, pages={27-60} }