Lock-free dynamic hash tables with open addressing

Distributed Computing

Volumn 18, Issue 1, 2005, Pages 21-42

  Gao, H ^a   Groote, J F ^b,c   Hesselink, W H ^a  

^a UNIVERSITY OF GRONINGEN   (Netherlands)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^c CWI   (Netherlands)

Author keywords

Distributed algorithms; Hash tables; Lock free; Wait free

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; MULTIPROCESSING SYSTEMS; RELIABILITY; THEOREM PROVING;

DISTRIBUTED ALGORITHMS; HASH TABLES; LOCK FREE; WAIT FREE;

DECISION TABLES;

EID: 27844608462     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00446-004-0115-2     Document Type: Article

References (30)

1. Anderson JH, Ramamurthy S, Jeffay K: Real-time computing with lock-free shared objects. ACM Trans Comput Syst 15(2): 134-165 (1997)
2. Attiya H, Bar-Noy A, Dolev D, Peleg D, Reischuk R: Renaming in an asynchronous environment. J ACM 37:524-548 (1990)
3. Bar-Noy A, Dolev D: Shared-memory vs. message-passing in an asynchronous distributed environment. In: Proc. 8th ACM Symp. on principles of distributed computing, 1989, pp 307-318
4. Barnes G: A method for implementing lock-free shared-data structures. In: Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures. ACM Press, 1993, pp 261-270
5. Cassez F, Jard C, Rozoy B, Dermot M: Modeling and verification of parallel processes (2000) 4th Summer School, MOVEP 2000, Nantes, France
6. Gao H, Groote JF, Hesselink WH: PVS verification. http://www.es.rug.nl/ ~wim/mechverhashtable (2003)
7. Groote JF. Hesselink WH, Mauw S, Vermeulen R: An algorithm for the asynchronous write-all problem based on process collision. Distr Comput 14:75-81 (2001)
8. Harbison SP: Modula-3. Prentice Hall, New Yersey 1992
9. Herlihy M: Wait-free synchronization. ACM Trans Program Lang Syst 13:124-149 (1991)
10. Herlihy M: A methodology for implementing highly concurrent data objects. ACM Trans Program Lang Syst 15:745-770 (1993)
11. Herlihy M, Wing J: Linearizability: a correctness condition for concurrent objects. ACM Trans Program Lang Syst 12:463-492 (1990)
12. Herlihy MP, Moss JEB: Lock-free garbage collection for multiprocessors. IEEE Transactions on Parallel and Distributed Systems 3:304-311 (1992)
13. Hesselink WH: Wait-free linearization with a mechanical proof. Distr Comput 9:21-36 (1995)
14. Hesselink WH: Bounded delay for a free address. Acta Inf 33:233-254 (1996)
15. Hesselink WH, Groote JF: Wait-free concurrent memory management by Create, and Read until Deletion (CaRuD). Distr Comput 14:31-39 (2001)
16. Kanellakis PC, Shvartsman AA: Fault-tolerant parallel computation. Kluwer Academic Publishers, Dordrecht 1997
17. Knuth DE: The Art of Computer Programming. Part 3, Sorting and searching. Addison-Wesley 1973
18. LaMarca A: A performance evaluation of lock-free synchronization protocols. In: Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing. ACM Press 1994, pp 130-140
19. Lamport L: The temporal logic of actions. ACM Trans Program Lang Syst 16:872-923 (1994)
20. Lynch NA: Distributed Algorithms. Morgan Kaufman, San Francisco 1996
21. Manna Z, Pnueli A: The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer, New York 1992
22. Michael MM: High performance dynamic lock-free hash tables and list-based sets. In: Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures. ACM Press 2002, pp 73-82
23. Owre S, Shankar N, Rushby JM, Stringer-Calvert DWJ: PVS Version 2.4, System Guide, Prover Guide, PVS Language Reference (2001) http://pvs.csl.sri.com
24. Rajwar R, Goodman JR: Transactional lock-free execution of lock-based programs. In: Tenth international conference on architectural support for programming languages and operating systems on Proceedings of the 10th international conference on architectural support for programming languages and operating systems (ASPLOS-X). ACM Press 2002, pp 5-17
25. Shalev O, Shavit N: Split-ordered lists: lock-free extensible hash tables. In: Proceedings of the twenty-second annual symposium on Principles of distributed computing. ACM Press 2003, pp 102-111
26. Sundell H, Tsigas P: Scalable and lock-free concurrent dictionaries. In: Proceedings of the 2004 ACM symposium on Applied computing. ACM Press 2004, pp 1438-1445
27. Valois JD: Implementing lock-free queues. In: Proceedings of the seventh international conference on Parallel and Distributed Computing Systems, 1994, pp 64-69
28. Valois JD: Lock-free linked lists using compare-and-swap. In: Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing. ACM Press 1995, pp 214-222.
29. See also Valois JD: ERRATA. Lock-free linked lists using compare-and-swap. Unpublished manuscript (1995)
30. Wirth N: Algorithms + Data Structures = Programs. Prentice Hall 1976