Algorithms for Balanced Graph Colorings with Applications in Parallel Computing

Graph coloring-in a generic sense-is used to identify subsets of independent tasks in parallel scientific computing applications. Traditional coloring heuristics aim to reduce the number of colors used as that number also corresponds to the number of parallel steps in the application. However, if th...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on parallel and distributed systems Vol. 28; no. 5; pp. 1240 - 1256
Main Authors:	Hao Lu, Halappanavar, Mahantesh, Chavarria-Miranda, Daniel, Gebremedhin, Assefaw H., Panyala, Ajay, Kalyanaraman, Ananth
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.05.2017 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Algorithms Balanced coloring Bipartite graph Color community detection Computation Context distance-1 coloring graph algorithms Graph coloring Heuristic Image color analysis parallel graph coloring Parallel processing partial distance-2 coloring Processor scheduling Tilera manycore architecture
ISSN:	1045-9219, 1558-2183
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!