{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T07:17:40Z","timestamp":1782371860531,"version":"3.54.5"},"reference-count":32,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2022,5,1]],"date-time":"2022-05-01T00:00:00Z","timestamp":1651363200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2022,5,1]],"date-time":"2022-05-01T00:00:00Z","timestamp":1651363200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2023,2,5]],"date-time":"2023-02-05T00:00:00Z","timestamp":1675555200000},"content-version":"am","delay-in-days":280,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2022,5,1]],"date-time":"2022-05-01T00:00:00Z","timestamp":1651363200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2022,5,1]],"date-time":"2022-05-01T00:00:00Z","timestamp":1651363200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2022,5,1]],"date-time":"2022-05-01T00:00:00Z","timestamp":1651363200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2022,5,1]],"date-time":"2022-05-01T00:00:00Z","timestamp":1651363200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,5,1]],"date-time":"2022-05-01T00:00:00Z","timestamp":1651363200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/100006168","name":"National Nuclear Security Administration","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006168","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["17-SC-20-SC"],"award-info":[{"award-number":["17-SC-20-SC"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1828083"],"award-info":[{"award-number":["1828083"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000015","name":"U.S. Department of Energy","doi-asserted-by":"publisher","award":["DE-NA-0003525"],"award-info":[{"award-number":["DE-NA-0003525"]}],"id":[{"id":"10.13039\/100000015","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Parallel Computing"],"published-print":{"date-parts":[[2022,5]]},"DOI":"10.1016\/j.parco.2022.102896","type":"journal-article","created":{"date-parts":[[2022,2,5]],"date-time":"2022-02-05T02:39:49Z","timestamp":1644028789000},"page":"102896","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":11,"special_numbering":"C","title":["Parallel graph coloring algorithms for distributed GPU environments"],"prefix":"10.1016","volume":"110","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6591-8785","authenticated-orcid":false,"given":"Ian","family":"Bogle","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"George M.","family":"Slota","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Erik G.","family":"Boman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Karen D.","family":"Devine","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sivasankaran","family":"Rajamanickam","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/j.parco.2022.102896_b1","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1145\/359094.359101","article-title":"New methods to color the vertices of a graph","volume":"22","author":"Br\u00e9laz","year":"1979","journal-title":"Commun. ACM"},{"key":"10.1016\/j.parco.2022.102896_b2","series-title":"2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS)","first-page":"892","article-title":"Parallel graph coloring for manycore architectures","author":"Deveci","year":"2016"},{"issue":"4","key":"10.1016\/j.parco.2022.102896_b3","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1016\/j.jpdc.2007.08.002","article-title":"A framework for scalable greedy coloring on distributed-memory parallel computers","volume":"68","author":"Bozda\u011f","year":"2008","journal-title":"J. Parallel Distrib. Comput."},{"key":"10.1016\/j.parco.2022.102896_b4","series-title":"SCCS-666","first-page":"1","article-title":"A comparison of parallel graph coloring algorithms","author":"Allwright","year":"1995"},{"issue":"1","key":"10.1016\/j.parco.2022.102896_b5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2513109.2513110","article-title":"ColPack: Software for graph coloring and related problems in scientific computing","volume":"40","author":"Gebremedhin","year":"2013","journal-title":"ACM Trans. Math. Softw."},{"issue":"10","key":"10.1016\/j.parco.2022.102896_b6","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1109\/TCS.1976.1084138","article-title":"An application of graph coloring to printed circuit testing","volume":"23","author":"Garey","year":"1976","journal-title":"IEEE Trans. Circuits Syst."},{"issue":"4","key":"10.1016\/j.parco.2022.102896_b7","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1137\/S0036144504444711","article-title":"What color is your Jacobian? Graph coloring for derivatives","volume":"47","author":"Gebremedhin","year":"2005","journal-title":"SIAM Rev."},{"issue":"1","key":"10.1016\/j.parco.2022.102896_b8","article-title":"An introduction to algorithmic differentiation","volume":"10","author":"Gebremedhin","year":"2020","journal-title":"Wiley Interdiscip. Rev.: Data Min. Knowl. Discov."},{"issue":"12","key":"10.1016\/j.parco.2022.102896_b9","doi-asserted-by":"crossref","first-page":"3202","DOI":"10.1016\/j.jpdc.2014.07.003","article-title":"Kokkos: Enabling manycore performance portability through polymorphic memory access patterns","volume":"74","author":"Edwards","year":"2014","journal-title":"J. Parallel Distrib. Comput."},{"key":"10.1016\/j.parco.2022.102896_b10","series-title":"Kokkos kernels","year":"2017"},{"issue":"3","key":"10.1016\/j.parco.2022.102896_b11","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1145\/1089014.1089021","article-title":"An overview of the Trilinos project","volume":"31","author":"Heroux","year":"2005","journal-title":"ACM Trans. Math. Softw."},{"key":"10.1016\/j.parco.2022.102896_b12","series-title":"2020 IEEE\/ACM 10th Workshop on Irregular Applications: Architectures and Algorithms (IA3)","first-page":"54","article-title":"Distributed memory graph coloring algorithms for multiple GPUs","author":"Bogle","year":"2020"},{"issue":"12","key":"10.1016\/j.parco.2022.102896_b13","doi-asserted-by":"crossref","first-page":"1131","DOI":"10.1002\/1096-9128(200010)12:12<1131::AID-CPE528>3.0.CO;2-2","article-title":"Scalable parallel graph coloring algorithms","volume":"12","author":"Gebremedhin","year":"2000","journal-title":"Concurrency, Pract. Exp."},{"key":"10.1016\/j.parco.2022.102896_b14","series-title":"SC20: International Conference for High Performance Computing, Networking, Storage and Analysis","first-page":"1","article-title":"High-performance parallel graph coloring with strong guarantees on work, depth, and quality","author":"Besta","year":"2020"},{"key":"10.1016\/j.parco.2022.102896_b15","series-title":"Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures","first-page":"166","article-title":"Ordering heuristics for parallel graph coloring","author":"Hasenplaugh","year":"2014"},{"issue":"3","key":"10.1016\/j.parco.2022.102896_b16","doi-asserted-by":"crossref","first-page":"654","DOI":"10.1137\/0914041","article-title":"A parallel graph coloring heuristic","volume":"14","author":"Jones","year":"1993","journal-title":"SIAM J. Sci. Comput."},{"key":"10.1016\/j.parco.2022.102896_b17","series-title":"GrAPL: Workshop on Graphs, Architectures, Programming, and Learning (IPDPSW)","article-title":"Graph coloring on the GPU","author":"Osama","year":"2019"},{"issue":"10\u201311","key":"10.1016\/j.parco.2022.102896_b18","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1016\/j.parco.2012.07.001","article-title":"Graph coloring algorithms for multi-core and massively multithreaded architectures","volume":"38","author":"\u00c7ataly\u00fcrek","year":"2012","journal-title":"Parallel Comput."},{"key":"10.1016\/j.parco.2022.102896_b19","series-title":"European Conference on Parallel Processing","first-page":"414","article-title":"A fast and scalable graph coloring algorithm for multi-core and many-core architectures","author":"Rokos","year":"2015"},{"key":"10.1016\/j.parco.2022.102896_b20","series-title":"2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum","first-page":"1744","article-title":"Scalable hybrid implementation of graph coloring using MPI and OpenMP","author":"Sariy\u00fcce","year":"2012"},{"issue":"8","key":"10.1016\/j.parco.2022.102896_b21","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1145\/2038037.1941597","article-title":"Evaluating graph coloring on GPUs","volume":"46","author":"Grosset","year":"2011","journal-title":"ACM SIGPLAN Not."},{"key":"10.1016\/j.parco.2022.102896_b22","series-title":"Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis","article-title":"Graph colouring as a challenge problem for dynamic graph processing on distributed systems","author":"Sallinen","year":"2016"},{"key":"10.1016\/j.parco.2022.102896_b23","series-title":"Greed is good: Optimistic algorithms for bipartite-graph partial coloring on multicore architectures","author":"Ta\u015f","year":"2017"},{"key":"10.1016\/j.parco.2022.102896_b24","series-title":"2017 IEEE International Parallel and Distributed Processing Symposium (IPDPS)","first-page":"646","article-title":"Partitioning trillion-edge graphs in minutes","author":"Slota","year":"2017"},{"key":"10.1016\/j.parco.2022.102896_b25","series-title":"2013 42nd International Conference on Parallel Processing","first-page":"80","article-title":"Efficient inter-node MPI communication using GPUDirect RDMA for InfiniBand clusters with NVIDIA GPUs","author":"Potluri","year":"2013"},{"key":"10.1016\/j.parco.2022.102896_b26","series-title":"2015 IEEE 22nd International Conference on High Performance Computing (HiPC)","first-page":"234","article-title":"Offloaded GPU collectives using CORE-direct and CUDA capabilities on InfiniBand clusters","author":"Venkatesh","year":"2015"},{"issue":"1","key":"10.1016\/j.parco.2022.102896_b27","doi-asserted-by":"crossref","first-page":"1:1","DOI":"10.1145\/2049662.2049663","article-title":"The university of florida sparse matrix collection","volume":"38","author":"Davis","year":"2011","journal-title":"ACM Trans. Math. Software"},{"key":"10.1016\/j.parco.2022.102896_b28","series-title":"Mathematical Proceedings of the Cambridge Philosophical Society, Vol. 37","first-page":"194","article-title":"On colouring the nodes of a network","author":"Brooks","year":"1941"},{"key":"10.1016\/j.parco.2022.102896_b29","series-title":"International Parallel & Distributed Processing Symposium (IPDPS)","article-title":"A case study of complex graph analysis in distributed memory: Implementation and optimization","author":"Slota","year":"2016"},{"key":"10.1016\/j.parco.2022.102896_b30","series-title":"Dagstuhl Seminar Proceedings","article-title":"Getting started with zoltan: A short tutorial","author":"Devine","year":"2009"},{"key":"10.1016\/j.parco.2022.102896_b31","unstructured":"M. Naumov, P. Castonguay, J. Cohen, Parallel graph coloring with applications to the incomplete-LU factorization on the GPU, Tech. rep., NVidia White Paper, 2015."},{"key":"10.1016\/j.parco.2022.102896_b32","series-title":"Graph 500","year":"2021"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819122000047?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819122000047?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T05:33:17Z","timestamp":1759123997000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167819122000047"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5]]},"references-count":32,"alternative-id":["S0167819122000047"],"URL":"https:\/\/doi.org\/10.1016\/j.parco.2022.102896","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[2022,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Parallel graph coloring algorithms for distributed GPU environments","name":"articletitle","label":"Article Title"},{"value":"Parallel Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.parco.2022.102896","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2022 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}],"article-number":"102896"}}