ucf-cs / tldsLinks
Lock-free Transactions without Rollbacks for Linked Data Structures
☆22Updated 3 years ago
Alternatives and similar repositories for tlds
Users that are interested in tlds are comparing it to the libraries listed below
Sorting:
- The world's first wait-free Software Transactional Memory☆173Updated 5 years ago
- Fast wait-free algorithms designed for shared memory systems☆46Updated 7 years ago
- QSBR and EBR library☆128Updated 5 years ago
- Effective Memory Reclamation☆62Updated 5 years ago
- C implementations of several scalable non-blocking data structures for x86 and x86-64.☆38Updated 14 years ago
- Lock-free multithreaded memory allocation☆108Updated 8 years ago
- A fully concurrent lock-free cuckoo hash table implementation☆56Updated 8 years ago
- Mordor is a high performance I/O library based on fibers.☆21Updated 8 years ago
- W-TinyLFU cache C++11 header only implementation☆63Updated 7 years ago
- Concurrent trie-hash map library☆92Updated last year
- Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …☆31Updated 15 years ago
- Our open source benchmarks and code samples☆193Updated this week
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference☆53Updated last year
- Cross-platform atomic operations and lock algorithm library☆99Updated 7 years ago
- High-performance multicore-scalable data structures and benchmarks☆143Updated 6 years ago
- ☆66Updated 5 years ago
- An implementation of the Judy array, wrapped in a c++ template. Uses Karl Malbrain's implementation, http://code.google.com/p/judyarray/ …☆44Updated 10 years ago
- C++ framework for rapid server development☆77Updated last year
- A clone of Google C++ B-tree code https://code.google.com/p/cpp-btree/☆87Updated 11 years ago
- Git mirror of the official (mercurial) repository of cpp-btree☆77Updated 11 years ago
- ☆110Updated last year
- Implementation of the algorithms from "Scalable Lock-Free Dynamic Memory Allocation"☆17Updated 11 years ago
- C++ implementation of concurrent Binary Search Trees☆72Updated 10 years ago
- Different implementations of spinlock.☆105Updated 10 years ago
- For details, see the blog post:☆34Updated last year
- A Low-latency, Locality-conscious Memory Allocator with Stable Performance Scalability☆68Updated 11 years ago
- Clone of Google's cpp-btree B-tree set and map containers, with minor fixes/modifications.☆37Updated 4 months ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- Compilation of concurrent data structures with at least lock-free or wait-free properties.☆76Updated 6 years ago
- A User Space Threading Library Supporting Multi-Core Systems☆141Updated 2 years ago