Multiprocessor fixed-priority scheduling with restricted interprocessor migrations

Proceedings - Euromicro Conference on Real-Time Systems

Volumn , Issue , 2003, Pages 195-202

  Baruah, S ^a   Carpenter, J ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

FIXED-PRIORITY SCHEDULING; INTERPROCESSORS; MULTI-PROCESSOR PLATFORMS; NP-HARD; PRIORITY-DRIVEN SCHEDULING; SINGLE PROCESSORS; SPORADIC TASK SYSTEMS; UTILIZATION BOUNDS;

SCHEDULING; SCHEDULING ALGORITHMS;

REAL TIME SYSTEMS;

EID: 0344362209     PISSN: 10683070     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/EMRTS.2003.1212744     Document Type: Conference Paper

References (13)

1. J. Anderson and A. Srinivasan. Early release fair scheduling. In Proceedings of the EuroMicro Conference on Real-Time Systems, pages 35-43. Stockholm, Sweden. June 2000. IEEE Computer Society Press.
2. S. Baruah, X. Cohen, G. Plaxton, and D. Yarvel. Proportionate progress: A notion of fairness in resource allocation. Algorithmica. 15(6):600-625. June 1996. (Pubitemid 126422534)
3. M. Dertouzos. Control robotics : the procedural control of physical processors. In Proceedings of the IFIP Congress, pages 807-813, 1974.
4. S. K. Dhall and C. L. Liu. On a real-time scheduling problem. Operations Research, 26:127-140, 1978.
5. J. Goossens, S. Funk, and S. Baruah. Priority-driven scheduling of periodic task systems on multiprocessors. Real Time Systems. To appear.
6. D. Johnson. Fast, algorithms for bin packing. Journal of Computer and Systems Science, 8(3):272-314, 1974.
7. D. S. Johnson, A. Demers, J. D. Ullman, M. R. Garey, and R. L. Graham. Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM Journal of Computing, 3(4):299-325, 1974.
8. J. Leung and J. Whitehead. On the complexity of fixed-priority scheduling of periodic, real-time tasks. Performance Evaluation, 2:237-250, 1982. (Pubitemid 13487696)
9. C. Liu and J. Layland. Scheduling algorithms for multiprogramming in a hard real-time environment. Journal of the ACM, 20(1):46-61, 1973.
10. C. L. Liu. Scheduling algorithms for multiprocessors in a hard real-time environment. JPL Space Programs Summary 37-60, 11:28-31, 1969.
11. J. M. Lopez, M. Garcia, J. L. Diaz, and D. F. Garcia. Worst-case utilization bound for EDF scheduling in real-time multiprocessor systems. In Proceedings of the EuroMicro Conference on Real-Time Systems, pages 25-34. Stockholm, Sweden. June 2000. IEEE Computer Society Press.
12. A. K. Mok. Fundamental Design Problems of Distributed Systems for The Hard-Real-Time Environment. PhD thesis, Laboratory for Computer Science. Massachusetts Institute of Technology. 1983. Available as Technical Report No. MIT/LCS/TR-297.
13. A. Srinivasan and S. Baruah. Deadline-based scheduling of periodic task systems on multiprocessors. Information Processing Letters, 84(2):93-98, 2002. (Pubitemid 34979783)