Efficient distributed breadth-first search algorithm

Authors:
S. A. M. Makki
Affiliations:
Department of Computer Science, University of Queensland, Brisbane, Queensland 4072, Australia
Venue:
Computer Communications
Year:
1996

Citing 7
Cited 1

A new distributed algorithm to find breadth first search trees

IEEE Transactions on Information Theory
Algorithms for some graph problems on a distributed computational model

Information Sciences: an International Journal
Randomized distributed shortest paths algorithms

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
A Single Source Shortest Path Algorithm for a Planar Distributed Network

STACS '85 Proceedings of the 2nd Symposium of Theoretical Aspects of Computer Science
Graph Traversal Techniques and the Maximum Flow Problem in Distributed Computation

IEEE Transactions on Software Engineering
Distributed BFS algorithms

SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Network decomposition and locality in distributed computation

SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science

Using tadpoles to reduce memory and communication requirements for exhaustive, breadth-first search using distributed computers

Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures

Quantified Score

Hi-index	0.24

Visualization

Abstract

We present a more efficient Distributed Breadth-First Search algorithm for an asynchronous communication network. In the best case, the algorithm only uses 2(|V| - 1) messages and 2|l| units of time, where |V| is the number of sites in the network and |l| is the maximum level assigned to any node. In the worst case, the algorithm also has better complexity than previous algorithms. The improvement over previous algorithms is achieved by more sophisticated synchronization.