Low contention semaphores and ready lists

DOI10.1145/358769.358787zbMATH Open0477.68029OpenAlexW2107698681MaRDI QIDQ3935463FDOQ3935463

Authors: Peter J. Denning, T. Donald Dennis, Jeffrey A. Brumfield 

Publication date: 1981

Published in: Communications of the ACM (Search for Journal in Brave)

Full work available at URL: https://docs.lib.purdue.edu/cstech/261

zbMATH Keywords

memory contentionring networksmultiprocessingprocess management

Mathematics Subject Classification ID

Data structures (68P05) Theory of operating systems (68N25)

This page was built for publication: Low contention semaphores and ready lists

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3935463)