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.
CITATION STYLE
Buttazzo, G. C. (2011). Periodic Task Scheduling (pp. 79–118). https://doi.org/10.1007/978-1-4614-0676-1_4
Mendeley helps you to discover research relevant for your work.