24 citations · 66 across the 17 of their papers we have counts for
Showing cs.DCShow all
2 papers · 1 filter
cs.DC2019★ 1 cited
Lock-Free Hopscotch Hashing
Robert Kelly, Barak A. Pearlmutter, Phil Maguire
In this paper we present a lock-free version of Hopscotch Hashing. Hopscotch Hashing is an open addressing algorithm originally proposed by Herlihy, Shavit, and Tzafrir, which is k…
cs.DC2018
Concurrent Robin Hood Hashing
Robert Kelly, Barak A. Pearlmutter, Phil Maguire
In this paper we examine the issues involved in adding concurrency to the Robin Hood hash table algorithm. We present a non-blocking obstruction-free K-CAS Robin Hood algorithm whi…