Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. Flat Combining is a new, efficient synchronization paradigm based on coarse locking.
☆31Sep 24, 2010Updated 15 years ago
Alternatives and similar repositories for Flat-Combining
Users that are interested in Flat-Combining are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Framework for creating simple, efficient, and composable lock-free data structures☆12May 7, 2016Updated 10 years ago
- A reusable, extensible, and efficient C++ implementation of the Foster B-tree data structure☆15Jun 26, 2019Updated 6 years ago
- A set of experimental extensions to the go standard library☆31May 21, 2026Updated 3 weeks ago
- Extra RNGs☆50May 20, 2026Updated 3 weeks ago
- Source code for a presentation on refactoring C++ while accounting for preprocessor interactions☆12Dec 31, 2023Updated 2 years ago
- Managed hosting for WordPress and PHP on Cloudways • AdManaged hosting for WordPress, Magento, Laravel, or PHP apps, on multiple cloud providers. Deploy in minutes on Cloudways by DigitalOcean.
- High-performance multicore-scalable data structures and benchmarks☆143Jul 8, 2019Updated 6 years ago
- Memtier benchmark front-end☆10May 9, 2023Updated 3 years ago
- Some miscellaneous OpenSHMEM examples☆23Sep 14, 2022Updated 3 years ago
- ucore+ repository for OS laboratory 2015☆11Jun 1, 2018Updated 8 years ago
- C++ heterogeneous and lock-free containers☆13Sep 5, 2018Updated 7 years ago
- Java library and runtime system for efficient state machine replication☆47Jul 21, 2021Updated 4 years ago
- C++14 CSV Stream based on C File API