Alternatives and similar repositories for simd_bitonic

Users that are interested in simd_bitonic are comparing it to the libraries listed below

• owensgroup / MVGpuBTree
  GPU B-Tree with support for versioning (snapshots).
  ☆51Updated 11 months ago
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆104Updated 7 years ago
• owensgroup / GpuBTree
  Code for paper "Engineering a High-Performance GPU B-Tree" accepted to PPoPP 2019
  ☆57Updated 3 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆54Updated last year
• cmuparlay / flock
  Library for lock-free locks
  ☆83Updated 2 years ago
• kunpengcompute / AvxToNeon
  Encapsulate the frequently used AVX instructions as independent modules to reduce repeated development workload.
  ☆125Updated last year
• howardlau1999 / rdmapp
  C++ interfaces for RDMA access
  ☆79Updated last week
• hpides / vectorized-hash-tables
  Code and results for our paper "Analyzing Vectorized Hash Tables Across CPU Architectures" @ VLDB '23.
  ☆26Updated last year
• cwida / ALP
  ALP: Adaptive Lossless Floating-Point Compression
  ☆128Updated 5 months ago
• cmuparlay / parlaylib
  A Toolkit for Programming Parallel Algorithms on Shared-Memory Multicore Machines
  ☆382Updated 3 weeks ago
• L-v-M / async
  ☆20Updated 2 years ago
• cmuparlay / PAM
  Parallel Balanced Binary Tree Structures
  ☆119Updated 6 months ago
• sfu-dis / corobase
  Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)
  ☆250Updated 3 years ago
• pabmont / pma
  Packed Memory Array
  ☆17Updated 11 years ago
• thu-pacman / TriCache
  A User-Transparent Block Cache Enabling High-Performance Out-of-Core Processing with In-Memory Programs
  ☆74Updated 2 years ago
• eloj / radix-sorting
  Radix sorting from the ground up
  ☆37Updated last year
• flexible-address-space / flexspace
  Code of the paper "Building an Efficient Key-Value Store in a Flexible Address Space", EuroSys '22
  ☆21Updated 6 months ago
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆92Updated 4 years ago
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆176Updated 9 years ago
• viktorleis / perfevent
  An easy-to-use, header-only C++ wrapper for Linux' perf event API
  ☆128Updated 6 months ago
• urcs-sync / Montage
  Montage is a system for building fast buffered persistent data structures on nonvolatile memory.
  ☆16Updated 3 years ago
• LPD-EPFL / CLHT
  CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.
  ☆165Updated 4 years ago
• awesome-simd / awesome-simd
  A curated list of awesome SIMD frameworks, libraries and software
  ☆208Updated last year
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• rusnikola / lfqueue
  A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)
  ☆67Updated last year
• berenger-eu / avx-512-sort
  Fast AVX512 (AVX-512) quicksort + bitonic sort.
  ☆28Updated 3 years ago
• pfent / L5RDMA
  A low level, low latency library, which can be used to accelerate network messages using shared memory and RDMA
  ☆78Updated 4 years ago
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆165Updated last year
• urcs-sync / ralloc
  Recoverable lock-free allocator based on LRMalloc
  ☆47Updated 4 years ago
• baotonglu / dash
  Scalable Hashing on Persistent Memory
  ☆194Updated last year