Reliable data broadcasting on parallel computers can be achieved by applying more than one independent spanning tree (IST). Using k-IST-based broadcasting from root r on an interconnection network (N=2^k) provides k-degree fault tolerance in broadcasting, while construction of optimal height k-ISTs needs more time than that of one IST. In the past, most research focused on constructing k ISTs on the hypercube Q"k, an efficient communication network. One sequential approach utilized the recursive feature of Q"k to construct k ISTs working on a specific root (r)=0 in O(kN) time. Another parallel approach was introduced for generating k ISTs with optimal height on Q"k, based on HDLS (Hamming Distance Latin Square), single pointer jumping, which is applied for a source (r)=0 in O(k^2) time for successful broadcasting in O(k). For broadcasting from r 0, those existing approaches require a special routine to reassign new nodes' IDs for logical r=0. This paper proposes a flexible and efficient parallel construction of k ISTs with optimal height on Q"k, a generalized approach, for an arbitrary root (r=0,1,2,..., or 2^k-1) in O(k) time. Our focus is to introduce the more efficient time (O(k)) of preprocessing, based on double pointer jumping over O(k^2) of the HDLS approach. We also prove that our generalized parallel k-IST construction (arbitrary r) with optimal height on Q"k is correctly set in efficient O(k) time. Finally, experiments were performed by simulation to investigate the fault-tolerance effect in reliable broadcasting. Experimental results showed that our efficient ISTs yielded 10%-20% fault tolerance for successful broadcasting (on N=16-1024 PEs).
[1]
Yoshihide Igarashi,et al.
Independent Spanning Trees of Chordal Rings
,
1999,
Inf. Process. Lett..
[2]
Shin-Ichi Nakano,et al.
A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four-Connected Planar Graphs
,
1998,
WG.
[3]
S. Lennart Johnsson,et al.
Optimum Broadcasting and Personalized Communication in Hypercubes
,
1989,
IEEE Trans. Computers.
[4]
Toru Hasunuma,et al.
Completely Independent Spanning Trees in Maximal Planar Graphs
,
2002,
WG.
[5]
Andreas Huck.
Independent trees in graphs
,
1994,
Graphs Comb..
[6]
Yue-Li Wang,et al.
Optimal Independent Spanning Trees on Hypercubes
,
2004,
J. Inf. Sci. Eng..
[7]
Yoshihide Igarashi,et al.
Independent Spanning Trees of Product Graphs
,
1996,
WG.
[8]
M. H. Schultz,et al.
Topological properties of hypercubes
,
1988,
IEEE Trans. Computers.
[9]
Andreas Huck.
Independent Trees in Planar Graphs Independent trees
,
1999,
Graphs Comb..
[10]
Jou-Ming Chang,et al.
Parallel construction of optimal independent spanning trees on hypercubes
,
2007,
Parallel Comput..
[11]
Andreas Huck.
Independent Trees and Branchings in Planar Multigraphs
,
1999,
Graphs Comb..
[12]
Parameswaran Ramanathan,et al.
Reliable Broadcast in Hypercube Multicomputers
,
1988,
IEEE Trans. Computers.
[13]
Jou-Ming Chang,et al.
Reducing the Height of Independent Spanning Trees in Chordal Rings
,
2007,
IEEE Transactions on Parallel and Distributed Systems.