This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Optimal Utilization Bounds for the Fixed-Priority Scheduling of Periodic Task Systems on Identical Multiprocessors
June 2004 (vol. 53 no. 6)
pp. 781-784

Abstract—In fixed-priority scheduling, the priority of a job, once assigned, may not change. A new fixed-priority algorthm for scheduling systems of periodic tasks upon identical multiprocessors is proposed. This algorithm has an achievable utilization of (m+1)/2 upon m unit-capacity processors. It is proven that this algorithm is optimal from the perspective of achievable utilization in the sense that no fixed-priority algorithm for scheduling periodic task systems upon identical multiprocessors may have an achievable utilization greater than (m+1)/2.

[1] B. Andersson, Static-Priority Scheduling on Multiprocessors PhD thesis, Dept. of Computer Eng., Chalmers Univ., 2003.
[2] T.P. Baker, An Analysis of EDF Schedulability on a Multiprocessor Technical Report TR-030202, Dept. of Computer Science, Florida State Univ., 2003.
[3] J. Goossens, S. Funk, and S. Baruah, Priority-Driven Scheduling of Periodic Task Systems on Multiprocessors Real Time Systems, vol. 25, nos. 2-3, pp. 187-205, 2003.
[4] R. Ha, Validating Timing Constraints in Multiprocessor and Distributed Systems PhD thesis, Dept. of Computer Science, Univ. of Illinois at Urbana-Champaign, 1995. Available as Technical Report No. UIUCDCS-R-95-1907.
[5] R. Ha and J.W.S. Liu, Validating Timing Constraints in Multiprocessor and Distributed Real-Time Systems Technical Report UIUCDCS-R-93-1833, Dept. of Computer Science, Univ. of Illinois at Urbana-Champaign, Oct. 1993.
[6] R. Ha and J.W.S. Liu, Validating Timing Constraints in Multiprocessor and Distributed Real-Time Systems Proc. 14th IEEE Int'l Conf. Distributed Computing Systems, 1994.
[7] C. Liu and J. Layland, Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment J. ACM, vol. 20, no. 1, 1973.
[8] J.W.S. Liu, Real-Time Systems. Upper Saddle River, N.J.: Prentice Hall, 2000.
[9] J.M. López, J.L. Díaz, M. García, and D.F. García, Worst-Case Utilization Bound for EDF Scheduling on Real-Time Multiprocessor Systems Proc. Euromicro Conf. Real-Time Systems, pp. 25-33, 2000.
[10] A. Srinivasan and S. Baruah, Deadline-Based Scheduling of Periodic Task Systems on Multiprocessors Information Processing Letters, vol. 84, no. 2, pp. 93-98, 2002.
[11] A. Srinivasan, P. Holman, J.H. Anderson, S. Baruah, and J. Kaur, Multiprocessor Scheduling on Processor-Based Router Platforms: Issues and Ideas Proc. Second Workshop Network Processors, Feb. 2003.

Index Terms:
Real-time systems, periodic task systems, identical multiprocessors, fixed-priority scheduling, utilization bounds.
Citation:
Sanjoy K. Baruah, "Optimal Utilization Bounds for the Fixed-Priority Scheduling of Periodic Task Systems on Identical Multiprocessors," IEEE Transactions on Computers, vol. 53, no. 6, pp. 781-784, June 2004, doi:10.1109/TC.2004.16
Usage of this product signifies your acceptance of the Terms of Use.