A method for implementing lock-free shared data structures

Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1993

Volumn , Issue , 1993, Pages 261-270

  Barnes, Greg ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COSTS; DATA STRUCTURES; LOCKS (FASTENERS); MEMORY ARCHITECTURE; PARALLEL ALGORITHMS; PARALLEL ARCHITECTURES; SEMANTICS;

ASYNCHRONOUS PARALLEL; CONCURRENT ACCESS; LOCK-FREE ALGORITHMS; LOCK-FREE DATA STRUCTURES; MUTUAL EXCLUSIONS; SEQUENTIAL IMPLEMENTATION; SHARED DATA STRUCTURE; SHARED MEMORY MULTIPROCESSOR;

CONCURRENCY CONTROL;

EID: 84991003269     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/165231.165265     Document Type: Conference Paper

References (24)

1. J. Alemany and E. W. Feiten. Performance issues in non-blocking synchronization on shared-memory multiprocessors. In Proceedings of the Eleventh Annual ACM Symposium on Principles of Distributed Computing, Vancouver, B.C., Canada, Aug. 1992.
2. R. J. Anderson. Parallel algorithms for generating random permutations on a shared memory machine. In Proceedings of the 1990 ACM Symposium on Parallel Algorithms and Architectures, pages 95-102, Crete, Greece, June 1990.
3. R. J. Anderson. Primitives for asynchronous bst compression. In Proceedings of the 1992 ACM Symposium on Parallel Algorithms and Architectures, pages 199-208, San Diego, CA, June 1992.
4. R. J. Anderson and H. Woll. Wait-free parallel algorithms for the umon-find problem. Technical Report 91-04-05, University of Washington, 1991. See also [5].
5. R. J. Anderson and H. Woll. Wait-free parallel algorithms for the umon-find problem. In Proceedings of the Twenty Third Annual ACM Symposium on Theory of Computing, pages 370-380, New Orleans, LA, May 1991.
6. G. Barnes. Wait-free algorithms for heaps. University of Washington, Preprint, 1992.
7. J. F. Buss and P. Ragde. Certified write-all on a strongly asynchronous PRAM. Preliminary Report, 1990.
8. R. Cole and O. Zajicek. The APRAM: Incorporating asynchxony into the PRAM model. In Proceedings of the 1989 ACM Symposium on Parallel Algorithms and Architectures, pages 169-178, Santa Fe, NM, June 1989.
9. R. Cole and O. Zajicek. The expected advantage of asynchrony. In Proceedings of the 1990 ACM Symposium on Parallel Algorithms and Architectures, pages 85-94, Crete, Greece, July 1990.
10. P. Gibbons. A more practical PRAM model. In Proceedings of the 1989 ACM Symposium on Parallel Algorithms and Architectures, pages 158-168, Santa Fe, NM, June 1989.
11. M. Herlihy. A methodology for implementing highly concurrent data objects. In Proceedings of the Second Annual A CM SIGPLAN Symposium on Principles and Practices of Parallel Programming, pages 197-206, Mar. 1990.
12. M. Herlihy. A methodology for implementing highly concurrent data objects. Technical Report CRL 91/10, DEC Cambridge Research Lab, Oct. 1991. See also [11].
13. M. Herlihy. Wait-free synchronization. ACM Transactions on Programming Languages and Systems, 13(1):124-149, 1991.
14. M. Herlihy and J. Moss. Transactional memory: Architectural support for lock-free data structures. Technical Report CRL 92/07, DEC Cambridge Research Lab, Dec. 1992.
15. M. Herhhy and J. Wing. Axioms for concurrent objects. In Conference Record of the Fourteenth Annual ACM Symposium on Principles of Programming Languages, pages 1326, Jan. 1987.
16. P. Kanellakis and A. Shvartsman. Efficient parallel algorithms can be made robust. In Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing, pages 211-222, 1989
17. Z. M. Kedem, K. V. Palem, and P. G. Spirakis. Efficient robust parallel computations. In Proceedings of the Twenty Second Annual ACM Symposium on Theory of Computing, pages 138-148, Baltimore, MD, May 1990.
18. L. Lamport. 'Sometime' is sometimes 'not never'. Technical report, S.R.I. International, Menlo Park, CA, Jan. 1979.
19. L. Lamport. Specifying concurrent program modules. ACM Transactions on Programming Languages and Systems, 5(2):190-222, Apr. 1983.
20. V. Lanin and D. Shasha. Concurrent set manipulation without locking. In Proceedings of tke Seventh Annual ACM Symposium on Principles of Database Systems, pages 211-220, Mar. 1988.
21. C. Martel, R. Subramonian, and A. Park. Asynchronous PRAMs are (almost) as good as synchronous PRAMs. In 81st Annual Symposium on Foundations of Computer Science, pages 590-599, St. Louis, MO, Oct. 1990. IEEE.
22. H. Massalin. Synthesis: An Efficient Implementation of Fundamental Operating System Services. PhD thesis, Columbia University, 1992.
23. MIPS Computer Company. The MIPS RISC architecture.
24. N. Nishimura. Asynchronous shared memory parallel computation. In Proceedings of the 1990 ACM Symposium on Parallel Algorithms and Architectures, pages 76-84, Crete, Greece, July 1990.