Flexible tardiness bounds for sporadic real-time task systems on multiprocessors

20th International Parallel and Distributed Processing Symposium, IPDPS 2006

Volumn 2006, Issue , 2006, Pages 10-19

  Devi, UmaMaheswari C ^a   Anderson, James H ^a  

^a UNIVERSITY OF NORTH CAROLINA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; MULTIPROCESSING SYSTEMS; REAL TIME SYSTEMS;

EARLIEST-DEADLINE-FIRST (EDF) SCHEDULING; NON-PREEMPTIVE EDF; TARDINESS;

SCHEDULING;

EID: 33847132383     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2006.1639265     Document Type: Conference Paper

References (13)

1. J. Anderson, V. Bud, and U. Devi. An EDF-based scheduling algorithm for multiprocessor soft real-time systems. In Proc. of the 17th Euromicro Conf. on Real-Time Systems, pages 199-208, July 2005.
2. B. Andersson and J. Jonsson. The utilization bounds of partitioned and pfair static-priority scheduling on multiprocessors are 50%. In Proc. of the 15th Eummicm Conf. on Real-Time Systems, pages 33-40, July 2003.
3. S. Baruah. Optimal utilization bounds for the fixed-priority scheduling of periodic task systems on identical multiprocessors. IEEE Trans. on Computers, 53(6):781-784, 2004.
4. S. Baruah, N. Cohen, C.G. Plaxton, and D. Varvel. Proportionate progress: A notion of fairness in resource allocation. Algorithmica, 15:600-625, 1996.
5. S. Cho, S.K. Lee, S. Ahn, and K.J. Lin. Efficient real-time scheduling algorithms for multiprocessors. IEICE Trans. on Communications, E85-B(12):2859-2867, December 2002.
6. M. Dertouzos. Control robotics: The procedural control of physical processes. In Proc. of IFIP Cong., pages 807-813, 1974.
7. U. Devi and J. Anderson. Flexible tardiness bounds for sporadic real-time task systems on multiprocessors (extended version). Available at http://www.cs.unc.edu/~anderson/papers.html, October 2005.
8. U. Devi and J. Anderson. Tardiness bounds for global EDF scheduling on a multiprocessor. In Proc. of the 26th IEEE Real-Time Systems Symp., pages 330-341, December 2005.
9. J. Carpenter et al. A categorization of real-time multiprocessor scheduling problems and algorithms. In Joseph Y. Leung, editor, Handbook on Scheduling Algorithms, Methods, and Models, pages 30.1-30.19. Chapman Hall/CRC, Boca Raton, Florida, 2004.
10. C.L. Liu and J.W. Layland. Scheduling algorithms for multiprogramming in a hard-real-time environment. Journal of the Association for Computing Machinery, 20(1):46-61, 1973.
11. J.M. Lopez, M. Garcia, J.L. Diaz, and D.F. Garcia. Worst-case utilization bound for EDF scheduling on real-time multiprocessor systems. In Proc. of the 12th Euromicro Conf. on Real-Time Systems, pages 25-34, June 2000.
12. A. Srinivasan and J. Anderson. Efficient scheduling of soft real-time applications on multiprocessors. In Proc. of the 15th Euromicro Conf. on Real-Time Systems, pages 51-59, July 2003.
13. P. Valente and G. Lipari. An upper bound to the lateness of soft real-time tasks scheduled by EDF on multiprocessors. In Proc. of the 26th IEEE Real-Time Systems Symp., pages 311-320, December 2005.