{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,24]],"date-time":"2025-12-24T12:21:53Z","timestamp":1766578913364,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,8,22]],"date-time":"2026-08-22T00:00:00Z","timestamp":1787356800000},"content-version":"vor","delay-in-days":440,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["1955367"],"award-info":[{"award-number":["1955367"]}],"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":[[2025,6,8]]},"DOI":"10.1145\/3721145.3730416","type":"proceedings-article","created":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T12:57:17Z","timestamp":1755867437000},"page":"1162-1175","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["A Multi-GPU Algorithm for Computing Maximal Independent Sets in Large Graphs"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5116-1109","authenticated-orcid":false,"given":"Anju","family":"Mongandampulath Akathoott","sequence":"first","affiliation":[{"name":"Texas State University, San Marcos, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0990-2911","authenticated-orcid":false,"given":"Benila Virgin","family":"Jerald Xavier","sequence":"additional","affiliation":[{"name":"Texas State University, San Marcos, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7717-3354","authenticated-orcid":false,"given":"Martin","family":"Burtscher","sequence":"additional","affiliation":[{"name":"Texas State University, San Marcos, USA"}]}],"member":"320","published-online":{"date-parts":[[2025,8,22]]},"reference":[{"key":"e_1_3_3_1_2_2","unstructured":"ACCESS. 2025. Advanced Cyberinfrastructure Coordination Ecosystem: Services & Support (ACCESS). https:\/\/access-ci.org. National Science Foundation."},{"key":"e_1_3_3_1_3_2","doi-asserted-by":"publisher","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. 10.1145\/3632953","DOI":"10.1145\/3632953"},{"key":"e_1_3_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/3503221.3508422"},{"key":"e_1_3_3_1_5_2","unstructured":"Martin Burtscher and Sindhu Devale. 2018. ECL-MIS. https:\/\/userweb.cs.txstate.edu\/\u00a0burtscher\/research\/ECL-MIS\/. Accessed: 2025-02-23."},{"key":"e_1_3_3_1_6_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 Transactions on Parallel Computing (TOPC) 5 2 (2018) 1\u201327.","DOI":"10.1145\/3291525"},{"key":"e_1_3_3_1_7_2","doi-asserted-by":"publisher","DOI":"10.1109\/IISWC.2013.6704684"},{"key":"e_1_3_3_1_8_2","unstructured":"Steven Dalton Nathan Bell Luke Olson and Michael Garland. 2014. CUSP: Generic parallel algorithms for sparse matrix and graph computations."},{"key":"e_1_3_3_1_9_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_1_10_2","unstructured":"Graph500. 2017. Graph500 Benchmark Version 3.0.0. https:\/\/github.com\/graph500\/graph500. Accessed: 2025-02-23."},{"key":"e_1_3_3_1_11_2","unstructured":"Mark Harris. 2017. Unified Memory for CUDA Beginners. https:\/\/developer.nvidia.com\/blog\/unified-memory-cuda-beginners\/. NVIDIA Developer Blog."},{"key":"e_1_3_3_1_12_2","doi-asserted-by":"crossref","unstructured":"Uwe Hobohm Michael Scharf Reinhard Schneider and Chris Sander. 1992. Selection of representative protein data sets. Protein Science 1 3 (1992) 409\u2013417.","DOI":"10.1002\/pro.5560010313"},{"key":"e_1_3_3_1_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/CANDAR51075.2020.00012"},{"key":"e_1_3_3_1_14_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) e6681.","DOI":"10.1002\/cpe.6681"},{"key":"e_1_3_3_1_15_2","doi-asserted-by":"crossref","unstructured":"Richard\u00a0M Karp and Avi Wigderson. 1985. A fast parallel algorithm for the maximal independent set problem. Journal of the ACM (JACM) 32 4 (1985) 762\u2013773.","DOI":"10.1145\/4221.4226"},{"key":"e_1_3_3_1_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS53621.2022.00035"},{"key":"e_1_3_3_1_17_2","unstructured":"Yiqian Liu Noushin Azami Avery Vanausdal and Martin Burtscher. 2024. Indigo3. https:\/\/github.com\/burtscher\/Indigo3Suite. Accessed: 2025-02-23."},{"key":"e_1_3_3_1_18_2","doi-asserted-by":"crossref","unstructured":"Yiqian Liu Noushin Azami Avery Vanausdal and Martin Burtscher. 2024. Indigo3: A parallel graph analytics benchmark suite for exploring implementation styles and common bugs. ACM Transactions on Parallel Computing 11 3 (2024) 1\u201329.","DOI":"10.1145\/3665251"},{"key":"e_1_3_3_1_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/22145.22146"},{"key":"e_1_3_3_1_20_2","doi-asserted-by":"publisher","unstructured":"Michael Luby. 1986. A Simple Parallel Algorithm for the Maximal Independent Set Problem. SIAM J. Comput. 15 4 (1986) 1036\u20131053. 10.1137\/0215074","DOI":"10.1137\/0215074"},{"key":"e_1_3_3_1_21_2","doi-asserted-by":"publisher","DOI":"10.1145\/3584371.3612982"},{"key":"e_1_3_3_1_22_2","unstructured":"Anju Mongandampulath\u00a0Akathoott Benila\u00a0Virgin Jerald\u00a0Xavier and Martin Burtscher. 2025. MG-MIS. https:\/\/userweb.cs.txstate.edu\/\u00a0burtscher\/research\/MG-MIS\/. Accessed: 2025-04-30."},{"key":"e_1_3_3_1_23_2","unstructured":"Anju Mongandampulath\u00a0Akathoott Benila\u00a0Virgin Jerald\u00a0Xavier and Martin Burtscher. 2025. MG-MIS. https:\/\/github.com\/burtscher\/MG-MIS\/. Accessed: 2025-04-30."},{"key":"e_1_3_3_1_24_2","unstructured":"Richard\u00a0C Murphy Kyle\u00a0B Wheeler Brian\u00a0W Barrett and James\u00a0A Ang. 2010. Introducing the Graph 500. Cray Users Group (CUG) 19 45-74 (2010) 22."},{"key":"e_1_3_3_1_25_2","volume-title":"CUDA C++ Programming Guide","author":"Corporation NVIDIA","year":"2024","unstructured":"NVIDIA Corporation. 2024. CUDA C++ Programming Guide. NVIDIA. https:\/\/docs.nvidia.com\/cuda\/cuda-c-programming-guide\/index.html."},{"key":"e_1_3_3_1_26_2","unstructured":"NVIDIA Corporation. 2025. NVIDIA Nsight Systems. https:\/\/developer.nvidia.com\/nsight-systems. Accessed: 2025-04-29."},{"key":"e_1_3_3_1_27_2","doi-asserted-by":"publisher","DOI":"10.1145\/2983990.2984015"},{"key":"e_1_3_3_1_28_2","doi-asserted-by":"publisher","DOI":"10.5555\/915903"},{"key":"e_1_3_3_1_29_2","doi-asserted-by":"crossref","unstructured":"San Diego Supercomputer Center. 2025. Expanse. https:\/\/doi.org\/10.1145\/3437359.3465588. University of California San Diego. Service.","DOI":"10.1145\/3437359.3465588"},{"key":"e_1_3_3_1_30_2","doi-asserted-by":"publisher","DOI":"10.1145\/2442516.2442530"},{"key":"e_1_3_3_1_31_2","doi-asserted-by":"crossref","unstructured":"Mois\u00e9s Silva-Mu\u00f1oz Carlos Contreras-Bolton Carlos Rey and Victor Parada. 2023. Automatic generation of a hybrid algorithm for the maximum independent set problem using genetic programming. Applied Soft Computing 144 (2023) 110474.","DOI":"10.1016\/j.asoc.2023.110474"},{"key":"e_1_3_3_1_32_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE55515.2023.00195"}],"event":{"name":"ICS '25: 2025 International Conference on Supercomputing","location":"Salt Lake City USA","acronym":"ICS '25","sponsor":["SIGARCH ACM Special Interest Group on Computer Architecture"]},"container-title":["Proceedings of the 39th ACM International Conference on Supercomputing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3721145.3730416","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3721145.3730416","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T13:03:58Z","timestamp":1755867838000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3721145.3730416"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,8]]},"references-count":31,"alternative-id":["10.1145\/3721145.3730416","10.1145\/3721145"],"URL":"https:\/\/doi.org\/10.1145\/3721145.3730416","relation":{},"subject":[],"published":{"date-parts":[[2025,6,8]]},"assertion":[{"value":"2025-08-22","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}