{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T10:07:33Z","timestamp":1770286053853,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540634409","type":"print"},{"value":"9783540695493","type":"electronic"}],"license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"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":[[1997]]},"DOI":"10.1007\/bfb0002734","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T07:29:42Z","timestamp":1132730982000},"page":"196-207","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Broadcast and associative operations on fat-trees"],"prefix":"10.1007","author":[{"given":"G.","family":"Bilardi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.","family":"Codenotti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Del Corso","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Pinotti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Resta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,9,26]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"A. Bar-Noy and S. Kipnis. Designing Broadcasting Algorithms in the Postal Model for Message-Passing Systems. In Proceedings of the 4th Annual Symposium on Parallel Algorithms and Architectures, pages 13\u201322. ACM, 1992.","DOI":"10.1145\/140901.140903"},{"key":"22_CR2","unstructured":"P. Bay and G. Bilardi. An area universal VLSI circuit. In Proceedings of the 1993 Symposium on Integrated Systems, pages 53\u201367, March 1993."},{"key":"22_CR3","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/BFb0049427","volume-title":"Algorithms \u2014 ESA '94","author":"Gianfranco Bilardi","year":"1994","unstructured":"G. Bilardi and P. Bay. An area lower bound for a class of fat-trees. In Proceedings of the 1994 European Symposium on Algorithms, pages 413\u2013423, Utrecht, The Netherlands, Springer-Verlag LNCS 855, 1994."},{"issue":"3","key":"22_CR4","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1145\/210346.210417","volume":"42","author":"P. Bay","year":"1995","unstructured":"P. Bay and G. Bilardi. Deterministic on-line routing on area-universal networks. Journal of the ACM, 42(3):614\u2013640, May 1995.","journal-title":"Journal of the ACM"},{"key":"22_CR5","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0020-0190(94)00070-0","volume":"51","author":"G. Bilardi","year":"1994","unstructured":"G. Bilardi, S. Chauduri, D. Dubashi, and K. Mehlhorn. A lower bound for area-universal graphs. Information Processing Letters, 51, 101\u2013105, 1994.","journal-title":"Information Processing Letters"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"G. Bilardi, K.T. Herley, A. Pietracaprina, G. Pucci, and P. Spirakis, BSP vs LogP. In Proceedings of the 8th Annual Symposium on Parallel Algorithms and Architectures, pages 25\u201332. ACM, 1996.","DOI":"10.1145\/237502.237504"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"D. Culler, R. Karp, D. Patterson, A. Sahay, K. E. Schauser, E. Santos, R. Subramonian, and T. von Eicken. LogP: Towards a Realistic Model of Parallel Computation. In Proceedings of the 4th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. ACM, 1993.","DOI":"10.1145\/155332.155333"},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"J. Hromkovi\u010d, R. Klasing, B. Monien, R. Peine. Dissemination of Information in Interconnection Networks (Broadcasting and Gossiping). In: Ding-Zhu Du and D. Frank Hsu (eds.), Combinatorial Network Theory, Kluwer Academic Publishers, 1995, pp. 125\u2013212.","DOI":"10.1007\/978-1-4757-2491-2_5"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"R. Karp, A. Sahay, E. Santos, K. E. Schauser. Optimal Broadcast and Summation in the LogP Model. In Proceedings of the 5th ACM Symposium on Parallel Algorithms and Architectures, June 1993.","DOI":"10.1145\/165231.165250"},{"key":"22_CR10","unstructured":"R. I. Greenberg and C. E. Leiserson. Randomized routing on fat-trees. In S. Micali, editor, Randomness and Computation, pages 345\u2013374. JAI Press, Inc., 1989."},{"issue":"12","key":"22_CR11","doi-asserted-by":"publisher","first-page":"1358","DOI":"10.1109\/12.338095","volume":"C-43","author":"R. I. Greenberg","year":"1994","unstructured":"R. I. Greenberg. The fat-pyramid and universal parallel computation independent of wire delay. IEEE Transactions on Computers, C-43(12):1358\u20131364, December 1994.","journal-title":"IEEE Transactions on Computers"},{"key":"22_CR12","doi-asserted-by":"crossref","unstructured":"C. E. Leiserson, Z. S. Abuhamdeh, D. C. Douglas, C. R. Feynman, M. N. Ganmukhi, J. V. Hill, W. D. Hillis, B. C. Kuszmaul, M. A. St. Pierre, D. S. Wells, M. C. Wong, S. W. Yang, and R. Zak. The network architecture of the Connection Machine CM-5. In Proceedings of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 272\u2013285, July 1992.","DOI":"10.1145\/140901.141883"},{"issue":"10","key":"22_CR13","doi-asserted-by":"publisher","first-page":"892","DOI":"10.1109\/TC.1985.6312192","volume":"C-34","author":"C. E. Leiserson","year":"1985","unstructured":"C. E. Leiserson. Fat-trees: Universal networks for hardware-efficient supercomputing. IEEE Transactions on Computers, C-34(10):892\u2013900, October 1985.","journal-title":"IEEE Transactions on Computers"},{"key":"22_CR14","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BF01762110","volume":"3","author":"C. E. Leiserson","year":"1988","unstructured":"C. E. Leiserson and B. Maggs. Communication-efficient parallel algorithms for distributed random-access machines. Algorithmica, 3, 53\u201377, 1988.","journal-title":"Algorithmica"},{"key":"22_CR15","doi-asserted-by":"crossref","unstructured":"T. Leighton, B. Maggs, and S. Rao. Universal packet routing algorithms. In Proceedings of the 29th Annual Symposium on the Foundations of Computer Science, White Plains, New York, October 1988.","DOI":"10.1109\/SFCS.1988.21942"},{"issue":"1","key":"22_CR16","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1006\/jagm.1994.1030","volume":"17","author":"T. Leighton","year":"1994","unstructured":"T. Leighton, B. Maggs, A. Ranade and S. Rao. Randomized Routing and Sorting on Fixed-Connection Networks. Journal of Algorithms, 17(1):157\u2013205, 1994.","journal-title":"Journal of Algorithms"},{"key":"22_CR17","unstructured":"A.L. Rosenberg, V. Scarano and R.K. Sitaraman. The Reconfigurable Ring of Processors: Fine-grained Tree-structured Computations. 6th IEEE Symposium on Parallel and Distributed Processing, 1994."},{"key":"22_CR18","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/79173.79181","volume":"33","author":"L. G. Valiant","year":"1990","unstructured":"L. G. Valiant. A Bridging Model for Parallel Computation. Communication of the ACM, 33:103\u2013111, 1990. *** DIRECT SUPPORT *** A0008C42 00007","journal-title":"Communication of the ACM"}],"container-title":["Lecture Notes in Computer Science","Euro-Par'97 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0002734","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,19]],"date-time":"2020-04-19T20:49:10Z","timestamp":1587329350000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0002734"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540634409","9783540695493"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/bfb0002734","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"26 September 2005","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"}]}}