Broadcasting on faulty hypercubes
Resource
Parallel and Distributed Systems, 1994. International Conference on
Journal
1994 International Conference on Parallel and Distributed Systems
Pages
128-133
Date Issued
1994
Author(s)
Abstract
In this paper we propose a method for constructing the maximum number of edge-disjoint spanning trees (in the directed sense) on a hypercube with arbitrary one faulty node. Each spanning tree is of optimal height. By taking the common neighbor of the roots of these edge-disjoint spanning trees as the new root and reversing the direction of the directed link from each root to the new root, a spanning graph, consisting of n-1 edge-disjoint spanning trees of optimal height is formed. Broadcasting based on the spanning graph has an optimal bandwidth utilization and an optimal latency.
Description
Hsinchu
Type
conference paper
File(s)![Thumbnail Image]()
Loading...
Name
00590062.pdf
Size
530.67 KB
Format
Adobe PDF
Checksum
(MD5):3a17f8542a85a721766b424e779749d1