cmu-sei / gbtl
GraphBLAS Template Library (GBTL): C++ graph algorithms and primitives using semiring algebra as defined at graphblas.org
☆133Updated last year
Alternatives and similar repositories for gbtl:
Users that are interested in gbtl are comparing it to the libraries listed below
- High-Performance Linear Algebra-based Graph Primitives on GPUs☆222Updated 3 years ago
- The Combinatorial BLAS (CombBLAS) is an extensible distributed-memory parallel graph library offering a small but powerful set of linear …☆71Updated last month
- Hornet data structure for sparse dynamic graphs and matrices☆82Updated 5 years ago
- This is a library plus a test harness for collecting algorithms that use the GraphBLAS. For test coverage reports, see https://graphblas…☆237Updated this week
- GraphMat graph analytics framework☆101Updated 2 years ago
- Scalable High-performance Algorithms and Data-structures☆128Updated last month
- Reference implementation of the draft C++ GraphBLAS specification.☆30Updated last month
- A Distributed Multi-GPU System for Fast Graph Processing☆65Updated 6 years ago
- Resources on the GraphBLAS standard for graph algorithms in the language of linear algebra☆193Updated 5 months ago
- Asynchronous Multi-GPU Programming Framework☆45Updated 3 years ago
- Medusa: Building GPU-based Parallel Sparse Graph Applications with Sequential C/C++ Code☆61Updated 4 years ago
- Home of ALP/GraphBLAS and ALP/Pregel, featuring shared- and distributed-memory auto-parallelisation of linear algebraic and vertex-centri…☆25Updated last month
- ☆68Updated 4 years ago
- MPI+OpenMP implementation of Louvain method for Graph Community Detection, with a number of parallel heuristics/approximate computing tec…☆27Updated last year
- The Berkeley Container Library☆124Updated last year
- A CUDA-based multi-GPU vertex-centric graph processing framework based on Warp Segmentation and Vertex Refinement techniques.☆10Updated 8 years ago
- CuSha is a CUDA-based vertex-centric graph processing framework that uses G-Shards and CW representations.☆52Updated 9 years ago
- A DSL for efficient Graph Analysis☆101Updated 6 years ago
- Artifact of paper "Exploiting Recent SIMD Architectural Advances for Irregular Applications"☆11Updated 8 years ago
- This repository contains the cuStinger data structure used for dynamic graph representation.☆19Updated 6 years ago
- A fast and highly scalable GPU dynamic memory allocator☆104Updated 10 years ago
- 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
- LonestarGPU: Irregular algorithms parallelized for GPUs☆34Updated 5 years ago
- Artifact for PPoPP 2018 paper "Making Pull-Based Graph Processing Performant"☆23Updated 4 years ago
- ☆81Updated 7 years ago
- Dynamic data structure for sparse graphs.☆29Updated 11 months ago
- Persistent memory allocator for data-centric analytics☆54Updated 2 weeks ago
- SuiteSparse graph algorithms in the language of linear algebra. For production: (default) STABLE branch. Code development: ask me for t…☆372Updated this week
- A NUMA-aware Graph-structured Analytics Framework☆42Updated 6 years ago
- Edge-centric Graph Processing System using Streaming Partitions☆82Updated 7 years ago