Notional processors: An approach for multiprocessor scheduling

Proceedings of the IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS

Volumn , Issue , 2009, Pages 3-12

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

^a INSTITUTO SUPERIOR DE ENGENHARIA DO PORTO   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

EXECUTION TIME; INTER-ARRIVAL TIME; MULTI PROCESSOR SCHEDULING;

EID: 67650221363     PISSN: 15453421     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/RTAS.2009.25     Document Type: Conference Paper

References (13)

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.
3. B. Andersson and K. Bletsas. Sporadic Multiprocessor Scheduling with Few Preemptions. In 20th Euromicro Conference on Real-Time Systems, pages 243-252, 2008.
4. B. Andersson and E. Tovar. Multiprocessor scheduling with few preemptions. In Proceedings of the 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, pages 322-334, 2006.
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. Y. Chao, S. Lin, and K. Lin. Schedulability issues for EDZL scheduling on real-time multiprocessor systems. Information Processing Letters, 107(5):158-164, Aug. 2008.
8. S. Cho, S. Lee, A. Han, and K. Lin. Efficient Real-Time Scheduling Algorithms for Multiprocessor Systems. IEICE Trans. on Communications, E85-B(12):2859-2867, 2002.
9. U. Devi and J. Anderson. Tardiness bounds for global EDF scheduling on a multiprocessor. In Proceedings of the 26th IEEE Real-Time Systems Symposium, pages 330-341, 2005.
10. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co, 1979.
11. S. Kato and N. Yamasaki. Real-Time Scheduling with Task Splitting on Multiprocessors. In Proc. of the 13th IEEE International Conf. on Embedded and Real-Time Computing Systems and Applications (RTCSA), pages 441-450, 2007.
12. J. M. López, M. Garcia, J. L. Díaz, and D. F. Garcia. Worst-Case Utilization Bound for EDF Scheduling on Real-Time Multiprocessor Systems. In Proc. of the 12th Euromicro Conference on Real-Time Systems, pages 25-33, 2000.
13. I. Shin, A. Easwaran, and I. Lee. Hierarchical Scheduling Framework for Virtual Clustering of Multiprocessors. In Proceedings of the 20th Euromicro Conference on Real-Time Systems, pages 181-190, 2007.