Change search
ReferencesLink to record
Permanent link

Direct link
Oblivious gossiping on tori
Umeå University, Faculty of Science and Technology, Departement of Computing Science.
2002 (English)In: Journal of Algorithms, Vol. 42, no 1, 1-19 p.Article in journal (Refereed) Published
Abstract [en]

Near-optimal gossiping algorithms are given for two-dimensional and higher dimensional tori, assuming the full-port store-and-forward communication model. For two-dimensional tori, a previous algorithm achieved optimality in an intricate way, with an adaptive routing pattern. In contrast, the processing units in our algorithm forward the received packets always in the same way. We thus achieve almost the same performance with patterns that might be hardwired. (C) 2002 Elsevier Science.

Place, publisher, year, edition, pages
2002. Vol. 42, no 1, 1-19 p.
URN: urn:nbn:se:umu:diva-21965ISBN: 0196-6774OAI: diva2:212224
Available from: 2009-04-21 Created: 2009-04-21 Last updated: 2009-04-21

Open Access in DiVA

No full text

Other links

<Go to ISI>://000173424600001
By organisation
Departement of Computing Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 21 hits
ReferencesLink to record
Permanent link

Direct link