This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Semaphore Queue Priority Assignment for Real-Time Multiprocessor Synchronization
October 1995 (vol. 21 no. 10)
pp. 834-844
Prior work on real-time scheduling with global shared resources in multiprocessor systems assigns as much blocking as possible to the lowest-priority tasks. In this paper, we show that better schedulability can be achieved if global blocking is distributed according to the blocking tolerance of tasks rather than their execution priorities. We describe an algorithm that assigns global semaphore queue priorities according to blocking tolerance, and we present simulation results demonstrating the advantages of this approach with rate monotonic scheduling. Our simulations also show that a simple FIFO usually provides better real-time schedulability with global semaphores than priority queues that use task execution priorities.

[1] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness.New York: W.H. Freeman, 1979.
[2] Y. Ishikawa, H. Tokuda, and C.W. Mercer, “An Object-Oriented Real-Time Programming Language,” Computer, vol. 25, no. 10, pp. 66–73, Oct. 1992.
[3] J.P. Lehoczky,L. Sha,, and J.K. Strosnider,“Enhanced aperiodic responsiveness in hard real-time environments,” Proc. Real-Time Systems Symp., pp. 261-270, Dec. 1987.
[4] C.L. Liu and J.W. Layland, “Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment,” J. ACM, vol. 20, no. 1, pp. 40-61, 1973.
[5] V.B. Lortz,An Object-Oriented Real-Time Database System for Multiprocessors, PhD thesis, Univ. of Michigan, Apr. 1994.
[6] A.K. Mok,“Fundamental design problems of distributed systems for the hard real-time environment,” PhD thesis, 1983.
[7] R. Rajkumar, "Real-Time Synchronization Protocols for Shared Memory Multiprocessors," Proc. IEEE 10th Int'l Conf. Distributed Computing, pp. 116-123, 1990.
[8] R. Rajkumar, Synchronization in Real-Time Systems: A Priority Inheritance Approach. Norwell,Mass.: Kluwer Academic, 1991.
[9] R. Rajkumar, L. Sha, and J.P. Lehoczky, "Real-Time Synchronization Protocols for Multiprocessors," Proc. IEEE Real-Time Systems Symp., pp. 259-269, 1988.
[10] L. Sha, R. Rajkuma, and J.P. Lehoczky, "Priority Inheritance Protocols: An Approach to Real-Time Synchronization," IEEE Trans. Computers, vol. 39, no. 9, pp. 1,175-1,185, Sept. 1990.
[11] K.G. Shin and Y.-C. Chang, “A Reservation-Based Algorithm for Scheduling Both Periodic and Aperiodic Real-Time Tasks,” IEEE Trans. Computers, vol. 44, no. 12, pp. 1,405-1,419, Dec. 1995.

Index Terms:
Real-time scheduling, priority assignment, multiprocessor synchronization, concurrency control.
Citation:
Victor B. Lortz, Kang G. Shin, "Semaphore Queue Priority Assignment for Real-Time Multiprocessor Synchronization," IEEE Transactions on Software Engineering, vol. 21, no. 10, pp. 834-844, Oct. 1995, doi:10.1109/32.469457
Usage of this product signifies your acceptance of the Terms of Use.