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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on parallel and distributed systems Ročník 28; číslo 5; s. 1240 - 1256
Hlavní autoři:	Hao Lu, Halappanavar, Mahantesh, Chavarria-Miranda, Daniel, Gebremedhin, Assefaw H., Panyala, Ajay, Kalyanaraman, Ananth
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York IEEE 01.05.2017 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!