A general lock-free algorithm using compare-and-swap

Information and Computation

Volumn 205, Issue 2, 2007, Pages 225-241

  Gao, H ^a   Hesselink, W H ^b  

^a UNIVERSITY OF ELECTRONIC SCIENCE AND TECHNOLOGY OF CHINA   (China)

^b UNIVERSITY OF GRONINGEN   (Netherlands)

Author keywords

Atomicity; Compare and swap; Correctness; Lock free; Refinement mapping

Indexed keywords

C (PROGRAMMING LANGUAGE); LOCATION; MAPPING; SYNCHRONIZATION;

ATOMICITY; COMPARE AND SWAPS; CORRECTNESS; LOCK-FREE; REFINEMENT MAPPING;

LOCKS (FASTENERS);

EID: 84855195982     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2006.10.003     Document Type: Article

References (25)

1. M. Abadi, L. Lamport, The existence of refinement mappings, Theoretical Computer Science 82(2) (1991) 253-284.
2. J. H. Anderson, M. Moir, Universal constructions for multi-object operations, in: PODC'95: Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing, ACM Press, New York, NY, USA, 1995, pp. 184-193.
3. R. J. R. Back, J. von Wright, Stepwise refinement of distributed systems: models, formalism, correctness: refinement calculus, in: J. W. de Bakker, W.-P. de Roever, G. Rozenberg (Eds.), Stepwise Refinement of Distributed Systems, Lecture Notes in Computer Science, vol. 430, Springer-Verlag, 1990, pp. 42-93.
4. G. Barnes, A method for implementing lock-free data structures, in: Proceedings of the 5th ACM Symposium on Parallel Algorithms and Architectures, June 1993, pp. 261-270.
5. B. N. Bershad, Practical considerations for non-blocking concurrent objects, in: Proceedings of the Thirteenth International Conference on Distributed Computing Systems, 1993, pp. 264-274.
6. S. Doherty, M. Herlihy, V. Luchangco, M. Moir, Bringing practical lock-freesynchronization to 64-bit applications, in: PODC'04: Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, ACM Press, New York, NY, USA, 2004, pp. 31-39.
7. H. Gao, J. F. Groote, W. H. Hesselink, Lock-free dynamic hash tables with open addressing, Distributed Computing 17(2005) 21-42. (Pubitemid 41660459)
8. H. Gao, J. F. Groote, W. H. Hesselink, Lock-free parallel garbage collection, in: Y. Pan, D. Chen, M. Guo, J. Cao, J. Dongarra (Eds.), Proceedings of Third International Symposium on Parallel and Distributed Processing and Applications (ISPA'05), vol. 3758, LNCS, Springer, 2005, pp. 263-274. (Pubitemid 43734134)
9. H. Gao, W. H. Hesselink, A formal reduction for lock-free parallel algorithms, in: Proceedings of the 16th Conference on Computer Aided Verification (CAV), July 2004.
10. M. Herlihy, Wait-free synchronization, ACM Transactions on Programming Languages and Systems 13(1) (1991) 124-149. (Pubitemid 23600427)
11. M. Herlihy, A methodology for implementing highly concurrent data objects, ACM Transactions on Programming Languages and Systems 15(5) (1993) 745-770.
12. M. P. Herlihy, V. Luchangco, M. Moir, The repeat offenderproblem: amechanism for supporting dynamic-sized, lockfree data structure, in: Proceedings of 16th International Symposium on Distributed Computing, Springer-Verlag, October 2002, pp. 339-353.
13. W. H. Hesselink, http://www.cs.rug.nl/wim/mechver/lockfree-reduction.
14. W. H. Hesselink, J. F. Groote, Wait-free concurrent memory management by create, and read until deletion, Distributed Computing 14(1) (2001) 31-39. (Pubitemid 32779971)
15. IBM, IBM System/370 Extended Architecture, Principles of Operation, 1983.
16. P. Jayanti, S. Petrovic, Efficient and practical constructions of LL/SC variables, in: PODC'03: Proceedings of the Twenty-Second Annual Symposium on Principles of Distributed Computing, ACM Press, New York, NY, USA, 2003, pp. 285-294.
17. L. Lamport, The temporal logicof actions, ACM Transactionson Programming Languages and Systems 16(3) (1994) 872-923.
18. V. Luchangco, M. Moir, N. Shavit, Nonblocking k-compare-single-swap, in: Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures, ACM Press, New York, 2003, pp. 314-323.
19. Z. Manna, A. Pnueli, The Temporal Logic of Reactive and Concurrent Systems: Specification, Springer Verlag, 1992.
20. H. Massalin, C. Pu, A lock-free multiprocessor OS kernel, Technical Report CUCS-005-91, Columbia University, 1991.
21. M. M. Michael, High performance dynamic lock-free hash tables and list-based sets, in: Proceedings ofthe Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, ACM Press, New York, 2002, pp. 73-82.
22. M. M. Michael, Safe memory reclamation for dynamic lock-free objects using atomic reads and writes, in: Proceedings of the Twenty-First Annual Symposium on Principles of Distributed Computing, ACM Press, New York, 2002, pp. 21-30.
23. M. M. Michael, Practical lock-free and wait-free LL/SC/VL implementations using 64-bit CAS, in: DISC, 2004, pp. 144-158. (Pubitemid 39750511)
24. M. Moir, Practical implementations of non-blocking synchronization primitives, in: Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, ACM Press, New York, 1997, pp. 219-228.
25. O. Shalev, N. Shavit, Split-ordered lists: lock-free extensible hash tables, in: Proceedings of the Twenty-Second Annual Symposium on Principles of Distributed Computing, ACM Press, New York, 2003, pp. 102-111.