Constant-Time Lazy Snapshots Supporting General Queries on Concurrent Data Structures

07/05/2020

∙

by   Naama Ben-David, et al.

∙

0

∙

share

We present a general transformation that takes any concurrent data structure written using CAS and adds wait-free linearizable query operations to it. These query operations may access arbitrary parts of the data structure, and do not interfere with the progress or running time of other operations. For example, our transformation can be used to add efficient and linearizable range queries, predecessor queries, and top-k queries to existing concurrent set data structures. We achieve this by presenting an efficient technique for taking lazy snapshots of CAS-based data structures.