Scheduling arbitrary-deadline sporadic task systems on multiprocessors

Proceedings - Real-Time Systems Symposium

Volumn , Issue , 2008, Pages 385-394

  Andersson, Björn ^a   Bletsas, Konstantinos ^a   Baruah, Sanjoy ^b  

^a POLYTECHNIC INSTITUTE OF PORTO   (Portugal)

^b Brooks Computer Science Building   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FEASIBILITY ANALYSIS; FEASIBILITY TESTS; MULTI-PROCESSOR PLATFORMS; PERFORMANCE GUARANTEES; SIMULATION-BASED; SPECIFIC PROCESSOR; SPORADIC TASK SYSTEMS; TWO PROCESSORS;

MULTIPROCESSING SYSTEMS; REAL TIME SYSTEMS;

SCHEDULING ALGORITHMS;

EID: 67249155839     PISSN: 10528725     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/RTSS.2008.44     Document Type: Conference Paper

References (12)

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. J. H. Anderson, V. Bud, and U. C. Devi. An EDF-based scheduling algorithm for multiprocessor soft real-time systems. In Proceedings of the 17th Euromicro Conference on real-time systems, pages 199-208, 2005. (Pubitemid 44458432)
3. B. Andersson and K. Bletsas. Sporadic multiprocessor scheduling with few preemptions. In Proceedings of the 20th Euromicro Conference on real-time systems, 2008.
4. B. Andersson, K. Bletsas, and S. Baruah. Scheduling arbitrary-deadline sporadic tasks on multiprocessors. Technical report, IPP-HURRAY Research Group. Institute Polytechnic Porto, HURRAY-TR-080501, available online at http://www.hurray.isep.ipp.pt/privfiles/HURRAYTR080501.pdf, September 2008.
5. 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.
6. 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.
7. S. Baruah and N. Fisher. The partitioned dynamic-priority scheduling of sporadic task systems. Real-Time Systems: The International Journal of Time-Critical Computing, 36(3):199-226, 2007. (Pubitemid 46870856)
8. 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. (Pubitemid 126422534)
9. 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.
10. 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. (Pubitemid 351209722)
11. 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.
12. S. Kato and N. Yamasaki. Real-time scheduling with task splitting on multiprocessors. In Proceedings of the 13th International Conference on Embedded and Real-Time Computing Systems and Applications, pages 441-450, 2007.