An Optimal Broadcasting Algorithm without Message Redundancy in Star Graphs

Authors:
Jang-Ping Sheu;Chao-Tsung Wu;Tzung-Shi Chen
Affiliations:
-;-;-
Venue:
IEEE Transactions on Parallel and Distributed Systems
Year:
1995

Citing 4
Cited 21

A Group-Theoretic Model for Symmetric Interconnection Networks

IEEE Transactions on Computers
Optimum Broadcasting and Personalized Communication in Hypercubes

IEEE Transactions on Computers
Optimal Broadcasting on the Star Graph

IEEE Transactions on Parallel and Distributed Systems
Multicast Communication in Multicomputer Networks

IEEE Transactions on Parallel and Distributed Systems

Balanced Spanning Trees in Complete and Incomplete Star Graphs

IEEE Transactions on Parallel and Distributed Systems
Optimal Parallel Routing in Star Networks

IEEE Transactions on Computers
Macro-Star Networks: Efficient Low-Degree Alternatives to Star Graphs

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

IEEE Transactions on Computers
Neighborhood Information Dissemination in the Star Graph

IEEE Transactions on Computers
Study of general incomplete star interconnection networks

Journal of Computer Science and Technology
Toward Optimal Broadcast in a Star Graph Using Multiple Spanning Trees

IEEE Transactions on Computers
Fault-Tolerant Ring Embedding in a Star Graph with Both Link and Node Failures

IEEE Transactions on Parallel and Distributed Systems
Nearly Optimal One-to-Many Parallel Routing in Star Networks

IEEE Transactions on Parallel and Distributed Systems
Fault-Tolerant Ring Embedding in Star Graphs

IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
One-to-All Broadcasting Scheme for Static Interconnection Networks with Arbitrary Topology

IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
One-to-All Broadcasting Scheme for Hypercubes with Background Traffic

ANSS '03 Proceedings of the 36th annual symposium on Simulation
Macro-Star Networks: Efficient Low-Degree Alternatives to Star Graphs for Larg-Scale Parallel Architecture

FRONTIERS '96 Proceedings of the 6th Symposium on the Frontiers of Massively Parallel Computation
Broadcasting on incomplete star graph interconnection networks

HPC-ASIA '97 Proceedings of the High-Performance Computing on the Information Superhighway, HPC-Asia '97
Broadcasting schemes for hypercubes with background traffic

Journal of Systems and Software - Special issue: Performance modeling and analysis of computer systems and networks
Optimal broadcasting on incomplete star graph interconnection networks

Journal of Systems Architecture: the EUROMICRO Journal
OTIS-star an attractive alternative network

SEPADS'05 Proceedings of the 4th WSEAS International Conference on Software Engineering, Parallel & Distributed Systems
Neighbourhood Broadcasting and Broadcasting on the (n, k)-Star Graph

ICA3PP '08 Proceedings of the 8th international conference on Algorithms and Architectures for Parallel Processing
On randomized broadcasting in Star graphs

Discrete Applied Mathematics
Rumor spreading and vertex expansion on regular graphs

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
An all-reduce operation in star networks using all-to-all broadcast communication pattern

ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part I

Quantified Score

Hi-index	0.01

Visualization

Abstract

Based on the Mendia and Sarkar's algorithm [8], we propose an optimal and nonredundant distributed broadcasting algorithm in star graphs. For an $n$-dimensional star graph, our algorithm takes $O(n\log_2 n)$ time and guarantees that all nodes in the star graph receive the message exactly once. Moreover, broadcasting $m$ packets in a pipeline fashion takes $O(m\log_2 n + n\log_2 n)$ time due to the nonredundant property of our broadcasting algorithm.Index Terms驴Broadcasting, interconnection networks, star graphs.