PlatformLab / PerfUtilsLinks
A collection of eclectic tools for measuring performance using the cycle counter and pinning threads.
☆41Updated last year
Alternatives and similar repositories for PerfUtils
Users that are interested in PerfUtils are comparing it to the libraries listed below
Sorting:
- A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)☆60Updated last year
- QSBR and EBR library☆123Updated 5 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- Concurrent trie-hash map library☆92Updated last year
- ☆108Updated last year
- W-TinyLFU cache C++11 header only implementation☆62Updated 6 years ago
- Different implementations of spinlock.☆105Updated 10 years ago
- Fast differential coding functions (using SIMD instructions)☆54Updated 7 years ago
- A Low-latency, Locality-conscious Memory Allocator with Stable Performance Scalability☆68Updated 11 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- User-space Page Management☆109Updated last year
- Very low-overhead timer/counter interfaces for C on Intel 64 processors.☆134Updated 5 years ago
- A fast in-memory key-value store☆49Updated 7 years ago
- Fast wait-free algorithms designed for shared memory systems☆46Updated 7 years ago
- Our open source benchmarks and code samples☆192Updated last month
- A low level, low latency library, which can be used to accelerate network messages using shared memory and RDMA☆78Updated 4 years ago
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆49Updated 9 years ago
- ☆52Updated 5 years ago
- Lock-free allocator as described by Maged M. Michael, 2004☆46Updated 11 years ago
- Freud, a tool to create Performance Annotations for C/C++ programs☆21Updated last year
- Implementation of the algorithms from "Scalable Lock-Free Dynamic Memory Allocation"☆16Updated 10 years ago
- Shared memory queue benchmarks and tracing for blog☆80Updated 9 years ago
- The Lightstep distributed tracing library for C++☆39Updated last year
- C++ implementation of concurrent Binary Search Trees☆72Updated 10 years ago
- Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …☆30Updated 14 years ago
- A CPP wrapper for asynchronous socket server using linux's latest IO_URING API☆25Updated 3 years ago
- Lock-free multithreaded memory allocation☆108Updated 8 years ago
- A more Pragmatic Implementation of the Lock-free, Ordered, Linked List☆17Updated 4 years ago
- Git mirror of the official (mercurial) repository of cpp-btree☆75Updated 11 years ago
- Programatically obtain information about the pages backing a given memory region☆78Updated 3 years ago