Live briefing
Everything about Two-tree broadcast
The two-tree broadcast is an algorithm that implements a broadcast communication pattern on a distributed system using message passing. A broadcast is a commonly used collective operation 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 full-duplex communication model while having a startup latency logarithmic in the number of partaking processors. The algorithm can also be adapted to perform a reduction or prefix sum. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Two-tree broadcastA 5-minute orientation
- Skim a recent paper: Telephone Broadcast on graphs of treewidth twoInfluential work since 2022
- Pick up a classic book: Computer NetworksThe most-reprinted book on the subject
- Read the landmark paper: Two-tree algorithms for full bandwidth broadcast, reduction and scanCited 87 times
- Go sideways: Broadcast (parallel pattern)A closely related topic
- Go sideways: Collective operationA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Two-tree algorithms for full bandwidth broadcast, reduction and scan
Tree-Based Data Broadcast in IEEE 802.15.4 and ZigBee Networks
Tree Based Broadcast in Ad Hoc Networks
Minimum-Energy Broadcasting in Multi-hop Wireless Networks Using a Single Broadcast Tree
All-to-all broadcast in optical WDM networks under light-tree model
A novel tree-based broadcast algorithm for wireless ad hoc networks
Distributed algorithms for constructing a minimum-weight spanning tree in a broadcast network
Clustering-Based Energy-Efficient Broadcast Tree in Wireless Networks
🆕 Influential since 2022
📚 Books worth reading
Computer NetworksAndrew S. Tanenbaum, John David Wetherall · 1981
Intelligence BulletinUnited States. War Department. Military Intelligence Service · 1942
Language and Automata Theory and ApplicationsAdrian-Horia Dediu · 2012
The Conspirators HierarchyJohn Coleman · 1992
Parallel Programming in C with MPI and OpenMPMichael J. Quinn · 2003
Practical radioHenry Smith Williams M.D. LL.D. · 1922
Intelligent Technologies and Engineering SystemsJengnan Juang · 2013- 📕The two treesGerald Vann · 1948
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Broadcast (parallel pattern) Broadcast is a collective communication primitive in parallel programming to distribute programming instructions or data to nodes in a cluster. It is the…
- Collective operation Collective operations are building blocks for interaction patterns, that are often used in SPMD algorithms in the parallel programming context. Hence,…
- Prefix sum In computer science, the prefix sum, cumulative sum, inclusive scan, or simply scan of a sequence of numbers x0, x1, x2, ... is a second sequence of numbers…
- Hypercube (communication pattern) d-dimensional hypercube is a network topology for parallel computers with 2d processing elements. The topology allows for an efficient implementation of…
- Brodal queue In computer science, the Brodal queue is a heap/priority queue structure with very low worst case time bounds: O(1) for insertion, find-minimum, meld (merge…
- Binary tree In computer science, a binary tree is a tree data structure in which each node has at most two children, referred to as the left child and the right child…
- Skew binomial heap In computer science, a skew binomial heap (or skew binomial queue) is a data structure for priority queue operations. It is a variant of the binomial heap…
- Treap In computer science, the treap and the randomized binary search tree are two closely related forms of binary search tree data structures that maintain…