|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'06)
Multiprocessor Scheduling with Few Preemptions
Sydney, Australia
August 16-August 18
ISBN: 0-7695-2676-4
| ASCII Text | x | ||
| Bj?rn Andersson, Eduardo Tovar, "Multiprocessor Scheduling with Few Preemptions," 2012 IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, pp. 322-334, 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'06), 2006. | |||
| BibTex | x | ||
| @article{ 10.1109/RTCSA.2006.45, author = {Bj?rn Andersson and Eduardo Tovar}, title = {Multiprocessor Scheduling with Few Preemptions}, journal ={2012 IEEE International Conference on Embedded and Real-Time Computing Systems and Applications}, volume = {0}, year = {2006}, issn = {1533-2306}, pages = {322-334}, doi = {http://doi.ieeecomputersociety.org/10.1109/RTCSA.2006.45}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - 2012 IEEE International Conference on Embedded and Real-Time Computing Systems and Applications TI - Multiprocessor Scheduling with Few Preemptions SN - 1533-2306 SP322 EP334 A1 - Bj?rn Andersson, A1 - Eduardo Tovar, PY - 2006 KW - null VL - 0 JA - 2012 IEEE International Conference on Embedded and Real-Time Computing Systems and Applications ER - | |||
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/RTCSA.2006.45
Consider the problem of scheduling a set of periodically arriving tasks on a multiprocessor with the goal of meeting deadlines. Processors are identical and have the same speed. Tasks can be preempted and they can migrate between processors. We propose an algorithm with a utilization bound of 66% and with few preemptions. It can trade a higher utilization bound for more preemptions and in doing so it has a utilization bound of 100%.
Citation:
Bj?rn Andersson, Eduardo Tovar, "Multiprocessor Scheduling with Few Preemptions," rtcsa, pp.322-334, 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.