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
  ☆28Updated 2 years ago
• datourat / Gorder
  ☆37Updated 6 years ago
• xiangyuzhi / GraphStorageExp
  ☆11Updated last year
• wheatman / Packed-Compressed-Sparse-Row
  Dynamic data structure for sparse graphs.
  ☆31Updated last year
• ldhulipala / aspen
  Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees
  ☆88Updated 6 years ago
• the-data-lab / GraphOne
  "GraphOne: A Data Store for Real-time Analytics on Evolving Graphs", Usenix FAST'19
  ☆59Updated 4 years ago
• concept-inversion / C-SAW
  A Framework for Graph Sampling and Random Walk on GPUs.
  ☆38Updated 6 months ago
• guowentian / SubgraphMatchGPU
  ☆31Updated 4 years ago
• spcl / gms
  GraphMineSuite (GMS): a benchmarking suite for graph mining algorithms such as graph pattern matching or graph learning
  ☆26Updated 4 years ago
• Xtra-Computing / ForkGraph
  ☆17Updated 3 years ago
• stanford-mast / Grazelle-PPoPP18
  Artifact for PPoPP 2018 paper "Making Pull-Based Graph Processing Performant"
  ☆23Updated 5 years ago
• DIR-LAB / VCSR
  Official code of our work, VCSR: Mutable CSR Graph Format Using Vertex-Centric Packed Memory Array [CCGrid 2022].
  ☆12Updated 3 years ago
• ParAlg / gbbs
  GBBS: Graph Based Benchmark Suite
  ☆212Updated 2 weeks ago
• cmuparlay / pbbslib
  ☆25Updated 4 years ago
• flashmobwalk / flashmob
  FlashMob is a shared-memory random walk system.
  ☆32Updated 2 years ago
• pabmont / pma
  Packed Memory Array
  ☆17Updated 11 years ago
• thu-pacman / GraphPi
  ☆40Updated 3 years ago
• Froot-NetSys / Arya
  Arya: Arbitrary Graph Pattern Mining with Decomposition-based Sampling
  ☆13Updated last year
• 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
• cwida / gfe_driver
  C++ driver to evaluate updates in dynamic structural graphs
  ☆17Updated 3 years ago
• AutomataLab / Tigr
  Transforming Graphs for Efficient Irregular Graph Processing on GPUs
  ☆48Updated 2 years ago
• desert0616 / gpma_demo
  Source code for the paper: Accelerating Dynamic Graph Analytics on GPUs
  ☆27Updated 2 years ago
• cwida / teseo
  A C++ library for the analysis of structural dynamic graphs
  ☆27Updated 3 years ago
• jmalicevic / EverythingGraph
  A platform to evaluate techniques used in multicore graph processing.
  ☆37Updated 6 years ago
• AutomataLab / Subway
  Out-of-GPU-Memory Graph Processing with Minimal Data Transfer
  ☆55Updated 2 years ago
• reddragon / packed-memory-array
  A simple implementation of the packed memory array
  ☆20Updated 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
  ☆33Updated 3 months ago
• rstream-system / RStream
  ☆25Updated 2 years ago
• PerFuchs / gfe_driver
  C++ driver to evaluate updates and analytics on dynamic structural graphs
  ☆27Updated 3 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