Broadcasting multiple messages in simultaneous send/receive systems
โ Scribed by Amotz Bar-Noy; Shlomo Kipnis
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 867 KB
- Volume
- 55
- Category
- Article
- ISSN
- 0166-218X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
We present an optimal algorithm for broadcasting m messages from one process to n ร 1 other processes in a one-port fully connected communication model, where m P 1; n > 1. In this algorithm, the processes are organized into 2 blog nc cooperation units, each consisting of one or two processes. Messa
We consider multiple message broadcasting in tree networks. The source (considered as the root of the tree) has k messages which have to be broadcast to all nodes of the tree. In every time unit each node can send one of its already obtained messages to one of its children. A k-message broadcasting
An algorithm for broadcasting multiple messages on a d-dimensional grid (d > 3 ) starting from the (1, 1, , 1) comer is presented. The algorithm has a complexity of d(n + m -2), where m is the number of messages transmitted and n is the number of points in each dimension. This answers a conjecture t
Broadcasting is an important operation in many message-passing systems that has been widely investigated. Most existing broadcasting algorithms, however, do not address several emerging trends in distributed-memory parallel computers and high-speed communication networks. These trends include (i) tr