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

DOI10.1016/J.JPDC.2007.08.002MaRDI QIDQ436752zbMATH OpenOpenAlexFDO

Authors Doruk Bozdağ, Fredrik Manne, E. G. Boman, Ümit V. Çatalyürek, Assefaw H. Gebremedhin

Publication date 26 July 2012

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jpdc.2007.08.002

zbMATH Keywords

scientific computinggraph coloringparallel algorithmsdistributed-memory computersexperimental algorithmics

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Parallel algorithms in computer science (68W10) Distributed systems (68M14)

Recommendations

• scientific article; zbMATH DE number 1863545
• A Parallel Graph Coloring Heuristic
• scientific article; zbMATH DE number 17674
• scientific article; zbMATH DE number 956853
• Graph coloring on coarse grained multicomputers

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1330033 (Why is no real title available?)
• scientific article; zbMATH DE number 1863545 (Why is no real title available?)
• scientific article; zbMATH DE number 2090688 (Why is no real title available?)
• scientific article; zbMATH DE number 2116061 (Why is no real title available?)
• A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
• A Parallel Graph Coloring Heuristic
• A Simple Parallel Algorithm for the Maximal Independent Set Problem
• An experimental analysis of simple, distributed vertex coloring algorithms
• Benchmarking optimization software with performance profiles.
• Estimation of Sparse Jacobian Matrices and Graph Coloring Blems
• Graph coloring on coarse grained multicomputers
• Heuristic for rapidly four-coloring large planar graphs
• ILUM: A Multi-Elimination ILU Preconditioner for General Sparse Matrices
• Scalable iterative solution of sparse linear systems
• Simple distributed +1-coloring of graphs
• What Color Is Your Jacobian? Graph Coloring for Computing Derivatives

Cited in

(9)

• Parallel Performance Model for Vertex Repositioning Algorithms and Application to Mesh Partitioning
• scientific article; zbMATH DE number 1863545 (Why is no real title available?)
• Vertex coloring of a graph for memory constrained scenarios
• Graph coloring using peer-to-peer networks
• scientific article; zbMATH DE number 1696533 (Why is no real title available?)
• Parallel computational optimization in operations research: a new integrative framework, literature review and research directions
• Distributed-memory parallel algorithms for distance-2 coloring and related problems in derivative computation
• Iterative computations with ordered read-write locks
• Evaluation of serial and parallel shared-memory distance-1 graph coloring algorithms

Describes a project that uses

Uses Software

• BSPedupack
• Zoltan
• ILUM

This page was built for publication: A framework for scalable greedy coloring on distributed-memory parallel computers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q436752)