{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T12:22:10Z","timestamp":1648988530197},"reference-count":19,"publisher":"Elsevier BV","issue":"8","license":[{"start":{"date-parts":[[1999,9,1]],"date-time":"1999-09-01T00:00:00Z","timestamp":936144000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Computing"],"published-print":{"date-parts":[[1999,9]]},"DOI":"10.1016\/s0167-8191(99)00028-9","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T14:52:00Z","timestamp":1049727120000},"page":"1035-1057","source":"Crossref","is-referenced-by-count":0,"title":["Scattering and multi-scattering in trees and meshes, with local routing and without buffering"],"prefix":"10.1016","volume":"25","author":[{"given":"Dominique","family":"Barth","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Laforest","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-8191(99)00028-9_BIB1","unstructured":"R.H. Arpaci, D.A. Patterson, The interaction of parallel and sequential workloads on a network of workstations, UC Berkeley Technical Report CS-94-830, 1994"},{"key":"10.1016\/S0167-8191(99)00028-9_BIB2","series-title":"Graphes et Hypergraphes","author":"Berge","year":"1971"},{"key":"10.1016\/S0167-8191(99)00028-9_BIB3","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0743-7315(91)90033-6","article-title":"Optimal communication algorithms for hypercubes","volume":"11","author":"Bertsekas","year":"1991","journal-title":"J. Parallel Distributed Comput."},{"key":"10.1016\/S0167-8191(99)00028-9_BIB4","doi-asserted-by":"crossref","unstructured":"A. Borodin, P. Raghavan, P. Schrieber, E. Upfal, How much hardware can help routing, Proceedings of the 25th Symposium on Theory of Computing, 1993, pp. 573\u2013582","DOI":"10.1145\/167088.167237"},{"key":"10.1016\/S0167-8191(99)00028-9_BIB5","doi-asserted-by":"crossref","unstructured":"F. Cappello, D. Etiemble, Communication in parallel architectures and networks of workstation: from standards to new standards, Proceedings of Parallel Computer Technologies, Lecture Notes in Computing Science, vol. 1277, 1997, pp. 298\u2013310","DOI":"10.1007\/3-540-63371-5_30"},{"key":"10.1016\/S0167-8191(99)00028-9_BIB6","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1006\/jpdc.1995.1128","article-title":"Optimal communication algorithms in distributed loop networks","volume":"30","author":"Das","year":"1995","journal-title":"J. Parallel Distributed Comput."},{"key":"10.1016\/S0167-8191(99)00028-9_BIB7","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/S0166-218X(97)00105-4","article-title":"Spanning graphs with applications to communication on a subclass of the cayley graph based networks","volume":"83","author":"Fragopoulou","year":"1998","journal-title":"Discrete App. Math."},{"key":"10.1016\/S0167-8191(99)00028-9_BIB8","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1006\/jpdc.1996.0012","article-title":"Optimal communication primitives on the generalized hypercube network","volume":"32","author":"Fragopoulou","year":"1996","journal-title":"J. Parallel Distributed Comput."},{"key":"10.1016\/S0167-8191(99)00028-9_BIB9","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0166-218X(94)90180-5","article-title":"Methods and problems of communication in usual networks","volume":"53","author":"Fraigniaud","year":"1994","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0167-8191(99)00028-9_BIB10","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/0167-8191(90)90140-5","article-title":"Scattering on a ring of processors","volume":"13","author":"Fraigniaud","year":"1990","journal-title":"Parallel Comput."},{"key":"10.1016\/S0167-8191(99)00028-9_BIB11","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1006\/jpdc.1998.1483","article-title":"Packet routing in fixed-connection networks: a survey","volume":"54","author":"Grammatikakis","year":"1998","journal-title":"J. Parallel Distributed Comput."},{"key":"10.1016\/S0167-8191(99)00028-9_BIB12","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1002\/net.3230180406","article-title":"A survey of gossiping and broadcasting in communication networks","volume":"18","author":"Hedetniemi","year":"1988","journal-title":"Networks"},{"key":"10.1016\/S0167-8191(99)00028-9_BIB13","series-title":"Advanced Computer Architecture","author":"Hwang","year":"1993"},{"issue":"9","key":"10.1016\/S0167-8191(99)00028-9_BIB14","doi-asserted-by":"crossref","first-page":"1249","DOI":"10.1109\/12.29465","article-title":"Optimum broadcasting and personalized communication in hypercubes","volume":"38","author":"Johnsson","year":"1989","journal-title":"IEEE Trans. Computers"},{"key":"10.1016\/S0167-8191(99)00028-9_BIB15","doi-asserted-by":"crossref","unstructured":"M. Kunde, Block gossiping on grids and tori: deterministic sorting and routing match the bisection bound, Proc. European Symp. Alg., Lecture Notes in Computing Science, vol. 726, 1993, pp. 272\u2013283","DOI":"10.1007\/3-540-57273-2_62"},{"key":"10.1016\/S0167-8191(99)00028-9_BIB16","series-title":"Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes","author":"Leighton","year":"1992"},{"key":"10.1016\/S0167-8191(99)00028-9_BIB17","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/S0167-8191(06)80015-3","article-title":"Multiscattering on the cube-connected cycles","volume":"20","author":"Li","year":"1994","journal-title":"Parallel Comput."},{"key":"10.1016\/S0167-8191(99)00028-9_BIB18","series-title":"Communications Dans Les R\u00e9seaux D'interconnexion","author":"de Rumeur","year":"1994"},{"key":"10.1016\/S0167-8191(99)00028-9_BIB19","doi-asserted-by":"crossref","unstructured":"A. Schuster, Bounds and analysis techniques for greedy hot-potato routing, in: Optical interconnections and Parallel Processing: Trends and Interface, Kluwer Academic Publishers, Dordrecht, 1997, pp. 283\u2013354","DOI":"10.1007\/978-1-4757-2791-3_11"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819199000289?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819199000289?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,28]],"date-time":"2020-01-28T23:44:44Z","timestamp":1580255084000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167819199000289"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,9]]},"references-count":19,"journal-issue":{"issue":"8","published-print":{"date-parts":[[1999,9]]}},"alternative-id":["S0167819199000289"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8191(99)00028-9","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1999,9]]}}}