Real-time synchronization protocols for multiprocessors
Top Cited Papers
- 6 January 2003
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Proceedings. Real-Time Systems Symposium
- p. 259-269
- https://doi.org/10.1109/real.1988.51121
Abstract
The authors investigate the synchronization problem in the context of priority-driven preemptive scheduling on shared-memory multiprocessors. Unfortunately, a direct application of synchronization mechanisms such as the Ada rendezvous, semaphores, or monitors can lead to uncontrolled priority inversion: a high job being blocked by a lower priority job for an indefinite period of time. A task allocation scheme based on the generalized protocol is outlinedKeywords
This publication has 9 references indexed in Scilit:
- Introduction to Distributed-Software EngineeringComputer, 1987
- Preemptive Scheduling Under Time and Resource ConstraintsInternational Conference on Acoustics, Speech, and Signal Processing (ICASSP), 1987
- Performance of real-time bus scheduling algorithmsACM SIGMETRICS Performance Evaluation Review, 1986
- Dynamic Task Scheduling in Hard Real-Time Distributed systemsIEEE Software, 1984
- Experience with processes and monitors in MesaCommunications of the ACM, 1980
- Guaranteed Response Times in a Hard-Real-Time EnvironmentIEEE Transactions on Software Engineering, 1980
- On a Real-Time Scheduling ProblemOperations Research, 1978
- Multiprocessor Scheduling with the Aid of Network Flow AlgorithmsIEEE Transactions on Software Engineering, 1977
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJournal of the ACM, 1973