Lock-free dynamic hash tables with open addressing

DOI10.1007/S00446-004-0115-2zbMath1264.68217arXivcs/0303011OpenAlexW2099899133MaRDI QIDQ1953636

Jan Friso Groote, Hui Gao, Wim H. Hesselink

Publication date: 7 June 2013

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0303011

zbMATH Keywords

distributed algorithmshash tableswait-freelock-free

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Distributed algorithms (68W15)

Related Items (3)

Verifying a simplification of mutual exclusion by Lycklama-Hadzilacos ⋮ A general lock-free algorithm using compare-and-swap ⋮ Parallel implementations of Brunotte's algorithm

Uses Software

• PVS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bounded delay for a free address
• Renaming in an asynchronous environment
• Randomized wait-free concurrent objects (extended abstract)
• A performance evaluation of lock-free synchronization protocols
• Lock-free linked lists using compare-and-swap
• Split-ordered lists
• Modeling and verification of parallel processes. 4th Summer school, MOVEP 2000, Nantes, France, June 19--23, 2000. Revised tutorial lectures

This page was built for publication: Lock-free dynamic hash tables with open addressing