Change search
ReferencesLink to record
Permanent link

Direct link
A bandwidth latency tradeoff for broadcast and reduction
Umeå University, Faculty of Science and Technology, Departement of Computing Science.
2003 (English)In: Information Processing Letters, Vol. 86, no 1, 33-38 p.Article in journal (Refereed) Published
Abstract [en]

The "fractional tree" algorithm for broadcasting and reduction is introduced. Its communication pattern interpolates between two well known patterns-sequential pipeline and pipelined binary tree. The speedup over the best of these simple methods can approach two for large systems and messages of intermediate size. For networks which are not very densely connected the new algorithm seems to be the best known method for the important case that each processor has only a single (possibly bidirectional) channel into the communication network. (C) 2002 Elsevier Science B.V. All rights reserved.

Place, publisher, year, edition, pages
2003. Vol. 86, no 1, 33-38 p.
URN: urn:nbn:se:umu:diva-21972ISBN: 0020-0190OAI: diva2:212235
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>://000181569300006
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: 18 hits
ReferencesLink to record
Permanent link

Direct link