ucf-cs / tlds
Lock-free Transactions without Rollbacks for Linked Data Structures
☆22Updated 2 years ago
Alternatives and similar repositories for tlds:
Users that are interested in tlds are comparing it to the libraries listed below
- C implementations of several scalable non-blocking data structures for x86 and x86-64.☆38Updated 13 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 8 years ago
- A C++ library for integer array compression☆28Updated 2 years ago
- Lock-free multithreaded memory allocation☆105Updated 8 years ago
- ssmp is a highly optimized message-passing library built on top of the cache-coherence protocols of shared memory processors.☆22Updated 9 years ago
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference☆51Updated last year
- A Low-latency, Locality-conscious Memory Allocator with Stable Performance Scalability☆68Updated 11 years ago
- Consistent Hashing data structures and algorithms for C++☆39Updated 8 years ago
- Cross-platform atomic operations and lock algorithm library☆97Updated 6 years ago
- W-TinyLFU cache C++11 header only implementation☆57Updated 6 years ago
- Automatically exported from code.google.com/p/google-concurrency-library☆35Updated 9 years ago
- C++ implementation of Concise and WAH compressed bitsets☆20Updated 7 years ago
- Fast wait-free algorithms designed for shared memory systems☆45Updated 6 years ago
- Code snippets for the workshop on concurrent data structure implementation.☆31Updated 11 years ago
- A fully concurrent lock-free cuckoo hash table implementation☆56Updated 7 years ago
- Feed-forward Bloom filters☆52Updated 13 years ago
- Cross-platform benchmarking for memory allocators, aiming to be as close to real world as it is practical☆45Updated 5 years ago
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆48Updated 9 years ago
- A Variable-Length String Hashing Library in C++☆44Updated 5 years ago
- Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …☆31Updated 14 years ago
- The Lightstep distributed tracing library for C++☆39Updated last year
- Fast differential coding functions (using SIMD instructions)☆52Updated 7 years ago
- C++ implementation of concurrent Binary Search Trees☆72Updated 9 years ago
- A lightweight (3 file, single function) library for running micro-benchmarks on C++ code☆79Updated 9 years ago
- ☆66Updated 4 years ago
- C++ framework for rapid server development☆77Updated last year
- Artifact for PPoPP'18☆18Updated 2 years ago
- Lock-free work stealing deque written in C. This is implemented after Chapter 16 of "The Art of Multiprocessor Programming."☆19Updated 13 years ago
- Implementation of the algorithms from "Scalable Lock-Free Dynamic Memory Allocation"☆16Updated 10 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 7 years ago