Sporadic multiprocessor scheduling with few preemptions

Proceedings - Euromicro Conference on Real-Time Systems

Volumn , Issue , 2008, Pages 243-252

  Andersson, Björn ^a   Bletsas, Konstantinos ^a  

^a INSTITUTO SUPERIOR DE ENGENHARIA DO PORTO   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

SCHEDULING; TREES (MATHEMATICS);

CONFIGURABLE; INTER-ARRIVAL TIME; MULTI-PROCESSOR SCHEDULING; WORST-CASE EXECUTION TIME;

REAL TIME SYSTEMS;

EID: 52049084771     PISSN: 10683070     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ECRTS.2008.9     Document Type: Conference Paper

References (11)

1. J. Anderson and A. Srinivasan. Mixed Pfair/ERfair scheduling of asynchronous periodic tasks. Journal of Computer and System Sciences, 68(1):157-204, 2004.
2. B. Andersson. Sporadic multiprocessor scheduling with few preemptions. Technical report, IPP-HURRAY Research Group. Institute Polytechnic Porto, HURRAY-TR-070501, available online at http://www.hurray.isep.ipp.pt/privfiles/ tr-hurray-070501.pdf, May 2007.
3. B. Andersson and E. Tovar. Multiprocessor scheduling with few preemptions. In Proc. of the 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, pages 322-334, 2006.
4. T. P. Baker. Comparison of empirical success rates of global vs. partitioned fixed-priority EDF scheduling for hard real time. Technical Report TR-050601, Department of Computer Science, Florida State University, Tallahassee, available at http://www.cs.fsu.edu/research/reports/tr-050601.pdf, July 2005.
5. S. K. Baruah, N. K. Cohen, C. G. Plaxton, and D. A. Varvel. Proportionate progress: A notion of fairness in resource allocation. Algorithmica, 15(6):600-625, June 1996.
6. S. K. Baruah, A. K. Mok, and L. E. Rosier. Preemptively scheduling hard-real-time sporadic tasks on one processor. In Proceedings of the 11th IEEE Real-Time Systems Symposium, pages 182-190, 1990.
7. J. Calandrino, H. Leontyev, A. Block, U. Devi, and J. Anderson. LITMUSRT: A testbed for empirically comparing real-time multiprocessor schedulers. In Proceedings of the 27th IEEE Real-Time Systems Symposium, pages 111-123, 2006.
8. H. Cho, B. Ravindran, and E. D. Jensen. An optimal realtime scheduling algorithm for multiprocessors. In Proc. of the 27th IEEE Real-Time Systems Symposium, pages 101-110, 2006.
9. U. Devi and J. Anderson. Tardiness bounds for global EDF scheduling on a multiprocessor. In Proc. of the 26th IEEE Real-Time Systems Symposium, pages 330-341, 2005.
10. A. Khemka and R. K. Shyamasundar. Multiprocessor scheduling of periodic tasks in a hard real-time environment. In Proc. of the 6th International Parallel Processing Symposium, pages 76-81, 1992.
11. D. Zhu, D. Mossé, and R. Melhem. Multiple-resource periodic scheduling problem: how much fairness is necessary? In Proc. of the IEEE Real-Time Systems Symposium, pages 142-151, 2003.