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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
A formal proof is also straightforward, but omitted.
- 2.
See Chap. 10 to review the definitions of Load (τ) and \( {dens_{\max}}{(\tau)}\)
Author information
Authors and Affiliations
Corresponding author
Sources
Sources
\(\textsf{EDF}\)-based partitioned scheduling was discussed in [44–46]; DM-based partitioning was studied in [87]. A general task model was considered in [47]. Also see Fisher’s dissertation [83].
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Baruah, S., Bertogna, M., Buttazzo, G. (2015). Partitioned Scheduling. In: Multiprocessor Scheduling for Real-Time Systems. Embedded Systems. Springer, Cham. https://doi.org/10.1007/978-3-319-08696-5_11
Download citation
DOI: https://doi.org/10.1007/978-3-319-08696-5_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-08695-8
Online ISBN: 978-3-319-08696-5
eBook Packages: EngineeringEngineering (R0)