Title :
On link-disjoint Hamiltonian cycles of torus networks
Author :
Latifi, Sara ; Zheng, Si-Qing
Author_Institution :
Dept. of Electr. & Comput. Eng., Nevada Univ., Las Vegas, NV, USA
Firstpage :
0.708333333333333
Abstract :
The problem of embedding link disjoint Hamiltonian cycles into 2-D and 3-D torus networks is addressed. The maximum number of link-disjoint cycles is limited to half the degree of the node in a regular network. Simple methods are presented to embed the maximum number of such cycles in a 2-D and 3-D torus. An analysis of network fault-tolerance in the presence of a set of faulty links is also presented
Keywords :
fault tolerant computing; parallel algorithms; 2-D torus networks; 3-D torus networks; distributed computing; faulty links; link-disjoint Hamiltonian cycles; network fault-tolerance; parallel algorithms; parallel computing; regular network; Computational modeling; Computer science; Concurrent computing; Distributed computing; Fault tolerance; Hardware; Joining processes; Parallel algorithms; Parallel processing; Robustness;
Conference_Titel :
Southeastcon '93, Proceedings., IEEE
Conference_Location :
Charlotte, NC
Print_ISBN :
0-7803-1257-0
DOI :
10.1109/SECON.1993.465661
