DP-FAIR: A simple model for understanding optimal multiprocessor scheduling

Proceedings - Euromicro Conference on Real-Time Systems

Volumn , Issue , 2010, Pages 3-13

  Levin, Greg ^a   Funk, Shelby ^b   Sadowski, Caitlin ^a   Pye, Ian ^a   Brandt, Scott ^a  

^a University of California Santa Cruz   (United States)

^b University of Georgia ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARBITRARY DEADLINES; FAIR SCHEDULING; FAIR SCHEDULING ALGORITHM; MULTI PROCESSOR SCHEDULING; OPTIMALITY; REAL TIME SCHEDULING;

MULTIPROCESSING SYSTEMS; OPTIMIZATION; REAL TIME SYSTEMS;

SCHEDULING ALGORITHMS;

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

References (26)

1. B. Andersson and K. Bletsas. Sporadic Multiprocessor Scheduling with Few Preemptions. Euromicro Conference on Real-Time Systems (ECRTS), 2008.
2. B. Andersson, K. Bletsas, and S. K. Baruah. Scheduling Arbitrary Deadline Sporadic Task Systems on Multiprocessors. IEEE Real-Time Systems Symposium (RTSS), 2008.
3. B. Andersson and E. Tovar. Multiprocessor Scheduling with Few Preemptions. IEEE Embedded and Real-Time Computing Systems and Applications (RTCSA), 2006.
4. S. K. Baruah and J. Carpenter. Multiprocessor Fixed- Priority Scheduling with Restricted Interprocessor Migrations. Journal of Embedded Computing, 1(2):169-178, 2004.
5. S. K. Baruah, N. K. Cohen, C. G. Plaxton, and D. Varvel. Proportionate Progress: A Notion of Fairness in Resource Allocation. Algorithmica, 15(6):600-625, 1996.
6. S. A. Brandt, S. Banachowski, C. Lin, and T. Bisson. Dynamic Integrated Scheduling of Hard Real-Time, Soft Real-Time, and Non-Real-Time Processes. IEEE Real-Time Systems Symposium (RTSS), 2003.
7. J. Carpenter, S. Funk, P. Holman, A. Srinivasan, J. Anderson, and S. K. Baruah. A categorization of real-time multiprocessor scheduling problems and algorithms. In Handbook on Scheduling Algorithms, Methods, and Models, pages 30.1-30.19. Chapman Hall/CRC, 2004.
8. S.-Y. Chen and C.-W. Hsueh. Optimal Dynamic-priority Real-Time Scheduling Algorithms for Uniform Multiprocessors. IEEE Real-Time Systems Symposium (RTSS), 2008.
9. H. Cho, B. Ravindran, and E. Jensen. An Optimal Real-Time Scheduling Algorithm for Multiprocessors. IEEE Real-Time Systems Symposium (RTSS), 2006.
10. S.-K. Cho, S. Lee, A. Han, and K.-J. Lin. Efficient Real-Time Scheduling Algorithms for Multiprocessor Systems. IEICE Transactions on Communications, E85-B(12):2859- 2867, 2002.
11. N. Fisher, J. Goossens, and S. Baruah. Optimal OnlineMultiprocessor Scheduling of Sporadic Real-Time Tasks is Impossible. Real-Time Systems, to appear, 2010.
12. K. Funaoka, S. Kato, and N. Yamasaki. New Abstraction for Optimal Real-Time Scheduling on Multiprocessors. IEEE Embedded and Real-Time Computing Systems and Applications (RTCSA), 2008.
13. K. Funaoka, S. Kato, and N. Yamasaki. Work-Conserving Optimal Real-Time Scheduling on Multiprocessors. Euromicro Conference on Real-Time Systems (ECRTS), 2008.
14. S. Funk and V. Nadadur. LRE-TL: An Optimal Multiprocessor Algorithm for Sporadic Task Sets. Conference on Real-Time and Network Systems (RTNS), 2009.
15. K. S. Hong and J. Y.-T. Leung. On-Line Scheduling of Real-Time Tasks. IEEE Transactions on Computers, 41:1326- 1331, 1992.
16. S. Kato and N. Yamasaki. Real-Time Scheduling with Task Splitting on Multiprocessors. IEEE Embedded and Real-Time Computing Systems and Applications (RTCSA), 2007.
17. S. Kato and N. Yamasaki. Portioned EDF-based Scheduling on Multiprocessors. ACM International Conference on Embedded Software (EMSOFT), 2008.
18. J. Leung. A new algorithm for scheduling periodic, realtime tasks. Algorithmica, 4(1):209-219, 1989.
19. C. Lin and S. A. Brandt. Improving Soft Real-Time Performance Through Better Slack Management. IEEE Real-Time Systems Symposium (RTSS), 2005.
20. C. Lin, T. Kaldewey, A. Povzner, and S. A. Brandt. Diverse Soft Real-Time Processing in an Integrated System. IEEE Real-Time Systems Symposium (RTSS), 2006.
21. C. Liu and J. Layland. Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment. Journal of the ACM (JACM), 20(1):46-61, 1973.
22. J. M. López, M. Garcia, J. L. Diaz, and D. F. Garcia. Worstcase Utilization Bound for EDF Scheduling on Real-Time Multiprocessor Systems. Euromicro Conference on Real-Time Systems (ECRTS), 2000.
23. R. McNaughton. Scheduling with Deadlines and Loss Functions. Machine Science, 6(1):1-12, October 1959.
24. A. K. Mok. Fundamental design problems of distributed systems for the hard-real-time environment. Technical report, Massachusetts Institute of Technology, 1983.
25. A. Srinivasan, P. Holman, J. H. Anderson, and S. K. Baruah. The Case for Fair Multiprocessor Scheduling. International Symposium on Parallel and Distributed Processing (IPDPS), 2003.
26. D. Zhu, D. Mossé, and R. Melhem. Multiple-Resource Periodic Scheduling Problem: how much fairness in necessary? IEEE Real-Time Systems Symposium (RTSS), 2003.