Abstract
In this chapter1 we discuss the problem of scheduling soft aperiodic tasks and hard periodic tasks under dynamic priority assignments. In particular, different service methods are introduced, the objective of which is to reduce the average response time of aperiodic requests without compromising the schedulability of hard periodic tasks. Periodic tasks are scheduled by the Earliest Deadline First (EDF) algorithm.
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). Dynamic 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_6
Download citation
DOI: https://doi.org/10.1007/978-1-4614-0676-1_6
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)