Alternatives and similar repositories for Packed-Memory-Array

Users that are interested in Packed-Memory-Array are comparing it to the libraries listed below

• PASSIONLab / terrace
  Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs
  ☆24Updated last year
• xiangyuzhi / GraphStorageExp
  ☆11Updated last year
• wheatman / Packed-Compressed-Sparse-Row
  Dynamic data structure for sparse graphs.
  ☆30Updated last year
• datourat / Gorder
  ☆36Updated 5 years ago
• guowentian / SubgraphMatchGPU
  ☆29Updated 4 years ago
• Xtra-Computing / ForkGraph
  ☆17Updated 3 years ago
• DIR-LAB / VCSR
  Official code of our work, VCSR: Mutable CSR Graph Format Using Vertex-Centric Packed Memory Array [CCGrid 2022].
  ☆12Updated 2 years ago
• thu-pacman / RisGraph
  RisGraph: A Real-Time Streaming System for Evolving Graphs to Support Sub-millisecond Per-update Analysis at Millions Ops/s
  ☆35Updated 3 years ago
• ldhulipala / aspen
  Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees
  ☆87Updated 5 years ago
• stanford-mast / Grazelle-PPoPP18
  Artifact for PPoPP 2018 paper "Making Pull-Based Graph Processing Performant"
  ☆23Updated 5 years ago
• Xtra-Computing / ThunderRW
  Source code of "ThunderRW: An In-Memory Graph Random Walk Engine" published in VLDB'2021 - By Shixuan Sun, Yuhang Chen, Shengliang Lu, Bi…
  ☆26Updated 3 years ago
• desert0616 / gpma_demo
  Source code for the paper: Accelerating Dynamic Graph Analytics on GPUs
  ☆25Updated last year
• thu-pacman / GraphPi
  ☆40Updated 3 years ago
• the-data-lab / GraphOne
  "GraphOne: A Data Store for Real-time Analytics on Evolving Graphs", Usenix FAST'19
  ☆58Updated 4 years ago
• jmalicevic / EverythingGraph
  A platform to evaluate techniques used in multicore graph processing.
  ☆37Updated 6 years ago
• pabmont / pma
  Packed Memory Array
  ☆17Updated 11 years ago
• queryproc / optimizing-subgraph-queries-combining-binary-and-worst-case-optimal-joins
  Code for the paper titled "Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins". VLDB'19
  ☆32Updated last month
• cwida / teseo
  A C++ library for the analysis of structural dynamic graphs
  ☆27Updated 2 years ago
• HPCGraphAnalysis / PuLP
  ☆24Updated 2 years ago
• flashmobwalk / flashmob
  FlashMob is a shared-memory random walk system.
  ☆32Updated last year
• cmuparlay / pbbslib
  ☆25Updated 4 years ago
• wheatman / BP-Tree
  ☆13Updated 4 months ago
• reddragon / packed-memory-array
  A simple implementation of the packed memory array
  ☆19Updated 11 years ago
• AutomataLab / Subway
  Out-of-GPU-Memory Graph Processing with Minimal Data Transfer
  ☆53Updated 2 years ago
• ustcadsl / GraphWalker
  ☆18Updated 4 years ago
• concept-inversion / C-SAW
  A Framework for Graph Sampling and Random Walk on GPUs.
  ☆39Updated 3 months 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
• AutomataLab / Tigr
  Transforming Graphs for Efficient Irregular Graph Processing on GPUs
  ☆47Updated 2 years ago
• cwida / gfe_driver
  C++ driver to evaluate updates in dynamic structural graphs
  ☆16Updated 2 years ago
• mayerrn / hybrid_edge_partitioner
  ☆18Updated 3 years ago