ELB-Trees, An Efficient and Lock-free B-tree Derivative

TL;DR

This paper introduces ELB-Trees, a lock-free B-tree derivative, and provides formal proofs of their correctness and lock-free properties, enhancing concurrent data structure efficiency.

Contribution

It presents a new lock-free B-tree variant with formal correctness proofs, advancing concurrent data structure design.

Findings

Proves correctness of ELB-Trees operations.

Establishes that ELB-Trees are lock-free.

Demonstrates improved concurrency performance.

Abstract

This technical report is an extension of the paper of the same title, which is to appear at MUCOCOS'13. The technical report proves correctness of the ELB-trees operations' semantics and that the operations are lock-free.