✦ LIBER ✦

Wormhole broadcast in star graph networks

✍ Scribed by Shahram Latifi; Pradip K. Srimani

Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 175 KB
Volume: 24
Category: Article
ISSN: 0167-8191
DOI: 10.1016/s0167-8191(98)00057-x

No coin nor oath required. For personal study only.

✦ Synopsis

We propose a new broadcasting algorithm in star graph connected networks with wormhole routing. We use the usual single-port communication model with intermediate node reception capability where a node can communicate with a single neighbor at any instant of time. Lower bound under the model is derived and ecient algorithms are developed to achieve broadcasting in O(n) communication time in a star graph S n (with n! nodes which is sublogarithmic in the number of nodes in the network).

📜 SIMILAR VOLUMES

Unicast-based multicast algorithm in wor

Unicast-based multicast algorithm in wormhole-routed star graph interconnection networks

✍ Jelena Mišić 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 266 KB

A contention-free unicast-based multicast algorithm is developed for wormhole-routed star graph interconnection networks. Since the size of the buffers in the wormhole routing controller is much smaller than the size of the message, only destination nodes of multicast should receive message and stor

A broadcasting algorithm in star graph i

A broadcasting algorithm in star graph interconnection networks

✍ Jang-Ping Sheu; Wen-Hwa Liaw; Tzung-Shi Chen 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 464 KB

A dual-hamiltonian-path-based multicasti

A dual-hamiltonian-path-based multicasting strategy for wormhole-routed star graph interconnection networks

✍ Nen-Chung Wang; Chih-Ping Chu; Tzung-Shi Chen 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 230 KB

Multicast is an important collective communication operation on multicomputer systems, in which the same message is delivered from a source node to an arbitrary number of destination nodes. The star graph interconnection network has been recognized as an attractive alternative to the popular hypercu

Scheduling of independent jobs in star g

Scheduling of independent jobs in star graph networks

✍ S. Latifi; P.K. Srimani 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 679 KB

Scheduling in broadcast networks

✍ Hall, Nicholas G.; Liu, Wei-Ping; Sidney, Jeffrey B. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 325 KB

Broadcasting in a communications network has been the subject of many studies in recent years. The studies vary in their assumptions governing the behavior of the network and in their objectives with respect to the network. Almost all the work to date uses the unit transmission time assumption, that

Conditional Fault Diameter of Star Graph

Conditional Fault Diameter of Star Graph Networks

✍ Yordan Rouskov; Shahram Latifi; Pradip K. Srimani 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 300 KB

It is well known that star graphs are strongly resilient like the n cubes in the sense that they are optimally fault tolerant and the fault diameter is increased only by one in the presence of maximum number of allowable faults. We investigate star graphs under the conditions of forbidden faulty set