Alternatives and similar repositories for vite

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

• ECP-ExaGraph / grappolo
  OpenMP implementation of Graph Community Detection, with a number of parallel heuristics/approximate computing techniques
  ☆20Updated last year
• netsyslab / Totem
  A graph processing engine for hybrid CPU and GPU platforms
  ☆38Updated 6 years ago
• iHeartGraph / Enterprise
  Enterprise: Breadth-First Graph Traversal on GPUs. SC'15.
  ☆31Updated 8 years ago
• ECP-ExaGraph / miniVite
  MPI+OpenMP implementation of the first phase of Louvain method for Graph Community Detection
  ☆26Updated 6 months ago
• IntelligentSoftwareSystems / GaloisGPU
  LonestarGPU: Irregular algorithms parallelized for GPUs
  ☆35Updated 5 years ago
• stanford-mast / Grazelle-PPoPP18
  Artifact for PPoPP 2018 paper "Making Pull-Based Graph Processing Performant"
  ☆23Updated 5 years ago
• narayanan2004 / GraphMat
  GraphMat graph analytics framework
  ☆102Updated 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
• Adam27X / hybrid_BC
  Hybrid methods for Parallel Betweenness Centrality on the GPU
  ☆24Updated 6 years ago
• pdclab / lumos
  Lumos: Dependency-Driven Disk-based Graph Processing
  ☆20Updated 5 years ago
• AutomataLab / Tigr
  Transforming Graphs for Efficient Irregular Graph Processing on GPUs
  ☆47Updated 2 years ago
• graphbig / graphBIG
  A Comprehensive Benchmark Suite for Graph Computing
  ☆69Updated 6 years ago
• bindscha / x-stream
  Edge-centric Graph Processing System using Streaming Partitions
  ☆82Updated 7 years ago
• ldhulipala / aspen
  Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees
  ☆87Updated 5 years ago
• cslab-ntua / sparsex
  The SparseX sparse kernel optimization library
  ☆39Updated 6 years ago
• weifengliu-ssslab / Benchmark_SpTRSV_using_CSC
  A Synchronization-Free Algorithm for Parallel Sparse Triangular Solves (SpTRSV)
  ☆22Updated 5 years ago
• AutomataLab / Subway
  Out-of-GPU-Memory Graph Processing with Minimal Data Transfer
  ☆53Updated 2 years ago
• hornet-gt / hornet
  Hornet data structure for sparse dynamic graphs and matrices
  ☆84Updated 5 years ago
• wheatman / Packed-Compressed-Sparse-Row
  Dynamic data structure for sparse graphs.
  ☆30Updated last year
• groute / groute
  Asynchronous Multi-GPU Programming Framework
  ☆46Updated 3 years ago
• cuStinger / cuStinger
  This repository contains the cuStinger data structure used for dynamic graph representation.
  ☆19Updated 6 years ago
• Algebraic-Programming / ALP
  Home of ALP/GraphBLAS and ALP/Pregel, featuring shared- and distributed-memory auto-parallelisation of linear algebraic and vertex-centri…
  ☆25Updated this week
• jmrosinski / GPTL
  General Purpose Timing Library
  ☆34Updated last year
• LuxGraph / Lux
  A Distributed Multi-GPU System for Fast Graph Processing
  ☆65Updated 6 years ago
• lcchen008 / irreg-simd
  Artifact of paper "Exploiting Recent SIMD Architectural Advances for Irregular Applications"
  ☆11Updated 8 years ago
• realstolz / polymer
  A NUMA-aware Graph-structured Analytics Framework
  ☆44Updated 6 years ago
• wheatman / Packed-Memory-Array
  ☆17Updated 5 months ago
• PASSIONLab / CombBLAS
  The Combinatorial BLAS (CombBLAS) is an extensible distributed-memory parallel graph library offering a small but powerful set of linear …
  ☆75Updated this week
• KarypisLab / TriangleCounting
  OpenMP-based parallel program for counting the number of triangles in a sparse graph
  ☆18Updated 7 years ago
• jmalicevic / EverythingGraph
  A platform to evaluate techniques used in multicore graph processing.
  ☆37Updated 6 years ago