Abstract
The real-time situations in this chapter have these properties in common:
-
Fixed-priority scheduling with no operating system overhead. We have perfect preemption; that is, when a task “ wakes up” from its suspension, it either has a higher priority than the currently executing task and thus preempts it instantaneously, or has a lower priority and is instantaneously placed into the task-ready queue.
-
CPU and data are the only resources under contention.
-
Real-time situations are confined to a uniprocessor.
For an overview of the relationship between the framework, real-time situations, and techniques, please see page 1-4.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer Science+Business Media New York
About this chapter
Cite this chapter
Klein, M.H., Ralya, T., Pollak, B., Obenza, R., Harbour, M.G. (1993). Basic Real-Time Situations. In: A Practitioner’s Handbook for Real-Time Analysis. The Kluwer International Series in Engineering and Computer Science. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-2796-1_5
Download citation
DOI: https://doi.org/10.1007/978-1-4615-2796-1_5
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-6209-8
Online ISBN: 978-1-4615-2796-1
eBook Packages: Springer Book Archive