{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T00:05:36Z","timestamp":1756425936787,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,7,28]]},"DOI":"10.1145\/3746238.3746243","type":"proceedings-article","created":{"date-parts":[[2025,7,21]],"date-time":"2025-07-21T22:33:37Z","timestamp":1753137217000},"page":"25-27","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Cases When Communicating More is Faster"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5195-3392","authenticated-orcid":false,"given":"Souvadra","family":"Hati","sequence":"first","affiliation":[{"name":"Georgia Tech, Atlanta, GA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2178-138X","authenticated-orcid":false,"given":"Richard","family":"Vuduc","sequence":"additional","affiliation":[{"name":"Georgia Tech, Atlanta, GA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,7,28]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3458817.3476212"},{"key":"e_1_3_2_1_2_1","volume-title":"Parallel scientific computation: A structured approach using BSP","author":"Bisseling Rob H.","year":"1987","unstructured":"Rob H. Bisseling. 2020. Parallel scientific computation: A structured approach using BSP (2nd ed. ed.). Oxford University Press. https:\/\/global.oup.com\/academic\/product\/parallel-scientific-computation-9780198788355?lang=en&cc=us","edition":"2"},{"key":"e_1_3_2_1_3_1","unstructured":"NVIDIA Corporation. 2021. NVIDIA GB200 NVL72. https:\/\/www.nvidia.com\/en-us\/data-center\/gb200-nvl72\/. Accessed: 2024-12-07."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btv022"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/502512.502525"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2807591.2807664"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1177\/10943420211029299"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2503792.2503797"},{"key":"e_1_3_2_1_9_1","volume-title":"An Asynchronous Distributed-Memory Parallel Algorithm for k-mer Counting. arXiv preprint arXiv:2505.04431","author":"Hati Souvadra","year":"2025","unstructured":"Souvadra Hati, Akihiro Hayashi, and Richard Vuduc. 2025. An Asynchronous Distributed-Memory Parallel Algorithm for k-mer Counting. arXiv preprint arXiv:2505.04431 (2025). https:\/\/arxiv.org\/abs\/2505.04431"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Steven Hofmeyr Rob Egan Evangelos Georganas Alex C Copeland Robert Riley Alicia Clum Emiley Eloe-Fadrosh Simon Roux Eugene Goltsman Ayd\u0131n Bulu\u00e7 et al. 2020. Terabase-scale metagenome coassembly with MetaHipMer. Scientific reports 10 1 (2020) 10689.","DOI":"10.1038\/s41598-020-67416-5"},{"key":"e_1_3_2_1_11_1","unstructured":"Alexander Ishii and Ryan Wells. 2025. THE NVLINK-NETWORK SWITCH: NVIDIA'S SWITCH CHIP FOR HIGH COMMUNICATION-BANDWIDTH SUPER-PODS. https:\/\/www.nvidia.com\/en-us\/data-center\/nvlink\/. Accessed: 2025-05-22."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1186\/1752-0509-6-28"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"e_1_3_2_1_14_1","volume-title":"Nebula: Ultra-efficient mapping-free structural variant genotyper. Nucleic acids research 49, 8","author":"Khorsand Parsoa","year":"2021","unstructured":"Parsoa Khorsand and Fereydoun Hormozdiari. 2021. Nebula: Ultra-efficient mapping-free structural variant genotyper. Nucleic acids research 49, 8 (2021)."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btx304"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2164-9-517"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASAP.2018.8445084"},{"key":"e_1_3_2_1_18_1","volume-title":"Estimating the repeat structure and length of DNA sequences using l-tuples. Genome research 13, 8","author":"Li Xiaoman","year":"2003","unstructured":"Xiaoman Li and Michael S Waterman. 2003. Estimating the repeat structure and length of DNA sequences using l-tuples. Genome research 13, 8 (2003), 1916--1922."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3673038.3673072"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3392717.3392750"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/CLUSTER.2019.8890991"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC41405.2020.00059"},{"key":"e_1_3_2_1_23_1","volume-title":"Merqury: reference-free quality, completeness, and phasing assessment for genome assemblies. Genome biology 21, 1","author":"Rhie Arang","year":"2020","unstructured":"Arang Rhie, Brian P Walenz, Sergey Koren, and Adam M Phillippy. 2020. Merqury: reference-free quality, completeness, and phasing assessment for genome assemblies. Genome biology 21, 1 (2020), 1--27."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC41406.2024.00108"},{"key":"e_1_3_2_1_25_1","unstructured":"Edgar Solomonik. 2014. Provably efficient algorithms for numerical tensor algebra. Ph. D. Dissertation. http:\/\/www.eecs.berkeley.edu\/Pubs\/TechRpts\/2014\/EECS-2014-170.pdf"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/79173.79181"}],"event":{"name":"SPAA '25: 37th ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"],"location":"Portland OR USA","acronym":"SPAA '25"},"container-title":["Proceedings of the 3rd Highlights of Parallel Computing Workshop"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3746238.3746243","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,28]],"date-time":"2025-08-28T16:24:20Z","timestamp":1756398260000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3746238.3746243"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,28]]},"references-count":26,"alternative-id":["10.1145\/3746238.3746243","10.1145\/3746238"],"URL":"https:\/\/doi.org\/10.1145\/3746238.3746243","relation":{},"subject":[],"published":{"date-parts":[[2025,7,28]]},"assertion":[{"value":"2025-07-28","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}