lemire / batched_random
Batched random number generation
☆17Updated last week
Alternatives and similar repositories for batched_random:
Users that are interested in batched_random are comparing it to the libraries listed below
- My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)☆30Updated last year
- Support for ternary logic in SSE, XOP, AVX2 and x86 programs☆31Updated 4 months ago
- Fast Hash Functions Using AES Intrinsics☆82Updated 5 years ago
- benchmarking positional population count☆14Updated last year
- A vectorized single header hash function.☆19Updated 5 months ago
- ☆27Updated 2 years ago
- Parse multiple decimal integers separated by arbitrary number of delimiters☆35Updated last year
- A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)☆56Updated last year
- String to Float Benchmark☆19Updated 6 years ago
- SIMDized check which bytes are in a set☆28Updated 6 years ago
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference☆53Updated last year
- ☆20Updated 2 years ago
- Collection of C++ containers extracted from LLVM☆26Updated 3 years ago
- ☆29Updated this week
- Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.☆38Updated 4 years ago
- ☆12Updated last year
- Hyaline Reclamation (PLDI '21, PODC '19)☆20Updated 3 years ago
- Quick sort code using AVX2 instructions☆68Updated 7 years ago
- Dictionary-based compression for inverted indexes.☆23Updated 6 years ago
- Quick 'n' Dirty benchmarks for various integer parsing methods in C++☆40Updated 4 years ago
- ☆20Updated 6 months ago
- Lock-free RCU (Read-Copy-Update) user-space library☆10Updated last year
- Lock-free allocator as described by Maged M. Michael, 2004☆45Updated 11 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 8 years ago
- Fast implementations of the scancount algorithm: C++ header-only library☆26Updated 5 years ago
- MlpIndex - Extremely fast ordered index via memory level parallelism☆12Updated 6 years ago
- Pruning elements in SIMD vectors (i.e., packing left elements)☆65Updated last year
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆48Updated 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 4 years ago