jkopinsky / SprayListLinks
The SprayList data structure
☆33Updated 8 years ago
Alternatives and similar repositories for SprayList
Users that are interested in SprayList are comparing it to the libraries listed below
Sorting:
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆49Updated 10 years ago
- High-performance multicore-scalable data structures and benchmarks☆142Updated 6 years ago
- A benchmark to compare synchronization techniques for multicore programming☆345Updated 2 months ago
- ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…☆180Updated 7 years ago
- Eris distributed transactions☆52Updated 7 years ago
- SILT: A Memory-Efficient, High-Performance Key-Value Store☆177Updated 3 years ago
- Yesquel: scalable SQL storage for Web apps☆42Updated 8 years ago
- MICA: A Fast In-memory Key-Value Store (see isca2015 branch for the ISCA2015 version)☆207Updated 9 years ago
- FOEDUS main source code repository☆63Updated 8 years ago
- A Profiler for Identifying the Major Sources of Performance Variance in Modern Applications☆95Updated 7 years ago
- Fast linearizability checker☆67Updated 10 years ago
- Read- and latency-optimized log structured merge tree☆174Updated 13 years ago
- LSM-trie☆114Updated 4 years ago
- HYRISE In-Memory Hybrid Storage Engine (archived, now developed in hyrise/hyrise repo)☆89Updated 7 years ago
- Prototype of FPaxos, built upon LibPaxos3☆48Updated 5 years ago
- Code snippets for the workshop on concurrent data structure implementation.☆31Updated 12 years ago
- The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.☆42Updated 8 years ago
- This is the public release of the ffwd delegation system, and associated benchmarks from the SOSP'17 paper.☆79Updated 7 years ago
- Experiments in partially ordered SMR.☆48Updated 4 years ago
- Experiments with array layouts for comparison-based searching☆84Updated last year
- Compilation of concurrent data structures with at least lock-free or wait-free properties.☆76Updated 6 years ago
- Accurate and Fast Evaluation of Multi-Stage Log-Structured Designs☆10Updated 9 years ago
- Persistent Adaptive Radix Trees in Java☆82Updated 4 years ago
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆101Updated 6 years ago
- ☆28Updated 8 years ago
- Feed-forward Bloom filters☆52Updated 14 years ago
- A distributed key-value store based on replicated LSM-Trees☆10Updated 8 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
- Lock-free multithreaded memory allocation☆108Updated 8 years ago
- A DSL for efficient Graph Analysis☆102Updated 7 years ago