A Methodology for Implementing Highly Concurrent Data Structures

ACM SIGPLAN Notices

Volumn 25, Issue 3, 1990, Pages 197-206

  Herlihy, Maurice ^a  

^a HEWLETT PACKARD COMPANY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84976688778     PISSN: 03621340     EISSN: 15581160     Source Type: Journal    
DOI: 10.1145/99164.99185     Document Type: Article

References (34)

1. G.R. Andrews and F.B. Schneider. Concepts and notations for concurrent programming. A CM Computing Surveys, 15(1):3-43, 1983.
2. R. Bayer and M. Schkolnick. Concurrency of operations on b-trees. Acta Informatica, 1(1):1-21, 1977.
3. J. Biswas and J.C. Browne. Simultaneous update of priority structures. In Proceedings of the 1987 International Conference on Parallel Processing, pages 124-131, 1987.
4. B. Bloom. Constructing two-writer atomic registers. In Proceedings of the Sixth ACM Symposium on Principles of Distributed Computing, pages 249-259, 1987.
5. J.E. Burns and G.L. Peterson. Constructing multi-reader atomic values from non-atomic values. In Proceedings of the Sixth A CM Symposium on Principles of Distributed Computing, pages 222-231, 1987.
6. B. Chor, A. Israeli, and M. Li. On processor coordination using asynchronous hardware. In Proceedings of the Sixth A CM Symposium on Principles of Distributed Computing, pages 86-97, 1987.
7. D. Dolev, C. Dwork, and L Stockmeyer. On the minimal synchronism needed for distributed consensus. Journal of the ACM, 34(1):77-97, January 1987.
8. C. Dwork, N. Lynch, and L Stockmeyer. Consensus in the presence of partial synchrony. Journal of the ACM, 35(2):228-323, April 1988.
9. C. Dwork, D. Shmoys, and L. Stockmeyer. Flipping persuasively in constant expected time. In Twenty-Seventh Annual Symposium on Foundations of Computer Science, pages 222-232, October 1986.
10. C.S. Ellis. Concurrent search and insertion in 2-3 trees. Acta Informatica, 14:63-86, 1980.
11. M. Fischer, N.A. Lynch, and M.S. Paterson. Impossibility of distributed commit with one faulty process. Journal of the ACM, 32(2), April 1985.
12. R. Ford and J. Calhoun. Concurrency control mechanisms and the serializability of concurrent tree algorithms. In 3rd A CM Symposium on Princples of Database Systems, pages 51-60, 1984.
13. A. Gottlieb, R. Grishman, C.P. Kruskal, K.P. McAuliffe, L. Rudolph, and M. Snir. The nyu ultracomputer - designing an mimd parallel computer. IEEE Transactions on Computers, C-32(2):175-189, February 1984.
14. A. Gottlieb, B.D. Lubachevsky, and L. Rudolph. Basic techniques for the efficient coordination of very large numbers of cooperating sequential processors. ACM Transactions on Programming Languages and Systems, 5(2):164-189, April 1983.
15. L. Guibas and R. Sedgewick. A dichromatic framework for balanced trees. In 19th ACM Symposium on Foundations of Computer Science, pages 8-21, 1978.
16. R. Halstead. Multilisp: A language for concurrent symbolic computation. ACM Trans. on Prog. Languages and Systems, 7(4):501-538, 1985.
17. M. Herlihy and J. Wing. Axioms for concurrent objects. In 14th ACM Symposium on Principles of Programming Languages, pages 13-26, January 1987.
18. M.P. Herlihy. Impossibility and universality results for wait-free synchronization. In Seventh ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, August 1988.
19. M.P. Herlihy. Wait-free synchronization. Submitted for publication., July 1989.
20. D.W. Jones. Concurrent operations on priority queues. Communications of the ACM, 32(1):132-137, January 1989.
21. L. Lamport. Concurrent reading and writing. Communications of the ACM, 20(11):806-811, November 1977.
22. L. Lamport. How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Transactions on Computers, C-28(9):690, September 1979.
23. L. Lamport. Specifying concurrent program modules. ACM Transactions on Programming Languages and Systems, 5(2):190-222, April 1983.
24. L. Lamport. On interprocess communication, parts i and ii. Distributed Computing, 1:77-101, 1986.
25. V. Lanin and D. Shasha. Concurrent set manipulation without locking. In Proceedings of the Seventh ACM Symposium on Principles of Database Systems, pages 211-220, March 1988.
26. P.L. Lehman and S.B. Yao. Efficient locking for concurrent operations on b-trees. ACM Transactions on Database Systems, 6(4):650-670, December 1981.
27. R. Newman-Wolfe. A protocol for wait-free, atomic, multi-reader shared variables. In Proceedings of the Sixth A CM Symposium on Principles of Distributed Computing, pages 232-249, 1987.
28. C.H. Papadimitriou. The serializability of concurrent database updates. Journal of the ACM, 26(4):631-653, October 1979.
29. G.L. Peterson. Concurrent reading while writing. ACM Transactions on Programming Languages and Systems, 5(1):46-55, January 1983.
30. G.L. Peterson and J.E. Burns. Concurrent reading while writing ii: the multi-writer case. Technical Report GIT-ICS-86/26, Georgia Institute of Technology, December 1986.
31. S.A. Plotkin. Sticky bits and universality of consensus. In Proceedings of the Eighth ACM Symposium on Principles of Distributed Computing, pages 159-176, 1989.
32. Y. Sagiv. Concurrent operations on b-trees with overtaking. In ACM Princples of Database Systems, pages 28-37, January 1985.
33. A.K. Singh, J.H. Anderson, and M.G. Gouda. The elusive atomic register revisited. In Proceedings of the Sixth ACM Symposium on Principles of Distributed Computing, pages 206-221, 1987.
34. D.D. Sleator and R.E. Tarjan. Self adjusting binary trees. In Proceedings of the 15th A CM Symposium on Theory of Computing, pages 52-59, 1983.