Parallel graph coloring algorithms for distributed GPU environments
- 5 February 2022
- journal article
- research article
- Published by Elsevier in Parallel Computing
- Vol. 110
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- National Nuclear Security Administration
- National Science Foundation (17-SC-20-SC, 1828083)
- U.S. Department of Energy (DE-NA-0003525)
This publication has 12 references indexed in Scilit:
- Kokkos: Enabling manycore performance portability through polymorphic memory access patternsJournal of Parallel and Distributed Computing, 2014
- ColPackACM Transactions on Mathematical Software, 2013
- Graph coloring algorithms for multi-core and massively multithreaded architecturesParallel Computing, 2012
- Evaluating graph coloring on GPUsACM SIGPLAN Notices, 2011
- A framework for scalable greedy coloring on distributed-memory parallel computersJournal of Parallel and Distributed Computing, 2008
- An overview of the Trilinos projectACM Transactions on Mathematical Software, 2005
- What Color Is Your Jacobian? Graph Coloring for Computing DerivativesSIAM Review, 2005
- A Parallel Graph Coloring HeuristicSIAM Journal on Scientific Computing, 1993
- New methods to color the vertices of a graphCommunications of the ACM, 1979
- An application of graph coloring to printed circuit testingIEEE Transactions on Circuits and Systems, 1976