trigonak / ssmpLinks
ssmp is a highly optimized message-passing library built on top of the cache-coherence protocols of shared memory processors.
☆24Updated 10 years ago
Alternatives and similar repositories for ssmp
Users that are interested in ssmp are comparing it to the libraries listed below
Sorting:
- MICA: A Fast In-memory Key-Value Store (see isca2015 branch for the ISCA2015 version)☆208Updated 9 years ago
- SILT: A Memory-Efficient, High-Performance Key-Value Store☆177Updated 3 years ago
- LSM-trie☆114Updated 4 years ago
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆101Updated 6 years ago
- The Cicada engine☆57Updated 8 years ago
- A persistent LSM key-value store. FloDB is designed to scale with the number of threads and memory size.☆26Updated 8 years ago
- MemC3☆152Updated 8 years 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
- Cross-platform atomic operations and lock algorithm library☆98Updated 6 years ago
- QSBR and EBR library☆121Updated 5 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆46Updated 3 years ago
- DB for DAQ systems based on Persistent Memory and NVMe drives☆21Updated 5 years ago
- Read- and latency-optimized log structured merge tree☆174Updated 13 years ago
- W-TinyLFU cache C++11 header only implementation☆62Updated 6 years ago
- This is a mirror of github.com/percona/PerconaFT that is kept here for legacy purposes.☆95Updated 5 years ago
- Implementation of the BwTree as specified by Microsoft Research☆100Updated 9 years ago
- A Distributed Key-Value Store for FAWN☆77Updated 14 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- A fast in-memory key-value store☆49Updated 7 years ago
- Accurate and Fast Evaluation of Multi-Stage Log-Structured Designs☆10Updated 9 years ago
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆48Updated 9 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆175Updated 9 years ago
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆166Updated 3 years ago
- Key-Value/Document store database library with btree and ARTree indexing methods, SSN-MVCC concurrency☆75Updated 4 years ago
- NOPaxos consensus protocol☆135Updated 4 years ago
- lock free modified prefix B+tree append-only database☆117Updated 10 years ago
- A working project for High-concurrency B-tree source code in C☆251Updated 4 years ago
- Code snippets for the workshop on concurrent data structure implementation.☆31Updated 12 years ago
- Tools for safe management of persistent main memory.☆27Updated 11 years ago
- Redis adapted to use Persistent Memory☆57Updated 3 years ago