An efficient circuit–switched broadcasting in star graph

Authors:
Cheng-Ta Lee;Yeong-Sung Lin
Affiliations:
Department of Information Management, National Taiwan University, Taipei, Taiwan;Department of Information Management, National Taiwan University, Taipei, Taiwan
Venue:
ICA3PP'10 Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part II
Year:
2010

Citing 9
Cited 0

A Group-Theoretic Model for Symmetric Interconnection Networks

IEEE Transactions on Computers
On the fault-diameter of the star graph

Information Processing Letters
Fault tolerance of the star graph interconnection network

Information Processing Letters
On some properties and algorithms for the star and pancake interconnection networks

Journal of Parallel and Distributed Computing
Methods and problems of communication in usual networks

Proceedings of the international workshop on Broadcasting and gossiping 1990
A Routing and Broadcasting Scheme on Faulty Star Graphs

IEEE Transactions on Computers
A Comparative Study of Topological Properties of Hypercubes and Star Graphs

IEEE Transactions on Parallel and Distributed Systems
Incomplete Star: An Incrementally Scalable Network Based on the Star Graph

IEEE Transactions on Parallel and Distributed Systems
Embedding of cycles and grids in star graphs

SPDP '90 Proceedings of the 1990 IEEE Second Symposium on Parallel and Distributed Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose an algorithm for broadcasting in star graph using circuit-switched, half-duplex, and link-bound communication. By using the algorithm, we show that the broadcasting in an n-dimensional star graph can be done in n-1 time steps. We also study the lower bound of time steps of the circuit-switched broadcasting in star graph, and we prove that the optimal broadcasting time steps in an n-dimensional star graph is $\lceil{\rm log}_{\rm n}{\it n}!\rceil$. Finally, the computational results showed that the proposed algorithm gets nearly optimal solutions.