lemire / testingmlp
Testing memory-level parallelism
☆67Updated last year
Alternatives and similar repositories for testingmlp:
Users that are interested in testingmlp are comparing it to the libraries listed below
- Fast Hash Functions Using AES Intrinsics☆82Updated 5 years ago
- ☆105Updated last year
- A terminal viewer for x86 instruction/intrinsic information using Python 3 + curses☆128Updated 2 years ago
- A description of Minotaur can be found in https://arxiv.org/abs/2306.00229.☆101Updated 6 months ago
- A Wait-Free Universal Construct for Large Objects☆96Updated 5 years ago
- InstLatX64_Demo☆42Updated this week
- ☆29Updated this week
- ☆39Updated 4 years ago
- Benchmarking suite for Google workloads☆122Updated this week
- a high performance cache simulator and library☆99Updated 6 months ago
- Programatically obtain information about the pages backing a given memory region☆74Updated 3 years ago
- User-space Page Management☆107Updated 6 months ago
- Dynamic runtime inlining with LLVM☆66Updated 3 years ago
- A low level, low latency library, which can be used to accelerate network messages using shared memory and RDMA☆74Updated 4 years ago
- Quick sort code using AVX2 instructions☆68Updated 7 years ago
- A small library and kernel module for easy access to x86 performance monitor counters under Linux.☆98Updated 10 months ago
- Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.☆39Updated 4 years ago
- Reproducible experimeents on UTF-8 validation using SIMD instructions☆40Updated 6 months ago
- Very low-overhead timer/counter interfaces for C on Intel 64 processors.☆122Updated 5 years ago
- Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …☆31Updated 14 years ago
- ☆20Updated 2 years ago
- Library for Restartable Sequences☆68Updated 3 weeks ago
- A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)☆55Updated last year
- Concurrent trie-hash map library☆91Updated last year
- Bitset Sort, a faster std::sort replacement.☆78Updated 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…☆45Updated 3 years ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆40Updated 3 months ago
- ☆65Updated 6 months ago
- C++20 Coroutines and io_uring☆48Updated 2 years ago
- Fast and compact minimal perfect hash functions in C++.☆215Updated last week