Nonblocking k-compare-single-swap

Annual ACM Symposium on Parallel Algorithms and Architectures

Volumn , Issue , 2003, Pages 314-323

  Luchangco, Victor ^a   Moir, Mark ^a   Shavit, Nir ^b  

^a SUN MICROSYSTEMS   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

Concurrent data structures; Linked lists; Multiprocessors; Nonblocking synchronization; Obstruction freedom

Indexed keywords

ALGORITHMS; CONCURRENT ENGINEERING; DATA STORAGE EQUIPMENT; DATA STRUCTURES; SOFTWARE ENGINEERING; SYNCHRONIZATION;

COMPARE-AND-SWAP (CAS) OPERATIONS;

MULTIPROCESSING SYSTEMS;

EID: 0038040976     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/777412.777468     Document Type: Conference Paper

References (29)

1. Y. Afek, H. Attiya, D. Dolev, E. Gafni, M. Marritt, and N. Shavit. Atomic snapshots of shared memory. Journal of the ACM (JACM), 40(4):873-890, 1993.
2. O. Agesen, D. Detlefs, C. Flood, A. Garthwaite, P. Martin, M. Moir, N. Shavit, and G. Steele. DCAS-based concurrent deques. Theory of Computing Systems, 35:349-386, 2002. A preliminary version appeared in the Proc. 12th ACM Symposium on Parallel Algorithms and Architectures.
3. H. Attiya and E. Dagan. Universal operations: Unary versus binary. In Proc. 15th Annual ACM Symposium on Principles of Distributed Computing, May 1996.
4. G. Barnes. A method for implementing lock-free shared data structures. In Proc. 5th ACM Symposium on Parallel Algorithms and Architectures, pages 261-270, June 1993.
5. D. Detlefs, P. Martin, M. Moir, and G. Steele. Lock-free reference counting. Distributed Computing, 15(4):255-271, 2002. A preliminary version appeared in the Proc. 20th Annual ACM Symposium on Principles of Distributed Computing, 2001.
6. A. Glew and W. Hwu. A feature taxonomy and survey of synchronization primitive implementations. Technical Report CRHC-91-7, University of Illinois at Urbana-Champaign, Dec. 1990.
7. M. Greenwald. Non-Blocking Synchronization and System Design. PhD thesis, Stanford University Technical Report STAN-CS-TR-99-1624, Aug. 1999.
8. T. Harris. A pragmatic implementation of non-blocking linked lists. In Proc. 15th International Symposium on Distributed Computing, 2001.
9. T. Harris. Personal communication, Dec. 2002.
10. T. Harris, K. Fraser, and I. Pratt. A practical multi-word compare-and-swap operation. In Proc. 16th International Symposium on Distributed Computing, 2002.
11. M. Herlihy. Wait-free synchronization. ACM Transactions on Programming Languages and Systems, 13(1):124-149, 1991.
12. M. Herlihy, V. Luchangco, and M. Moir. Obstruction-free software NCAS and transactional memory. Unpublished manuscript, 2002.
13. M. Herlihy, V. Luchangco, and M. Moir. The repeat offender problem: A mechanism for supporting dynamic-sized, lock-free data structures. In Proc. 16th International Symposium on Distributed Computing, 2002.
14. M. Herlihy, V. Luchangco, and M. Moir. Obstruction-free synchronization: Double-ended queues as an example. In Proc. 23rd International Conference on Distributed Computing Systems, 2003.
15. M. Herlihy, V. Luchangco, M. Moir, and W. Scherer. Software transactional memory for supporting dynamic-sized data structures. In Proc. 22th Annual ACM Symposium on Principles of Distributed Computing, 2003. To appear.
16. M. Herlihy and J. E. B. Moss. Transactional memory: Architectural support for lock-free data structures. In Proc. 20th Annual, International Symposium on Computer Architecture, 1993.
17. M. Herlihy and J. Wing. Linearizability: A correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems, 12(3):463-492, 1990.
18. Intel. Pentium processor family user's manual: Vol 3, architecture and programming manual, 1994.
19. A. Israeli and L. Rappoport. Disjoint-access-parallel implementations of strong shared memory primitives. In Proc. 13th Annual ACM Symposium on Principles of Distributed Computing, pages 151-160, 1994.
20. N. Lynch and F. Vaandrager. Forward and backward simulations - part I: Untimed systems. Information and Computation, 121(2):214-233, 1995.
21. M. Michael. High performance dynamic lock-free hash tables and list-based sets. In Proc. 14th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 73-82, 2002.
22. M. Michael. Safe memory reclamation for dynamic lock-free objects using atomic reads and writes. In Proc. 21st Annual ACM Symposium on the Principles of Distributed Computing, 2002.
23. M. Michael and M. Scott. Nonblocking algorithms and preemption-safe locking on multiprogrammed shared memory multiprocessors. Journal of Parallel and Distributed Computing, 51(1):1-26, 1998.
24. M. Moir. Practical implementations of non-blocking synchronization primitives. In Proc. 16th Annual ACM Symposium on Principles of Distributed Computing, pages 219-228, 1997.
25. Motorola. MC68030 User's Manual. Prentice-Hall, 1989.
26. N. Shavit and D. Touitou. Software transactional memory. Distributed Computing, 10(2):99-116, 1997.
27. R. Sites. Alpha architecture reference manual, 1992.
28. J. Turek, D. Shasha, and S. Prakash. Locking without blocking: Making lock-based concurrent data structure algorithms nonblocking. In Proc. 11th ACM Symposium on Principles of Database Systems, pages 212-222, 1992.
29. D. Weaver and T. Germond. The SPARC Architecture Manual Version 9. PTR Prentice Hall, 1994.