Alternatives and similar repositories for mini:

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

• 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
• stanford-mast / Grazelle-PPoPP18
  Artifact for PPoPP 2018 paper "Making Pull-Based Graph Processing Performant"
  ☆23Updated 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…
  ☆28Updated 6 years ago
• LuxGraph / Lux
  A Distributed Multi-GPU System for Fast Graph Processing
  ☆65Updated 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 3 years ago
• chenxuhao / GraphAIBench
  A benchmark suite for Graph Machine Learning
  ☆18Updated 5 months ago
• ldhulipala / aspen
  Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees
  ☆87Updated 5 years ago
• pzrq / megakv
  A GPU-Accelerated In-Memory Key-Value Store (AWS-focused fork)
  ☆28Updated 7 years ago
• realstolz / polymer
  A NUMA-aware Graph-structured Analytics Framework
  ☆42Updated 6 years ago
• netsyslab / Totem
  A graph processing engine for hybrid CPU and GPU platforms
  ☆38Updated 6 years ago
• groute / groute
  Asynchronous Multi-GPU Programming Framework
  ☆45Updated 3 years ago
• goatdb / llama
  LLAMA Graph Analytics Engine
  ☆41Updated 7 years ago
• Liu-Cheng / graph-database-accel-survey
  ☆29Updated 8 years ago
• 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
• bindscha / x-stream
  Edge-centric Graph Processing System using Streaming Partitions
  ☆82Updated 7 years ago
• rstream-system / RStream
  ☆25Updated last year
• wheatman / Packed-Compressed-Sparse-Row
  Dynamic data structure for sparse graphs.
  ☆30Updated 11 months ago
• asherliu / simd-x
  SIMD-X: Programming and Processing of Graph Algorithms on GPUs [USENIX ATC '19]
  ☆20Updated 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
• iHeartGraph / iBFS
  iBFS: Concurrent Breadth-First Search on GPUs. SIGMOD'16
  ☆23Updated 7 years ago
• IntelligentSoftwareSystems / GaloisGPU
  LonestarGPU: Irregular algorithms parallelized for GPUs
  ☆34Updated 5 years ago
• domargan / parallel-packed-csr
  A parallel packed CSR data structure for large-scale dynamic graphs
  ☆14Updated 2 years ago
• AutomataLab / Subway
  Out-of-GPU-Memory Graph Processing with Minimal Data Transfer
  ☆53Updated 2 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
• hornet-gt / hornet
  Hornet data structure for sparse dynamic graphs and matrices
  ☆82Updated 5 years ago
• spcl / gms
  GraphMineSuite (GMS): a benchmarking suite for graph mining algorithms such as graph pattern matching or graph learning
  ☆26Updated 3 years ago
• graphbig / graphBIG
  A Comprehensive Benchmark Suite for Graph Computing
  ☆67Updated 6 years ago
• dnasc / graph-processing
  This repository contains information about graph processing.
  ☆32Updated 7 months ago
• ECP-ExaGraph / grappolo
  OpenMP implementation of Graph Community Detection, with a number of parallel heuristics/approximate computing techniques
  ☆20Updated last year
• syhlalala / PAM-AE
  ☆9Updated 6 years ago