The GAP benchmark suite
We present a graph processing benchmark suite with the goal of helping to standardize
graph processing evaluations. Fewer differences between graph processing evaluations will …
graph processing evaluations. Fewer differences between graph processing evaluations will …
Ligra: a lightweight graph processing framework for shared memory
J Shun, GE Blelloch - Proceedings of the 18th ACM SIGPLAN …, 2013 - dl.acm.org
There has been significant recent interest in parallel frameworks for processing graphs due
to their applicability in studying social networks, the Web graph, networks in biology, and …
to their applicability in studying social networks, the Web graph, networks in biology, and …
Julienne: A framework for parallel graph algorithms using work-efficient bucketing
Existing graph-processing frameworks let users develop efficient implementations for many
graph problems, but none of them support efficiently bucketing vertices, which is needed for …
graph problems, but none of them support efficiently bucketing vertices, which is needed for …
Mapreduce in MPI for large-scale graph algorithms
SJ Plimpton, KD Devine - Parallel Computing, 2011 - Elsevier
We describe a parallel library written with message-passing (MPI) calls that allows
algorithms to be expressed in the MapReduce paradigm. This means the calling program …
algorithms to be expressed in the MapReduce paradigm. This means the calling program …
Distributed socialite: A datalog-based language for large-scale graph analysis
Large-scale graph analysis is becoming important with the rise of world-wide social network
services. Recently in SociaLite, we proposed extensions to Datalog to efficiently and …
services. Recently in SociaLite, we proposed extensions to Datalog to efficiently and …
Snap, small-world network analysis and partitioning: An open-source parallel graph framework for the exploration of large-scale networks
We present SNAP (Small-world Network Analysis and Partitioning), an open-source graph
framework for exploratory study and partitioning of large-scale networks. To illustrate the …
framework for exploratory study and partitioning of large-scale networks. To illustrate the …
Scalable single source shortest path algorithms for massively parallel systems
We consider the single-source shortest path (SSSP) problem: given an undirected graph
with integer edge weights and a source vertex, find the shortest paths from to all other …
with integer edge weights and a source vertex, find the shortest paths from to all other …
Parallel breadth-first search and exact shortest paths and stronger notions for approximate distances
This paper introduces stronger notions for approximate single-source shortest-path
distances and gives simple reductions to compute them from weaker standard notions of …
distances and gives simple reductions to compute them from weaker standard notions of …
Finding all-pairs shortest path for a large-scale transportation network using parallel Floyd-Warshall and parallel Dijkstra algorithms
A Pradhan, G Mahinthakumar - Journal of computing in civil …, 2013 - ascelibrary.org
Parallel computing has become a powerful approach for solving real-time decisions about
large-scale, computing-intensive transportation problems. A frequently encountered …
large-scale, computing-intensive transportation problems. A frequently encountered …
Analysis of average shortest‐path length of scale‐free network
G Mao, N Zhang - Journal of Applied Mathematics, 2013 - Wiley Online Library
Computing the average shortest‐path length of a large scale‐free network needs much
memory space and computation time. Hence, parallel computing must be applied. In order to …
memory space and computation time. Hence, parallel computing must be applied. In order to …