Disjoint-access-parallel implementations of strong shared memory primitives

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn Part F129432, Issue , 1994, Pages 151-160

  Israeli, Amos ^a   Rappoport, Lihu ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; DISTRIBUTED COMPUTER SYSTEMS; TIN;

ASYNCHRONOUS SHARED MEMORY; DISJOINT SETS; EFFICIENT IMPLEMENTATION; NON-BLOCKING; PARALLEL IMPLEMENTATIONS; PRIMITIVE OPERATIONS; SHARED MEMORY; SPACE COMPLEXITY;

MEMORY ARCHITECTURE;

EID: 84938938481     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/197917.198079     Document Type: Conference Paper

References (18)

1. J. Alemany and E. W. Felten. Performance Issues in Non-blocking Synchronization on Shared-memory Multiprocessors. In Proceedings of the 11th ACM Symposium on Principles of Distributed Computing, pages 124-134, August 1992.
2. DEC, Alpha system reference manual.
3. R. J. Anderson and H. Woll. Wait-Free parallel algorithms for the union-find problem. In Proceedings of the 23rd ACM Symposium on Theory of Computation, pages 370-380, May 1991.
4. Y. Afek, E. Weisberger and H. Weisman. A completness theorem for a class of synchronization objects. In Proceedings of the 12th ACM Symposium on Principles of Distributed Computing, pages 159-170, August 1993.
5. G. Barnes. A Method for Implementing Lock-Free Shared Data Structures. In 5th ACM Symposium on Parallel Algorithms and Architectures, pages 261-270, 1993.
6. M. P. Herlihy. Impossibility and universality results for wait-free synchronization. In 7th ACM Symposium on Principles of Distributed Computing, pages 276-290, August 1988.
7. M. P. Herlihy. A methodology for implementing highly concurrent data structures. DEC Cambridge Research Lab Technical report 91/10.
8. M. P. Herlihy, J. E. B. Moss. Transactional Memory: Architectural Support for Lock-Free Data Structures. DEC Cambridge Research Lab Technical report 92/7.
9. M. Herlihy and J. Wing. Linearizability: A correctness condition for concurrent objects. In ACM TOPLAS, 12(3):463-492, 1990.
10. IBM System 370 principles of operation. Order Number GA22-7000.
11. A. Israeli and L. Rappoport. Efficient Wait-Free Implementation of a Concurrent Priority Queue. In Workshop of Distributed algorithms, pages 1-16, September 1993.
12. 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.
13. G. Kane. MIPS RISC Architecture, Prentice Hall, New York, 1989.
14. Motorola MC68020 32-bit Microprocessor User's Manual, 1984.
15. S. A. Plotkin. Sticky Bits and Universality of Consensus. In Proceedings of the Eighth ASM Symposium on Principles of Distributed Computing, pages 159-175, 1989.
16. S. Prakash, Y. Lee and T. Johnson. A Non-Blocking Algorithm for Shared Queues Using Compare-and-Swap, Proceedings 1991 International Conference on Parallel Processing, volume 2, pages 68-75.
17. N. Shavit and D. Touitou. Software Transactional Memory. Technical Report 290/94, Tel-Aviv University.
18. J. Turek, D. Shasha and S. Prakash. Locking Without Blocking: Making Lock Based Concurrent Data Structure Algorithms Nonblocking, In Proceedings of 1992 Principles of Database Systems, pages 212-222, 1992.