Practical Multi-threaded Graph Coloring Algorithms for Shared Memory Architecture

Singhal, Nandini; Peri, Sathya; Kalyanasundaram, Subrahmanyam

doi:10.1145/3007748.3018281

Search citation statements

Order By: Relevance

Paper Sections

Select...

Graph Coloring1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2017

2022

Publication Types

Select...

Other2

Book1

Article1

Relationship

Self Cite0

Independent4

Authors

Journals

Cited by 4 publications

(1 citation statement)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Heuristic algorithms can color a graph with no adjacent vertices assigned the same color, but they may require more colors than the optimal algorithm [15,16,17,18,19].…”

Section: Graph Coloringmentioning

confidence: 99%

Experience of Migrating a Parallel Graph Coloring Program from CUDA to SYCL

Jin

2022

View full text Add to dashboard Cite

We describe the experience of converting a CUDA implementation of a parallel graph coloring algorithm to SYCL. The goals are for our work to be useful to application and compiler developers by providing a detailed description of migration paths between CUDA and SYCL. We will describe how CUDA functions are mapped to SYCL functions. Evaluating the CUDA and SYCL implementations of the algorithm shows that the performance of SYCL and CUDA kernels are comparable over the test graph set on NVIDIA P100 and V100 GPUs. The SYCL program also allows for performance evaluation with the OpenCL and Level Zero interfaces and power profiling on an Intel GPU computing platform.

show abstract

“…Heuristic algorithms can color a graph with no adjacent vertices assigned the same color, but they may require more colors than the optimal algorithm [15,16,17,18,19].…”

Section: Graph Coloringmentioning

confidence: 99%