This thesis aims to comprehensively examine and compare two implementations of Concurrent Robin Hood Hashing: Bolt [8] and K-CAS Robin Hood [11]. The primary objective is to gain a deep understanding of their performance characteristics, identify key differences, and explore the optimizations applied in these advanced techniques.

By conducting this examination, we aim to provide concrete insights into the strengths, weaknesses, and unique features of each implementation. This analysis will contribute to advancing the understanding of Concurrent Robin Hood Hashing and inform the design of high-performance concurrent data structures.