Alternatives and similar repositories for mini

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

• LuxGraph / Lux
  A Distributed Multi-GPU System for Fast Graph Processing
  ☆65Updated 6 years ago
• hornet-gt / hornet
  Hornet data structure for sparse dynamic graphs and matrices
  ☆85Updated 5 years ago
• ldhulipala / aspen
  Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees
  ☆88Updated 6 years ago
• farkhor / WS-VR
  A CUDA-based multi-GPU vertex-centric graph processing framework based on Warp Segmentation and Vertex Refinement techniques.
  ☆10Updated 8 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
• CGCL-codes / Frog
  Frog is Asynchronous Graph Processing on GPU with Hybrid Coloring Model. The fundamental idea is based on Pareto principle (or 80-20 rule…
  ☆36Updated 4 years ago
• graphbig / graphBIG
  A Comprehensive Benchmark Suite for Graph Computing
  ☆70Updated 6 years ago
• netsyslab / Totem
  A graph processing engine for hybrid CPU and GPU platforms
  ☆38Updated 6 years ago
• IntelligentSoftwareSystems / GaloisGPU
  LonestarGPU: Irregular algorithms parallelized for GPUs
  ☆35Updated 5 years ago
• realstolz / polymer
  A NUMA-aware Graph-structured Analytics Framework
  ☆44Updated 6 years ago
• groute / groute
  Asynchronous Multi-GPU Programming Framework
  ☆46Updated 4 years ago
• narayanan2004 / GraphMat
  GraphMat graph analytics framework
  ☆102Updated 2 years ago
• stanford-mast / Grazelle-PPoPP18
  Artifact for PPoPP 2018 paper "Making Pull-Based Graph Processing Performant"
  ☆23Updated 5 years ago
• wheatman / Packed-Compressed-Sparse-Row
  Dynamic data structure for sparse graphs.
  ☆29Updated last year
• bindscha / x-stream
  Edge-centric Graph Processing System using Streaming Partitions
  ☆82Updated 7 years ago
• iHeartGraph / Enterprise
  Enterprise: Breadth-First Graph Traversal on GPUs. SC'15.
  ☆31Updated 8 years ago
• farkhor / CuSha
  CuSha is a CUDA-based vertex-centric graph processing framework that uses G-Shards and CW representations.
  ☆52Updated 9 years ago
• rstream-system / RStream
  ☆25Updated 2 years ago
• iHeartGraph / iBFS
  iBFS: Concurrent Breadth-First Search on GPUs. SIGMOD'16
  ☆24Updated 8 years ago
• owensgroup / GpuBTree
  Code for paper "Engineering a High-Performance GPU B-Tree" accepted to PPoPP 2019
  ☆57Updated 3 years ago
• chenxuhao / GraphAIBench
  A benchmark suite for Graph Machine Learning
  ☆19Updated 9 months ago
• Xtra-Computing / Medusa
  Medusa: Building GPU-based Parallel Sparse Graph Applications with Sequential C/C++ Code
  ☆62Updated 4 years ago
• fpgasystems / doppiodb
  doppioDB - A hardware accelerated database
  ☆49Updated 8 years ago
• 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
• the-data-lab / GraphOne
  "GraphOne: A Data Store for Real-time Analytics on Evolving Graphs", Usenix FAST'19
  ☆58Updated 4 years ago
• syhlalala / PAM-AE
  ☆9Updated 6 years ago
• IntelligentSoftwareSystems / Galois
  Galois: C++ library for multi-core and multi-node parallelization
  ☆330Updated last year
• stanford-ppl / Green-Marl
  A DSL for efficient Graph Analysis
  ☆102Updated 6 years ago
• Liu-Cheng / graph-database-accel-survey
  ☆29Updated 8 years ago
• ECP-ExaGraph / grappolo
  OpenMP implementation of Graph Community Detection, with a number of parallel heuristics/approximate computing techniques
  ☆21Updated 2 years ago