Scheduling periodic tasks on uniform multiprocessors

Proceedings - Euromicro Conference on Real-Time Systems

Volumn , Issue , 2000, Pages 7-13

  Baruah, S K ^a  

^a UNIVERSITY OF NORTH CAROLINA   (United States)

Author keywords

hard real time systems; integer boundary constraint; periodic tasks; Uniform multiprocessors

Indexed keywords

BOUNDARY CONSTRAINTS; COMPUTING CAPACITY; HARD REAL-TIME SYSTEMS; INTEGER NUMBERS; MULTI PROCESSOR SYSTEMS; MULTIPROCESSOR MACHINES; PERIODIC TASKS; UNIFORM MULTIPROCESSORS;

MULTIPROCESSING SYSTEMS; SCHEDULING;

REAL TIME SYSTEMS;

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

References (12)

1. J. Anderson, R. Jain, and K. Jeffay. Efficient object-sharing in quantum-based real-time systems. In Proceedings of the Nineteenth IEEE Real-Time Systems Symposium, Madrid, Spain, December 1998. IEEE Computer Society Press.
2. James Anderson, Sanjoy Baruah, and Kevin Jeffay. Parallel switching in connection-oriented networks. In Proceedings of the Real-Time Systems Symposium, pages 200-209, Pheonix, AZ, December 1999. IEEE Computer Society Press.
3. S. Baruah, N. Cohen, G. Plaxton, and D. Varvel. Proportionate progress: A notion of fairness in resource allocation. Algorithmica, 15(6):600-625, June 1996. (Pubitemid 126422534)
4. Sadegh Davari and Sudarshan K. Dhall. An on-line algorithm for real-time tasks allocation. In Proceedings of the Real-Time Systems Symposium, pages 194-200, 1986.
5. M. Garey and D. Johnson. Computers and Intractability : a Guide to the Theory of NP-Completeness. W. H. Freeman and company, NY, 1979.
6. T. Gonzales and S. Sahni. Preemptive scheduling of uniform processor systems. Journal of the ACM, 25:92-101, 1978. (Pubitemid 8579083)
7. W. Horn. Some simple sc heduling algorithms. Naval Research Logistics Quarterly, 21:177-185, 1974.
8. R. Karp. Reducibility among combinatorial problems. In R. Miller and J. Thatcher, editors, Complexity of Computer Computations, pages 85-103. Plenum Press, New York, 1972.
9. J. Labetoulle, E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan. Preemptive scheduling of uniform machines subject to release times. In H. R. Pulley-blank, editor, Progress in Combinatorial Optimization, pages 245-261. Academic Press, 1984.
10. C. Liu. Scheduling algorithms for multiprocessors in a hard real-time environment. JPL Space Programs Summary 37-60, II:28-37, 1969.
11. C. Liu and J. Layland. Scheduling algorithms for multiprogramming in a hard real-time environment. Journal of the ACM, 20(1):46-61, 1973.
12. Mark Moir and Srikanth Ramamurthy. Pfair scheduling of fixed and migrating tasks on multiple resources. In Proceedings of the Real-Time Systems Symposium, Pheonix, AZ, December 1999. IEEE Computer Society Press.