Alternatives and similar repositories for simd-x

Users that are interested in simd-x are comparing it to the libraries listed below

• AutomataLab / Tigr
  Transforming Graphs for Efficient Irregular Graph Processing on GPUs
  ☆47Updated 2 years ago
• AutomataLab / Subway
  Out-of-GPU-Memory Graph Processing with Minimal Data Transfer
  ☆53Updated 2 years ago
• PAA-NCIC / GSWITCH
  A pattern-based algorithmic autotuner for graph processing on GPUs.
  ☆30Updated 5 months ago
• wpybtw / Skywalker
  ☆10Updated last year
• iHeartGraph / Enterprise
  Enterprise: Breadth-First Graph Traversal on GPUs. SC'15.
  ☆31Updated 8 years ago
• concept-inversion / C-SAW
  A Framework for Graph Sampling and Random Walk on GPUs.
  ☆39Updated 3 months ago
• owensgroup / ATOS
  Multi-GPU dynamic scheduler using PGAS style cross-GPU communication
  ☆28Updated last year
• IntelligentSoftwareSystems / GaloisGPU
  LonestarGPU: Irregular algorithms parallelized for GPUs
  ☆35Updated 5 years ago
• groute / groute
  Asynchronous Multi-GPU Programming Framework
  ☆46Updated 3 years ago
• illinois-impact / EMOGI
  ☆21Updated 4 years ago
• guowentian / SubgraphMatchGPU
  ☆29Updated 4 years ago
• jmalicevic / EverythingGraph
  A platform to evaluate techniques used in multicore graph processing.
  ☆37Updated 6 years ago
• stanford-mast / Grazelle-PPoPP18
  Artifact for PPoPP 2018 paper "Making Pull-Based Graph Processing Performant"
  ☆23Updated 5 years ago
• desert0616 / gpma_demo
  Source code for the paper: Accelerating Dynamic Graph Analytics on GPUs
  ☆25Updated last year
• GPUPeople / faimGraph
  This code base represents "faimGraph: High Performance Management of Fully-dynamic Graphs under tight Memory Constraints on the GPU"
  ☆12Updated 4 years ago
• araij / rabbit_order
  ☆46Updated 2 years ago
• flashmobwalk / flashmob
  FlashMob is a shared-memory random walk system.
  ☆32Updated last year
• plasma-umass / NextDoor
  Graph Sampling using GPU
  ☆52Updated 3 years ago
• rstream-system / RStream
  ☆25Updated 2 years ago
• jinzh-hust / GraphM
  An efficient storage system for concurrent graph processing
  ☆10Updated 4 years ago
• wheatman / Packed-Compressed-Sparse-Row
  Dynamic data structure for sparse graphs.
  ☆30Updated last year
• ustcadsl / GraphWalker
  ☆18Updated 4 years ago
• datourat / Gorder
  ☆36Updated 5 years ago
• pkumod / GSI
  GPU-friendly Subgraph Isomorphism, published in ICDE 2020
  ☆34Updated 11 months ago
• thu-pacman / GraphPi
  ☆40Updated 3 years ago
• wzbxpy / TRUST
  Trust: Triangle Counting Reloaded on GPUs
  ☆20Updated last year
• owensgroup / GpuBTree
  Code for paper "Engineering a High-Performance GPU B-Tree" accepted to PPoPP 2019
  ☆55Updated 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…
  ☆30Updated 6 years ago
• owensgroup / merge-spmm
  Code for paper "Design Principles for Sparse Matrix Multiplication on the GPU" accepted to Euro-Par 2018
  ☆71Updated 4 years ago
• getianao / ngAP
  ngAP's artifact for ASPLOS'24
  ☆23Updated 4 months ago