dterei / tscLinks
Quick and dirty TSC access for benchmarking
☆32Updated 8 years ago
Alternatives and similar repositories for tsc
Users that are interested in tsc are comparing it to the libraries listed below
Sorting:
- A Low-latency, Locality-conscious Memory Allocator with Stable Performance Scalability☆68Updated 11 years ago
- QSBR and EBR library☆123Updated 5 years ago
- A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)☆60Updated last year
- Very low-overhead timer/counter interfaces for C on Intel 64 processors.☆134Updated 5 years ago
- Our open source benchmarks and code samples☆192Updated last month
- A User Space Threading Library Supporting Multi-Core Systems☆140Updated 2 years ago
- Cross-platform benchmarking for memory allocators, aiming to be as close to real world as it is practical☆46Updated 6 years ago
- The world's first Web-scale memory allocator☆108Updated 7 years ago
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆49Updated 9 years ago
- ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…☆181Updated 7 years ago
- Cross-platform atomic operations and lock algorithm library☆98Updated 6 years ago
- Different implementations of spinlock.☆105Updated 10 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- Test if AVX vector loads and stores are atomic☆30Updated 5 years ago
- Lock-free allocator as described by Maged M. Michael, 2004☆46Updated 11 years ago
- A more Pragmatic Implementation of the Lock-free, Ordered, Linked List☆17Updated 4 years ago
- A wall-clock stack-sampling profiler that actually works☆64Updated last year
- A Super Fast Multithreaded malloc() for 64-bit Machines☆291Updated 5 years ago
- High-performance multicore-scalable data structures and benchmarks☆142Updated 6 years ago
- Implementation of the algorithms from "Scalable Lock-Free Dynamic Memory Allocation"☆16Updated 10 years ago
- A benchmark framework for concurrent queue implementations☆291Updated 5 years ago
- Super Fast, Lock-Free, Wait-Free, CAS-free, thread-safe, memory allocator.☆178Updated 12 years ago
- AVX512F and AVX2 versions of quick sort☆104Updated 7 years ago
- ☆128Updated 2 years ago
- Fast wait-free algorithms designed for shared memory systems☆46Updated 7 years ago
- C++ implementation of concurrent Binary Search Trees☆72Updated 10 years ago
- The world's first wait-free Software Transactional Memory☆173Updated 5 years ago
- Lock-free multithreaded memory allocation☆108Updated 8 years ago
- Benchmarks for our memory allocator☆68Updated last year
- This is the user space slab memory allocator, umem, first available in Solaris 9.☆88Updated 3 years ago