A methodology for implementing highly concurrent data objects
- 1 November 1993
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Programming Languages and Systems
- Vol. 15 (5) , 745-770
- https://doi.org/10.1145/161468.161469
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- The performance of spin lock alternatives for shared-memory multiprocessorsIEEE Transactions on Parallel and Distributed Systems, 1990
- Concurrent operations on priority queuesCommunications of the ACM, 1989
- Consensus in the presence of partial synchronyJournal of the ACM, 1988
- On the minimal synchronism needed for distributed consensusJournal of the ACM, 1987
- Specifying Concurrent Program ModulesACM Transactions on Programming Languages and Systems, 1983
- Basic Techniques for the Efficient Coordination of Very Large Numbers of Cooperating Sequential ProcessorsACM Transactions on Programming Languages and Systems, 1983
- Concurrent Reading While WritingACM Transactions on Programming Languages and Systems, 1983
- Efficient locking for concurrent operations on B-treesACM Transactions on Database Systems, 1981
- On optimistic methods for concurrency controlACM Transactions on Database Systems, 1981
- EthernetCommunications of the ACM, 1976