Optimal broadcasting on incomplete star graph interconnection networks

Authors:
Tzung-Shi Chen;Nen-Chung Wang
Affiliations:
Department of Information and Learning Technology, National University of Tainan, Tainan 700, Taiwan, ROC;Department of Computer Science and Information Engineering, Chaoyang University of Technology, Taichung 413, Taiwan, ROC
Venue:
Journal of Systems Architecture: the EUROMICRO Journal
Year:
2005

Citing 18
Cited 2

Incomplete Hypercubes

IEEE Transactions on Computers
A Group-Theoretic Model for Symmetric Interconnection Networks

IEEE Transactions on Computers
Optimum Broadcasting and Personalized Communication in Hypercubes

IEEE Transactions on Computers
An Optimal Broadcasting Algorithm without Message Redundancy in Star Graphs

IEEE Transactions on Parallel and Distributed Systems
Optimal communication algorithms on star graphs using spanning tree constructions

Journal of Parallel and Distributed Computing
Balanced Spanning Trees in Complete and Incomplete Star Graphs

IEEE Transactions on Parallel and Distributed Systems
Fault Tolerant Algorithms for Broadcasting on the Star Graph Network

IEEE Transactions on Computers
A Fault-Tolerant Broadcast Scheme in the Star Graph under the Single-Port, Half-Duplex Communication Model

IEEE Transactions on Computers
Toward Optimal Broadcast in a Star Graph Using Multiple Spanning Trees

IEEE Transactions on Computers
Optimal Broadcasting on the Star Graph

IEEE Transactions on Parallel and Distributed Systems
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
Broadcasting on the star and pancake interconnection networks

IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
An Efficient Adaptive Routing Algorithm for the Faulty Star Graph

ICPADS '97 Proceedings of the 1997 International Conference on Parallel and Distributed Systems
A Novel Neighbourhood Broadcasting Algorithm on Star Graphs

ICPADS '02 Proceedings of the 9th International Conference on Parallel and Distributed Systems
Broadcasting on Incomplete WK-Recursive Networks

ISPAN '96 Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks
Fault-Tolerant Routing on the Star Graph with Safety Vectors

ISPAN '02 Proceedings of the 2002 International Symposium on Parallel Architectures, Algorithms and Networks
Fault-Tolerant Routing in the Star Graph

AINA '04 Proceedings of the 18th International Conference on Advanced Information Networking and Applications - Volume 2

Perfect load balancing on the star interconnection network

The Journal of Supercomputing
Properties of a hierarchical network based on the star graph

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Broadcasting is an important collective communication operation in many applications which use parallel computing. In this paper, we focus on designing broadcasting algorithms for general incomplete star graphs. We propose two optimal one-to-all broadcasting algorithms for incomplete star graphs with a single-port communication model. An incomplete star graph with N nodes, where (n - 1)! N n!, is a subgraph of an n-dimensional star graph. The first scheme is single-message one-to-all broadcasting that takes O(nlogn) steps. The second one is multi-message one-to-all broadcasting that takes O(nlogn + m) steps.