Low contention semaphores and ready lists
- 1 October 1981
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 24 (10) , 687-699
- https://doi.org/10.1145/358769.358787
Abstract
A method for reducing semaphore and ready-list contention in multiprocessor operating systems is described. Its correctness is established. Its performance is compared with conventional implementations. A ready list implemented as a ring network is proposed and evaluated.Keywords
This publication has 5 references indexed in Scilit:
- Variable-length capabilities as a solution to the small-object problemPublished by Association for Computing Machinery (ACM) ,1979
- Systems aspects of The Cambridge RingPublished by Association for Computing Machinery (ACM) ,1979
- Modularization and hierarchy in a family of operating systemsCommunications of the ACM, 1976
- On The Advantages of Tagged ArchitectureIEEE Transactions on Computers, 1973
- The design of the Venus operating systemCommunications of the ACM, 1972