{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T17:46:58Z","timestamp":1648576018757},"reference-count":9,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[2002,3]]},"abstract":"<jats:p> We consider a communication model in which the intermediate nodes cannot store in-transit messages. Under this communication model we study the all-node multicast operation on multidimensional grids and tori. We derive optimal algorithms that are compactly described using a short sequence of node identities. This characteristic contributes to the simplicity of the router, the unit that resides at each processor and is dedicated to handle communication. <\/jats:p>","DOI":"10.1142\/s012962640200080x","type":"journal-article","created":{"date-parts":[[2012,9,1]],"date-time":"2012-09-01T09:07:47Z","timestamp":1346490467000},"page":"31-39","source":"Crossref","is-referenced-by-count":1,"title":["COMPACT MULTICAST ALGORITHMS ON GRIDS AND TORI WITHOUT INTERMEDIATE BUFFERING"],"prefix":"10.1142","volume":"12","author":[{"given":"DOMINIQUE","family":"BARTH","sequence":"first","affiliation":[{"name":"Laboratoire de Recherche en Informatique, Universit\u00e9 Paris-Sud, 91405 Orsay CEDEX, France"}]},{"given":"PARASKEVI","family":"FRAGOPOULOU","sequence":"additional","affiliation":[{"name":"Laboratoire de Recherche en Informatique, Universit\u00e9 Paris-Sud, 91405 Orsay CEDEX, France"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"p_2","doi-asserted-by":"publisher","DOI":"10.1016\/0743-7315(91)90033-6"},{"key":"p_3","first-page":"202","volume":"1","author":"Coolsaet K.","year":"1994","journal-title":"Nordic Journal of Computing"},{"key":"p_4","doi-asserted-by":"publisher","DOI":"10.1007\/BF01994840"},{"key":"p_5","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(97)00105-4"},{"key":"p_6","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8191(96)00029-4"},{"key":"p_7","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1996.0012"},{"key":"p_8","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1998.1483"},{"key":"p_9","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1997.1399"},{"key":"p_11","doi-asserted-by":"publisher","DOI":"10.1109\/12.506425"}],"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S012962640200080X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T12:19:48Z","timestamp":1565093988000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S012962640200080X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,3]]},"references-count":9,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2002,3]]}},"alternative-id":["10.1142\/S012962640200080X"],"URL":"https:\/\/doi.org\/10.1142\/s012962640200080x","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,3]]}}}