|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
2009 15th IEEE Real-Time and Embedded Technology and Applications Symposium
Notional Processors: An Approach for Multiprocessor Scheduling
San Francisco, CA
April 13-April 16
ISBN: 978-0-7695-3636-1
| ASCII Text | x | ||
| Konstantinos Bletsas, Björn Andersson, "Notional Processors: An Approach for Multiprocessor Scheduling," 2009 15th IEEE Real-Time and Embedded Technology and Applications Symposium, pp. 3-12, 2009 15th IEEE Real-Time and Embedded Technology and Applications Symposium, 2009. | |||
| BibTex | x | ||
| @article{ 10.1109/RTAS.2009.25, author = {Konstantinos Bletsas and Björn Andersson}, title = {Notional Processors: An Approach for Multiprocessor Scheduling}, journal ={2009 15th IEEE Real-Time and Embedded Technology and Applications Symposium}, volume = {0}, year = {2009}, issn = {1080-1812}, pages = {3-12}, doi = {http://doi.ieeecomputersociety.org/10.1109/RTAS.2009.25}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - 2009 15th IEEE Real-Time and Embedded Technology and Applications Symposium TI - Notional Processors: An Approach for Multiprocessor Scheduling SN - 1080-1812 SP3 EP12 A1 - Konstantinos Bletsas, A1 - Björn Andersson, PY - 2009 KW - multiprocessor scheduling KW - real-time scheduling KW - preemptions KW - task migrations KW - utilization bound VL - 0 JA - 2009 15th IEEE Real-Time and Embedded Technology and Applications Symposium ER - | |||
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/RTAS.2009.25
Consider the problem of designing an algorithm with a high utilization bound for scheduling sporadic tasks with implicit deadlines on identical processors. A task is characterized by its minimum interarrival time and its execution time. Task preemption and migration is permitted. Still, low preemption and migration counts are desirable.We formulate an algorithm with a utilization bound no less than 66.6%characterized by worst-case preemption counts comparing favorably against the state-of-the-art.
Index Terms:
multiprocessor scheduling, real-time scheduling, preemptions, task migrations, utilization bound
Citation:
Konstantinos Bletsas, Björn Andersson, "Notional Processors: An Approach for Multiprocessor Scheduling," rtas, pp.3-12, 2009 15th IEEE Real-Time and Embedded Technology and Applications Symposium, 2009
Usage of this product signifies your acceptance of the Terms of Use.