Utilization bounds for EDF scheduling on real-time multiprocessor systems

Real-Time Systems

Volumn 28, Issue 1, 2004, Pages 39-68

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

^a UNIVERSITY OF OVIEDO   (Spain)

Author keywords

Bin packing problem; Earliest deadline first scheduling; Multiprocessor scheduling; Multiprocessor utilization bounds; Partitioning

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; OPTIMIZATION; PROGRAM PROCESSORS; REAL TIME SYSTEMS; RESOURCE ALLOCATION; SCHEDULING;

BIN-PACKING PROBLEM; EARLIEST DEADLINE FIRST SCHEDULING; MULTIPROCESSOR SCHEDULING; MULTIPROCESSOR UTILIZATION BOUNDS; PARTITIONING;

MULTIPROCESSING SYSTEMS;

EID: 3142724149     PISSN: 09226443     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:TIME.0000033378.56741.14     Document Type: Article

References (19)

1. Baker, T. 1991. Stack-based scheduling of real-time processes. Real-Time Systems 3(1): 301-324.
2. Bernat, G., and Burns, A. 1999. New results on fixed priority aperiodic servers. In Proceedings of the Real-Time Systems Symposium.
3. 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).
4. Buttazzo, G. 1997. Hard Real-Time Computing Systems. Predictable Scheduling Algorithms and Applications. Boston/Dordrecht/London: Kluwer Academic Publishers, Chapter 7.
5. Dall, S., and Liu, C. 1978. On a real-time scheduling problem. Operations Research 6(1): 127-140.
6. Davari, S., and Dhall, S. 1986a. On a periodic real-time task allocation problem. In Annual International Conference on Systems Sciences, pp. 133-141.
7. Davari, S., and Dhall, S. 1986b. An on line algorithm for real time tasks allocation. In Proceedings of the IEEE Real-Time Systems Symposium, pp. 194-200.
8. Dertouzos, M. L. 1974. Control robotics: the procedural control of physical processes. In Proceedings of IFIP Congress, pp. 807-813.
9. Dertouzos, M. L., and Mok, A. K. 1989. Multiprocessor on-line scheduling of hard-real-time tasks. Transactions on Software Engineering 15(12): 1497-1506.
10. Garey, M., and Johnson, D. 1979. Computers and Intractability. New York: W. H. Freman.
11. Lauzac, S., Melhem, R., and Mossé, D. 1998. An efficient rms admission control and its application to multiprocessor scheduling. In Proceedings of the International Parallel Processing Symposium, pp. 511-518.
12. Liu, C., and Layland, J. 1973. Scheduling algorithms for multiprogramming in a hard-real-time environment. Journal of the ACM 20(1): 46-61.
13. López, J. Díaz, J. Garía, M., and García, D. 2003. Utilization bounds for multiprocessor rate-monotonic scheduling. Real-Time Systems 24(1): 5-28.
14. 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.
15. Oh, Y., and Son, S. 1995. Allocating fixed-priority periodic tasks on multiprocessor systems. Real-Time Systems 9(3): 207-239.
16. Pedro, P., and Bums, A. 1998. Schedulability changes for mode changes in flexible real-time systems. In Proceedings of the Euromicro Workshop on Real Time Systems, pp. 172-179.
17. Sáez, S., Vila, J., 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.
18. Tindell, K., Burns, A., and Wellings, A. 1994. An extendible approach for analyzing fixed priority hard real-time tasks. Real-Time Systems 6(2): 133-151.
19. Tindell, K., and Clark, J. 1994. Holistic Schedulability analysis for distributed hard real-time systems. Microprocessing and Microprogramming 40: 117-134.