One-to-All Broadcasting Scheme for Static Interconnection Networks with Arbitrary Topology

Authors:
Demetres D. Kouvatsos;I. M. Mkwawa
Affiliations:
-;-
Venue:
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Year:
2002

Citing 7
Cited 0

A Group-Theoretic Model for Symmetric Interconnection Networks

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

IEEE Transactions on Parallel and Distributed Systems
Optimal Information Dissemination in Star and Pancake Networks

IEEE Transactions on Parallel and Distributed Systems
Performance analysis of buffered banyan ATM switch architectures

ATM networks
Efficient Broadcasting in Wormhole-Routed Multicomputers: A Network-Partitioning Approach

IEEE Transactions on Parallel and Distributed Systems
Optimal Broadcasting on the Star Graph

IEEE Transactions on Parallel and Distributed Systems
Information theoretical analysis of multivariate correlation

IBM Journal of Research and Development

Quantified Score

Hi-index	0.00

Visualization

Abstract

A novel one-to-all broadcasting scheme is proposed for static interconnection networks with arbitrary topology facilitating inter-process communication amongst parallel computers. The scheme is based on an information theoretic decomposition criterion and graph theoretic concepts. Evidence based on empirical studies indicates the suitability of the scheme for achieving optimal one-to-all broadcasting bounds for various types of networks. The scheme is applicable to both single-port and half-duplex modes of message passing communication.