This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Limited-Global-Information-Based Multicasting Scheme for Faulty Hypercubes
September 1995 (vol. 44 no. 9)
pp. 1162-1167
ASCII Text
x 
 
Kejun Yao, Jie Wu, "A Limited-Global-Information-Based Multicasting Scheme for Faulty Hypercubes," IEEE Transactions on Computers, vol. 44, no. 9, pp. 1162-1167, September, 1995.
 
 
BibTex
x
 
@article{ 10.1109/12.464397,
author = {Kejun Yao and Jie Wu},
title = {A Limited-Global-Information-Based Multicasting Scheme for Faulty Hypercubes},
journal ={IEEE Transactions on Computers},
volume = {44},
number = {9},
issn = {0018-9340},
year = {1995},
pages = {1162-1167},
doi = {http://doi.ieeecomputersociety.org/10.1109/12.464397},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Computers
TI - A Limited-Global-Information-Based Multicasting Scheme for Faulty Hypercubes
IS - 9
SN - 0018-9340
SP1162
EP1167
EPD - 1162-1167
A1 - Kejun Yao,
A1 - Jie Wu,
PY - 1995
KW - Fault tolerance
KW - hypercubes
KW - multicasting
KW - parallel processing.
VL - 44
JA - IEEE Transactions on Computers
ER -
 

Abstract—We study the multicast problem in hypercubes with faulty nodes. We assume that each node has limited global information of fault distribution, which is captured by the safety level associated with the node. Basically, the safety level is an approximate measure of the distribution of faulty nodes in the neighborhood. We first propose a safety-level-based multicasting scheme which guarantees time optimality. We then present a variant of this scheme that reduces the number of traffic steps. Finally, an address-sum-based multicasting scheme is studied which utilizes both the distribution of destination nodes and the safety level of neighboring nodes. Simulation results show that the traffic generated in both schemes is very close to optimal. Time optimality is guaranteed when the source is safe and at most two additional time steps are required when the source is unsafe in an n-dimensional cube (denoted as n-cube) with up to n− 1 node faults.

[1] Y. Lan,“Fault-tolerant multidestination routing in hypercubemulticomputers,” Proc. 12th Int’l Conf. Distributed Computing Systems, pp. 632-639, June 1992.
[2] Y. Lan, A.-H. Esfahanian, and L.M. Ni, "Multicast in Hypercube Multiprocessors," J. Parallel and Distributed Computing, vol. 8, pp. 30-41, Jan. 1990.
[3] A.C. Liang, S. Bhattacharya, W.T. Tsai, "Fault-Tolerant Multicast on Hypercube," J. Parallel and Distributed Computing, Vol. 23, No. 12, Dec. 1994, pp. 418-428.
[4] X. Lin and L.M. Ni, "Multicast Communication in Multicomputer Networks," IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 10, pp. 1,104-1,117, 1993.
[5] X. Lin and L.M. Ni,“Multicast communication in multicomputer networks,” Proc. 1990 Int’l Conf. Parallel Processing, vol. III, pp. 114-118, 1990.
[6] L.M. Ni and P.K. McKinley, "A Survey of Wormhole Routing Techniques in Direct Networks," Computer, vol. 26, no. 2, pp. 62-76, Feb. 1993.
[7] G.D. Pifarre,S.A. Felperin,L. Gravano,, and J.L.C. Sanz,“Routing techniques for massively parallel systems,” Proc. IEEE, vol. 74, no. 4, pp. 488-503, Apr. 1991.
[8] Y. Saad and M. Schultz, "Topological Properties of Hypercubes," IEEE Trans. Computers, vol. 37, no. 7, pp. 867-872, July 1988.
[9] J.P. Sheu and M.Y. Su,“A multicast algorithm for hypercube multiprocessors,” Proc. 1992 Int’l Conf. Parallel Processing, vol. III, pp. 18-22, 1992.
[10] J. Wu,“Broadcasting in injured hypercubes using incomplete spanning binomialtrees,” Technical Report TR-CSE-92-29, Dept. of Computer Science and Eng.,Florida Atlantic Univ., Nov. 1992.

Index Terms:
Fault tolerance, hypercubes, multicasting, parallel processing.
Citation:
Kejun Yao, Jie Wu, "A Limited-Global-Information-Based Multicasting Scheme for Faulty Hypercubes," IEEE Transactions on Computers, vol. 44, no. 9, pp. 1162-1167, Sept. 1995, doi:10.1109/12.464397
Usage of this product signifies your acceptance of the Terms of Use.