On the Routing of the OTIS-Cube Network in Presence of Faults

This paper proposes a new fault-tolerant routing algorithm for the well-known class of networks, OTIS-cube. In this new proposed algorithm, each node A starts by computing the first level unsafety set, S1 A , composed of the set of unreachable direct neighbours. It then performs m-1 exchanges with its neighbours to determine the k-level unsafety sets Sk A , for all 1 ≤ k ≤ m, where m is an adjustable parameter between 1 and 2n + 1. The k-level unsafety set at node A represents the set of all faulty nodes at Hamming distance k from A, which either faulty or unreachable from A due to faulty nodes or links. Equipped with these unsafety sets, we show how each node calculates numeric unsafety vectors and uses them to achieve efficient fault- tolerant routing.

[1]  Quentin F. Stout,et al.  Hypercube message routing in the presence of faults , 1988, C3P.

[2]  Sartaj Sahni,et al.  Algorithms for the otis optoelectronic computer , 1998 .

[3]  Yousef Saad,et al.  Data Communication in Hypercubes , 1989, J. Parallel Distributed Comput..

[4]  Khaled Day,et al.  Arrangement Graphs: A Class of Generalized Star Graphs , 1992, Inf. Process. Lett..

[5]  Sheldon B. Akers,et al.  The Star Graph: An Attractive Alternative to the n-Cube , 1994, ICPP.

[6]  Sanjay Ranka,et al.  Embedding meshes on the star graph , 1990, Supercomputing '90.

[7]  John P. Hayes,et al.  A Fault-Tolerant Communication Scheme for Hypercube Computers , 1992, IEEE Trans. Computers.

[8]  M. H. Schultz,et al.  Topological properties of hypercubes , 1988, IEEE Trans. Computers.

[9]  Sartaj Sahni,et al.  BPC permutations on the OTIS-Mesh optoelectronic computer , 1997, Proceedings of the Fourth International Conference on Massively Parallel Processing Using Optical Interconnections.

[10]  Lionel M. Ni,et al.  A survey of wormhole routing techniques in direct networks , 1993, Computer.

[11]  S C Esener,et al.  Optical transpose interconnection system architectures. , 1993, Optics letters.

[12]  Sudhakar Yalamanchili,et al.  Adaptive routing protocols for hypercube interconnection networks , 1993, Computer.

[13]  Abdel Elah Al-Ayyoub,et al.  Topological Properties of OTIS-Networks , 2002, IEEE Trans. Parallel Distributed Syst..

[14]  Justin R. Rattner.  Concurrent processing: a new direction in scientific computing in afips conference proceedings , 1985 .

[15]  Ming-Syan Chen,et al.  Depth-First Search Approach for Fault-Tolerant Routing in Hypercube , 1990, IEEE Trans. Parallel Distributed Syst..

[16]  Daniel H. Linder,et al.  An Adaptive and Fault Tolerant Wormhole Routing Strategy for k-Ary n-Cubes , 1994, IEEE Trans. Computers.

[17]  Ming-Syan Chen,et al.  Adaptive Fault-Tolerant Routing in Hypercube Multicomputers , 1990, IEEE Trans. Computers.

[18]  Sartaj Sahni,et al.  BPC Permutations on the OTIS-Hypercube Optoelectronic Computer , 1998, Informatica.

[19]  Ramamohan Paturi,et al.  Scalable Network Architectures Using the Optical Transpose Interconnection System (OTIS) , 2000, J. Parallel Distributed Comput..

[20]  Youran Lan.  A Fault-Tolerant Routing Algorithm in Hypercubes , 1994, ICPP.

[21]  P. Marchand,et al.  Grain-size considerations for optoelectronic multistage interconnection networks. , 1992, Applied optics.

[22]  Charles L. Seitz,et al.  The cosmic cube , 1985, CACM.

[23]  Lars Lundberg,et al.  Performance Optimization Using Extended Critical Path Analysis in Multithreaded Programs on Multiprocessors , 2001, J. Parallel Distributed Comput..

[24]  S.W. Graham,et al.  The Cost of Broadcasting on Star Graphs and k-Ary Hypercubes , 1993, IEEE Trans. Computers.

[25]  Mohamed Ould-Khaoua,et al.  Unsafety vectors: a new fault-tolerant routing for the binary n-cube , 2002, J. Syst. Archit..

[26]  Sanjay Ranka,et al.  Embedding meshes on the star graph , 1990, Proceedings SUPERCOMPUTING '90.

[27]  Sartaj Sahni,et al.  Basic Operations on the OTIS-Mesh Optoelectronic Computer , 1998, IEEE Trans. Parallel Distributed Syst..