Comprehensive Analysis of Lock Free Binary Search Algorithms Report

This report analyzes lock-free binary search algorithms, focusing on their structure and concurrency aspects. The study investigates the benefits of binary search trees (BSTs) in a lock-free context, comparing their performance to existing external BSTs. An online survey was conducted to assess the linearizability of node pointers and deadlock prevention. The report details the algorithm's configuration, operations, and a C++ implementation, along with an evaluation of concurrency management. The findings highlight the algorithm's efficiency and scalability compared to concurrent skip lists, demonstrating higher throughput and smaller memory footprints. The report concludes with a discussion of future research directions and the advantages of a lock-free structure, recommending the adaptation of proposed methodologies to prevent limitations in data access.