stgatilov / linear-vs-binary-searchLinks
Comparing linear and binary searches
☆44Updated 5 years ago
Alternatives and similar repositories for linear-vs-binary-search
Users that are interested in linear-vs-binary-search are comparing it to the libraries listed below
Sorting:
- 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
- Benchmarks for our memory allocator☆70Updated 2 years ago
- Vectorized version of the PCG random number generator☆87Updated last month
- A hash table implementation using Robin Hood Linear Probing☆52Updated 11 years ago
- Fast Hash Functions Using AES Intrinsics☆85Updated 6 years ago
- A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)☆71Updated 2 years ago
- AVX512F and AVX2 versions of quick sort☆104Updated 8 years ago
- Pruning elements in SIMD vectors (i.e., packing left elements)☆68Updated 2 years ago
- Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.☆40Updated 5 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- ☆113Updated 2 years ago
- Unstable O(n log n) sorting algorithm with O(n) memory☆67Updated 3 months ago
- Experiments with array layouts for comparison-based searching☆86Updated 2 years ago
- ☆39Updated 5 years ago
- A C library for runtime-flippable feature flags on Linux/x86-64, with negligible overhead in the common case☆76Updated 3 years ago
- Generic SIMD intrinsic to allow for portable SIMD intrinsic programming☆42Updated 11 years ago
- Random Number Generator based on hardware-accelerated AES instructions☆61Updated 6 years ago
- Looking into the performance of heaps, starting with the Min-Max Heap☆70Updated 5 years ago
- Lace - implementation of work-stealing in C☆55Updated 6 months ago
- TLSF: two-level segregated fit O(1) allocator☆83Updated 3 years ago
- The world's first wait-free Software Transactional Memory☆175Updated 5 years ago
- A Wait-Free Universal Construct for Large Objects☆96Updated 6 years ago
- fast open addressing hash table☆42Updated 3 months ago
- A Fast, Multicore-Scalable, Low-Fragmentation Memory Allocator☆162Updated 7 months ago
- A collection of SIMD optimized general purpose hash functions☆48Updated 11 years ago
- Fast random number generators: Vectorized (SIMD) version of xorshift128+☆123Updated 5 years ago
- Linear vs binary search benchmark☆41Updated 6 years ago
- High-performance multicore-scalable data structures and benchmarks☆144Updated 6 years ago
- Fast multi-threaded memory allocator☆79Updated 6 years ago
- Support for ternary logic in SSE, XOP, AVX2 and x86 programs☆31Updated last year