spcl / vldb19-distributed-lockingLinks
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
Sorting:
- ☆20Updated 2 years ago
- ☆12Updated 3 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆46Updated 3 years ago
- ☆14Updated 2 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 8 years ago
- ☆53Updated last year
- ☆12Updated 6 years ago
- Grizzly: Efficient Stream Processing Through Adaptive Query Compilation☆16Updated 4 years ago
- Dependably fast multi-core in-memory transactions☆20Updated 7 years ago
- ☆38Updated 4 years ago
- Self-Tuning Adaptive Radix Tree☆27Updated 5 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
- The Cicada engine☆57Updated 7 years ago
- IOManager tries to bridge the gap in existing async framework to build full async networked database/storage/keyvalue storage☆10Updated last week
- Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …☆31Updated 14 years ago
- In-memory, columnar, arrow-based database.☆46Updated 2 years ago
- ☆28Updated 2 years ago
- Benchmarking In-Memory Index Structures☆26Updated 6 years ago
- An open-source BzTree implementation☆92Updated 3 years ago
- The world's first wait-free KV store with generic durable linearizable transactions☆41Updated 3 years ago
- A fork of Couchbase ForestDB project, aiming at making it simple and generic☆18Updated last month
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)☆25Updated 6 years ago
- Concurrent Log-Structured Memory for Many-Core Key-Value Stores☆35Updated 4 years ago
- ☆47Updated last year
- ☆26Updated 3 years ago
- A fast in-memory key-value store☆49Updated 7 years ago
- Source code of our implementation of the concurrent RMA☆12Updated 6 years ago
- A four-dimensional Analysis of Partitioned Approximate Filters☆10Updated 2 years ago
- ☆15Updated 5 years ago