{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T22:13:48Z","timestamp":1648764828196},"reference-count":0,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[1993,12]]},"abstract":"<jats:p> This paper considers the gossiping problem in mesh-bus computers, in which n<jats:sup>2<\/jats:sup> nodes arranged on an n\u00d7n array are connected by n column-buses and n row-buses. The algorithm we propose in this paper completes the gossiping in [n\/2]+[ log <jats:sub>2<\/jats:sub> n]+1 steps. Since a lower bound on the number of steps for this problem is shown to be [n\/2]+[ log <jats:sub>2<\/jats:sub> n]\u22121, it takes at most only 2 more steps than an optimal algorithm. <\/jats:p>","DOI":"10.1142\/s0129626493000393","type":"journal-article","created":{"date-parts":[[2004,11,23]],"date-time":"2004-11-23T03:29:30Z","timestamp":1101180570000},"page":"357-361","source":"Crossref","is-referenced-by-count":6,"title":["OPTIMAL GOSSIPING IN MESH-BUS COMPUTERS"],"prefix":"10.1142","volume":"03","author":[{"given":"SATOSHI","family":"FUJITA","sequence":"first","affiliation":[{"name":"Department of Electrical Engineering, Faculty of Engineering, Hiroshima University, Japan"}]},{"given":"MASAFUMI","family":"YAMASHITA","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering, Faculty of Engineering, Hiroshima University, Japan"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626493000393","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T16:18:19Z","timestamp":1565108299000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626493000393"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,12]]},"references-count":0,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[1993,12]]}},"alternative-id":["10.1142\/S0129626493000393"],"URL":"https:\/\/doi.org\/10.1142\/s0129626493000393","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,12]]}}}