A methodology for implementing highly concurrent data structures
- 1 February 1990
- proceedings article
- Published by Association for Computing Machinery (ACM)
- Vol. 25 (3), 197-206
- https://doi.org/10.1145/99163.99185
Abstract
No abstract availableThis publication has 29 references indexed in Scilit:
- 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
- MULTILISP: a language for concurrent symbolic computationACM Transactions on Programming Languages and Systems, 1985
- Impossibility of distributed consensus with one faulty processJournal of the ACM, 1985
- 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
- Concurrent reading and writingCommunications of the ACM, 1977