Communications of the ACM

Home/Magazine Archive/October 1981 (Vol. 24, No. 10)/Low contention semaphores and ready lists/Abstract

Low contention semaphores and ready lists

By Peter J. Denning, T. Don Dennis, Jeffrey A. Brumfield
Communications of the ACM, October 1981, Vol. 24 No. 10, Pages 687-699
10.1145/358769.358787
Comments

View as: Print Mobile App ACM Digital Library Full Text (PDF) Share:

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.

The full text of this article is premium content

No entries found

Log in to Read the Full Article

Sign In

Sign in using your ACM Web Account username and password to access premium content if you are an ACM member, Communications subscriber or Digital Library subscriber.

Need Access?

Please select one of the options below for access to premium content and features.

Create a Web Account

If you are already an ACM member, Communications subscriber, or Digital Library subscriber, please set up a web account to access premium content on this site.

Join the ACM

Become a member to take full advantage of ACM's outstanding computing information resources, networking opportunities, and other benefits.

Subscribe to Communications of the ACM Magazine

Get full access to 50+ years of CACM content and receive the print version of the magazine monthly.

Purchase the Article

Non-members can purchase this article or a copy of the magazine in which it appears.