Utilization bounds for multiprocessor rate-monotonic scheduling

Real-Time Systems

Volumn 24, Issue 1, 2003, Pages 5-28

  Lopez J M ^a   Garcia M ^a   Diaz J L ^a   Garcia D F ^a  

^a UNIVERSITY OF OVIEDO   (Spain)

Author keywords

Hard real time; Multiprocessor scheduling; Partitioning; Rate monotonic scheduling; Utilization bound

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; SCHEDULING;

RATE-MONOTONIC POLICY; UTILIZATION BOUNDS;

MULTIPROCESSING SYSTEMS;

EID: 0037262543     PISSN: 09226443     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1021749005009     Document Type: Article

References (7)

1. Burchard, A., Liebeherr, J., Oh, Y., and Son, S, 1995. New strategies for assigning real-time tasks to multiprocessor systems. IEEE Transactions on Computers 44(12).
2. Dall, S., and Liu, C. 1978. On a real-time scheduling problem. Operations Research 6(1): 127-140.
3. Garey, M., and Johnson, D. 1979. Computers and Intractability. New York: W. H. Freeman, pp. 121-127.
4. Liu, C. L., and Layland, J. 1973. Scheduling algorithms for multiprogramming in a hard-real-time environment. Journal of the ACM 20(1): 46-61.
5. Oh, D., and Baker, T. 1998. Utilization bounds for N-processor rate monotone scheduling with static processor assignment. Real-Time Systems 15(2): 183-193.
6. Oh, Y., and Son, S. 1995. Allocating fixed-priority periodic tasks on multiprocessor systems. Real-Time Systems 9(3): 207-239.
7. Sáez, S. J. V., and Crespo, A. 1998. Using exact feasibility tests for allocating real-time tasks in multiprocessor systems. In Proceedings of the 10th Euromicro Workshop on Real-Time Systems, pp. 53-60.