Alternatives and similar repositories for MVGpuBTree

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

• owensgroup / GpuBTree
  Code for paper "Engineering a High-Performance GPU B-Tree" accepted to PPoPP 2019
  ☆56Updated 3 years ago
• owensgroup / SlabHash
  A warp-oriented dynamic hash table for GPUs
  ☆73Updated last year
• owensgroup / BGHT
  BGHT: High-performance static GPU hash tables.
  ☆66Updated 2 months ago
• thu-pacman / TriCache
  A User-Transparent Block Cache Enabling High-Performance Out-of-Core Processing with In-Memory Programs
  ☆73Updated 2 years ago
• owensgroup / ATOS
  Multi-GPU dynamic scheduler using PGAS style cross-GPU communication
  ☆27Updated last year
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆104Updated 7 years ago
• IntelligentSoftwareSystems / GaloisGPU
  LonestarGPU: Irregular algorithms parallelized for GPUs
  ☆35Updated 5 years ago
• Geolm / simd_bitonic
  Bitonic sort using simd (avx/neon) instructions
  ☆14Updated 3 years ago
• pzrq / megakv
  A GPU-Accelerated In-Memory Key-Value Store (AWS-focused fork)
  ☆28Updated 7 years ago
• alpaka-group / mallocMC
  mallocMC: Memory Allocator for Many Core Architectures
  ☆56Updated last month
• madsys-dev / ROART
  Range Optimized Adaptive Radix Tree
  ☆23Updated 2 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆54Updated last year
• crosetto / cupq
  a CUDA implementation of a priority queue
  ☆84Updated 4 years ago
• sleeepyjack / warpcore
  A Library for fast Hash Tables on GPUs
  ☆122Updated 2 years ago
• urcs-sync / Montage
  Montage is a system for building fast buffered persistent data structures on nonvolatile memory.
  ☆15Updated 3 years ago
• horizon-research / rtnn
  ☆66Updated 2 years ago
• maleadt / pChase
  Pointer-chasing memory benchmark (forked from Doug Pase's code).
  ☆59Updated 11 years ago
• GPUPeople / GPUMemManSurvey
  Evaluating different memory managers for dynamic GPU memory
  ☆25Updated 4 years ago
• cmuparlay / PAM
  Parallel Balanced Binary Tree Structures
  ☆117Updated 3 months ago
• Pfzuo / Path-Hashing
  A Write-friendly and Cache-optimized Hashing Scheme for Non-volatile Memory Systems (MSST 2017, TPDS 2018)
  ☆30Updated 7 years ago
• groute / groute
  Asynchronous Multi-GPU Programming Framework
  ☆46Updated 4 years ago
• pabmont / pma
  Packed Memory Array
  ☆17Updated 11 years ago
• cmuparlay / flock
  Library for lock-free locks
  ☆82Updated 2 years ago
• shoaibkamil / stencilprobe
  Stencil Probe - a stencil microbenchmark
  ☆30Updated 12 years ago
• YanB25 / Universal-Print
  Universal Presentation: A Header-only C++ Library to Cout STL containers and more
  ☆18Updated last year
• zxjcarrot / 2-Tree
  Tiered Indexing is a general approach to improve the memory utilization of buffer-managed data structures including B+tree, Hashing, Heap…
  ☆36Updated last week
• urcs-sync / ralloc
  Recoverable lock-free allocator based on LRMalloc
  ☆47Updated 4 years ago
• pkumod / GraphSetIntersection
  Codes of the paper "Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions" that was published in SIGMOD 2018. Authors…
  ☆30Updated 6 years ago
• wxdwfc / rlib
  RLib is a header-only library for easier usage of RDMA.
  ☆45Updated 4 years ago
• stanford-mast / Grazelle-PPoPP18
  Artifact for PPoPP 2018 paper "Making Pull-Based Graph Processing Performant"
  ☆23Updated 5 years ago