✦ LIBER ✦

Broadcasting multiple messages in a grid

✍ Scribed by Frances L. Van Scoy; Jeffrey A. Brooks

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 890 KB
Volume: 53
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(94)90194-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On broadcasting multiple messages in a d

On broadcasting multiple messages in a d-dimensional grid

✍ Y. Roditty; B. Shoham 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 451 KB

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 multiple messages in simult

Broadcasting multiple messages in simultaneous send/receive systems

✍ Amotz Bar-Noy; Shlomo Kipnis 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 867 KB

Multiple message broadcasting in communi

Multiple message broadcasting in communication networks

✍ Oh-Heum Kwon; Kyung-Yong Chwa 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 754 KB

Process cooperation in multiple message

Process cooperation in multiple message broadcast

✍ Bin Jia 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 475 KB

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

Minimum multiple message broadcast graph

Minimum multiple message broadcast graphs

✍ Hovhannes A. Harutyunyan 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 207 KB

Multiple message broadcasting is the process of multiple message dissemination in a communication network in which m messages, originated by one vertex, are transmitted to all vertices of the network. A graph G with n vertices is called a m-message broadcast graph if its broadcast time is the theore

An Optimal Algorithm for Broadcasting Mu

An Optimal Algorithm for Broadcasting Multiple Messages in Trees

✍ Krzysztof Diks; Andrzej Lingas; Andrzej Pelc 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 118 KB

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