Two-tree broadcast

<p>The two-tree broadcast (abbreviated 2tree-broadcast or 23-broadcast) is an algorithm that implements a <a href="/facts/Broadcasting_(networking)/NRj7gHre">broadcast</a> communication pattern on a <a href="/facts/Distributed_computing/o5nyhqTF">distributed system</a> using <a href="/facts/Message_passing/RYf3hD3J">message passing</a>.
A broadcast is a commonly used <a href="/facts/Message_Passing_Interface/BEuBgDpm">collective operation</a> that sends data from one processor to all other processors.
The two-tree broadcast communicates concurrently over two binary trees that span all processors. This achieves full usage of the bandwidth in the <a href="/facts/Duplex_(telecommunications)/LCULeVxr">full-duplex</a> communication model while having a startup latency logarithmic in the number of partaking processors.
The algorithm can also be adapted to perform a <a href="/facts/Fold_(higher-order_function)/gllDcCxw">reduction</a> or <a href="/facts/Prefix_sum/HAacSHLW">prefix sum</a>.
</p>

Two-tree broadcast open-in-new

Two-tree broadcast