An analysis of fixed-priority schedulability on a multiprocessor

Real-Time Systems

Volumn 32, Issue 1-2, 2006, Pages 49-71

  Baker, Theodore P ^a  

^a Florida State University   (United States)

Author keywords

Deadline monotonic; Fixed priority; Multiprocessor; Rate monotonic; Real time; Scheduling; Symmetric multiprocessing; Utilization bound

Indexed keywords

DEADLINE MONOTONIC; FIXED PRIORITY; RATE MONOTONIC; SYMMETRIC MULTIPROCESSING; UTILIZATION BOUND;

REAL TIME SYSTEMS; SCHEDULING; SERVERS;

MULTIPROCESSING SYSTEMS;

EID: 33746930211     PISSN: 09226443     EISSN: None     Source Type: Journal    
DOI: 10.1007/S11241-005-4686-1     Document Type: Article

References (12)

1. Andersson, B., Baruah, S., and Jonsson, J. 2001. Static-priority scheduling on multiprocessors. In Proc. 22nd IEEE Real-Time Systems Symposium, London, UK, pp. 193-202.
2. Baker, T. P. 2003a. An analysis of deadline-monotonic scheduling on a multiprocessor. Technical Report TR-030301, Florida State University Department of Computer Science, Tallahassee, FL.
3. Baker, T. P. 2003b. Multiprocessor EDF and deadline monotonic schedulability analysis. In Proc. 24th IEEE Real-Time Systems Symposium, pp. 120-129.
4. Baruah, S., and Goossens, J. 2003. Rate-monotonic scheduling on uniform multiprocessors. IEEE Trans. Computers 52(7): 966-970.
5. Dhall, S. K., and Liu, C. L. 1978. On a real-time scheduling problem. Operations Research 26(1): 127-140.
6. Liu, C. L., and Layland, J. W. 1973. Scheduling alghorithms for multiprogramming in a hard real-time environment. Journal of the ACM 20(1): 46-61.
7. Lopez, J. M., Diaz, J.L., and Garcia, D. F. 2001. Minimum and maximum utilization bounds for multiprocessor RM scheduling. In Proc. 13th Euromicro Conf. Real-Time Systems, Delft, Netherlands, pp. 67-75.
8. Lopez, J. M., Diaz, J. L., Garcia, M., and Garcia, D. F. 2000. Worst-case utilization bound for EDF scheduling on real-time multiprocessor systems. In Proc. 12th Euromicro Conf. Real-Time Systems, pp. 25-33.
9. Lundberg, L. 2002. Analyzing fixed-priority global multiprocessor scheduling. In Proc. 8th IEEE Real-Time and Embedded Technology and Applications Symposium, San Jose, CA, USA, pp. 145-153, IEEE Computer Society.
10. Oh, D. I., and Baker, T. P. 1998. Utilization bounds for N-processor rate monotone scheduling with stable processor assignment. Real Time Systems 15(2): 183-193.
11. Phillips, C. A., Stein, C., Torng, E., and Wein, J. 1997. Optimal time-critical scheduling via resource augmentation. In Proc. 29th Annual ACM Symposium on Theory of Computing, El Paso, TX, pp. 140-149, ACM.
12. Sha, L., Abdelzaher, T., Årzén, K. E., Cervin, A., Baker, T. P., Burns, A., Buttazzo, G., Caccamo, M., Lehoczky, J., and Mok, A. K. 2004. Real time scheduling theory: A historical perspective. Real-Time Systems 28(2/3): 101-155.