Advertisement
Published in:
2015 | OriginalPaper | Chapter
11. Partitioned Scheduling
Authors : Sanjoy Baruah, Marko Bertogna, Giorgio Buttazzo
Published in: Multiprocessor Scheduling for Real-Time Systems
Publisher: Springer International Publishing
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Abstract
In this chapter, we consider approximation algorithms for partitioning a sporadic task system upon an identical multiprocessor platform. Since earliest-deadline-first (\(\textsf{EDF}\)) is known to be an optimal algorithm for scheduling upon a preemptive uniprocessor, we will assume in this chapter that each individual processor will be \(\textsf{EDF}\)-scheduled during run-time.