Abstract
In this chapter we present 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. The restrictions made on the task set are aimed at simplifying the algorithm in terms of time complexity. When no restrictions are applied on the application tasks, the complexity can be reduced by employing heuristic approaches, which do not guarantee to find the optimal solution to a problem but can still guarantee a feasible schedule in a wide range of situations.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 1997 Kluwer Academic Publishers
About this chapter
Cite this chapter
(1997). Aperiodic task scheduling. In: Hard real-time computing systems. The Springer International Series in Engineering and Computer Science, vol 416. Springer, Boston, MA. https://doi.org/10.1007/978-0-585-28005-9_3
Download citation
DOI: https://doi.org/10.1007/978-0-585-28005-9_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-7923-9994-0
Online ISBN: 978-0-585-28005-9
eBook Packages: Springer Book Archive