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

Full description

Saved in:

Bibliographic Details
Published in:	The Journal of supercomputing Vol. 79; no. 6; pp. 6373 - 6421
Main Authors:	Giannoula, Christina, Peppas, Athanasios, Goumas, Georgios, Koziris, Nectarios
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.04.2023 Springer Nature B.V
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!