Scheduling hard real-time systems: a review
- 1 January 1991
- journal article
- review article
- Published by Institution of Engineering and Technology (IET) in Software Engineering Journal
- Vol. 6 (3) , 116-128
- https://doi.org/10.1049/sej.1991.0015
Abstract
Recent results in 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
This publication has 10 references indexed in Scilit:
- Real-Time Scheduling Theory and AdaPublished by Defense Technical Information Center (DTIC) ,1989
- Scheduling Sporadic and Aperiodic Events in a Hard Real-Time SystemPublished by Defense Technical Information Center (DTIC) ,1989
- The priority ceiling protocol: A method for minimizing the blocking of high priority Ada tasksPublished by Association for Computing Machinery (ACM) ,1988
- A testbed for investigating real-time Ada issuesPublished by Association for Computing Machinery (ACM) ,1988
- Problems in Ada runtime task schedulingPublished by Association for Computing Machinery (ACM) ,1987
- Scheduling difficulties of Ada in the hard real-time environmentPublished by Association for Computing Machinery (ACM) ,1987
- Real-time Ada issuesPublished by Association for Computing Machinery (ACM) ,1987
- Limitations of Ada for real-time schedulingPublished by Association for Computing Machinery (ACM) ,1987
- A Review of Ada TaskingPublished by Springer Nature ,1987
- Cooperating Sequential ProcessesPublished by Springer Nature ,1968