Alternatives and similar repositories for SIMD-sorting-network:

Users that are interested in SIMD-sorting-network are comparing it to the libraries listed below

• lemire / pospopcnt_avx512
  benchmarking positional population count
  ☆14Updated 11 months ago
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆45Updated 5 years ago
• simd-sorting / fast-and-robust
  ☆31Updated 3 years ago
• gerben-s / quicksort-blog-post
  ☆39Updated 4 years ago
• WojciechMula / man-intrinsics
  Create man pages from information used by Intel Intrinsics Guide and optionally uops.info
  ☆45Updated 2 months ago
• skarupke / heap
  Looking into the performance of heaps, starting with the Min-Max Heap
  ☆65Updated 4 years ago
• mjansson / rpmalloc-benchmark
  Benchmarks for our memory allocator
  ☆63Updated last year
• damageboy / vxsort-cpp
  My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)
  ☆31Updated last year
• fix8mt / fiber
  C++20 fiber implementation with similar interface to std::thread, header-only / x86_64 / Linux only / stackful / built-in scheduler / thr…
  ☆27Updated 4 months ago
• twiggler / slotmap
  Slotmap is a sequence container with weak reference keys written in C++17.
  ☆39Updated 4 months ago
• mikekazakov / eytzinger
  Cache-friendly associative STL-like container with an Eytzinger (BFS) layout for C++
  ☆31Updated 7 years ago
• skarupke / mutex_benchmarks
  Code for benchmarking of mutexes to accompany a blog post of mine.
  ☆27Updated 5 years ago
• WojciechMula / simd-byte-lookup
  SIMDized check which bytes are in a set
  ☆28Updated 6 years ago
• lemire / simdprune
  Pruning elements in SIMD vectors (i.e., packing left elements)
  ☆64Updated last year
• JacksonAllan / c_cpp_hash_tables_benchmark
  A comparative, extendable benchmarking suite for C and C++ hash-table libraries.
  ☆32Updated 8 months ago
• pdziepak / ranges-gpu
  Experimental ranges for CUDA
  ☆25Updated 6 years ago
• ljestrada / charconvutils
  C++17 sports two low-level character conversion functions, std::from_chars and std::to_chars, but they have a usage model that can be ea…
  ☆8Updated 5 years ago
• michaeljclark / ethical_hashmap
  Fast open addressing hash table
  ☆41Updated last year
• skarupke / sherwood_map
  A hash table implementation using Robin Hood Linear Probing
  ☆50Updated 10 years ago
• ogiroux / atomic_wait
  Sample implementation of C++20 atomic_wait/notify
  ☆59Updated 5 years ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆32Updated last year
• fvalasiad / devector
  C++11 Header-only continuous-storage Double ended vector implementation similar to STL's std::vector for efficient insertions/removals at…
  ☆13Updated 2 years ago
• ssteinberg / shared_futex
  Fast, shared, upgradeable, non-recursive and non-fair mutex
  ☆30Updated 6 years ago
• greg7mdp / sho
  Small Hash Optimization - an optimization for when you have many small hash maps - similar to LLVM's small vector optimization.
  ☆39Updated 7 years ago
• nadavrot / fast_log
  A fast implementation of log() and exp()
  ☆51Updated 2 years ago
• node-dot-cpp / alloc-test
  Cross-platform benchmarking for memory allocators, aiming to be as close to real world as it is practical
  ☆45Updated 5 years ago
• PatwinchIR / ultra-sort
  DSL for SIMD Sorting on AVX2 & AVX512
  ☆30Updated 6 years ago
• gpderetta / libtask
  ☆13Updated 8 years ago
• tower120 / trackable_ptr
  Smart pointer for any movable objects. When trackable object moved/destroyed, trackers updated with new object's pointer.
  ☆25Updated 5 years ago
• parlab-tuwien / lockfree-linked-list
  A more Pragmatic Implementation of the Lock-free, Ordered, Linked List
  ☆17Updated 4 years ago