{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:18:47Z","timestamp":1750220327029,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,11]],"date-time":"2022-07-11T00:00:00Z","timestamp":1657497600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,11]]},"DOI":"10.1145\/3490148.3538560","type":"proceedings-article","created":{"date-parts":[[2022,7,10]],"date-time":"2022-07-10T22:10:15Z","timestamp":1657491015000},"page":"143-146","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Brief Announcement"],"prefix":"10.1145","author":[{"given":"Jesper Larsson","family":"Tr\u00e4ff","sequence":"first","affiliation":[{"name":"TU Wien, Vienna, Austria"}]}],"member":"320","published-online":{"date-parts":[[2022,7,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(99)00155-9"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.642949"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/0139032"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/3287775.3287808"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2018.09.015"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2009.09.002"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.29465"},{"volume-title":"Optimal Broadcast and Summation in the LogP Model. In 5th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA). 142--153","author":"Karp Richard M.","key":"e_1_3_2_1_8_1","unstructured":"Richard M. Karp , Abhijit Sahay , Eunice E. Santos , and Klaus E. Schauser . 1993 . Optimal Broadcast and Summation in the LogP Model. In 5th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA). 142--153 . Richard M. Karp, Abhijit Sahay, Eunice E. Santos, and Klaus E. Schauser. 1993. Optimal Broadcast and Summation in the LogP Model. In 5th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA). 142--153."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230260409"},{"key":"e_1_3_2_1_10_1","volume-title":"MPI: A Message-Passing Interface Standard. Version 3.1. www. mpi-forum.org.","author":"Forum MPI","year":"2015","unstructured":"MPI Forum . 2015 . MPI: A Message-Passing Interface Standard. Version 3.1. www. mpi-forum.org. MPI Forum. 2015. MPI: A Message-Passing Interface Standard. Version 3.1. www. mpi-forum.org."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2006.1639334"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1999.1529"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33518-1_15"},{"key":"e_1_3_2_1_14_1","unstructured":"Jesper Larsson Tr\u00e4ff. 2022. (Poly)Logarithmic Time Construction of Roundoptimal n-Block Broadcast Schedules for Broadcast and irregular Allgather in MPI. arXiv:2205.10072. (2022).  Jesper Larsson Tr\u00e4ff. 2022. (Poly)Logarithmic Time Construction of Roundoptimal n-Block Broadcast Schedules for Broadcast and irregular Allgather in MPI. arXiv:2205.10072. (2022)."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2007.12.001"}],"event":{"name":"SPAA '22: 34th 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":"Philadelphia PA USA","acronym":"SPAA '22"},"container-title":["Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3490148.3538560","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3490148.3538560","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:12:08Z","timestamp":1750191128000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3490148.3538560"}},"subtitle":["Fast(er) Construction of Round-optimal n-Block Broadcast Schedules"],"short-title":[],"issued":{"date-parts":[[2022,7,11]]},"references-count":15,"alternative-id":["10.1145\/3490148.3538560","10.1145\/3490148"],"URL":"https:\/\/doi.org\/10.1145\/3490148.3538560","relation":{},"subject":[],"published":{"date-parts":[[2022,7,11]]},"assertion":[{"value":"2022-07-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}