Preemptive multiprocessor scheduling anomalies

Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2002

Volumn , Issue , 2002, Pages 110-117

  Andersson, B ^a   Jonsson, J ^a  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84966472165     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2002.1015483     Document Type: Conference Paper

References (15)

1. C. L. Liu and J. W. Layland. Scheduling algorithms for multiprogramming in a hard-real-time environment. Journal of the Association for Computing Machinery, 20(1):46-61, January 1973.
2. D. W. Gillies and J. W.-S. Liu. Greed in resource scheduling. In Proc. of the IEEE Real-Time Systems Symposium, pages 285-294, Santa Monica, California, December 5-7, 1989.
3. A. K. Mok. Tracking real-time systems requirements, December 12-14, 2000. invited talk at the International Conference on Real-Time Computing Systems and Applications.
4. C. Shen, K. Ramamritham, and J. A. Stankovic. Resource reclaiming in multiprocessor real-time systems. IEEE Trans. on Parallel and Distributed Systems, 4(4):382-397, April 1995.
5. T. Lundqvist and P. Stenström. Timing anomalies in dynamically scheduled microprocessors. In Proc. of the IEEE Real-Time Systems Symposium, pages 12-21, Scottsdale, Arizona, December 1-3, 1999.
6. R. L. Graham. Bounds on multiprocessing timing anomalies. SIAM Journal of Applied Mathematics, 17(2):416-429, March 1969.
7. R. Ha and J. W.-S. Liu. Validating timing constraints in multiprocessor and distributed real-time systems. In Proc. of the IEEE Int'l Conf. on Distributed Computing Systems, pages 162-171, Poznan, Poland, June 21-24, 1994.
8. B. Andersson and J. Jonsson. Some insights on fixed-priority preemptive non-partitioned multiprocessor scheduling. In Proc. of the IEEE Real-Time Systems Symposium - Work-in-Progress Session, Orlando, Florida, November 27-30, 2000. Also in TR-00-10, Dept. of Computer Engineering, Chalmers University of Technology.
9. R. L. Graham. Bounds on multiprocessor scheduling anomalies and related packing problem. In Proceedings AFIPS Spring Joint Computer Conference, pages 205-217, 1972.
10. S. K. Dhall and C. L. Liu. On a real-time scheduling problem. Operations Research, 26(1):127-140, January/February 1978.
11. J. M. López, J. L. Díaz, and D. F. García. Minimum and maximum utilization bounds for multiprocessor RM scheduling. In Proc. of the EuroMicro Conference on Real-Time Systems, pages 67-75, Delft, The Netherlands, June 13-15 2001.
12. F. D. Murgolo. Anomalous behavior in bin packing algorithms. Discrete Applied Mathematics, 21(3):229-243, October 1988. North Holland.
13. D. Oh and T. P. Baker. Utilization bounds for n-processor rate monotone scheduling with static processor assignment. Real-Time Systems, 15(2):183-192, September 1998.
14. B. Andersson and J. Jonsson. Preemptive multiprocessor scheduling anomalies. Technical Report 01-9, Department of Computer Engineering, Chalmers University of Technology, 2001.
15. S. Lauzac, R. Melhem, and D. Mossé. An efficient RMS admission control and its application to multiprocessor scheduling. In Proc. of the IEEE Int'l Parallel Processing Symposium, pages 511-518, Orlando, Florida, March 1998.