rlu-sync / rlu-rhtLinks
RLU resizable hash-table
☆17Updated 9 years ago
Alternatives and similar repositories for rlu-rht
Users that are interested in rlu-rht are comparing it to the libraries listed below
Sorting:
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆48Updated 9 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- Lock-free multithreaded memory allocation☆106Updated 8 years ago
- Restartable Sequences: a userspace implementation of cheap per-cpu atomic operations☆37Updated 6 years ago
- I-cache line packing and branch misprediction measuring tool☆18Updated 8 years ago
- A small DFA for under 16 states☆51Updated 7 years ago
- A distributed key-value cache with builtin materialized views.☆26Updated 10 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆49Updated 4 years ago
- Lightweight performance and debugging tools☆17Updated 5 years ago
- The space of memory management research and systems produced by the PLASMA lab (https://plasma-umass.org).☆20Updated 4 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- unrolled skip list library for C☆21Updated 6 years ago
- Implementation of the algorithms from "Scalable Lock-Free Dynamic Memory Allocation"☆16Updated 10 years ago
- Quick sort code using AVX2 instructions☆69Updated 8 years ago
- A threaded, continuations-based I/O event library for manycore NUMA machines☆73Updated 4 years ago
- A feature-incomplete peekahole (pahole) clone that doesn't rely on libdwarves (and doesn't choke on Clang output)☆22Updated 7 years ago
- finding set bits in large bitmaps☆15Updated 9 years ago
- A splaytree ADT written in C with a BSD license☆18Updated 5 years ago
- LLVM-jitted bitmaps☆27Updated 5 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 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
- Compact tries for fixed-width keys☆26Updated 7 years ago
- reverse engineering branch predictors☆17Updated 9 years ago
- Feed-forward Bloom filters☆52Updated 14 years ago
- Crit-bit tree (trie) library☆32Updated 11 years ago
- NetBSD cdb (constant database) library☆14Updated 6 years ago
- Hyaline Reclamation (PLDI '21, PODC '19)☆22Updated 4 years ago
- A software-based Ethernet switch design built around a memory-efficient, high-performance, and highly-concurrent hash table for compact a…☆36Updated 9 years ago
- ☆11Updated 5 years ago
- A Distributed Key-Value Store for FAWN☆77Updated 14 years ago