{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T16:07:53Z","timestamp":1648570073738},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2007,7,24]],"date-time":"2007-07-24T00:00:00Z","timestamp":1185235200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2008,5]]},"DOI":"10.1007\/s00224-007-9008-7","type":"journal-article","created":{"date-parts":[[2007,7,23]],"date-time":"2007-07-23T14:36:43Z","timestamp":1185201403000},"page":"519-535","source":"Crossref","is-referenced-by-count":0,"title":["Store-and-Forward Multicast Routing on the Mesh"],"prefix":"10.1007","volume":"42","author":[{"given":"Kieran T.","family":"Herley","sequence":"first","affiliation":[]},{"given":"Andrea","family":"Pietracaprina","sequence":"additional","affiliation":[]},{"given":"Geppino","family":"Pucci","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,7,24]]},"reference":[{"issue":"1","key":"9008_CR1","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1006\/jpdc.1998.1473","volume":"53","author":"E. Fleury","year":"1998","unstructured":"Fleury, E., Fraigniaud, P.: Strategies for multicasting in wormhole-routed meshes. J.\u00a0Parallel Distrib. Comput. 53(1), 26\u201362 (1998)","journal-title":"J.\u00a0Parallel Distrib. Comput."},{"issue":"2","key":"9008_CR2","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1006\/jpdc.1998.1483","volume":"54","author":"M. Grammatikakis","year":"1998","unstructured":"Grammatikakis, M., Hsu, D., Kraetzel, M., Sibeyn, J.: Packet routing in fixed-connection networks: a survey. J.\u00a0Parallel Distrib. Comput. 54(2), 77\u2013132 (1998)","journal-title":"J.\u00a0Parallel Distrib. Comput."},{"key":"9008_CR3","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1006\/inco.2000.3004","volume":"173","author":"R. Grossi","year":"2002","unstructured":"Grossi, R., Pietracaprina, A., Pucci, G.: Optimal deterministic protocols for mobile robots on a grid. Inf. Comput. 173, 132\u2013142 (2002)","journal-title":"Inf. Comput."},{"issue":"6","key":"9008_CR4","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0020-0190(90)90214-I","volume":"33","author":"T. Hagerup","year":"1990","unstructured":"Hagerup, T., R\u00fcb, C.: A\u00a0guided tour of Chernoff bounds. Inf. Process. Lett. 33(6), 305\u2013308 (1990)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"9008_CR5","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1137\/S0097539789164765","volume":"23","author":"K. Herley","year":"1994","unstructured":"Herley, K., Bilardi, G.: Deterministic simulations of PRAMs on bounded-degree networks. SIAM J. Comput. 23(2), 276\u2013292 (1994)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"9008_CR6","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1006\/inco.2000.3006","volume":"165","author":"K. Herley","year":"2001","unstructured":"Herley, K., Pietracaprina, A., Pucci, G.: Implementing shared memory on mesh-connected computers and on the fat-tree. Inf. Comput. 165(2), 123\u2013143 (2001)","journal-title":"Inf. Comput."},{"key":"9008_CR7","volume-title":"An Introduction to Parallel Algorithms","author":"J. J\u00e1J\u00e1","year":"1992","unstructured":"J\u00e1J\u00e1, J.: An Introduction to Parallel Algorithms. Addison Wesley, Reading (1992)"},{"issue":"4","key":"9008_CR8","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1109\/71.762817","volume":"10","author":"R. Kesavan","year":"1999","unstructured":"Kesavan, R., Panda, D.: Multiple multicast with minimized node contention on wormhole k-ary n-cube networks. IEEE Trans. Parallel Distrib. Syst. 10(4), 371\u2013393 (1999)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"9008_CR9","volume-title":"Introduction to Parallel Algorithms and Architectures: Arrays \u2022 Trees \u2022 Hypercubes","author":"F. Leighton","year":"1992","unstructured":"Leighton, F.: Introduction to Parallel Algorithms and Architectures: Arrays \u2022 Trees \u2022 Hypercubes. Morgan Kaufmann, San Mateo (1992)"},{"issue":"1","key":"9008_CR10","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1006\/jagm.1994.1030","volume":"17","author":"F. Leighton","year":"1994","unstructured":"Leighton, F., Maggs, B., Ranade, A., Rao, S.: Randomized routing and sorting on fixed-connection networks. J. Algorithms 17(1), 157\u2013205 (1994)","journal-title":"J. Algorithms"},{"key":"9008_CR11","doi-asserted-by":"crossref","unstructured":"Libeskind-Hadas, R., Mazzoni, D., Rajagopalan, R.: Tree-based multicasting in wormhole-routed irregular topologies. In: Proc. of the 1st Merged IPPS\/SPDP Symposium, pp.\u00a0244\u2013249, March\/April 1998","DOI":"10.1109\/IPPS.1998.669919"},{"key":"9008_CR12","doi-asserted-by":"crossref","unstructured":"Lin, X., Ni, L.: Deadlock-free multicast wormhole routing in multicomputer networks. In: Proc. of the 18th ACM Annual International Symposium on Computer Architecture, pp.\u00a0116\u2013125, May 1991","DOI":"10.1145\/115952.115965"},{"issue":"10","key":"9008_CR13","doi-asserted-by":"crossref","first-page":"1105","DOI":"10.1109\/71.246072","volume":"4","author":"X. Lin","year":"1993","unstructured":"Lin, X., Ni, L.: Multicast communication in multicomputer networks. IEEE Trans. Parallel Distrib. Syst. 4(10), 1105\u20131117 (1993)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"3","key":"9008_CR14","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/BF02679461","volume":"30","author":"A. Pietracaprina","year":"1997","unstructured":"Pietracaprina, A., Pucci, G.: The complexity of deterministic PRAM simulation on distributed memory machines. Theory Comput. Syst. 30(3), 231\u2013247 (1997)","journal-title":"Theory Comput. Syst."},{"issue":"1","key":"9008_CR15","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1016\/j.ipl.2005.04.006","volume":"96","author":"A. Pietracaprina","year":"2005","unstructured":"Pietracaprina, A., Pucci, G.: Optimal many-to-one routing on the mesh with constant queues. Inf. Process. Lett. 96(1), 24\u201329 (2005)","journal-title":"Inf. Process. Lett."},{"key":"9008_CR16","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0022-0000(91)90005-P","volume":"42","author":"A. Ranade","year":"1991","unstructured":"Ranade, A.: How to emulate shared memory. J.\u00a0Comput. Syst. Sci. 42, 307\u2013326 (1991)","journal-title":"J.\u00a0Comput. Syst. Sci."},{"issue":"10","key":"9008_CR17","doi-asserted-by":"crossref","first-page":"1029","DOI":"10.1109\/71.473513","volume":"6","author":"D. Robinson","year":"1995","unstructured":"Robinson, D., McKinley, P., Cheng, B.: Optimal multicast communication in wormhole-routed torus networks. IEEE Trans. Parallel Distrib. Syst. 6(10), 1029\u20131042 (1995)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"9008_CR18","doi-asserted-by":"crossref","unstructured":"Sibeyn, J.F., Kaufmann, M.: Deterministic 1-k routing on meshes, with application to hot-potato worm-hole routing. In: Proc. of the 11th Symp. on Theoretical Aspects of Computer Science. Lecture Notes in Comput. Sci., vol.\u00a0775, pp.\u00a0237\u2013248 (February 1994)","DOI":"10.1007\/3-540-57785-8_145"},{"key":"9008_CR19","doi-asserted-by":"crossref","unstructured":"Wang, C., Hou, Y., Hsu, L.: Adaptive path-based multicast on wormhole-routed hypercubes. In: Proc. of the 8th Euro-Par. Lecture Notes in Comput. Sci., vol.\u00a02400, pp.\u00a0757\u2013761 (August 2002)","DOI":"10.1007\/3-540-45706-2_106"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-007-9008-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-007-9008-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-007-9008-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T07:51:34Z","timestamp":1558684294000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-007-9008-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,7,24]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,5]]}},"alternative-id":["9008"],"URL":"https:\/\/doi.org\/10.1007\/s00224-007-9008-7","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,7,24]]}}}