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 ...

Feb 25, 2012 · We compare concurrent hash trie performance with other concurrent data structures and evaluate the performance of the snapshot operation.

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 ...

Oct 22, 2024 · This report describes an implementation of a non-blocking concurrent shared-memory hash trie based on single-word compare-and-swap instructions.

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 ...

Concurrent Tries with Efficient Non-blocking Snapshots. Aleksandar Prokopec. Phil Bagwell. Martin Odersky. École Polytechnique Fédérale de Lausanne. Nathan ...

The SONAR project aims to create a scholarly archive that collects, promotes and preserves the publications of authors affiliated with Swiss public research ...

Apr 15, 2019 · Another paper along these lines that I often refer too these days is: Concurrent Tries with Efficient Non-Blocking Snapshots ...

... concurrent, lock-free hash trie. This data structure was originally presented in the paper Concurrent Tries with Efficient Non-Blocking Snapshots: https ...

The two-lock concurrent queue outperforms a single lock when several processes are competing simultaneously for access; it ap- pears to be the algorithm of ...