LPD-EPFL / MVTILLinks
Distributed transactions
☆13Updated 5 years ago
Alternatives and similar repositories for MVTIL
Users that are interested in MVTIL are comparing it to the libraries listed below
Sorting:
- Persistent Memory Graph Database☆43Updated 2 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- mini is mini☆20Updated 5 years ago
- Serverless ML Framework☆22Updated 3 years ago
- A Distributed Multi-GPU System for Fast Graph Processing☆65Updated 6 years ago
- Artifact for PPoPP 2018 paper "Making Pull-Based Graph Processing Performant"☆23Updated 5 years ago
- Mu: Microsecond Consensus for Microsecond Applications☆40Updated 4 years ago
- An open-source framework for concurrent data-structures and benchmarks. 🛠️ Latest Dev Branch: v3.4.0-dev 🚀 https://github.com/nkallima/…☆68Updated 3 months ago
- A DSL for efficient Graph Analysis☆102Updated 6 years ago
- Simplified Interface to Complex Memory☆28Updated last year
- A CUDA-based multi-GPU vertex-centric graph processing framework based on Warp Segmentation and Vertex Refinement techniques.☆11Updated 8 years ago
- Benchmarking In-Memory Index Structures☆26Updated 6 years ago
- Parallel Balanced Binary Tree Structures☆117Updated 4 months ago
- Bridging Immutable and Mutable Abstractions for Distributed Data Analytics☆12Updated 6 years ago
- ☆28Updated 4 years ago
- Code snippets for the workshop on concurrent data structure implementation.☆31Updated 12 years ago
- Diamond reactive programming platform☆25Updated 3 years ago
- Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees☆88Updated 6 years ago
- ☆32Updated 7 years ago
- A C/C++ task-based programming model for shared memory and distributed parallel computing.☆71Updated 4 years ago
- Persistent Memory Storage Engine☆24Updated 8 months ago
- A Lightweight Graph Processing Framework for Multi-GPUs☆14Updated 10 years ago
- ArgoDSM - A Page-Based Software Distributed Shared Memory System☆44Updated 3 weeks ago
- A local cache for the Anna KVS☆25Updated 5 years ago
- Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …☆30Updated 14 years ago
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆48Updated 9 years ago
- Implementation of the unary leapfrog join for efficient intersection of sorted sets.☆10Updated 5 years ago
- Nonblocking data structures☆12Updated 10 years ago
- ☆82Updated 7 years ago
- Persistent Memory Programming book examples☆40Updated 8 months ago