bretthall / Wyatt-STMLinks
Software transactional memory system developed at Wyatt Technology
☆29Updated 6 years ago
Alternatives and similar repositories for Wyatt-STM
Users that are interested in Wyatt-STM are comparing it to the libraries listed below
Sorting:
- Restartable Sequences: a userspace implementation of cheap per-cpu atomic operations☆38Updated 6 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆49Updated 4 years ago
- Composable Data and Type Generators for C++☆10Updated 6 years ago
- LLVM-jitted bitmaps☆27Updated 5 years ago
- A small DFA for under 16 states☆53Updated 7 years ago
- Lock-free multithreaded memory allocation☆110Updated 9 years ago
- Hash Array Mapped Trie (C++ Templates)☆125Updated 2 years ago
- Extension of the STL algorithms on sets☆21Updated 6 years ago
- A hash table implementation using Robin Hood Linear Probing☆51Updated 11 years ago
- Modern C++ framework for critical systems☆21Updated 2 years ago
- Quick sort code using AVX2 instructions☆69Updated 8 years ago
- Hyaline Reclamation (PLDI '21, PODC '19)☆23Updated 4 years ago
- Composable monadic STM for C++ on Free monads☆80Updated 5 years ago
- Simple out-of-process invoker☆18Updated 5 months ago
- Papers for the C++ Standards Committee, WG21☆58Updated 7 months ago
- A Wait-Free Universal Construct for Large Objects☆96Updated 6 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- ☆112Updated last year
- ☆49Updated 5 years ago
- A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)☆71Updated 2 years ago
- Erlang style programming for C++☆15Updated 7 years ago
- Header-only C++17 library for property-based testing.☆127Updated last year
- High-performance multicore-scalable data structures and benchmarks☆144Updated 6 years ago
- STM (Software Transactional Memory) implementation in C, based on memory-mapping.☆60Updated 16 years ago
- C++ QD locking library☆11Updated 3 weeks ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago
- Demonstration of LLVM's opt-viewer tool☆71Updated 8 years ago
- Fast implementations of the scancount algorithm: C++ header-only library☆27Updated 6 years ago
- haesni is a small hash function using aes-ni for fast string hashing☆19Updated 7 years ago
- Compile-time Checked, Type-Safe Formatting in C++14☆36Updated 8 years ago