{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T13:44:48Z","timestamp":1782999888492,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,7,5]],"date-time":"2026-07-05T00:00:00Z","timestamp":1783209600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2209921"],"award-info":[{"award-number":["2209921"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2209922"],"award-info":[{"award-number":["2209922"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,7,6]]},"DOI":"10.1145\/3797905.3800529","type":"proceedings-article","created":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T11:50:37Z","timestamp":1782993037000},"page":"699-713","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["cuMIS: A Unified Scalable Framework for Computing Maximal Independent Sets on Trillion-Edge Graphs"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-1690-0773","authenticated-orcid":false,"given":"Joseph","family":"Nke","sequence":"first","affiliation":[{"name":"Texas State University, San Marcos, TX, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-9432-9604","authenticated-orcid":false,"given":"Seunghwa","family":"Kang","sequence":"additional","affiliation":[{"name":"NVIDIA, Santa Clara, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4820-1306","authenticated-orcid":false,"given":"Bradley","family":"Rees","sequence":"additional","affiliation":[{"name":"NVIDIA, Santa Clara, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4778-8996","authenticated-orcid":false,"given":"Chul-Ho","family":"Lee","sequence":"additional","affiliation":[{"name":"Texas State University, San Marcos, TX, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,7,5]]},"reference":[{"key":"e_1_3_3_2_2_2","doi-asserted-by":"crossref","unstructured":"Tyler Allen Bennett Cooper and Rong Ge. 2024. Fine-grain Quantitative Analysis of Demand Paging in Unified Virtual Memory. ACM Trans. Archit. Code Optim. 21 1 Article 14 (Jan. 2024) 24\u00a0pages.","DOI":"10.1145\/3632953"},{"key":"e_1_3_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/3503221.3508422"},{"key":"e_1_3_3_2_4_2","doi-asserted-by":"crossref","unstructured":"Eugene\u00a0T.Y. Ang Prasanta Bhattacharya and Andrew\u00a0E.B. Lim. 2025. Estimating policy effects in a social network with independent set sampling. Social Networks 81 (2025) 17\u201330.","DOI":"10.1016\/j.socnet.2024.10.002"},{"key":"e_1_3_3_2_5_2","volume-title":"Cray User Group (CUG)","author":"Ang James\u00a0Alfred","year":"2010","unstructured":"James\u00a0Alfred Ang, Brian\u00a0W Barrett, Kyle\u00a0Bruce Wheeler, and Richard\u00a0C Murphy. 2010. Introducing the graph 500. In Cray User Group (CUG). Sandia National Laboratories. https:\/\/www.osti.gov\/biblio\/1014640"},{"key":"e_1_3_3_2_6_2","series-title":"(SC \u201912)","volume-title":"Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis","author":"Beamer Scott","year":"2012","unstructured":"Scott Beamer, Krste Asanovi\u0107, and David Patterson. 2012. Direction-optimizing breadth-first search. In Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis (Salt Lake City, Utah) (SC \u201912). IEEE Computer Society Press, Washington, DC, USA, Article 12, 10\u00a0pages."},{"key":"e_1_3_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/2503210.2503293"},{"key":"e_1_3_3_2_8_2","doi-asserted-by":"crossref","unstructured":"Martin Burtscher Sindhu Devale Sahar Azimi Jayadharini Jaiganesh and Evan Powers. 2018. A High-Quality and Fast Maximal Independent Set Implementation for GPUs. ACM Trans. Parallel Comput. 5 2 Article 8 (Dec. 2018) 27\u00a0pages.","DOI":"10.1145\/3291525"},{"key":"e_1_3_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/IISWC.2013.6704684"},{"key":"e_1_3_3_2_10_2","unstructured":"Steven Dalton Nathan Bell Luke Olson and Michael Garland. 2014. CUSP: Generic parallel algorithms for sparse matrix and graph computations. http:\/\/cusplibrary.github.io\/ Version 0.5.0."},{"key":"e_1_3_3_2_11_2","volume-title":"Frequency assignment in GSM networks: Models, heuristics and lower bounds","author":"Eisenbl\u00e4tter Andreas","year":"2002","unstructured":"Andreas Eisenbl\u00e4tter. 2002. Frequency assignment in GSM networks: Models, heuristics and lower bounds. Cuvillier Verlag."},{"key":"e_1_3_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.5555\/645933.673363"},{"key":"e_1_3_3_2_13_2","doi-asserted-by":"crossref","unstructured":"Ilya Gertsbakh and Helman\u00a0I Stern. 1978. Minimal resources for fixed and variable job schedules. Operations Research 26 1 (1978) 68\u201385.","DOI":"10.1287\/opre.26.1.68"},{"key":"e_1_3_3_2_14_2","series-title":"(OSDI\u201912)","first-page":"17","volume-title":"Proceedings of the 10th USENIX Conference on Operating Systems Design and Implementation","author":"Gonzalez Joseph\u00a0E.","year":"2012","unstructured":"Joseph\u00a0E. Gonzalez, Yucheng Low, Haijie Gu, Danny Bickson, and Carlos Guestrin. 2012. PowerGraph: Distributed graph-parallel computation on natural graphs. In Proceedings of the 10th USENIX Conference on Operating Systems Design and Implementation (Hollywood, CA, USA) (OSDI\u201912). USENIX Association, USA, 17\u201330."},{"key":"e_1_3_3_2_15_2","unstructured":"Graph500. 2017. Graph500 Benchmark Version 3.0.0. https:\/\/github.com\/graph500\/graph500. Accessed: 2025-02-23."},{"key":"e_1_3_3_2_16_2","doi-asserted-by":"crossref","unstructured":"John\u00a0L. Gustafson. 1988. Reevaluating Amdahl\u2019s law. Commun. ACM 31 5 (May 1988) 532\u2013533.","DOI":"10.1145\/42411.42415"},{"key":"e_1_3_3_2_17_2","doi-asserted-by":"crossref","unstructured":"D. G\u00f3mez J. Montero J. Y\u00e1\u00f1ez and C. Poidomani. 2007. A graph coloring approach for image segmentation. Omega 35 2 (2007) 173\u2013183.","DOI":"10.1016\/j.omega.2005.05.003"},{"key":"e_1_3_3_2_18_2","unstructured":"Mark Harris. 2017. Unified memory for CUDA beginners. https:\/\/developer.nvidia.com\/blog\/unified-memory-cuda-beginners\/. Accessed: 2025-12-13."},{"key":"e_1_3_3_2_19_2","unstructured":"Mark Harris. 2020. Fast Flexible Allocation for NVIDIA CUDA with RAPIDS Memory Manager. https:\/\/developer.nvidia.com\/blog\/fast-flexible-allocation-for-cuda-with-rapids-memory-manager\/. Accessed: 2025-12-13."},{"key":"e_1_3_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/1941553.1941590"},{"key":"e_1_3_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1109\/CANDAR51075.2020.00012"},{"key":"e_1_3_3_2_22_2","doi-asserted-by":"crossref","unstructured":"Tomohiro Imanaga Koji Nakano Ryota Yasudo Yasuaki Ito Yuya Kawamata Ryota Katsuki Yusuke Tabata Takashi Yazane and Kenichiro Hamano. 2023. Simple iterative trial search for the maximum independent set problem optimized for the GPUs. Concurrency and Computation: Practice and Experience 35 14 (2023).","DOI":"10.1002\/cpe.6681"},{"key":"e_1_3_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC43674.2020.9286216"},{"key":"e_1_3_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC55821.2022.9926341"},{"key":"e_1_3_3_2_25_2","doi-asserted-by":"crossref","unstructured":"Richard\u00a0M. Karp and Avi Wigderson. 1985. A fast parallel algorithm for the maximal independent set problem. J. ACM 32 4 (Oct. 1985) 762\u2013773.","DOI":"10.1145\/4221.4226"},{"key":"e_1_3_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS53621.2022.00035"},{"key":"e_1_3_3_2_27_2","unstructured":"Imran Khan and Ansaari. 2016. A New and Fast Approximation Algorithm for Vertex Cover Using Independent Set (VCUMI). Operations Research and Decisions 25 1 (2016) 201\u2013215."},{"key":"e_1_3_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1145\/22145.22146"},{"key":"e_1_3_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1145\/3584371.3612982"},{"key":"e_1_3_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1145\/3721145.3730416"},{"key":"e_1_3_3_2_31_2","unstructured":"Maxim Naumov. 2015. Graph Coloring: More Parallelism for Incomplete-LU Factorization. https:\/\/developer.nvidia.com\/blog\/graph-coloring-more-parallelism-for-incomplete-lu-factorization\/. NVIDIA Developer Blog (June 2015). Accessed: 2025-10-27."},{"key":"e_1_3_3_2_32_2","unstructured":"NVIDIA Corporation. 2023. NVIDIA Visual Profiler. https:\/\/docs.nvidia.com\/cuda\/profiler-users-guide\/. Accessed: 2025-10-27."},{"key":"e_1_3_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1145\/2983990.2984015"},{"key":"e_1_3_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1145\/1993498.1993501"},{"key":"e_1_3_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.5555\/915903"},{"key":"e_1_3_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.1145\/2442516.2442530"},{"key":"e_1_3_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2012.240"},{"key":"e_1_3_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE55515.2023.00195"},{"key":"e_1_3_3_2_39_2","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2005.4"}],"event":{"name":"ICS '26: 2026 International Conference on Supercomputing","location":"Belfast United Kingdom","acronym":"ICS '26","sponsor":["SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing","SIGARCH ACM Special Interest Group on Computer Architecture"]},"container-title":["Proceedings of the 40th ACM International Conference on Supercomputing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/abs\/10.1145\/3797905.3800529","content-type":"text\/html","content-version":"vor","intended-application":"syndication"}],"deposited":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T13:01:12Z","timestamp":1782997272000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3797905.3800529"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,5]]},"references-count":38,"alternative-id":["10.1145\/3797905.3800529","10.1145\/3797905"],"URL":"https:\/\/doi.org\/10.1145\/3797905.3800529","relation":{},"subject":[],"published":{"date-parts":[[2026,7,5]]},"assertion":[{"value":"2026-07-05","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}