Real-time synchronization protocols for multiprocessors

Top Cited Papers

6 January 2003

conference paper
Published by Institute of Electrical and Electronics Engineers (IEEE)

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 outlined

Keywords

This publication has 9 references indexed in Scilit:

Introduction to Distributed-Software Engineering
Computer, 1987
Preemptive Scheduling Under Time and Resource Constraints
IEEE Transactions on Computers, 1987
Performance of real-time bus scheduling algorithms
ACM SIGMETRICS Performance Evaluation Review, 1986
Dynamic Task Scheduling in Hard Real-Time Distributed systems
IEEE Software, 1984
Experience with processes and monitors in Mesa
Communications of the ACM, 1980
Guaranteed Response Times in a Hard-Real-Time Environment
IEEE Transactions on Software Engineering, 1980
On a Real-Time Scheduling Problem
Operations Research, 1978
Multiprocessor Scheduling with the Aid of Network Flow Algorithms
IEEE Transactions on Software Engineering, 1977
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM, 1973

Cited by 210 articles