Abstract
The question whether preemptive systems are better than non-preemptive systems has been debated for a long time, but only partial answers have been provided in the realtime literature and some issues still remain open to discussion. In fact, each approach has advantages and disadvantages, and no one dominates the other when both predictability and efficiency have to be taken into account in the system design. This chapter presents and compares some existing approaches for reducing preemptions and describes an efficient method for minimizing preemption costs by removing unnecessary preemptions while preserving system schedulability.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2011 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Buttazzo, G.C. (2011). Limited Preemptive Scheduling. In: Hard Real-Time Computing Systems. Real-Time Systems Series, vol 24. Springer, Boston, MA. https://doi.org/10.1007/978-1-4614-0676-1_8
Download citation
DOI: https://doi.org/10.1007/978-1-4614-0676-1_8
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4614-0675-4
Online ISBN: 978-1-4614-0676-1
eBook Packages: Computer ScienceComputer Science (R0)