Minimizing migrations in fair multiprocessor scheduling of persistent tasks

Journal of Scheduling

Volumn 9, Issue 4, 2006, Pages 365-379

  Kimbrel, Tracy ^a   Schieber, Baruch ^a   Sviridenko, Maxim ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Fair scheduling; Multiprocessor scheduling; Persistent tasks; Process migration

Indexed keywords

FAIR SCHEDULING; MULTIPROCESSOR SCHEDULING; PERSISTENT TASKS; PROCESS MIGRATION;

ALGORITHMS; JOB ANALYSIS; LEARNING SYSTEMS; PROGRAM PROCESSORS; SCHEDULING;

MULTIPROCESSING SYSTEMS;

EID: 33646705427     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10951-006-7040-0     Document Type: Article

References (20)

1. Anderson J. and A. Srinivasan, "Towards a more efficient and flexible pfair scheduling framework," 20th IEEE Real-time Systems Symposium (RTSS), pp. 46-50 (1999).
2. Baruah, S. K., "Scheduling periodic tasks on uniform multiprocessors," 12th Euromicro Conference on Real-Time Systems (Euromicro-RTS), 7-14 (2000).
3. Baruah, S. K., "Dynamic- and static-priority scheduling of recurring real-time tasks," Real-time Systems, 24(1), 93-128 (2003).
4. Baruah, S. and J. Carpenter, "Multiprocessor fixed-priority scheduling with restricted interprocessor migrations," 15th Euromicro Conference on Real-Time Systems (Euromicro-RTS) 2003.
5. Baruah, S., N. Cohen, G. Plaxton, and D. Varvel, "Proportionate progress: A notion of fairness in resource allocation," Algorithmica 15(6), 600-625 (1996).
6. Baruah, S., J. Gehrke, and G. Plaxton, "Fast scheduling of periodic tasks on multiple resources," Int. Parallel Processing Symposium (IPPS), pp. 280-288 (1995).
7. Baruah, S., J. Gehrke, G. Plaxton, I. Stoica, H. Abdel-Wahab, and K. Jeffay, "Fair on-line scheduling of a dynamic set of tasks on a single resource," Information Processing Letters, 64(1), 43-51 (1997).
8. Bruno, J., E. Gabber, B. Özden, and A. Silberschatz, "The Eclipse operating system: Providing quality of service via reservation domains," USENX Annual Technical Conference, pp. 235-246 (1998).
9. Bar-Noy, A., A. Mayer, B. Schieber, and M. Sudan, "Guaranteeing fair service to persistent dependent tasks," SIAM J. on Computing, 24, 1168-1189 (1998).
10. Chandra, A., M. Adler, and P. J. Shenoy, "Deadline fair scheduling: Bridging the theory and practice of proportionate fair scheduling in multiprocessor systems," IEEE Real Time Technology and Applications Symposium (RTAS), pp. 3-14 (2001).
11. Duda, K. J. and D. R. Cheriton, "Borrowed-virtual-time (BVT) scheduling: Supporting latency-sensitive threads in a general-purpose schedular, "Symposium on Operating Systems Principles (SOSP), pp. 261-276 (1999).
12. Harizopoulos, S. and A. Ailamaki, "Affinity scheduling in staged server architectures," Technical Report CMU-CS-02-113 (2002).
13. Autonomie computing: IBM's perspective on the state of information technology. http://www.research.ibm.com/autonomic/manifesto/.
14. Jones, M. B., D. Rosu, and M. C. Rosu, "CPU Reservations and time constraints: Efficient, predictable scheduling of independent activities," Symposium on Operating Systems Principles (SOSP), pp. 198-211 (1997).
15. Liu, C. L., "Scheduling algorithms for hard-real-time multiprogramming of a single processor," JPL Space Program Summary, 2, 37-60 (1969).
16. Liu, C. L. and J. W. Layland, "Scheduling algorithms for multiprogramming in a hard-real-time environment. Journal of the ACM, 20(1), 46-61 (1973).
17. Sapuntzakis, C. P., R. Chandra, B. Pfaff, J. Chow, M. S. Lam, and M. Rosenblum, "Optimizing the migration of virtual computers," 5th Symp. on Operating Systems Design and Implementation (OSDI) 2002.
18. Srinivasan, A., P. Holman, and J. Anderson, "Integrating aperiodic and recurrent tasks on fair-scheduled multiprocessors," 14th Euromicro Conference on Real-Time Systems (Euromicro-RTS) 2002.
19. Srinivasan, A., P. Holman, J. H. Anderson, and S. Baruah, "The case for fair multiprocessor scheduling," 11th International Workshop on Parallel and Distributed Real-Time Systems (WPDRTS) 2003.
20. Waldspurger, C. A. and W. E. Weihl, "Stride scheduling: Deterministic proportional-share resource mangement. technical memorandum MIT/LCS/TM-528, MIT laboratory for computer science 1995.