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 →
  • 5N
    59a34eabe31910abfb06f308 – NeuralHash Collision Demo2021 · thishashcollisionisnotporn.com · ▲339
  • Neural-hash-collider – Find target hash collisions for NeuralHash2021 · github.com · ▲623

    Preimage attack against NeuralHash 💣. Contribute to anishathalye/neural-hash-collider development by creating an account on GitHub.

  • A hash array-mapped trie implementation in C2023 · github.com · ▲171

    Long-simmering side project that is finally ready to see the light. HAMTs are a cool persistent data structure and implementing one has been a lot of fun. Beyond the code, there is likely some value in the extensive and largely complete implementation docs; basic benchmarks are linked in the README, too. Kind of aiming to be "the libavl for HAMTs". That is obviously a high and aspirational bar but a distinct possibility if it stirs up a little interest and/or contribution. Anyways, it's time for this to go out, collect feedback and maybe even some use outside of toy projects. Let me…

  • We made our own inference engine for Apple Silicon2025 · github.com · ▲186

    We wrote our inference engine on Rust, it is faster than llama cpp in all of the use cases. Your feedback is very welcomed. Written from scratch with idea that you can add support of any kernel and platform.

  • Hashnode2015 · hashnode.com · ▲250

    A friendly and inclusive Q&A network for coders

  • An open-source financial ledger API written in Clojure2020 · github.com · ▲125

    Immutable, scalable, and easy to use ledger service. - hoophq/sequence

More life & fun this month

the category →

Source: Show HN post ↗

Launched alongside, March 2013

the whole month →