Alternatives and similar repositories for GpuBTree:

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

• owensgroup / MVGpuBTree
  GPU B-Tree with support for versioning (snapshots).
  ☆47Updated 4 months ago
• owensgroup / ATOS
  Multi-GPU dynamic scheduler using PGAS style cross-GPU communication
  ☆28Updated last year
• GPUPeople / GPUMemManSurvey
  Evaluating different memory managers for dynamic GPU memory
  ☆25Updated 4 years ago
• owensgroup / SlabHash
  A warp-oriented dynamic hash table for GPUs
  ☆74Updated last year
• IntelligentSoftwareSystems / GaloisGPU
  LonestarGPU: Irregular algorithms parallelized for GPUs
  ☆33Updated 5 years ago
• pzrq / megakv
  A GPU-Accelerated In-Memory Key-Value Store (AWS-focused fork)
  ☆28Updated 7 years ago
• gcoe-dresden / cuda-gpu-tlb
  TLB Benchmarks
  ☆33Updated 7 years ago
• groute / groute
  Asynchronous Multi-GPU Programming Framework
  ☆45Updated 3 years ago
• asherliu / simd-x
  SIMD-X: Programming and Processing of Graph Algorithms on GPUs [USENIX ATC '19]
  ☆20Updated 4 years ago
• shoaibkamil / stencilprobe
  Stencil Probe - a stencil microbenchmark
  ☆30Updated 12 years ago
• AutomataLab / Subway
  Out-of-GPU-Memory Graph Processing with Minimal Data Transfer
  ☆53Updated 2 years ago
• stanford-mast / Grazelle-PPoPP18
  Artifact for PPoPP 2018 paper "Making Pull-Based Graph Processing Performant"
  ☆23Updated 4 years ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 years ago
• sleeepyjack / warpcore
  A Library for fast Hash Tables on GPUs
  ☆114Updated 2 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…
  ☆28Updated 6 years ago
• saramcallister / Kangaroo
  ☆34Updated 3 years ago
• thu-pacman / TriCache
  A User-Transparent Block Cache Enabling High-Performance Out-of-Core Processing with In-Memory Programs
  ☆74Updated last year
• GPUPeople / faimGraph
  This code base represents "faimGraph: High Performance Management of Fully-dynamic Graphs under tight Memory Constraints on the GPU"
  ☆11Updated 3 years ago
• wxdwfc / rlib
  RLib is a header-only library for easier usage of RDMA.
  ☆45Updated 3 years ago
• cmuparlay / PAM
  Parallel Balanced Binary Tree Structures
  ☆114Updated 3 weeks ago
• realstolz / polymer
  A NUMA-aware Graph-structured Analytics Framework
  ☆42Updated 6 years ago
• maleadt / pChase
  Pointer-chasing memory benchmark (forked from Doug Pase's code).
  ☆59Updated 11 years ago
• wheatman / BP-Tree
  ☆14Updated last month
• howardlau1999 / rdmapp
  C++ interfaces for RDMA access
  ☆66Updated last month
• AutomataLab / Tigr
  Transforming Graphs for Efficient Irregular Graph Processing on GPUs
  ☆47Updated 2 years ago
• anilshanbhag / crystal
  GPU library for writing SQL queries
  ☆71Updated 9 months ago
• YanB25 / Universal-Print
  Universal Presentation: A Header-only C++ Library to Cout STL containers and more
  ☆19Updated last year
• Linestro / GRACE
  Artifact of ASPLOS'23 paper entitled: GRACE: A Scalable Graph-Based Approach to Accelerating Recommendation Model Inference
  ☆17Updated 2 years ago
• wheatman / Packed-Memory-Array
  ☆17Updated 3 months ago
• cmuparlay / PIM-tree
  A Skew-Resistant Index for Processing-in-Memory
  ☆25Updated 5 months ago