
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
ChienPing Chang, PaoLien Lai, Jimmy JiannMean Tan, LihHsing Hsu, "Diagnosability of tConnected Networks and Product Networks under the Comparison Diagnosis Model," IEEE Transactions on Computers, vol. 53, no. 12, pp. 15821590, December, 2004.  
BibTex  x  
@article{ 10.1109/TC.2004.114, author = {ChienPing Chang and PaoLien Lai and Jimmy JiannMean Tan and LihHsing Hsu}, title = {Diagnosability of tConnected Networks and Product Networks under the Comparison Diagnosis Model}, journal ={IEEE Transactions on Computers}, volume = {53}, number = {12}, issn = {00189340}, year = {2004}, pages = {15821590}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2004.114}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Diagnosability of tConnected Networks and Product Networks under the Comparison Diagnosis Model IS  12 SN  00189340 SP1582 EP1590 EPD  15821590 A1  ChienPing Chang, A1  PaoLien Lai, A1  Jimmy JiannMean Tan, A1  LihHsing Hsu, PY  2004 KW  Diagnosability KW  comparison diagnosis model KW  tdiagnosable KW  connectivity KW  order graph KW  product networks. VL  53 JA  IEEE Transactions on Computers ER   
[1] S.B. Akers and B. Krishnamurthy, “A GroupTheoretic Model for Symmetric Interconnection Networks,” IEEE Trans. Computers, vol. 38, no. 4, pp. 555566, Apr. 1989.
[2] T. Araki and Y. Shibata, “Diagnosability of Networks by the Cartesian Product,” IEICE Trans. Fundamentals, vol. E83, A. no. 3, pp. 465470, 2000.
[3] 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.
[4] L.N. Bhuyan and D.P. Agrawal, “Generalized Hypercube and Hyperbus Structures for a Computer Network,” IEEE Transactions on Computers, vol. 33, no. 4, pp. 323333, Apr. 1984.
[5] K. Day and A.E. AlAyyoub, “The Cross Product of Interconnection Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 2, no. 2, pp. 109118, 1991.
[6] K. Day and A.E. AlAyyoub, “Minimal Fault Diameter for Highly Resilient Product Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 11, no. 9, pp. 926930, Sept. 2000.
[7] J.A. Mchugh, Algorithmic Graph Theorey. Prentice Hall Int'l, 1990.
[8] K. Efe and A. Fernandez, “Products of Networks with Logarithmic Diameters and Fixed Degree,” IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 9, pp. 963975, Sept. 1995.
[9] J. Fan, “Diagnosability of Crossed Cubes under the Comparison Diagnosis Model,” IEEE Trans. Parallel and Distributed Systems, vol. 13, no. 10, pp. 1,0991,104, Oct. 2002.
[10] T. ElGhazawi and A. Youssef, “A Generalized Framework for Developing Adaptive FaultTolerant Routing Algorithms,” IEEE Trans. Reliability, vol. 42, no. 2, pp. 250258, 1993.
[11] T. ElGhazawi and A. Youssef, “A Unified Approach to FaultTolerant Routing,” Proc. 1992 Int'l Conf. Distributed Computing Systems, pp. 210217, 1992.
[12] A. Kavianpour and K.H. Kim, “Diagnosability of Hypercube under the Pessimistic OneStep Diagnosis Strategy,” IEEE Trans. Computers, vol. 40, no. 2, pp. 232237, Feb. 1991.
[13] P.L. Lai, J.J.M. Tan, C.H. Tsai, and L.H. Hsu, “The Diagnosability of Matching Composition Network under the Comparison Diagnosis Model,” IEEE Trans. Computers, accepted.
[14] J. Maeng and M. Malek, “A Comparsion Connection Assignment for SelfDiagnosis of Multiprocessor System,” Proc. 11th Int'l Symp. FaultTolerant Computing, pp. 173175, 1981.
[15] M. Malek, “A Comparsion Connection Assignment for Diagnosis of Multiprocessor System,” Proc. Seventh Int'l Symp. Computer Architecture, pp. 3135, 1980.
[16] S. Ohring and S.K. Das, “Folded Petersen Cube Networks: New Competitors for Hypercubes,” IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 2, pp. 151168, Feb. 1996.
[17] S. Ohring and D.H. Hohndel, “Optimal Fault Tolerant Communication Algorithms on Product Networks Using Spanning Trees,” Proc. Sixth IEEE Symp. Parallel and Distributed Processing, pp. 188195, 1994.
[18] F.P. Preparata, G. Metze, and R.T. Chien, “On the Connection Assignment Problem of Diagnosis Systems,” IEEE Trans. Electronic Computers, vol. 16, no. 12, pp. 848854, Dec. 1967.
[19] A.L. Rosenberg, “ProductShuffle Networks: Towards Reconciling Shuffles and Butterflies,” Discrete Applied Math., vols. 37/38, pp. 465488, 1992.
[20] A. Sengupta and A. Dahbura, “On SelfDiagnosable Multiprocessor System: Diagnosis by the Comparison Approach,” IEEE Trans. Computers, vol. 41, no. 11, pp. 1,3861,396, 1992.
[21] D. Wang, “Diagnosability of Enhanced Hypercubes,” IEEE Trans. Computers, vol. 43, no. 9, pp. 1,0541,061, Sept. 1994.
[22] D. Wang, “Diagnosability of Hypercubes and Enhanced Hypercubes under the Comparison Diagnosis Model,” IEEE Trans. Computers, vol. 48, no. 12, pp. 1,3691,374, Dec. 1999.
[23] A. Youssef, “Design and Analysis of Product Networks,” Proc. Frontiers '95, pp. 521528, 1995.