2018 · 11 citations · 18 references
ComputingComputer EngineeringComputer ScienceComputational GeometryParallel AlgorithmsParallel ComputingData ParallelismMemory Hierarchy OptimizationParallel Computing SystemsParallel Performance AnalysisShared-memory MultiprocessingShared-memory ParallelismParallel Geometric Data StructuresParallel Graph AlgorithmsShared MemoryShared Memory ManagementShared Memory OptimizationShared-memory AlgorithmsShared-memory Data StructuresShared-memory Graph Algorithms
As triangle counting is becoming a widely-used building block for a large amount of graph analytics applications, there is a growing need to make it run fast and scalable on large parallel systems. In this work we conduct a preliminary exploration on the optimizations of triangle counting algorithms on shared-memory system with large dataset.
18
XSEDE: Accelerating Scientific Discovery
John Towns, T.M. Cockerill, Maytal Dahan et al. · Computing in Science & Engineering · 2014 · 3.3K citations · Full text
Julian Shun, Guy E. Blelloch · 2013 · 808 citations
A lightweight infrastructure for graph analytics
Donald Nguyen, Andrew Lenharth, Keshav Pingali · 2013 · 589 citations · Full text
Narayanan Sundaram, Nadathur Satish, Md. Mostofa Ali Patwary et al. · Proceedings of the VLDB Endowment · 2015 · 292 citations
Julian Shun, Guy E. Blelloch · ACM SIGPLAN Notices · 2013 · 218 citations