A Synchronization-Avoiding Distance-1 Grundy Coloring Algorithm for Power-Law Graphs

In this paper, we propose a distributed, unordered, label-correcting distance-1 Grundy (vertex) coloring algorithm, namely, Distributed Control (DC) coloring algorithm. Our algorithm eliminates the need for vertex-centric barriers and global synchronization for color refinement, relying only on atom...

Full description

Bibliographic Details

Published in:	Proceedings / International Conference on Parallel Architectures and Compilation Techniques pp. 421 - 432
Main Authors:	Firoz, Jesun Sahariar, Zalewski, Marcin, Lumsdaine, Andrew
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.09.2019
Subjects:	Asynchronous algorithms Color Decentralized control Distributed graph algorithms Graph coloring Heuristic algorithms Message systems Parallel processing Synchronization Task analysis
ISSN:	2641-7936
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!