Static graph challenge: Subgraph isomorphism

@article{Samsi2017StaticGC,
  title={Static graph challenge: Subgraph isomorphism},
  author={Siddharth Samsi and Vijay Gadepally and Michael B. Hurley and Michael Jones and Edward K. Kao and Sanjeev Mohindra and Paul Monticciolo and Albert Reuther and Steven Thomas Smith and William Song and Diane Staheli and Jeremy Kepner},
  journal={2017 IEEE High Performance Extreme Computing Conference (HPEC)},
  year={2017},
  pages={1-6}
}
The rise of graph analytic systems has created a need for ways to measure and compare the capabilities of these systems. Graph analytics present unique scalability difficulties. The machine learning, high performance computing, and visual analytics communities have wrestled with these difficulties for decades and developed methodologies for creating challenges to move these communities forward. The proposed Subgraph Isomorphism Graph Challenge draws upon prior challenges from machine learning… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 45 CITATIONS

Improving Scheduling for Irregular Applications with Logarithmic Radix Binning

VIEW 6 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Fast and Adaptive List Intersections on the GPU

VIEW 7 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

Linear Algebraic Formulation of Edge-centric K-truss Algorithms with Adjacency Matrices

VIEW 5 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Triangle Counting with A Multi-Core Computer

VIEW 7 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Exploring optimizations on shared-memory platforms for parallel triangle counting algorithms

VIEW 6 EXCERPTS
CITES BACKGROUND, RESULTS & METHODS
HIGHLY INFLUENCED

Skip the Intersection: Quickly Counting Common Neighbors on Shared-Memory Systems

VIEW 4 EXCERPTS
CITES BACKGROUND, METHODS & RESULTS
HIGHLY INFLUENCED

Collaborative (CPU + GPU) Algorithms for Triangle Counting and Truss Decomposition

VIEW 10 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Logarithmic Radix Binning and Vectorized Triangle Counting

VIEW 5 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

First look: Linear algebra-based triangle counting without matrix multiplication

VIEW 7 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

Quickly finding a truss in a haystack

VIEW 5 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

References

Publications referenced by this paper.
SHOWING 1-10 OF 27 REFERENCES

Graphing trillions of triangles

VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

A task-based linear algebra Building Blocks approach for scalable graph analytics

VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

Online; accessed 01-January-2017

  • C. Cortes Y. LeCun, C.J.C. Burges
  • The MNIST Database. http: //www.hpcchallenge.org,
  • 2017
VIEW 2 EXCERPTS

Streaming graph challenge: Stochastic block partition

VIEW 2 EXCERPTS

A CUDA implementation of the pagerank pipeline benchmark

VIEW 1 EXCERPT

Kokkos/Qthreads task-parallel approach to linear algebra based graph analytics

PageRank Pipeline Benchmark: Proposal for a Holistic System Benchmark for Big-Data Platforms

VIEW 1 EXCERPT

Graphulo: Linear Algebra Graph Kernels for NoSQL Databases

VIEW 1 EXCERPT

Parallel Triangle Counting and Enumeration Using Matrix Algebra

VIEW 1 EXCERPT