High-performance and balanced parallel graph coloring on multicore platforms

Graph coloring is widely used to parallelize scientific applications by identifying subsets of independent tasks that can be executed simultaneously. Graph coloring assigns colors the vertices of a graph, such that no adjacent vertices have the same color. The number of colors used corresponds to th...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	The Journal of supercomputing Ročník 79; číslo 6; s. 6373 - 6421
Hlavní autoři:	Giannoula, Christina, Peppas, Athanasios, Goumas, Georgios, Koziris, Nectarios
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.04.2023 Springer Nature B.V
Témata:	Algorithms Apexes Compilers Computer Science Conflict resolution Costs Design Designers Graph coloring Graph theory Hardware Interpreters Linear algebra Parallel processing Performance enhancement Processor Architectures Programming Languages Resource utilization Scheduling Software Synchronism Multicore architectures Distance-1 coloring Parallel graph coloring High-performance computing Parallel graph algorithms Community detection Pagerank HPC Shared memory architectures Balanced graph coloring
ISSN:	0920-8542, 1573-0484
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!