Jaccard Coefficients as a Potential Graph Benchmark
Author:
- Peter M. KoggePKPeter M. Kogge
- 1 May 2016
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 921-928
Abstract
The processing of graphs is of increasing importance in many applications, with the size of such graphs growing rapidly. As with scientific computing, there is a growing need to understand the relationship between system architectures and graph algorithms, especially as both the scale of the system and the size of the graph increase. To date there is one such graph benchmark that has several hundred comparative reports available, namely Breadth First Search, which has over the last few years fueled new algorithms that have improved typical performance very significantly. This paper suggests an additional benchmark based on the computation of neighborhoods and Jaccard coefficients that is of both a different intrinsic complexity and can be recast in multiple ways that may be suitable for different classes of real-world applications.Keywords
This publication has 13 references indexed in Scilit:
- When will we have an exascale supercomputer? [News]IEEE Spectrum, 2014
- HPGMG 1.0: A Benchmark for Ranking High Performance Computing Systems2014
- How Well Do Graph-Processing Platforms Perform? An Empirical Performance Evaluation and Analysis2014
- Traversing Trillions of Edges in Real Time: Graph Exploration on Large-Scale Parallel Machines2014
- Exascale Computing Trends: Adjusting to the "New Normal"' for Computer ArchitectureComputing in Science & Engineering, 2013
- Comparative performance analysis of a Big Data NORA problem on a variety of architectures2013
- Direction-optimizing Breadth-First Search2012
- Graph Algorithms in the Language of Linear Algebra2011
- R-MAT: A Recursive Model for Graph Mining2004
- Performance of various computers using standard linear equations softwareACM SIGARCH Computer Architecture News, 1992