Johannes Schneider
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.
- D. Bozdag, A. H. Gebremedhin, F. Manne, E. G. Boman, and Ü. V. Çatalyürek. A framework for scalable greedy coloring on distributed-memory parallel computers. J. Parallel Distrib. Comp., 2008. Google Scholar
Digital Library
- G. Karypis and V. Kumar. Multilevel k-way partitioning scheme for irregular graphs. J. Parallel Distrib. Comp., 48(1), 1998. Google ScholarDigital Library
- F. Kuhn and R. Wattenhofer. Constant-Time Distributed Dominating Set Approximation. In J. Distrib. Comp., 2005. Google ScholarDigital Library
- J. Schneider and R. Wattenhofer. A New Technique For Distributed Symmetry Breaking. In Symp. on Principles of Distributed Computing, 2010. Google ScholarDigital Library
Index Terms
- Brief announcement: efficient graph algorithms without synchronization
Recommendations
Brief announcement: performance potential of an easy-to-program PRAM-on-chip prototype versus state-of-the-art processor
SPAA '09: Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architecturesWe compare the Paraleap FPGA computer, a 64-processor hardware prototype of the PRAM-driven XMT architecture, with an Intel Core 2 Duo processor and show that Paraleap outperforms the Intel processor by up to 13.89x in terms of cycle counts. The ...
Brief announcement: a lower bound for depth-restricted work stealing
SPAA '09: Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architecturesWork stealing is a common technique used in the runtime schedulers of parallel languages such as Cilk and parallel libraries such as Intel Threading Building Blocks (TBB). Depth-restricted work stealing is a restriction of Cilk-like work stealing in ...
The b -chromatic number and f -chromatic vertex number of regular graphs
The b -chromatic number of a graph G , denoted by b ( G ) , is the largest positive integer k such that there exists a proper coloring for G with k colors in which every color class contains at least one vertex adjacent to some vertex in each of the ...
Comments