
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Khaled Day, Abdel Elah AlAyyoub, "Fault Diameter of kary ncube Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 8, no. 9, pp. 903907, September, 1997.  
BibTex  x  
@article{ 10.1109/71.615436, author = {Khaled Day and Abdel Elah AlAyyoub}, title = {Fault Diameter of kary ncube Networks}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {8}, number = {9}, issn = {10459219}, year = {1997}, pages = {903907}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.615436}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Fault Diameter of kary ncube Networks IS  9 SN  10459219 SP903 EP907 EPD  903907 A1  Khaled Day, A1  Abdel Elah AlAyyoub, PY  1997 KW  Fault diameter KW  interconnection networks KW  kary ncube KW  nodedisjoint paths KW  torus. VL  8 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—We obtain the fault diameter of
[1] Y. Saad and M. Schultz, "Topological Properties of Hypercubes," IEEE Trans. Computers, vol. 37, no. 7, pp. 867872, July 1988.
[2] W. Dally and C. Seitz, "The Torus Routing Chip," Distributed Computing, pp. 187196, 1986.
[3] L. Gravano, G.D. Pifarré, P.E. Berman, and J.L.C. Sanz, “Adaptive Deadlock and LivelockFree Routing with All Minimal Paths in Torus Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 12, pp. 1,233–1,251, Dec. 1994.
[4] L.N. Bhuyan and D.P. Agrawal, "Generalized Hypercube and Hyperbus Structures for a Computer Network," IEEE Trans. Computers, vol. 33, no. 4, pp. 323333, Apr. 1984.
[5] S. Lakshmivarahan and S. Dhall, "A New Hierarchy of Hypercube Interconnection Schemes for Parallel Computers," J. Supercomputing, vol. 2, pp. 81108, 1988.
[6] S.W. Graham and S.R. Seidel, "The Cost of Broadcasting on Star Graphs and Kary Hypercubes," IEEE Trans. Computers, vol. 42, no. 6, pp. 756759, June 1993.
[7] D.H. Linder and J.C. Harden, "An Adaptive and Fault Tolerant Wormhole Routing Strategy for kAry nCubes," IEEE Trans. Computers, vol. 40, no. 1, pp. 212, Jan. 1991.
[8] B. Bose, B. Broeg, Y. Kwon, and Y. Ashir, "Lee Distance and Topological Properties of kAry nCubes," IEEE Trans. Computers, vol. 44, no. 8, pp. 1,0211,030, Aug. 1995.
[9] M.S. Krishnamoorty and B. Krishnamoorty, "Fault diameter of interconnection networks," Computers and Mathematics with Applications, vol. 13, no. 56, pp. 577582, 1987.
[10] A.H. Esfahanian, “Generalized Measures of Fault Tolerance with Application to nCube Networks,” IEEE Trans. Computers, vol. 38, no. 11, pp. 1,5861,591, 1989.
[11] S. Latifi, “Combinatorial Analysis of the Fault Diameter of the$n$Cube,” IEEE Trans. Computers, vol. 42, no.1, pp. 2733, 1993.
[12] S.B. Akers and B. Krishnamurthy, "The Fault Tolerance of Star Graphs," Second Int'l Conf. Supercomputing, 1987.
[13] F. Harary, Graph Theory, third edition. AddisonWesley, 1972.