Fast Approximate Distance Queries in Unweighted Graphs Using Bounded Asynchrony

  title={Fast Approximate Distance Queries in Unweighted Graphs Using Bounded Asynchrony},
  author={Adam Fidel and Francisco Coral-Sabido and Colton Riedel and Nancy M. Amato and Lawrence Rauchwerger},
We introduce a new parallel algorithm for approximate breadth-first ordering of an unweighted graph by using bounded asynchrony to parametrically control both the performance and error of the algorithm. This work is based on the \(k\)-level asynchronous (KLA) paradigm that trades expensive global synchronizations in the level-synchronous model for local synchronizations in the asynchronous model, which may result in redundant work. Instead of correcting errors introduced by asynchrony and… 
V-Combiner: speeding-up iterative graph processing on a shared-memory platform with vertex merging
V-Combiner is a deterministic, fast, and application-transparent technique to construct an approximate graph to enable faster execution and shows a better performance-accuracy trade-off than the existing sparsification and k-core techniques.
GraphGuess: Approximate Graph Processing System with Adaptive Correction
A vertex-centric processing system based on GraphGuess, where it allows the user to trade off accuracy for better performance, and experimental studies show that using GraphGu Guess can significantly reduce the processing time for large scale graphs while maintaining high accuracy.
Provably optimal parallel transport sweeps on semi-structured grids


KLA: A new algorithmic paradigm for parallel graph computations
Results of an implementation of KLA in the STAPL Graph Library show excellent scalability on up to 96K cores and improvements of 10× or more over level-synchronous and asynchronous versions for graph algorithms such as breadth-first search, PageRank, k-core decomposition and others on certain classes of real-world graphs.
High-probability parallel transitive closure algorithms
The algorithm for transitive closure of an n-node directed graph in O(log2 n) time on an EREW-PRAM, using n3/log n processors, is presented, and it is shown how to do “breadth-first-search” with the same performance as the algorithm is able to achieve for single-source transitiveclosure.
Distributed approximation algorithms for weighted shortest paths
The time complexity of approximating weighted (undirected) shortest paths on distributed networks with a O (log n) bandwidth restriction on edges is studied to find a sublinear-time algorithm with almost optimal solution.
An Algorithmic Approach to Communication Reduction in Parallel Graph Algorithms
This work presents an approach to transparently (without programmer intervention) allow fine-grained graph algorithms to utilize algorithmic communication reduction optimizations and presents an optimization for small-world scale-free graphs wherein hub vertices are represented in a similar hierarchical manner, which is exploited to increase parallelism and reduce communication.
Space and Time Efficient Parallel Graph Decomposition, Clustering, and Diameter Approximation
This work develops a novel parallel decomposition strategy for unweighted, undirected graphs, based on growing disjoint connected clusters from batches of centers progressively selected from yet uncovered nodes, and presents two important applications of this strategy: clustering approximation and diameter approximation.
Multithreaded Asynchronous Graph Traversal for In-Memory and Semi-External Memory
  • R. Pearce, M. Gokhale, N. Amato
  • Computer Science
    2010 ACM/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis
  • 2010
This work presents a novel asynchronous approach to compute Breadth-First-Search (BFS), Single-Source-Shortest-Paths, and Connected Components for large graphs in shared memory to overcome data latencies and provide significant speedup over alternative approaches.
Pregel: a system for large-scale graph processing
A model for processing large graphs that has been designed for efficient, scalable and fault-tolerant implementation on clusters of thousands of commodity computers, and its implied synchronicity makes reasoning about programs easier.
Parallel breadth-first search on distributed memory systems
  • A. Buluç, Kamesh Madduri
  • Computer Science
    2011 International Conference for High Performance Computing, Networking, Storage and Analysis (SC)
  • 2011
This work presents two highly-tuned parallel approaches for Breadth-First Search on large parallel systems: a level-synchronous strategy that relies on a simple vertex-based partitioning of the graph, and a two-dimensional sparse matrix partitioning-based approach that mitigates parallel communication overhead.
Toward a Distance Oracle for Billion-Node Graphs
This paper conducts extensive experiments on both real networks and synthetic networks to show that the feasibility of building distance oracles of affordable cost and efficiently answer shortest distance queries even for billion-node graphs is studied.
Fast and accurate estimation of shortest paths in large graphs
This paper presents a scalable sketch-based index structure that not only supports estimation of node distances, but also computes corresponding shortest paths themselves, leading to near-exact shortest-path approximations in real world graphs.