klsmpq / klsmLinks
The k-LSM: A relaxed, lock-free, linearizable priority queue
☆23Updated 8 years ago
Alternatives and similar repositories for klsm
Users that are interested in klsm are comparing it to the libraries listed below
Sorting:
- Compact tries for fixed-width keys☆26Updated 7 years ago
- Restartable Sequences: a userspace implementation of cheap per-cpu atomic operations☆38Updated 7 years ago
- NetBSD cdb (constant database) library☆14Updated 6 years ago
- LLVM IR generation "middle end" for LLVM-based go compiler.☆18Updated 3 years ago
- Static Radix Tree (Patricia trie) implementation in C☆48Updated 8 years ago
- Go implementation of compress, hash, and displace (CHD) algorithm☆14Updated 6 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆58Updated 3 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- A threaded, continuations-based I/O event library for manycore NUMA machines☆76Updated 4 years ago
- Simple out-of-process invoker☆19Updated 7 months ago
- A C++14 framework for asynchronous I/O, cooperative multitasking and green threads scheduling☆160Updated 8 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
- Stasis is a flexible transactional storage library that is geared toward high-performance applications and system developers. It supports…☆53Updated 12 years ago
- ☆11Updated 7 years ago
- Tiny Cooperative Process Management Library/Embedded Bounded Queue Actor Model (C11)☆40Updated 7 years ago
- ☆27Updated 8 years ago
- Interactive object file browser with symbol, source, assembly, and analysis☆22Updated last year
- Software transactional memory system developed at Wyatt Technology☆30Updated 6 years ago
- Code samples for using libjit☆91Updated 9 years ago
- A universal thread-safe memory pool.☆26Updated 7 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Updated 2 years ago
- Lock-free allocator as described by Maged M. Michael, 2004☆48Updated 12 years ago
- A lightweight concurrency library for C, featuring symmetric coroutines as the main control flow abstraction.☆12Updated 10 years ago
- My personal C++ framework :^)☆44Updated last month
- Crit-bit tree (trie) library☆32Updated 11 years ago
- Fast differential coding functions (using SIMD instructions)☆55Updated 8 years ago
- An implementation of the Judy array, wrapped in a c++ template. Uses Karl Malbrain's implementation, http://code.google.com/p/judyarray/ …☆45Updated 10 years ago
- simple consistent hashing implementation☆56Updated 7 years ago
- Implementation of Alexander A. Stepanov inverted Index Compression algorithms☆21Updated 10 years ago
- fast SIMD-able JIT regular expression compiler☆197Updated 10 years ago