Concurrent tries with efficient non-blocking snapshots

Authors:
Aleksandar Prokopec;Nathan Grasso Bronson;Phil Bagwell;Martin Odersky
Affiliations:
École Polytechnique Fédérale de Lausanne, Lausanne, Switzerland;Stanford, Palo Alto, CA, USA;Typesafe, Lausanne, Switzerland;École Polytechnique Fédérale de Lausanne, Lausanne, Switzerland
Venue:
Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of Parallel Programming
Year:
2012

Citing 18
Cited 4

Concurrency and trie hashing

Acta Informatica
Skip lists: a probabilistic alternative to balanced trees

Communications of the ACM
Concurrent maintenance of skip lists

Concurrent maintenance of skip lists
A methodology for implementing highly concurrent data structures

PPOPP '90 Proceedings of the second ACM SIGPLAN symposium on Principles & practice of parallel programming
Concurrent manipulation of binary search trees

ACM Transactions on Database Systems (TODS)
DCAS-based concurrent deques

Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Trie memory

Communications of the ACM
High performance dynamic lock-free hash tables and list-based sets

Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Introduction to Algorithms

Introduction to Algorithms
Purely Functional Data Structures

Purely Functional Data Structures
Trie hashing

SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
A Practical Multi-word Compare-and-Swap Operation

DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Split-ordered lists: Lock-free extensible hash tables

Journal of the ACM (JACM)
Statistically rigorous java performance evaluation

Proceedings of the 22nd annual ACM SIGPLAN conference on Object-oriented programming systems and applications
File searching using variable length keys

IRE-AIEE-ACM '59 (Western) Papers presented at the the March 3-5, 1959, western joint computer conference
A practical concurrent binary search tree

Proceedings of the 15th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
Non-blocking binary search trees

Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
A generic parallel collection framework

Euro-Par'11 Proceedings of the 17th international conference on Parallel processing - Volume Part II

Leaplist: lessons learned in designing tm-supported range queries

Proceedings of the 2013 ACM symposium on Principles of distributed computing
The SkipTrie: low-depth concurrent search without rebalancing

Proceedings of the 2013 ACM symposium on Principles of distributed computing
Network-aware data caching and prefetching for cloud-hosted metadata retrieval

NDM '13 Proceedings of the Third International Workshop on Network-Aware Data Management
Fast concurrent lock-free binary search trees

Proceedings of the 19th ACM SIGPLAN symposium on Principles and practice of parallel programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe a non-blocking concurrent hash trie based on shared-memory single-word compare-and-swap instructions. The hash trie supports standard mutable lock-free operations such as insertion, removal, lookup and their conditional variants. To ensure space-efficiency, removal operations compress the trie when necessary. We show how to implement an efficient lock-free snapshot operation for concurrent hash tries. The snapshot operation uses a single-word compare-and-swap and avoids copying the data structure eagerly. Snapshots are used to implement consistent iterators and a linearizable size retrieval. We compare concurrent hash trie performance with other concurrent data structures and evaluate the performance of the snapshot operation.