Fixed priority scheduling of periodic task sets with arbitrary deadlines

Author

Lehoczky, John P.

Author_Institution

Dept. of Stat., Carnegie Mellon Univ., Pittsburgh, PA, USA

fYear

1990

fDate

5-7 Dec 1990

Firstpage

201

Lastpage

209

Abstract

Consideration is given to the problem of fixed priority scheduling of period tasks with arbitrary deadlines. A general criterion for the schedulability of such a task set is given. Worst case bounds are given which generalize the C.L. Liu and J.W. Layland (1973) bound. The results are shown to provide a basis for developing predictable distributed real-time systems

Keywords

distributed processing; real-time systems; resource allocation; scheduling; arbitrary deadlines; distributed real-time systems; fixed priority scheduling; periodic task sets; schedulability; worst case bounds; Algorithm design and analysis; Computer displays; Contracts; Delay; Oceans; Performance analysis; Real time systems; Scheduling algorithm; Statistics; Stochastic processes;

fLanguage

English

Publisher

ieee

Conference_Titel

Real-Time Systems Symposium, 1990. Proceedings., 11th

Conference_Location

Lake Buena Vista, FL

Print_ISBN

0-8186-2112-5

Type

conf

DOI

10.1109/REAL.1990.128748

Filename

128748

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2831064