Reliable Broadcast in Hypercube Multicomputers
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
Optimal communication algorithms for hypercubes
Journal of Parallel and Distributed Computing
Fault-tolerant gossiping on hypercube multicomputers
EDMCC2 Proceedings of the 2nd European conference on Distributed memory computing
Fault tolerant routing in the star and pancake interconnection networks
Information Processing Letters
Optimal communication algorithms on star graphs using spanning tree constructions
Journal of Parallel and Distributed Computing
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
Fault Tolerant Algorithms for Broadcasting on the Star Graph Network
IEEE Transactions on Computers
IEEE Transactions on Computers
Neighborhood Information Dissemination in the Star Graph
IEEE Transactions on Computers
Optimally Balanced Spanning Tree of the Star Network
IEEE Transactions on Computers
Nearly Optimal One-to-Many Parallel Routing in Star Networks
IEEE Transactions on Parallel and Distributed Systems
Constructing Edge-Disjoint Spanning Trees in Product Networks
IEEE Transactions on Parallel and Distributed Systems
Embedding k(n - k) edge-disjoint spanning trees in arrangement graphs
Journal of Parallel and Distributed Computing
Optimal all-ports collective communication algorithms for the k-ary n-cube interconnection networks
Journal of Systems Architecture: the EUROMICRO Journal
Edge-disjoint spanning trees for the generalized butterfly networks and their applications
Journal of Parallel and Distributed Computing - Special issue: Design and performance of networks for super-, cluster-, and grid-computing: Part II
The super connectivity of the pancake graphs and the super laceability of the star graphs
Theoretical Computer Science
Deterministic Models of Communication Faults
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
On randomized broadcasting in Star graphs
Discrete Applied Mathematics
Constructing edge-disjoint spanning trees in locally twisted cubes
Theoretical Computer Science
Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes
Information Processing Letters
Constructing edge-disjoint spanning trees in twisted cubes
Information Sciences: an International Journal
Broadcasting secure messages via optimal independent spanning trees in folded hypercubes
Discrete Applied Mathematics
Independent spanning trees on twisted cubes
Journal of Parallel and Distributed Computing
On randomized broadcasting in star graphs
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Hi-index | 15.00 |
Data communication and fault tolerance are important issues in parallel computers in which the processors are interconnected according to a specific topology. One way to achieve fault tolerant interprocessor communication is by exploiting and effectively utilizing the disjoint paths that exist between pairs of source and destination nodes. In this paper, we construct n - 1 directed edge-disjoint spanning trees, on the star network. These spanning trees are used to derive a near optimal single-node broadcasting algorithm, and fault tolerant algorithms for the single-node and multinode broadcasting, and for the single-node and multinode scattering problems. Broadcasting is the distribution of the same group of messages from one processor to all the other processors. Scattering is the distribution of distinct groups of messages from one processor to all the other processors. We consider broadcasting and scattering from a single processor of the network and simultaneously from all processors of the network. The single-node broadcasting algorithm offers a speed up of n - 1 for a large number of messages, over the straightforward algorithm that uses a single shortest path spanning tree. Fault tolerance is achieved by transmitting the same messages through a number of edge-disjoint spanning trees. The fault tolerant algorithms operate successfully in the presence of up to n - 2 faulty nodes or edges in the network. The degree of fault tolerance can be adjusted depending on the network reliability. The importance of this method lies in the fact that no prior knowledge of the faulty nodes or edges is required. All of the algorithms operate under the store-and-forward, all-port communication model.