{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T01:44:02Z","timestamp":1773193442316,"version":"3.50.1"},"reference-count":20,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2016,2,18]],"date-time":"2016-02-18T00:00:00Z","timestamp":1455753600000},"content-version":"vor","delay-in-days":365,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000015","name":"Department of Energy","doi-asserted-by":"publisher","award":["DE-AC02-06CH11357"],"award-info":[{"award-number":["DE-AC02-06CH11357"]}],"id":[{"id":"10.13039\/100000015","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["0837719"],"award-info":[{"award-number":["0837719"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Parallel Comput."],"published-print":{"date-parts":[[2015,2,18]]},"abstract":"<jats:p>Modern supercomputers with torus networks allow each node to simultaneously pass messages on all of its links. However, most collective algorithms are designed to only use one link at a time. In this work, we present novel multiported algorithms for the scatter, gather, all-gather, and reduce-scatter operations. Our algorithms can be combined to create multiported reduce, all-reduce, and broadcast algorithms. Several of these algorithms involve a new technique where we relax the MPI message-ordering constraints to achieve high performance and restore the correctordering using an additional stage of redundant communication.<\/jats:p>\n                  <jats:p>\n                    According to our models, on an\n                    <jats:italic toggle=\"yes\">n<\/jats:italic>\n                    -dimensional torus, our algorithms should allow for nearly a 2\n                    <jats:italic toggle=\"yes\">n<\/jats:italic>\n                    -fold improvement in communication performance compared to known, single-ported torus algorithms. In practice, we have achieved nearly 6x better performance on a 32k-node 3-dimensional torus.\n                  <\/jats:p>","DOI":"10.1145\/2686882","type":"journal-article","created":{"date-parts":[[2015,2,23]],"date-time":"2015-02-23T10:32:19Z","timestamp":1424687539000},"page":"1-33","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Collective Algorithms for Multiported Torus Networks"],"prefix":"10.1145","volume":"1","author":[{"given":"Paul","family":"Sack","sequence":"first","affiliation":[{"name":"University of Illinois at Urbana-Champaign"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"William","family":"Gropp","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2015,2,18]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00450-012-0211-7"},{"key":"e_1_2_1_2_1","volume-title":"Proceedings of the Scalable High Performance Computing Conference.","author":"Barnett Mike","unstructured":"Mike Barnett, Satya Gupta, David G. Payne, Lance Shuler, Robert van de Geijn, and Jerrell Watts. 1994. Interprocessor Collective Communication Library (InterCom). In Proceedings of the Scalable High Performance Computing Conference."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1122971.1122975"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/2388996.2389090"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2010.38"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8191(06)80021-9"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/1375990.1376008"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1810085.1810093"},{"key":"e_1_2_1_9_1","volume-title":"Proceedings of the Conference on Local Computer Networks.","author":"Kapil A.","unstructured":"A. Kapil and E. T. Ososanya. 1992. Broadcasting and personalized communication in a torus and grid network. In Proceedings of the Conference on Local Computer Networks."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1177\/1094342009359011"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2008.83"},{"key":"e_1_2_1_12_1","volume-title":"Proceedings of the 10th International Conference on Optical Internet.","author":"Kurokawa M.","year":"2012","unstructured":"M. Kurokawa. 2012. The K computer: 10 Peta-FLOPS supercomputer. In Proceedings of the 10th International Conference on Optical Internet."},{"key":"e_1_2_1_13_1","unstructured":"Hans Meuer Erich Strohmaier Jack Dongarra and Horst Simon. 2014. TOP500 Supercomputing Sites. http:\/\/top500.org."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/2522220"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2145816.2145823"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/377792.377895"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39924-7_38"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1177\/1094342005051521"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1177\/1094342009359013"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2012.01.018"}],"container-title":["ACM Transactions on Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2686882","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2686882","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2686882","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:40:23Z","timestamp":1763458823000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2686882"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2,18]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,2,18]]}},"alternative-id":["10.1145\/2686882"],"URL":"https:\/\/doi.org\/10.1145\/2686882","relation":{},"ISSN":["2329-4949","2329-4957"],"issn-type":[{"value":"2329-4949","type":"print"},{"value":"2329-4957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,2,18]]},"assertion":[{"value":"2013-04-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2014-08-01","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2015-02-18","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}