Triangle Counting Performance

  title={ Triangle Counting Performance},
  author={S. Samsi and J. Kepner and V. Gadepally and M. Hurley and Michael Jones and E. Kao and S. Mohindra and A. Reuther and S. Smith and William S. Song and D. Staheli and P. Monticciolo},
  journal={2020 IEEE High Performance Extreme Computing Conference (HPEC)},
The rise of graph analytic systems has created a need for new ways to measure and compare the capabilities of graph processing systems. The MIT/Amazon/IEEE Graph Challenge has been developed to provide a well-defined community venue for stimulating research and highlighting innovations in graph analysis software, hardware, algorithms, and systems. provides a wide range of pre-parsed graph data sets, graph generators, mathematically defined graph algorithms, example serial… Expand

Figures and Tables from this paper

Leveraging Linear Algebra to Count and Enumerate Simple Subgraphs
This paper explores and defines a linear algebra methodology for performing exact subgraph counting and matching for 4-vertex subgraphs excluding the clique and demonstrates that the linear algebra formulation leverages path aggregation which allows it to be up 2x to 5x more efficient in traversing the search space and compressing the results as compared to tree-based subgraph matching techniques. Expand
Labeled Triangle Indexing for Efficiency Gains in Distributed Interactive Subgraph Search††This work was performed under the auspices of the U.S. Department of Energy by Lawrence Livermore National Laboratory under Contract DE-AC52-07NA27344 (LLNL-CONF-814976). Experiments were performed at the Live
The feasibility of indexing the background graph to accelerate the checking of non-local constraints, the most expensive phase of pruning, is explored and it is demonstrated that indexing labeled triangle (i.e., a 3-Cycle) participation is a valuable acceleration technique. Expand
Towards an Objective Metric for the Performance of Exact Triangle Count
This work derives a metric that captures how certain techniques employed in many implementations improve performance and can be used to evaluate and compare multiple approaches for triangle counting, using a SIMD approach as a case study against a scalar baseline. Expand


SHOWING 1-10 OF 128 REFERENCES Raising the Bar on Graph Analytic Performance
Graph Challenge 2017 received 22 submissions by 111 authors from 36 organizations and highlighted graph analytic innovations in hardware, software, algorithms, systems, and visualization that produced many comparable performance measurements that can be used for assessing the current state of the art of graph analysis. Expand
Graphs, Matrices, and the GraphBLAS: Seven Good Reasons
The GraphBLAS mathematically defines a core set of matrix-based graph operations that can be used to implement a wide class of graph algorithms in a wide range of programming environments. Expand
Graphing trillions of triangles
A scalable triangle listing algorithm in the MapReduce model will be presented followed by a description of the experiments with that algorithm that led to the current largest and fastest triangle listing benchmarks to date. Expand
On Large-Scale Graph Generation with Validation of Diverse Triangle Statistics at Edges and Vertices
This work shows that many flavors of triangle participation can be cheaply calculated while generating a Kronecker product graph, and derive the respective formulas when A and B have self loops, which boosts the triangle counts for the associated vertices/edges in C. Expand
Static graph challenge: Subgraph isomorphism
The proposed Subgraph Isomorphism Graph Challenge draws upon prior challenges from machine learning, high performance computing, and visual analytics to create a graph challenge that is reflective of many real-world graph analytics processing systems. Expand
Triangle counting for scale-free graphs at scale in distributed memory
  • R. Pearce
  • Computer Science
  • 2017 IEEE High Performance Extreme Computing Conference (HPEC)
  • 2017
This work-in-progress builds on existing heuristics for pruning the number of wedge checks by ordering based on degree, and presents a brief experimental evaluation on two large real scale-free graphs: a 128B edge web-graph and a 1.4B edge twitter follower graph, and a weak scaling study on synthetic Graph500 RMAT graphs up to 274.9 billion edges. Expand
Mathematical foundations of the GraphBLAS
This paper provides an introduction to the mathematics of the GraphBLAS, a core set of matrix-based graph operations that can be used to implement a wide class of graph algorithms in a wide range of programming environments. Expand
Fast Triangle Counting Using Cilk
This paper develops an SpGEMM implementation that relies on a highly efficient, work-stealing, multithreaded runtime, and presents analysis of the scaling of the triangle counting implementation as the graph sizes increase using both synthetic and real graphs from the graph challenge data set. Expand
Fast linear algebra-based triangle counting with KokkosKernels
This paper addresses the IEEE HPEC Static Graph Challenge problem of triangle counting, focusing on obtaining the best parallel performance on a single multicore node, using a linear algebra-based approach that has grown out of work related to miniTri data analytics miniapplication and efforts to pose graph algorithms in the language of linear algebra. Expand
Scalable Triangle Counting on Distributed-Memory Systems
This work proposes a novel, hybrid, parallel triangle counting algorithm based on its linear algebra formulation that achieves the fastest time on the 1.4B edge real-world twitter graph, which is 3.217 seconds, on 1,092 cores. Expand