nowfound

Life & fun · March 11, 2013

CC

Concurrent cuckoo hashing – fast, compact, multi-reader

A blog about computer science, systems, technology, and sometimes vegan cooking.

Concurrent cuckoo hashing – fast, compact, multi-reader launched on March 11, 2013 with 17 votes, #112 of 671 launches that month and more than 75% of that year's launches. The site was still online in September 2026, 13 years on.

Visit da-data.blogspot.com ↗Alternativestop 17% of March 2013

In plain words

David Andersen's blog covers computer science, systems, and technology topics with occasional posts about vegan cooking. The site features technical discussions on subjects like concurrent data structures, including detailed explorations of implementation details and synchronization challenges. It serves readers interested in systems programming and related computer science concepts.

written from the facts on this page · September 2026

From the sources

David Andersen's blog about computer science, systems, technology, and sometimes vegan cooking. When moving the "hole" don't you still need a barrier of some sort to ensure other threads see the writes in the way you expect? Yeskinda. The optimistic part has a barrier around the reads of the version counters. So as long as you do read_version, read_bucket, read_and_check_version before using the value you found in read_bucket, you're ok. The slightly longer answer is that if the read_bucket contains a pointer, you have no guarantees from the hash table itself that the pointer still points to something valid afterwords. In MemC3, we guarantee this by virtue of Memcached's slab allocator (the…from da-data.blogspot.com

Does a similar job

all alternatives →

More life & fun this month

the category →

Source: Show HN post ↗

Launched alongside, March 2013

the whole month →