Brief announcement: efficient graph algorithms without synchronization

Authors:
Johannes Schneider;Roger Wattenhofer
Affiliations:
ETH, Zurich, Switzerland;ETH, Zurich, Switzerland
Venue:
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Year:
2010

Citing 4
Cited 0

Multilevel k-way partitioning scheme for irregular graphs

Journal of Parallel and Distributed Computing
Constant-time distributed dominating set approximation

Distributed Computing
A framework for scalable greedy coloring on distributed-memory parallel computers

Journal of Parallel and Distributed Computing
A new technique for distributed symmetry breaking

Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give a graph decomposition technique that creates entirely independent subproblems for graph problems such as coloring and dominating sets that can be solved without synchronization on a distributed memory system. For coloring, evaluation shows a performance gain of a factor 3 to 5 at the price of using more colors.