Abstract
This chapter presents a variety of algorithms for scheduling real-time aperiodic tasks on a single machine environment. Each algorithm represents a solution for a particular scheduling problem, which is expressed through a set of assumptions on the task set and by an optimality criterion to be used on the schedule.
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). Aperiodic Task 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_3
Download citation
DOI: https://doi.org/10.1007/978-1-4614-0676-1_3
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)