๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A bandwidth latency tradeoff for broadcast and reduction

โœ Scribed by Peter Sanders; Jop F Sibeyn


Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
109 KB
Volume
86
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

โœฆ Synopsis


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.


๐Ÿ“œ SIMILAR VOLUMES


Two-tree algorithms for full bandwidth b
โœ Peter Sanders; Jochen Speck; Jesper Larsson Trรคff ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 673 KB

We present a new, simple algorithmic idea for the collective communication operations broadcast, reduction, and scan (prefix sums). The algorithms concurrently communicate over two binary trees which both span the entire network. By careful layout and communication scheduling, each tree communicates

Ordering for bandwidth reduction
โœ A. Kaveh ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 857 KB
A study of application sensitivity to va
โœ WORLEY, PATRICK H.; ROBINSON, ALLEN C.; MACKAY, DAVID R.; BARRAGY, EDWARD J. ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 144 KB ๐Ÿ‘ 2 views

This study measures the effects of changes in message latency and bandwidth for productionlevel codes on a current generation tightly coupled MPP, the Intel Paragon. Messages are sent multiple times to study the application sensitivity to variations in bandwidth and latency. This method preserves th