spcl / vldb19-distributed-locking
This repository hosts the code used for the following paper: Claude Barthels, Ingo Müller, Konstantin Taranov, Torsten Hoefler, Gustavo Alonso. "Strong consistency is not hard to get: Two-Phase Locking and Two-Phase Commit on Thousands of Cores." In: PVLDB, 2020.
☆10Updated 5 years ago
Alternatives and similar repositories for vldb19-distributed-locking:
Users that are interested in vldb19-distributed-locking are comparing it to the libraries listed below
- ☆14Updated 2 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆45Updated 2 years ago
- ☆20Updated 2 years ago
- Grizzly: Efficient Stream Processing Through Adaptive Query Compilation☆16Updated 4 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 8 years ago
- A fork of Couchbase ForestDB project, aiming at making it simple and generic☆17Updated last week
- Code of the paper "Building an Efficient Key-Value Store in a Flexible Address Space", EuroSys '22☆21Updated 2 weeks ago
- ☆53Updated 10 months ago
- ☆12Updated 6 years ago
- ☆27Updated 3 years ago
- ☆14Updated 5 years ago
- ☆12Updated 3 years ago
- Source code of our implementation of the concurrent RMA☆13Updated 5 years ago
- Rust bindings for the NVM Library http://pmem.io☆15Updated 8 years ago
- Persistent Memory Storage Engine☆24Updated 4 months ago
- Rust bindings for SPDK☆19Updated 7 years ago
- The world's first wait-free KV store with generic durable linearizable transactions☆40Updated 3 years ago
- ☆28Updated 2 years ago
- An open-source BzTree implementation☆91Updated 3 years ago
- Dependably fast multi-core in-memory transactions☆19Updated 7 years ago
- A fast in-memory key-value store☆49Updated 7 years ago
- Code snippets for the workshop on concurrent data structure implementation.☆31Updated 12 years ago
- The Cicada engine☆55Updated 7 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
- ☆14Updated 3 years ago
- A low-latency, extensible, multi-tenant key-value store.☆55Updated 4 years ago
- "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)☆25Updated 6 years ago
- PAIO: General, Portable I/O Optimizations With Minor Application Modifications (FAST'22)☆23Updated last year
- Adaptive Radix Tree in C++☆41Updated this week
- Benchmarking In-Memory Index Structures☆26Updated 6 years ago