DCAS is not a silver bullet for nonblocking algorithm design

Annual ACM Symposium on Parallel Algorithms and Architectures

Volumn 16, Issue , 2004, Pages 216-224

  Doherty, Simon ^a,b   Detlefs, David L ^b   Groves, Lindsay ^a   Flood, Christine H ^b   Luchangco, Victor ^b   Martin, Paul A ^b   Moir, Mark ^b   Shavit, Nir ^b   Steele Jr , Guy L ^b  

^a VICTORIA UNIVERSITY OF WELLINGTON   (New Zealand)

^b SUN MICROSYSTEMS   (United States)

Author keywords

Concurrent data structures; DCAS; Double compare and swap; Linked lists; Lock free; Multiprocessors; Nonblocking synchronization

Indexed keywords

ALGORITHMS; COMPUTER ARCHITECTURE; DATA STRUCTURES; PROGRAMMING THEORY; SOFTWARE ENGINEERING; SYNCHRONIZATION;

CONCURRENT DATA STRUCTURES; DCAS DOUBLE-COMPARE-AND-SWAP; LINKED LIST; LOCK-FREE; MULTIPROCESSORS; NONBLOCKING SYNCHRONIZATION;

MULTIPROCESSING SYSTEMS;

EID: 8344265234     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1007912.1007945     Document Type: Conference Paper

References (29)

1. O. Agesen, D. Detlefs, C. H. Flood, A. Garthwaite, P. Martin, M. Moir, N. Shavit, and Guy L. Steele Jr. DCAS-based concurrent deques. In Theory of Computing Systems, volume 35, 2002.
2. N. S. Arora, B. Blumofe, and C. G. Plaxton. Thread scheduling for multiprogrammed multiprocessors. In Proceedings of the 10th Annual ACM Symposium on Parallel Algorithms and Architectures, 1998.
3. D. Detlefs, C. H. Flood, A. Garthwaite, P. Martin, N. Shavit, and G. L. Steele Jr. Even better DCAS-based concurrent deques. In Proceedings of the 14th International Symposium on Distributed Computing, pages 59-73, 2000.
4. D. Detlefs, P. Martin, M. Moir, and G. L. Steele, Jr. Lock-free reference counting. In Proceedings of the 20th Annual ACM Symposium on Principles of Distributed Computing, August 2001.
5. S. Doherty. Modelling and verifying non-blocking algorithms that use dynamically allocated memory. Master's thesis, Victoria University Wellington, April 2003. http://www.mcs.vuw.ac.nz/~sdoherty.
6. M. Greenwald. Two-handed emulation: How to build non-blocking implementations of complex data structures using DCAS. In Proceedings of the 21st Annual Symposium on Principles of Distributed Computing, 2002.
7. M. Greenwald and D. Cheriton. The synergy between non-blocking synchronization and operating system structure. In Proceedings of the end Symposium on Operating System Design and Implementation, pages 123-136, 1996.
8. M. B. Greenwald. Non-Blocking Synchronisation and System Design. PhD thesis, Stanford University, August 1999.
9. T. Harris and K. Fraser. Language support for lightweight transactions. In Proceedings of the 18th ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications, 2003.
10. T. L. Harris, K. Fraser, and I. A. Pratt. A practical multi-word compare-and-swap operation. In Proceedings of the 14th International Conference on Distributed Computing, 2002.
11. M. Herlihy. Wait-free synchronization. ACM Transactions on Programming Languages and Systems, 11(1):124-149, January 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 structure. In Proceedings of the 16th International Symposium on Distributed Computing, October 2002.
14. M. Herlihy, V. Luchangco, and M. Moir. Obstruction-free synchronization: Double-ended queues as an example. In Proceedings of the IEEE International Conference on Distributed Computing Systems, 2003.
15. M. Herlihy, V. Luchangco, M. Moir, and W. Scherer. Software transactional memory for dynamic-sized data structures. In Proceedings of the 22nd Annual ACM Symposium on Principles of Distributed Computing, 2003.
16. M. Herlihy and J. E. B. Moss. Transactional memory: Architectural support for lock-free data structures. In Proceedings of 20th Annual International Symposium on Computer Architecture, 1993.
17. M. P. Herlihy and J. M. Wing. Linearizability: A correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems, 12(3):463-492, November 1990.
18. D. E. Knuth. The Art of Computer Programming: Fundamental Algorithms. Addison-Wesley, 2nd edition, 1968.
19. V. Luchangco, M. Moir, and N. Shavit. Nonblocking k-compare-single-swap. In Proceedings of the ACM Symposium on Parallel Architectures and Algorithms, 2003.
20. N. Lynch, Distributed Algorithms. Morgan Kaufmann, San Mateo, CA, 1996.
21. N. Lynch and M. Tuttle. Hierarchical correctness proofs for distributed algorithms. In Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing, pages 137-151, August 1987.
22. N. A. Lynch and F. W. Vaandrager. Forward and backward simulations - part I: untimed systems. Information and Computation, 121(2):214-233, September 1995.
23. P. A. Martin, M. Moir, and Guy L. Steele, Jr. DCAS-based concurrent deques supporting bulk allocation. Technical Report TR-2002-111, Sun Microsystems Laboratories, 2002.
24. H. Massalin and C. Pu. A lock-free multiprocessor OS kernel. Technical report, Columbia University, New York, June 1991.
25. M. Michael and M. Scott. Nonblocking algorithms and preemption-safe locking on multiprogrammed shared memory multiprocessors. Journal of Parallel and Distributed Computing, 51(1):l-26, 1998.
26. S. Prakash, Y. Lee, and T. Johnson. A non-blocking algorithm for shared queues using compare-and-swap. IEEE Transactions on Computers, 43(5):548-559, 1994.
27. N. Shavit and D. Touitou. Software transactional memory. In Distributed Computing, Special Issue, volume 10, pages 99-116, 1997.
28. The PVS Specification and Verification System, http://pvs.csl.sri.com/.
29. R. K. Treiber. Systems programming: Coping with parallelism. Technical Report RJ 5118, IBM Almaden Research Center, April 1986.