A benchmark to compare synchronization techniques for multicore programming
☆349Jul 3, 2025Updated last year
Alternatives and similar repositories for synchrobench
Users that are interested in synchrobench are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…☆185Jan 19, 2018Updated 8 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆37Jun 8, 2016Updated 10 years ago
- Framework for creating simple, efficient, and composable lock-free data structures☆12May 7, 2016Updated 10 years ago
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆170Oct 4, 2021Updated 5 years ago
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆49Aug 31, 2015Updated 11 years ago
- End-to-end encrypted cloud storage - Proton Drive • AdSpecial offer: 40% Off Yearly / 80% Off First Month. Protect your most important files, photos, and documents from prying eyes.
- Code for "Yoav Zuriel, Michal Friedman, Gali Sheffi, Nachshon Cohen, and Erez Petrank. Efficient Lock-Free Durable Sets, OOPSLA 2019" (ht…☆19Jan 30, 2020Updated 6 years ago
- Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …☆31Sep 24, 2010Updated 16 years ago
- The rep contains my experiments with state of the art NVM programming abstractions during my internship at Regal Lab of Inria Paris under…☆11Oct 24, 2025Updated last year
- Nonblocking data structures☆12Jan 25, 2015Updated 11 years ago
- ☆30Sep 14, 2022Updated 4 years ago
- Fast wait-free algorithms designed for shared memory systems☆45May 4, 2018Updated 8 years ago
- Dynamic analysis of multithreaded C programs☆13Feb 7, 2020Updated 6 years ago
- Cross-platform atomic operations and lock algorithm library☆100Aug 29, 2018Updated 8 years ago
- C++ QD locking library☆11Nov 27, 2025Updated 11 months ago
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- pmwcas☆139Apr 7, 2023Updated 3 years ago
- ☆15Sep 9, 2020Updated 6 years ago
- An open-source framework for concurrent data-structures and benchmarks. 🛠️ Latest Dev Branch: v3.4.0-dev 🚀 https://github.com/nkallima/…☆72Apr 12, 2025Updated last year
- RLU resizable hash-table☆17Aug 24, 2015Updated 11 years ago
- Artifact for PPoPP 2018 paper "Making Pull-Based Graph Processing Performant"☆23Apr 23, 2020Updated 6 years ago
- High-performance multicore-scalable data structures and benchmarks☆143Jul 8, 2019Updated 7 years ago
- Red Black Tree implemented with Relativistic Programming☆14Nov 28, 2012Updated 13 years ago
- A reusable, extensible, and efficient C++ implementation of the Foster B-tree data structure☆15Jun 26, 2019Updated 7 years ago
- QSBR and EBR library☆144Dec 15, 2019Updated 6 years ago
- GPU virtual machines on DigitalOcean Gradient AI • AdGet to production fast with high-performance AMD and NVIDIA GPUs you can spin up in seconds. The definition of operational simplicity.
- ☆454Oct 25, 2025Updated last year
- C++ implementation of concurrent Binary Search Trees☆73Aug 17, 2015Updated 11 years ago
- LiTL: Library for Transparent Lock Interposition☆86Jun 29, 2023Updated 3 years ago
- Lock-free Transactions without Rollbacks for Linked Data Structures☆23Sep 1, 2022Updated 4 years ago
- ☆129May 25, 2026Updated 5 months ago
- RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)☆195Oct 15, 2024Updated 2 years ago
- ☆153Mar 11, 2023Updated 3 years ago
- Beta release of Masstree.☆458Oct 15, 2023Updated 3 years ago
- Persistent Memory Storage Engine☆24Nov 4, 2024Updated last year
- Simple, predictable pricing with DigitalOcean hosting • AdAlways know what you'll pay with monthly caps and flat pricing. Enterprise-grade infrastructure trusted by 600k+ customers.
- An implementation of Horton hash tables☆10Aug 24, 2016Updated 10 years ago
- Montage is a system for building fast buffered persistent data structures on nonvolatile memory.☆16Jun 9, 2022Updated 4 years ago
- Benchmarking framework for index structures on persistent memory☆93Aug 10, 2026Updated 2 months ago
- MICA: A Fast In-memory Key-Value Store (see isca2015 branch for the ISCA2015 version)☆215Jan 18, 2016Updated 10 years ago
- Concurrency primitives, safe memory reclamation mechanisms and non-blocking (including lock-free) data structures designed to aid in the …☆2,710Oct 20, 2026Updated last week
- A C++ library of Concurrent Data Structures☆2,746Oct 17, 2023Updated 3 years ago
- Atlas: Programming for Persistent Memory☆78Nov 22, 2020Updated 5 years ago