node-dot-cpp / alloc-testLinks
Cross-platform benchmarking for memory allocators, aiming to be as close to real world as it is practical
☆46Updated 6 years ago
Alternatives and similar repositories for alloc-test
Users that are interested in alloc-test are comparing it to the libraries listed below
Sorting:
- Benchmarks for our memory allocator☆70Updated 2 years ago
- Very low-overhead timer/counter interfaces for C on Intel 64 processors.☆140Updated 2 months ago
- ☆45Updated 5 years ago
- The world's first wait-free Software Transactional Memory☆175Updated 5 years ago
- For details, see the blog post:☆35Updated 2 years ago
- A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)☆71Updated 2 years ago
- QSBR and EBR library☆135Updated 6 years ago
- Implementation of the algorithms from "Scalable Lock-Free Dynamic Memory Allocation"☆17Updated 11 years ago
- SIMD sorting network generator and very basic tester☆16Updated 3 years ago
- Looking into the performance of heaps, starting with the Min-Max Heap☆69Updated 5 years ago
- AVX512F and AVX2 versions of quick sort☆104Updated 8 years ago
- Sample implementation of C++20 atomic_wait/notify☆62Updated 6 years ago
- Test if AVX vector loads and stores are atomic☆35Updated 5 years ago
- Effective Memory Reclamation☆63Updated 5 years ago
- A Low-latency, Locality-conscious Memory Allocator with Stable Performance Scalability☆68Updated 12 years ago
- benchmarking positional population count☆17Updated 3 months ago
- Concurrent trie-hash map library☆94Updated 2 years ago
- ☆128Updated 2 years ago
- Fastest CPU SIMD (SSE4) sorting networks for small integer arrays (2-6 elements), also optimal amd64 assembly and notes on getting compil…☆52Updated 4 years ago
- Fast, shared, upgradeable, non-recursive and non-fair mutex☆36Updated 7 years ago
- Unstable O(n log n) sorting algorithm with O(n) memory☆67Updated 2 months ago
- Programatically obtain information about the pages backing a given memory region☆82Updated 4 years ago
- DSL for SIMD Sorting on AVX2 & AVX512☆31Updated 7 years ago
- A more Pragmatic Implementation of the Lock-free, Ordered, Linked List☆17Updated 5 years ago
- Optimized for systems that read and write large blobs.☆12Updated 10 years ago
- TLSF: two-level segregated fit O(1) allocator☆82Updated 3 years ago
- ☆112Updated last year
- Library for lock-free locks☆83Updated 2 years ago
- Library for Restartable Sequences☆74Updated 2 months ago
- W-TinyLFU cache C++11 header only implementation☆63Updated 7 years ago