DocumentCode
1510811
Title
Scheduling hard real-time systems: a review
Author
Burns, A.
Author_Institution
Dept. of Comput. Sci., York Univ., Heslington, UK
Volume
6
Issue
3
fYear
1991
fDate
5/1/1991 12:00:00 AM
Firstpage
116
Lastpage
128
Abstract
Results of the application of scheduling theory to hard real-time systems are reviewed in this paper. The review takes the form of an analysis of the problems presented by different application requirements and characteristics. Issues covered include uniprocessor and multiprocessor systems, periodic and aperiodic processes, static and dynamic algorithms, transient overloads and resource usage. Protocols that limit and reduce blocking are discussed. Consideration is also given to scheduling Ada tasks
Keywords
Ada; multiprocessing systems; real-time systems; scheduling; aperiodic processes; application requirements; dynamic algorithms; hard real-time systems; multiprocessor systems; periodic processes; protocols; resource usage; scheduling Ada tasks; scheduling theory; static algorithms; transient overloads; uniprocessor;
fLanguage
English
Journal_Title
Software Engineering Journal
Publisher
iet
ISSN
0268-6961
Type
jour
Filename
76598
Link To Document