A bandwidth latency tradeoff for broadcast and reduction
2003 (English)In: Information Processing Letters, Vol. 86, no 1, 33-38 p.Article in journal (Refereed) Published
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.
IdentifiersURN: urn:nbn:se:umu:diva-21972ISBN: 0020-0190OAI: oai:DiVA.org:umu-21972DiVA: diva2:212235