sbeamer / gapbsLinks
GAP Benchmark Suite
☆378Updated 9 months ago
Alternatives and similar repositories for gapbs
Users that are interested in gapbs are comparing it to the libraries listed below
Sorting:
- Graph500 reference implementations☆181Updated 3 years ago
- A Comprehensive Benchmark Suite for Graph Computing☆70Updated 6 years ago
- Multi-threaded Large-Scale RMAT Graph Generator.☆132Updated 2 years ago
- A platform to evaluate techniques used in multicore graph processing.☆37Updated 7 years ago
- Galois: C++ library for multi-core and multi-node parallelization☆344Updated last year
- Edge-centric Graph Processing System using Streaming Partitions☆82Updated 7 years ago
- Asynchronous Multi-GPU Programming Framework☆48Updated 4 years ago
- Out-of-GPU-Memory Graph Processing with Minimal Data Transfer☆58Updated 3 years ago
- GBBS: Graph Based Benchmark Suite☆214Updated 2 weeks ago
- A Shared Memory Multithreaded Graph Benchmark Suite for Multicores☆36Updated 7 months ago
- ☆24Updated 2 years ago
- Transforming Graphs for Efficient Irregular Graph Processing on GPUs☆51Updated 3 years ago
- GraphMat graph analytics framework☆104Updated 2 years ago
- Ligra: A Lightweight Graph Processing Framework for Shared Memory☆484Updated last year
- CuSha is a CUDA-based vertex-centric graph processing framework that uses G-Shards and CW representations.☆53Updated 10 years ago
- ☆39Updated 6 years ago
- Out-of-core graph processing on a single machine.☆130Updated 7 years ago
- Graph Pattern Mining☆93Updated last year
- Enterprise: Breadth-First Graph Traversal on GPUs. SC'15.☆32Updated 8 years ago
- Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees☆90Updated 6 years ago
- SIMD-X: Programming and Processing of Graph Algorithms on GPUs [USENIX ATC '19]☆22Updated 5 years ago
- ☆47Updated 3 years ago
- FlashMob is a shared-memory random walk system.☆32Updated 2 years ago
- Graphene: Fine-Grained IO Management for Graph Computing. FAST'17☆20Updated 8 years ago
- New version of pbbs benchmarks☆96Updated last month
- A NUMA-aware Graph-structured Analytics Framework☆44Updated 7 years ago
- the Stanford Transactional Applications for Multi-Processing; a benchmark suite for transactional memory research☆44Updated 4 years ago
- Pointer-chasing memory benchmark (forked from Doug Pase's code).☆59Updated 12 years ago
- ☆29Updated 8 years ago
- Codes of the paper "Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions" that was published in SIGMOD 2018. Authors…☆31Updated 6 years ago