To maximize the performance of concurrent data structures, researchers have often turned to highly complex fine-grained techniques, resulting in efficient and elegant algorithms, which can however be often difficult to understand and prove correct. While simpler techniques exist, such as transactional memory, they can have limited performance or po...

PathCAS: An Efficient Middle Ground for Concurrent Search Data Structures

10.48550/arxiv.2212.09851