Life & fun · alternatives · 2026
24 alternatives to A Lock- and wait-free hashtable (and an array too), written in C
📶 A lock- and wait-free hashtable (and an array too) - mulle-concurrent/mulle-concurrent
A Lock- and Wait-Free Hashtable is a C library providing concurrent data structures designed for multi-threaded applications. It offers both a hashtable and an array implementation that operate without locks or wait… Below are 24 products that do a similar job, ranked by how close each is in meaning and then by launch-day votes. A Lock- and wait-free hashtable (and an array too), written in C launched in 2016; newer entries below may have overtaken it.
- 1
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…
2023 · github.com · its alternatives →
- 2
A concurrent thread-safe hash map implemented in C++ - kshk123/hashMap
2017 · github.com · its alternatives →
- 3AS
- 4
A small, portable, linear probing hash map. Contribute to e-dant/salmagundi development by creating an account on GitHub.
2024 · github.com · its alternatives →
- 5
A simple GPU hash table implemented in CUDA using lock free techniques - nosferalatu/SimpleGPUHashTable
2020 · github.com · its alternatives →
- 6
Contribute to igushev/IgushArray development by creating an account on GitHub.
2019 · github.com · its alternatives →
- 7
This project presents a new data structure for storing ordered integer maps. The proposed data structure is a compressive, cache-friendly, radix tree that has performance comparable to an unordered map (`std::unordered_map`) and is an order of magnitude faster than an ordered map (`std::map`).
2024 · github.com · its alternatives →
- 8
A pure C (-std=c89) implementation of Go channels, including blocking and non-blocking selects. - GitHub - rochus-keller/CspChan: A pure C (-std=c89) implementation of Go channels, including blocking and non-blocking selects.
2023 · github.com · its alternatives →
- 9
Simple hash table implementation for C. Contribute to watmough/jwHash development by creating an account on GitHub.
2015 · github.com · its alternatives →
- 10
Multithreaded, non-blocking Linux server framework in Rust - nathansizemore/hydrogen
2016 · github.com · its alternatives →
- 11
A single publisher, multi subscriber lockless ring buffer build with the new generics in Go 1.18beta.
2022 · github.com · its alternatives →
- 12
Pure C implementation of Go channels. Contribute to tylertreat/chan development by creating an account on GitHub.
2014 · github.com · its alternatives →
- 13
:copyright: Concurrent Programming Library (Coroutine) for C11 - sharow/libconcurrent
2016 · github.com · its alternatives →
- 14
A fun toy memory allocator (not thread safe, that's a future TODO). I also wanted to explain how I approached it, so I also wrote a tutorial blog post (~20 minute read) covering the code which you can find the link to in the README.
Nov 2025 · github.com · its alternatives →
- 15AP
2016 · chara.cs.illinois.edu · its alternatives →
- 16
Concurrency library for C (coroutines). Contribute to tidwall/neco development by creating an account on GitHub.
2024 · github.com · its alternatives →
- 17
2015 · github.com · its alternatives →
- 18
- 19
Hey HN, this is Will and David from Fortress (https://news.ycombinator.com/item?id=41426998). We use a lot of async Rust internally, and created this library out of a need for an async-aware concurrent hashmap since there weren’t many available in the Rust ecosystem. Whirlwind is a sharded HashMap with a fully asynchronous API. Just as dashmap is a replacement for std::sync::RwLock, whirlwind aims to be a replacement for tokio::sync::RwLock. It has a similar design and performance characteristics to dashmap, but seems to perform better in read-heavy workloads with tokio's…
2024 · github.com · its alternatives →
- 20AS
2016 · blog.minio.io · its alternatives →
- 21UC
2016 · samanbarghi.com · its alternatives →
- 22
Non-preemptive Thread Hierarchy Manager. Contribute to gueststar/nthm development by creating an account on GitHub.
2020 · github.com · its alternatives →
- 23
ZeroDB▲119An open-source, end-to-end encrypted database protocol
2015 · zerodb.io · its alternatives →
- 24
🔄 Flexible C memory allocation scheme. Contribute to mulle-c/mulle-allocator development by creating an account on GitHub.
2016 · github.com · its alternatives →
Also compare
- A hash array-mapped trie implementation in C alternatives
- A concurrent thread-safe hash map implemented in C++ alternatives
- A Simple GPU Hash Table alternatives
- A portable hash map in C alternatives
- A simple GPU hash table that can process 300M+ operations/second alternatives
- Array with Constant Time Access and Fast Insertion and Deletion alternatives
Ranked by how close each launch is in meaning, then by votes. Prices were read from each product’s own site when checked and can change. Refine with your own description →