Abstract
Predictability is of paramount concern for hard real-time systems. In one approach to predictability, every aspect of a real-time system and every primitive provided by the underlying operating system must be bounded and predictable in order to achieve overall predictability. In this paper, we describe several concurrency control synchronization mechanisms developed for a next generation multiprocessor real-time kernel, the Spring Kernel. The important features of these mechanisms include semaphore support for mutual exclusion with linear waiting and bounded resource usage, termed strong semaphores. Three, more efficient, strong semaphore solutions are proposed in this paper. Two of them are based on the main theorem of the paper, the Deferred Bus theorem. These two solutions can either be implemented in hardware or software. The third solution, a pure software solution, is an extension to the existing Burns' algorithm. A performance comparison and a complexity analysis in terms of time, space and bus traffic are presented.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Anderson, T.E., Lazowska, E.D., and Levy, H.M. 1988. The performance implications of thread management alternatives for shared-memory multiprocessors. Technical Report 88-09-04, University of Washington, (Sept.).
Burns, J.E. 1978. Mutual exclusion with linear waiting using binary shared variables. SIGACT News, 10 (2), (Summer).
Dijkstra, E.W. 1968. The structure of the “THE”-multiprogramming system. Communications of the ACM, 11 (5), (May).
Dijkstra, E.W. 1971. Hierarchical ordering of sequential processes. Acta Information, 1.
Dinning, A. 1989. A survey of synchronization methods for parallel computers. Computer, 22 (7), (July).
Gottlieb, A., Grishman, R., Kruskal, C.P., McAuliffe, K.P., Rudolph, L., and Snir, M. 1983. The NYU ultracomputer—designing an MIMD shared memory parallel computer. IEEE Transactions on Computers, c-32 (2), (Feb.).
Motorola Inc. 1985. MC68020 32-Bit Microprocessor User's Manual. Englewood Cliffs, NJ: Prentice Hall.
Motorola Inc. 1986. MC68851 Paged Memory Management Unit User's Manual. Englewood Cliffs, NJ: Prentice Hall.
Motorola Inc. 1989. MVME135, MVME135-1, MVME135A, MVME136, and MVME136A 32-Bit Microcomputers User's Manual. Motorola Inc.
Sequent Computer Systems Inc. 1988. Sequent Symmetry Technical Summary. Sequent Computer Systems, Inc.
PetersonJ.L., and SilberschatzA. 1985. Operating System Concepts. Reading, MA: Addison-Wesley.
Rajkumar, R., Sha, L., and Lehoczky, J.P. 1988. Real-time synchronization protocols for multiprocessors. In Real-Time Systems Symposium, (Dec.).
Ramamritham, K., Stankovic, J.A., and Shiah, P. 1989. O(n) scheduling algorithms for real-time multiprocessor systems. In The 9th International Conference on Parallel Processing, (June).
Stankovic, J.A., and Ramamritham, K. 1989. The Spring kernel: A new paradigm for real-time operating systems. Operating Systems Review, 23 (3), (July).
Author information
Authors and Affiliations
Additional information
This work is part of the Spring Project directed by Prof. Krithi Ramamritham and Prof. John A. Stankovic at the University of Massachusetts and is funded in part by the Office of Naval Research under contract N00014-85-K-0398 and by the National Science Foundation under grant DCR-8500332.
Rights and permissions
About this article
Cite this article
Molesky, L.D., Shen, C. & Zlokapa, G. Predictable synchronization mechanisms for multiprocessor real-time systems. The Journal of Real-Time Systems 2, 163–180 (1990). https://doi.org/10.1007/BF00365325
Issue Date:
DOI: https://doi.org/10.1007/BF00365325