Abstract
The scheduling algorithms treated in the previous chapters deal with homogeneous sets of tasks, where all computational activities are either aperiodic or periodic. Many real-time control applications, however, require both types of processes, which may also differ for their criticality. Typically, periodic tasks are time-driven and execute critical control activities with hard timing constraints aimed at guaranteeing regular activation rates. Aperiodic tasks are usually event-driven and may have hard, soft, or non-real-time requirements depending on the specific application.
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). Fixed-Priority Servers. 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_5
Download citation
DOI: https://doi.org/10.1007/978-1-4614-0676-1_5
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)