2017 · 39 citations · 15 references
ComputingComputer ScienceHigh-performance ComputingAlgorithmsParallel AlgorithmsParallel ComputingAlgorithm AnalysisData ParallelismGraph AlgorithmsGraphics Processing Unit ArchitectureGraphics Processing Unit ComputingParallel Computing SystemsAbstractionGraph AbstractionGraph ProcessingParallel Combinatorial GeometryParallel Geometric Graph AlgorithmsParallel Graph Algorithms
We describe CPU and GPU implementations of parallel triangle-counting and k-truss identification in the Galois and IrGL systems. Both systems are based on a graph-centric abstraction called the operator formulation of algorithms. Depending on the input graph, our implementations are two to three orders of magnitude faster than the reference implementations provided by the IEEE HPEC static graph challenge.
15
{SNAP Datasets}: {Stanford} Large Network Dataset Collection
Jure Leskovec, Andrej Krevl · 2014 · 2.8K citations
A lightweight infrastructure for graph analytics
Donald Nguyen, Andrew Lenharth, Keshav Pingali · 2013 · 589 citations · Full text
The tao of parallelism in algorithms
Keshav Pingali, Donald Nguyen, Milind Kulkarni et al. · ACM SIGPLAN Notices · 2011 · 317 citations
The tao of parallelism in algorithms
Keshav Pingali, Donald Nguyen, Milind Kulkarni et al. · 2011 · 230 citations
Lonestar: A suite of parallel irregular programs
Milind Kulkarni, Martin Burtscher, Călin Caşcaval et al. · 2009 · 184 citations