{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T19:14:16Z","timestamp":1774120456462,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540440499","type":"print"},{"value":"9783540457060","type":"electronic"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45706-2_112","type":"book-chapter","created":{"date-parts":[[2007,10,7]],"date-time":"2007-10-07T05:37:18Z","timestamp":1191735438000},"page":"799-803","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["The Hierarchical Factor Algorithm for All-to-All Communication"],"prefix":"10.1007","author":[{"given":"Peter","family":"Sanders","sequence":"first","affiliation":[]},{"given":"Jesper Larsson","family":"Tr\u00e4ff","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,8,20]]},"reference":[{"issue":"11","key":"112_CR1","doi-asserted-by":"publisher","first-page":"1143","DOI":"10.1109\/71.642949","volume":"8","author":"J. Bruck","year":"1997","unstructured":"J. Bruck, C.-T. Ho, S. Kipnis, E. Upfal, and D. Weathersby. Efficient algorithms for all-to-all communications in multiport message-passing systems. IEEE Transactions on Parallel and Distributed Systems, 8(11):1143\u20131156, 1997.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"112_CR2","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1016\/0167-8191(94)00110-V","volume":"21","author":"S. E. Hambrusch","year":"1995","unstructured":"S. E. Hambrusch, F. Hameed, and A. A. Khokar. Communication operations on coarse-grained mesh architectures. Parallel Computing, 21:731\u2013751, 1995.","journal-title":"Parallel Computing"},{"key":"112_CR3","unstructured":"F. Harary. Graph Theory. Addison-Wesley, 1967."},{"key":"112_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1007\/3-540-45255-9_11","volume-title":"7th European PVM\/MPI User\u2019s Group Meeting","author":"L. P. Huse","year":"2000","unstructured":"L. P. Huse. MPI optimization for SMP based clusters interconnected with SCI. In 7th European PVM\/MPI User\u2019s Group Meeting, volume 1908 of Lecture Notes in Computer Science, pages 56\u201363, 2000."},{"key":"112_CR5","doi-asserted-by":"crossref","unstructured":"N. T. Karonis, B. R. de Supinski, I. Foster, W. Gropp, E. Lusk, and J. Bresnahan. Exploiting hierarchy in parallel computer networks to optimize collective operation performance. In Proceedings of International Parallel and Distributed Processing Symposium (IPDPS\u20192000), pages 377\u2013384, 2000.","DOI":"10.1109\/IPDPS.2000.846009"},{"key":"112_CR6","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1006\/jagm.2001.1169","volume":"41","author":"P. Sanders","year":"2001","unstructured":"P. Sanders and R. Solis-Oba. How helpers hasten h-relations. Journal of Algorithms, 41:86\u201398, 2001.","journal-title":"Journal of Algorithms"},{"key":"112_CR7","unstructured":"D. S. Scott. Efficient all-to-all communication patterns in hypercube and mesh topologies. In Sixth Distributed Memory Computing Conference Proceedings, pages 398\u2013403, 1991."},{"key":"112_CR8","doi-asserted-by":"crossref","unstructured":"S. Sistare, R. vandeVaart, and E. Loh. Optimization of MPI collectives on clusters of large-scale SMPs. In Supercomputing, 1999. http:\/\/www.supercomp.org\/sc99\/proceedings\/techpap.htm\/#mpi .","DOI":"10.1145\/331532.331555"},{"key":"112_CR9","unstructured":"M. Snir, S. Otto, S. Huss-Lederman, D. Walker, and J. Dongarra. MPI \u2014 The Complete Reference, volume 1, The MPI Core. MIT Press, second edition, 1998."},{"issue":"3","key":"112_CR10","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1109\/71.841742","volume":"11","author":"Y. Yang","year":"2000","unstructured":"Y. Yang and J. Wang. Optimal all-to-all personalized exchange in self-routable multistage networks. IEEE Transactions on Parallel and Distributed Systems, 11(3):261\u2013274, 2000.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2002 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45706-2_112","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T12:43:36Z","timestamp":1737463416000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45706-2_112"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540440499","9783540457060"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-45706-2_112","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"20 August 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}