{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T16:12:51Z","timestamp":1767888771823,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":63,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,6,17]],"date-time":"2024-06-17T00:00:00Z","timestamp":1718582400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100006374","name":"Intelligence Advanced Research Projects Activity","doi-asserted-by":"publisher","award":["W911NF22C0081"],"award-info":[{"award-number":["W911NF22C0081"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006374","name":"U.S. Department of Energy","doi-asserted-by":"publisher","award":["89233218CNA000001"],"award-info":[{"award-number":["89233218CNA000001"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006374","name":"Los Alamos National Laboratory","doi-asserted-by":"publisher","award":["20230692ER"],"award-info":[{"award-number":["20230692ER"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,6,17]]},"DOI":"10.1145\/3626183.3659975","type":"proceedings-article","created":{"date-parts":[[2024,6,4]],"date-time":"2024-06-04T18:23:04Z","timestamp":1717525384000},"page":"345-357","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["PolarStar: Expanding the Horizon of Diameter-3 Networks"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9414-8481","authenticated-orcid":false,"given":"Kartik","family":"Lakhotia","sequence":"first","affiliation":[{"name":"Intel, Santa Clara, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7175-0103","authenticated-orcid":false,"given":"Laura","family":"Monroe","sequence":"additional","affiliation":[{"name":"Los Alamos National Lab, Los Alamos, NM, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7979-0516","authenticated-orcid":false,"given":"Kelly","family":"Isham","sequence":"additional","affiliation":[{"name":"Colgate University, Hamilton, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6550-7916","authenticated-orcid":false,"given":"Maciej","family":"Besta","sequence":"additional","affiliation":[{"name":"ETH Z\u00fcrich, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-0401-0388","authenticated-orcid":false,"given":"Nils","family":"Blach","sequence":"additional","affiliation":[{"name":"ETH Z\u00fcrich, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1333-9797","authenticated-orcid":false,"given":"Torsten","family":"Hoefler","sequence":"additional","affiliation":[{"name":"ETH Z\u00fcrich, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4977-7107","authenticated-orcid":false,"given":"Fabrizio","family":"Petrini","sequence":"additional","affiliation":[{"name":"Intel, Santa Clara, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,6,17]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Large Networks of Diameter Two Based on Cayley Graphs. In Computer Science On-line Conference. Springer, 225--233","author":"Abas Marcel","year":"2017","unstructured":"Marcel Abas. 2017. Large Networks of Diameter Two Based on Cayley Graphs. In Computer Science On-line Conference. Springer, 225--233."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1654059.1654101"},{"key":"e_1_3_2_1_3_1","volume-title":"Optical Fiber Telecommunications VIB","author":"Awaji Yoshinari","unstructured":"Yoshinari Awaji, Kunimasa Saitoh, and Shoichiro Matsuo. 2013. Optical Fiber Telecommunications VIB: Chapter 13. Transmission Systems Using Multicore Fibers. Elsevier Inc. Chapters."},{"key":"e_1_3_2_1_4_1","volume-title":"A generic traffic model for on-chip interconnection networks. Network on Chip Architectures","author":"Bahn Jun Ho","year":"2008","unstructured":"Jun Ho Bahn and Nader Bagherzadeh. 2008. A generic traffic model for on-chip interconnection networks. Network on Chip Architectures (2008), 22."},{"key":"e_1_3_2_1_5_1","first-page":"191","article-title":"On finite Moore graphs","volume":"20","author":"Bannai Eiichi","year":"1973","unstructured":"Eiichi Bannai and Tatsuro Ito. 1973. On finite Moore graphs. Journal of the Faculty of Science, the University of Tokyo. Sect. 1 A, Mathematics , Vol. 20 (1973), 191--208.","journal-title":"Journal of the Faculty of Science, the University of Tokyo. Sect. 1 A, Mathematics"},{"key":"e_1_3_2_1_6_1","first-page":"23","article-title":"Large graphs with given degree and diameter III","volume":"13","author":"Bermond J.C.","year":"1982","unstructured":"J.C. Bermond, C. Delorme, and G. Farhi. 1982. Large graphs with given degree and diameter III. Ann. of Discrete Math. , Vol. 13 (1982), 23--32.","journal-title":"Ann. of Discrete Math."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2014.34"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2749246.2749263"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/HOTI.2015.22"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/HiPC.2013.6799144"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.4153\/CMB-1966-036-2"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2016.2635640"},{"key":"e_1_3_2_1_13_1","unstructured":"Charles Q Choi. 2022. The Beating Heart of the World's First Exascale Supercomputer. https:\/\/spectrum.ieee.org\/frontier-exascale-supercomputer."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"C. Dalf\u00c3\u00b3. 2019. A survey on the missing Moore graph. Linear Algebra Appl. (2019).","DOI":"10.1016\/j.laa.2018.12.035"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0305004100048015"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2018.00107"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1364\/OFC.2021.Th4A.4"},{"key":"e_1_3_2_1_18_1","volume-title":"Edge-Disjoint Spanning Trees on Star-Product Networks. arXiv preprint arXiv:2403.12231","author":"Dawkins Aleyah","year":"2024","unstructured":"Aleyah Dawkins, Kelly Isham, Ales Kubicek, Kartik Lakhotia, and Laura Monroe. 2024. Edge-Disjoint Spanning Trees on Star-Product Networks. arXiv preprint arXiv:2403.12231 (2024)."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2408776.2408794"},{"key":"e_1_3_2_1_20_1","unstructured":"Jack Dongarra. 2020. Report on the Fujitsu Fugaku System. Technical Report ICL-UT-20-06. University of Tennessee Knoxville."},{"key":"e_1_3_2_1_21_1","first-page":"623","article-title":"On a problem in the theory of graphs","volume":"7","author":"Alfred R\u00e9nyi Paul","year":"1962","unstructured":"Paul ErdH os and Alfred R\u00e9nyi. 1962. On a problem in the theory of graphs. Publ. Math. Inst. Hungar. Acad. Sci. , Vol. 7A (1962), 623--641.","journal-title":"Publ. Math. Inst. Hungar. Acad. Sci."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01895716"},{"key":"e_1_3_2_1_23_1","volume-title":"Megafly: A topology for exascale systems. In High Performance Computing (ISC High Performance","author":"Flajslik Mario","year":"2018","unstructured":"Mario Flajslik, Eric Borch, and Mike A Parker. 2018. Megafly: A topology for exascale systems. In High Performance Computing (ISC High Performance 2018). Springer, 289--310."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2017.37"},{"key":"e_1_3_2_1_25_1","volume-title":"Digital processing of signals. Digital processing of signals","author":"Gold Bernard","year":"1969","unstructured":"Bernard Gold and Charles M Rader. 1969. Digital processing of signals. Digital processing of signals (1969)."},{"key":"e_1_3_2_1_26_1","volume-title":"Michael J Levenhagen, Arun F Rodrigues, and Gwendolyn Renae Voskuilen.","author":"Hammond Simon David","year":"2015","unstructured":"Simon David Hammond, Karl Scott Hemmert, Michael J Levenhagen, Arun F Rodrigues, and Gwendolyn Renae Voskuilen. 2015. Ember: Reference Communication Patterns for Exascale. Technical Report. Sandia National Lab.(SNL-NM), Albuquerque, NM (United States)."},{"key":"e_1_3_2_1_27_1","unstructured":"Karl Scott Hemmert. 2018. Merlin Element Library Deep Dive. Technical Report. Sandia National Lab.(SNL-NM) Albuquerque NM (United States)."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.45.0497"},{"key":"e_1_3_2_1_29_1","volume-title":"Workshop on wide area networks and high performance computing. Springer, 171--187","author":"Hoisie Adolfy","year":"2007","unstructured":"Adolfy Hoisie, Olaf Lubeck, and Harvey Wasserman. 2007. Performance analysis of wavefront algorithms on very-large scale distributed systems. In Workshop on wide area networks and high performance computing. Springer, 171--187."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISPASS.2013.6557149"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2011.122111.00069"},{"key":"e_1_3_2_1_32_1","unstructured":"George Karypis and Vipin Kumar. 2009. MeTis: Unstructured Graph Partitioning and Sparse Matrix Ordering System Version 4.0. https:\/\/github.com\/KarypisLab\/METIS."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2807591.2807652"},{"key":"e_1_3_2_1_34_1","volume-title":"ERI Programs Panel - Phase II Overview. DARPA ERI Summit","author":"Keeler Gordon","year":"2019","unstructured":"Gordon Keeler. [n.,d.]. ERI Programs Panel - Phase II Overview. DARPA ERI Summit 2019."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250662.1250679"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2008.19"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC41404.2022.00017"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3558481.3591073"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2021.3139092"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3392717.3392747"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2925426.2926275"},{"key":"e_1_3_2_1_42_1","volume-title":"1985 a. Fat-trees: Universal networks for hardware-efficient supercomputing","author":"Leiserson Charles E","year":"1985","unstructured":"Charles E Leiserson. 1985 a. Fat-trees: Universal networks for hardware-efficient supercomputing. IEEE transactions on Computers, Vol. 100, 10 (1985), 892--901."},{"key":"e_1_3_2_1_43_1","first-page":"10","article-title":"b. Fat-trees: universal networks for hardware-efficient supercomputing","volume":"34","author":"Leiserson Charles E.","year":"1985","unstructured":"Charles E. Leiserson. 1985 b. Fat-trees: universal networks for hardware-efficient supercomputing. IEEE Trans. Comput. , Vol. 34, 10 (Oct. 1985), 892--901.","journal-title":"IEEE Trans. Comput."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30141-7_45"},{"key":"e_1_3_2_1_45_1","unstructured":"Lightmatter. [n. d.]. https:\/\/lightmatter.co\/."},{"key":"e_1_3_2_1_46_1","unstructured":"E Loz H. P\u00e9rez-Ros\u00e9s and G.Pineda-Villavicencio. 2010. The Degree-Diameter Problem for General Graphs. http:\/\/www.combinatoricswiki.org\/wiki\/The_Degree_Diameter_Problem_for_General_Graphs."},{"key":"e_1_3_2_1_47_1","volume-title":"Finite Fields for Computer Scientists and Engineers","author":"McEliece Robert J.","unstructured":"Robert J. McEliece. 1987. Finite Fields for Computer Scientists and Engineers. Springer, Boston, MA."},{"key":"e_1_3_2_1_48_1","series-title":"Series B","volume-title":"A note on Large Graphs of Diameter Two and Given Maximum Degree. Journal of Combinatorial Theory","author":"McKay Brendan D.","year":"1998","unstructured":"Brendan D. McKay, Mirka Miller, and Jozef vSir\u00e1n. 1998. A note on Large Graphs of Diameter Two and Given Maximum Degree. Journal of Combinatorial Theory, Series B (1998)."},{"key":"e_1_3_2_1_49_1","unstructured":"Hans Meuer Erich Strohmaier Jack Dongarra Horst Simon and Martin Meuer. 2023. Top 500: The List. https:\/\/top500.org\/lists\/top500\/."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1002\/sapm1933121311"},{"key":"e_1_3_2_1_51_1","volume-title":"An introduction to the infiniband architecture. High performance mass storage and parallel I\/O","author":"Pfister Gregory F","year":"2001","unstructured":"Gregory F Pfister. 2001. An introduction to the infiniband architecture. High performance mass storage and parallel I\/O, Vol. 42, 617--632 (2001), 10."},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2016.05.014"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24685-5_1"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/1964218.1964225"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8191(01)00112-0"},{"key":"e_1_3_2_1_56_1","volume-title":"Horovod: fast and easy distributed deep learning in TensorFlow. arXiv preprint arXiv:1802.05799","author":"Sergeev Alexander","year":"2018","unstructured":"Alexander Sergeev and Mike Del Balso. 2018. Horovod: fast and easy distributed deep learning in TensorFlow. arXiv preprint arXiv:1802.05799 (2018)."},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1109\/HiPINEB.2017.11"},{"key":"e_1_3_2_1_58_1","volume-title":"Proceedings of the 9th USENIX NSDI","author":"Singla Ankit","unstructured":"Ankit Singla, Chi-Yao Hong, Lucian Popa, and P. Brighten Godfrey. 2012. Jellyfish: networking data centers randomly. In Proceedings of the 9th USENIX NSDI (San Jose, CA). USENIX Association, Berkeley, CA, USA, 17--17."},{"key":"e_1_3_2_1_59_1","volume-title":"A new generation of cluster interconnect. White Paper","author":"Stewart Lawrence C","year":"2006","unstructured":"Lawrence C Stewart and David Gingold. 2006. A new generation of cluster interconnect. White Paper, SiCortex Inc (2006)."},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1364\/OFC.2013.OTu3H.1"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2020.2976067"},{"key":"e_1_3_2_1_62_1","series-title":"SIAM journal on Computing","volume-title":"Lower bounds for accessing binary search trees with rotations","author":"Wilber Robert","year":"1989","unstructured":"Robert Wilber. 1989. Lower bounds for accessing binary search trees with rotations. SIAM journal on Computing, Vol. 18, 1 (1989), 56--67."},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS53621.2022.00105"}],"event":{"name":"SPAA '24: 36th ACM Symposium on Parallelism in Algorithms and Architectures","location":"Nantes France","acronym":"SPAA '24","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"]},"container-title":["Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3626183.3659975","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3626183.3659975","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T16:23:57Z","timestamp":1755879837000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3626183.3659975"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,17]]},"references-count":63,"alternative-id":["10.1145\/3626183.3659975","10.1145\/3626183"],"URL":"https:\/\/doi.org\/10.1145\/3626183.3659975","relation":{},"subject":[],"published":{"date-parts":[[2024,6,17]]},"assertion":[{"value":"2024-06-17","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}