Optimum Broadcasting and Personalized Communication in Hypercubes
IEEE Transactions on Computers
A broadcasting algorithm in star graph interconnection networks
Information Processing Letters
On some properties and algorithms for the star and pancake interconnection networks
Journal of Parallel and Distributed Computing
Matrix representation of graph embedding in a hypercube
Journal of Parallel and Distributed Computing
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
A Routing and Broadcasting Scheme on Faulty Star Graphs
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
Communication Aspects of the Star Graph Interconnection Network
IEEE Transactions on Parallel and Distributed Systems
Fault-Tolerant Ring Embedding in Star Graphs
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Broadcasting on the star and pancake interconnection networks
IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
Graph Theory With Applications
Graph Theory With Applications
A Dilated-Diagonal-Based Scheme for Broadcast in a Wormhole-Routed 2D Torus
IEEE Transactions on Computers
Efficient Broadcasting in Wormhole-Routed Multicomputers: A Network-Partitioning Approach
IEEE Transactions on Parallel and Distributed Systems
Building a Multicasting Tree in a High-Speed Network
IEEE Concurrency
Fault-Tolerant Ring Embedding in a Star Graph with Both Link and Node Failures
IEEE Transactions on Parallel and Distributed Systems
Journal of Parallel and Distributed Computing
Broadcasting on incomplete star graph interconnection networks
HPC-ASIA '97 Proceedings of the High-Performance Computing on the Information Superhighway, HPC-Asia '97
A faster algorithm for solving linear algebraic equations on the star graph
Journal of Parallel and Distributed Computing
Embedding k(n - k) edge-disjoint spanning trees in arrangement graphs
Journal of Parallel and Distributed Computing
Multipath-Based Multicasting Strategies for Wormhole-Routed Star Graph Interconnection Networks
The Journal of Supercomputing
Optimal broadcasting on incomplete star graph interconnection networks
Journal of Systems Architecture: the EUROMICRO Journal
Perfect load balancing on the star interconnection network
The Journal of Supercomputing
Optimum broadcasting algorithms in (n, k)-star graphs using spanning trees
NPC'07 Proceedings of the 2007 IFIP international conference on Network and parallel computing
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
Hi-index | 14.98 |
In a multicomputer network, sending a packet typically incurs two costs: start-up time and transmission time. This work is motivated by the observation that most broadcast algorithms in the literature for the star graph networks only try to minimize one of the costs. Thus, many algorithms, though claimed to be optimal, are only so when one of the costs is negligible. In this paper, we try to optimize both costs simultaneously for four types of broadcast problems: one-to-all or all-to-all broadcasting in an n-star network with either one-port or all-port communication capability. As opposed to earlier solutions, the main technique used in this paper is to construct from a source node multiple spanning trees, along each of which one partition of the broadcast message is transmitted.