Keno / correctunwindLinks
One part of my "this-is-why-we-cant-have-nice-thing" series
☆12Updated 9 years ago
Alternatives and similar repositories for correctunwind
Users that are interested in correctunwind are comparing it to the libraries listed below
Sorting:
- Restartable Sequences: a userspace implementation of cheap per-cpu atomic operations☆38Updated 7 years ago
- Paxos-replicated key-value store in 3 hours or less.☆25Updated 8 years ago
- RWMutex for sharing of multicore machines.☆18Updated 6 years ago
- bit & sketches data structures☆60Updated 7 years ago
- Feed-forward Bloom filters☆53Updated 14 years ago
- A distributed key-value cache with builtin materialized views.☆25Updated 11 years ago
- A demo of concurrency primitives in x64 assembly☆18Updated 4 years ago
- Parses and executes Runway models of distributed systems☆50Updated 3 years ago
- Lock-free multithreaded memory allocation☆110Updated 9 years ago
- A small DFA for under 16 states☆53Updated 7 years ago
- Fast linearizability checker☆67Updated 10 years ago
- Control and diagnostic applications for rump kernels☆35Updated 8 years ago
- A system for maintaining replicated state machines☆116Updated 8 years ago
- Iterator library.☆80Updated 6 years ago
- finding set bits in large bitmaps☆15Updated 10 years ago
- Stasis is a flexible transactional storage library that is geared toward high-performance applications and system developers. It supports…☆53Updated 12 years ago
- Compact tries for fixed-width keys☆26Updated 7 years ago
- Backtrace.io's resilient log record framing format☆40Updated 3 years ago
- fast SIMD-able JIT regular expression compiler☆197Updated 10 years ago
- ☆27Updated 8 years ago
- Create DTrace probes at runtime☆105Updated 5 years ago
- TLA+ specification of Flexible Paxos☆41Updated 2 years ago
- The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.☆44Updated 9 years ago
- Roaring bitmaps in C☆17Updated 9 years ago
- Tiny Transactions on Computer Systems (TinyToCS) Site☆32Updated 9 years ago
- Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…☆50Updated last year
- Mount Everest Application Framework☆120Updated 2 months ago
- Implementation of the JSON semi-index described in the paper "Semi-Indexing Semi-Structured Data in Tiny Space"☆58Updated 13 years ago
- Compute xxHash hash codes for 8 keys in parallel☆47Updated 6 years ago
- Distributed Systems Reading Group☆20Updated 8 years ago