travisdowns / concurrency-hierarchy-benchLinks
Supporting code for the concurrency hierarchy described in this blog post: https://travisdowns.github.io/blog/2020/07/06/concurrency-costs.html.
☆27Updated 3 years ago
Alternatives and similar repositories for concurrency-hierarchy-bench
Users that are interested in concurrency-hierarchy-bench are comparing it to the libraries listed below
Sorting:
- Lock-free multithreaded memory allocation☆108Updated 8 years ago
- ☆109Updated last year
- LLVM-jitted bitmaps☆27Updated 5 years ago
- A small DFA for under 16 states☆52Updated 7 years ago
- Quick sort code using AVX2 instructions☆69Updated 8 years ago
- Stasis is a flexible transactional storage library that is geared toward high-performance applications and system developers. It supports…☆53Updated 12 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆49Updated 4 years ago
- High-performance dictionary coding☆108Updated 8 years ago
- Restartable Sequences: a userspace implementation of cheap per-cpu atomic operations☆38Updated 6 years ago
- A compact implementation of Dr. Askitis HatTrie☆80Updated 11 years ago
- Fast wait-free algorithms designed for shared memory systems☆46Updated 7 years ago
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆49Updated 10 years ago
- Random Number Generator based on hardware-accelerated AES instructions☆60Updated 6 years ago
- Detailed experiments over simdjson for VLDB article (2019) and future work☆21Updated 5 years ago
- C Minimal Perfect Hashing Library☆86Updated 8 years ago
- Programatically obtain information about the pages backing a given memory region☆79Updated 3 years ago
- A hash table implementation using Robin Hood Linear Probing☆51Updated 11 years ago
- Hyaline Reclamation (PLDI '21, PODC '19)☆22Updated 4 years ago
- ☆48Updated 5 years ago
- Latency benchmarks of Unix IPC mechanisms☆100Updated last week
- lock free modified prefix B+tree append-only database☆116Updated 10 years ago
- qp tries and crit-bit tries☆122Updated 3 years ago
- Fastest CPU SIMD (SSE4) sorting networks for small integer arrays (2-6 elements), also optimal amd64 assembly and notes on getting compil…☆50Updated 4 years ago
- The world's first wait-free Software Transactional Memory☆173Updated 5 years ago
- A threaded, continuations-based I/O event library for manycore NUMA machines☆73Updated 4 years ago
- A simple, intrusive, zero-allocation red-black tree implementation☆52Updated 3 years ago
- Cache Oblivious Lookahead Arrays☆27Updated 12 years ago
- A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)☆71Updated last year
- QSBR and EBR library☆127Updated 5 years ago