Abstract
Real-time systems have stringent deadline requirements for their tasks. To meet the requirements, a real-time system must use scheduling algorithms that ensure a predictable response even in the face of mutually exclusive accesses to critical sections. We present a concurrency control protocol for systems using the earliest deadline first scheduling algorithm. The protocol specifies a dynamic priority ceiling for each critical section which is the earliest deadline of jobs which are currently in or will enter the critical section. Jobs trying to enter a critical section will be blocked if they do not have a priority higher than the priority ceiling of any critical section which is in use. We show that the protocol prevents both deadlock and chained blocking. The schedulability condition and implementation issues of the protocol are also discussed.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Dhall, S.K. and Liu, C.L. 1978. On a Real-Time Scheduling Problem.Operations Research, vol. 26, pp. 127–140.
Knuth, D.E. 1973.The Art of Computer Programming—vol. 3/Sorting and Searching, Reading, MA: Addison-Wesley.
Lohoczky, J.P., Sha, L. and Strosnider, J.K. 1987. Enhanced Aperiodic Responsiveness in Hard Real-Time Environments.Proc IEEE Real-Time Systems Symposium, pp. 261–269.
Lehoczky, J.P., Sha, L. and Ding, Y. 1989. The Rate Monotonic Scheduling Algorithm: Exact Characterization and Average Case Behavior.Proc. IEEE Real-Time Systems Symposium, pp. 166–171.
Leinbaugh, D.W. 1980. Guaranteed Response Times in a Hard-Real-Time Environment.IEEE Trans. on Software Engineering, vol. SE-6, pp. 85–91.
Leung, J.Y.T. and Merrill, M.L. 1980. A Note on Preemptive Scheduling of Periodic, Real-Time Tasks,Information Processing Letters, vol. 11, pp. 115–118.
Liu, C.L. and Layland, J.W. 1973. Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment.JACM 20, pp. 46–61.
Mok, A.K. 1984. The Design of Real-Time Programming Systems Based on Process Models.Proc. IEEE Real-Time Systems Symposium, pp. 5–17.
Mok, A.K. 1988. Task Management Techniques for Enforcing ED Scheduling on Periodical Task Set,Proc. Fifth Workshop on Real-Time Software and Operating Systems, pp. 42–46.
Peterson, J.L. and Siberschatz, A. 1985.Operating System Concepts, 2nd Edition, Reading, MA: Addison-Wesley.
Ramamritham, K. and Stankovic, J. 1984. Dynamic Task Scheduling in Hard Real-Time Distributed Systems,IEEE Software, vol. 1, pp. 65–75.
Sha, L., Lehoczky, J.P. and Rajkumar, R. 1986. Solutions for Some Practical Problems in Prioritized Preemptive Scheduling.Proc. IEEE Real-Time Systems Symposium, pp. 181–191.
Sha, L., Rajkumar, R. and Lehoczky, J.P. 1987. Priority Inheritance Protocols: An Approach to Real-Time Synchronization. Technical Report CMU-CS-87-181, Department of Computer Science, Carnegie-Mellon University.
Stankovic, J. 1985. Stability and Distributed Scheduling Algorithms.IEEE Trans. Software Engineering, vol. SE-11, pp. 1141–1152.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Chen, MI., Lin, KJ. Dynamic priority ceilings: A concurrency control protocol for real-time systems. Real-Time Syst 2, 325–346 (1990). https://doi.org/10.1007/BF01995676
Issue Date:
DOI: https://doi.org/10.1007/BF01995676