{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,5]],"date-time":"2025-03-05T04:10:01Z","timestamp":1741147801975,"version":"3.38.0"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2011,4,16]],"date-time":"2011-04-16T00:00:00Z","timestamp":1302912000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int J Parallel Prog"],"published-print":{"date-parts":[[2011,12]]},"DOI":"10.1007\/s10766-011-0169-2","type":"journal-article","created":{"date-parts":[[2011,4,15]],"date-time":"2011-04-15T17:22:09Z","timestamp":1302888129000},"page":"746-782","source":"Crossref","is-referenced-by-count":12,"title":["Efficient and Scalable Routing Algorithms for Collective Communication Operations on 2D All-Port Torus Networks"],"prefix":"10.1007","volume":"39","author":[{"given":"Kayhan M.","family":"\u0130mre","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cesur","family":"Baransel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Harun","family":"Artuner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,4,16]]},"reference":[{"key":"169_CR1","first-page":"8","volume":"XXII","author":"J.C. Bermond","year":"1992","unstructured":"Bermond J.C.: Broadcasting and NP-completeness. Graph Theory Notes of New York XXII, 8\u201314 (1992)","journal-title":"Graph Theory Notes of New York"},{"key":"169_CR2","doi-asserted-by":"crossref","first-page":"1749","DOI":"10.1002\/cpe.1206","volume":"19","author":"E. Chan","year":"2007","unstructured":"Chan E., Heimlich M., Purkayastha A., van de Geijn R.: Collective communication: theory, practice, and experience. Concurr. Comput. Pract. Exp. 19, 1749\u20131783 (2007)","journal-title":"Concurr. Comput. Pract. Exp."},{"key":"169_CR3","first-page":"91","volume-title":"Edge-Disjoint Branchings, Combinatorial Algorithms","author":"J. Edmonds","year":"1972","unstructured":"Edmonds J.: Edge-Disjoint Branchings, Combinatorial Algorithms, pp. 91\u201396. Algorithmics Press, New York (1972)"},{"key":"169_CR4","unstructured":"Faraj, A., Kumar, S., Smith, B., Mamidala, A., Gunnels, J.: MPI collective communications on the blue gene\/P supercomputer: algorithms and optimizations. In: 17th IEEE Symposium on High Performance Interconnects, 2009. HOTI 2009., pp. 63\u201372, 25\u201327 (Aug. 2009)"},{"key":"169_CR5","volume-title":"Introduction to Parallel Computing (Chap. 2)","author":"A. Grama","year":"2003","unstructured":"Grama A., Gupta A., Karypis G., Kumar V.: Introduction to Parallel Computing (Chap. 2) 2nd edn. Addison Wesley, Redwood City (2003)","edition":"2"},{"key":"169_CR6","volume-title":"Advanced Computer Architecture: Parallelism, Scalability, Programabilitiy","author":"K. Hwang","year":"1993","unstructured":"Hwang K.: Advanced Computer Architecture: Parallelism, Scalability, Programabilitiy. McGraw Hill International Editions, New York (1993)"},{"key":"169_CR7","doi-asserted-by":"crossref","unstructured":"Jain, N., Sabharwal, Y.: Optimal bucket\u00a0algorithms for large MPI collectives on torus interconnects. In: Proceedings of the 24th ACM International Conference on Supercomputing (ICS \u201810). ACM, New York, NY, USA, 27\u201336 (2010)","DOI":"10.1145\/1810085.1810093"},{"key":"169_CR8","unstructured":"Kumar, S., Sabharwal, Y., Garg, R., Heidelberger, P.: Optimization of all-to-all communication on the blue gene\/L supercomputer. In: 37th International Conference on Parallel Processing, 2008. ICPP \u201808., pp. 320\u2013329, 9\u201312 (Sept. 2008)"},{"key":"169_CR9","doi-asserted-by":"crossref","unstructured":"Liu, G., Gu, N., Ren, K., Tao, Y.: Optimal all-to-all personalized communication in all-port tori. Computer and Computational Sciences, 2006. IMSCCS \u201806. First International Multi-Symposiums on, vol. 1, no., pp. 369\u2013376, 20\u201324 (June 2006)","DOI":"10.1109\/IMSCCS.2006.98"},{"key":"169_CR10","doi-asserted-by":"crossref","unstructured":"Mamadou, H.N., Nanri, T., Murakami, K.: A robust dynamic optimization for MPI All-to-all operation. In: IEEE International Symposium on Parallel & Distributed Processing, IPDPS 2009, pp. 1\u201315, 23\u201329 (May 2009)","DOI":"10.1109\/IPDPS.2009.5160917"},{"key":"169_CR11","unstructured":"Michallon, P.: Sch\u00e9mas de communications globales dans les r\u00e9seaux de processeurs: application \u00e0 la grille torique. Ph.D. Thesis, INPG Grenoble, France (1994)"},{"key":"169_CR12","first-page":"80","volume":"1","author":"P. Michallon","year":"1995","unstructured":"Michallon P., Trystram D.: Minimum depth arcs-disjoint spanning trees for broadcasting on wrap-around meshes. Proc. Int Conf. Parallel Process. 1, 80\u201383 (1995)","journal-title":"Proc. Int Conf. Parallel Process."},{"key":"169_CR13","unstructured":"Peters, J.G., Rapine, C., Trystam, D.: Small Depth Arc-Disjoint Spanning Trees in Two-Dimensional Toroidal Meshes. Technical Report SFU-CMPTR-TR 2002-10, School of Computing Science, Simon Fraser University, (November 2002)"},{"issue":"3","key":"169_CR14","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1109\/71.491578","volume":"7","author":"J.G. Peters","year":"1996","unstructured":"Peters J.G., Syska M.: Circuit-switched broadcasting in torus networks. IEEE Trans. Parallel Distrib. Syst. 7(3), 246\u2013255 (1996)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"12","key":"169_CR15","doi-asserted-by":"crossref","first-page":"1252","DOI":"10.1109\/71.819947","volume":"10","author":"M. Soch","year":"1999","unstructured":"Soch M., Tvrd\u00edk P.: Time-optimal gossip of large packets in noncombining 2D tori and meshes. IEEE Trans. Parallel Distrib. Syst. 10(12), 1252\u20131261 (1999)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"1","key":"169_CR16","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1109\/71.899938","volume":"12","author":"Y. Suh","year":"2001","unstructured":"Suh Y., Shin K.G.: All-to-all personalized communication in multidimensional torus and mesh networks. IEEE Trans. Parallel Distrib. Syst. 12(1), 38\u201359 (2001)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"5","key":"169_CR17","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1109\/71.679215","volume":"9","author":"Y. Suh","year":"1998","unstructured":"Suh Y., Yalamanchili S.: All-to-all communication with minimum start-up costs in 2D\/3D tori and meshes. IEEE Trans. Parallel Distrib. Syst. 9(5), 442\u2013458 (1998)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"12","key":"169_CR18","doi-asserted-by":"crossref","first-page":"1201","DOI":"10.1109\/71.970553","volume":"12","author":"N.S. Sundar","year":"2001","unstructured":"Sundar N.S., Jayasimha D.N., Panda D.K., Sadayappan P.: Hybrid algorithms for complete exchange in 2D meshes. IEEE Trans. Parallel Distrib. Syst. 12(12), 1201\u20131218 (2001)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"169_CR19","unstructured":"Tsai, Y., McKinley, P.K.: Broadcast in all-port wormhole-routed 3D mesh networks using extended dominating sets. In: Ni, L.M. (Ed.) Proceedings of the 1994 International Conference on Parallel and Distributed Systems, IEEE Computer Society, Washington, DC, pp. 120\u2013127 (December 19\u201321, 1994)"},{"issue":"8","key":"169_CR20","doi-asserted-by":"crossref","first-page":"947","DOI":"10.1109\/12.609282","volume":"46","author":"Y. Tseng","year":"1997","unstructured":"Tseng Y.: A dilated-diagonal-based scheme for broadcast in a wormhole-routed 2D torus. IEEE Trans. Comput. 46(8), 947\u2013952 (1997)","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"169_CR21","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1109\/71.588613","volume":"8","author":"Y. Tseng","year":"1997","unstructured":"Tseng Y., Lin T., Panda D.K., Gupta S.K.: Bandwidth-optimal complete exchange on wormhole-routed 2D\/3D torus networks: a diagonal-propagation approach. IEEE Trans. Parallel Distrib. Syst. 8(4), 380\u2013396 (1997)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"10","key":"169_CR22","doi-asserted-by":"crossref","first-page":"1065","DOI":"10.1109\/12.805156","volume":"48","author":"Y. Tseng","year":"1999","unstructured":"Tseng Y., Ni S., Sheu J.: Toward optimal complete exchange on wormhole-routed tori. IEEE Trans. Comput. 48(10), 1065\u20131082 (1999)","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"169_CR23","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1109\/71.744837","volume":"10","author":"Y. Tseng","year":"1999","unstructured":"Tseng Y., Wang S., Ho C.: Efficient broadcasting in wormhole-routed multicomputers: a network-partitioning approach. IEEE Trans. Parallel Distrib. Syst. 10(1), 44\u201361 (1999)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"2","key":"169_CR24","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1142\/S0129626495000266","volume":"5","author":"J. Watts","year":"1995","unstructured":"Watts J., Geijn R.: A pipelined broadcast for multidimensional meshes. Parallel Process. Lett. 5(2), 281\u2013292 (1995)","journal-title":"Parallel Process. Lett."},{"issue":"2","key":"169_CR25","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1109\/71.983941","volume":"13","author":"Y. Yang","year":"2002","unstructured":"Yang Y., Wang J.: Near-optimal all-to-all broadcast in multidimensional all-port meshes and tori. IEEE Trans. Parallel Distrib. Syst. 13(2), 128\u2013141 (2002)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"11","key":"169_CR26","doi-asserted-by":"crossref","first-page":"1034","DOI":"10.1109\/TPDS.2005.129","volume":"16","author":"X. Zhuang","year":"2005","unstructured":"Zhuang X., Liberatore V.: A recursion-based broadcast paradigm in wormhole routed networks. IEEE Trans. Parallel Distrib. Syst. 16(11), 1034\u20131052 (2005)","journal-title":"IEEE Trans. Parallel Distrib. Syst."}],"container-title":["International Journal of Parallel Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10766-011-0169-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10766-011-0169-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10766-011-0169-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,5]],"date-time":"2025-03-05T03:17:17Z","timestamp":1741144637000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10766-011-0169-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4,16]]},"references-count":26,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2011,12]]}},"alternative-id":["169"],"URL":"https:\/\/doi.org\/10.1007\/s10766-011-0169-2","relation":{},"ISSN":["0885-7458","1573-7640"],"issn-type":[{"type":"print","value":"0885-7458"},{"type":"electronic","value":"1573-7640"}],"subject":[],"published":{"date-parts":[[2011,4,16]]}}}