|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| Pao-Lien Lai, Jimmy J.M. Tan, Chang-Hsiung Tsai, Lih-Hsing Hsu, "The Diagnosability of the Matching Composition Network under the Comparison Diagnosis Model," IEEE Transactions on Computers, vol. 53, no. 8, pp. 1064-1069, August, 2004. | |||
| BibTex | x | ||
| @article{ 10.1109/TC.2004.50, author = {Pao-Lien Lai and Jimmy J.M. Tan and Chang-Hsiung Tsai and Lih-Hsing Hsu}, title = {The Diagnosability of the Matching Composition Network under the Comparison Diagnosis Model}, journal ={IEEE Transactions on Computers}, volume = {53}, number = {8}, issn = {0018-9340}, year = {2004}, pages = {1064-1069}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2004.50}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - The Diagnosability of the Matching Composition Network under the Comparison Diagnosis Model IS - 8 SN - 0018-9340 SP1064 EP1069 EPD - 1064-1069 A1 - Pao-Lien Lai, A1 - Jimmy J.M. Tan, A1 - Chang-Hsiung Tsai, A1 - Lih-Hsing Hsu, PY - 2004 KW - Diagnosability KW - t-diagnosable KW - comparison model KW - Matching Composition Network KW - MM* model. VL - 53 JA - IEEE Transactions on Computers ER - | |||
Abstract—The classical problem of diagnosability is discussed widely and the diagnosability of many well-known networks have been explored. In this paper, we consider the diagnosability of a family of networks, called the Matching Composition Network (MCN); two components are connected by a perfect matching. The diagnosability of MCN under the comparison model is shown to be one larger than that of the component, provided some connectivity constraints are satisfied. Applying our result, the diagnosability of the Hypercube
[1] T. Araik and Y. Shibata, Diagnosability of Butterfly Networks under the Comparison Approach IEICE Trans. Fundamentals, vol. E85-A, no. 5, pp. 1152-1160, May 2002.
[2] J.R. Armstrong and F.G. Gray, Fault Diagnosis in a Boolean$n$Cube Array of Multiprocessors IEEE Trans. Computers, vol. 30, no. 8, pp. 587-590, Aug. 1981.
[3] C.P. Chang, J.N. Wang, and L.H. Hsu, Topological Properties of Twisted Cubes Information Sciences, vol. 113, nos. 1-2, pp. 147-167, Jan. 1999.
[4] W.S. Chiue and B.S. Shieh, On Connectivity of the Cartesian Product of Two Graphs Applied Math. and Computation, vol. 102, nos. 2-3, pp. 129-137, July 1999.
[5] P. Cull and S.M. Larson, The Möbius Cubes IEEE Trans. Computers, vol. 44, no. 5, pp. 647-659, May 1995.
[6] K. Efe, “A Variation on the Hypercube with Lower Diameter,” IEEE Trans. Computers, vol. 40, no. 11, pp. 1312-1316, Nov. 1991.
[7] K. Efe, “The Crossed Cube Architecture for Parallel Computing,” IEEE Trans. Parallel and Distributed Systems, vol. 3, no. 5, pp. 513-524, Sept.-Oct. 1992.
[8] K. Efe, P.K. Blackwell, W. Slough, and T. Shiau, Topological Properties of the Crossed Cube Architecture Parallel Computing, vol. 20, pp. 1763-1,775, Aug. 1994.
[9] A.H. Esfahanian, L.M. Ni, and B.E. Sagan, "The Twisted n-Cube with Application to Multiprocessing," IEEE Trans. Computers, vol. 40, no. 1, pp. 88-93, Jan. 1991.
[10] J. Fan, Diagnosability of Crossed Cubes under the Two Strategies Chinese J. Computers, vol. 21, no. 5, pp. 456-462, May 1998.
[11] J. Fan, Diagnosability of the Möbius Cubes IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 9, pp. 923-928, Sept. 1998.
[12] J. Fan, Diagnosability of Crossed Cubes under the Comparison Diagnosis Model IEEE Trans. Parallel and Distributed Systems, vol. 13, no. 7, pp. 687-692, July 2002.
[13] P.A.J. Hilbers, M.R.J. Koopman, J.L.A. van de Snepscheut, The Twisted Cube Proc. Parallel Architectures and Languages Europe, pp. 152-159, June 1987.
[14] A. Kavianpour and K.H. Kim, “Diagnosability of Hypercube under the Pessimistic One-Step Diagnosis Strategy,” IEEE Trans. Computers, vol. 40, no. 2, pp. 232-237, Feb. 1991.
[15] P. Kulasinghe, Connectivity of the Crossed Cube Information Processing Letters, vol. 61, no. 4, pp. 221-226, Feb. 1997.
[16] J. Maeng and M. Malek, A Comparison Connection Assignment for Self-Diagnosis of Multiprocessors Systems Proc. 11th Int'l Symp. Fault-Tolerant Computing, pp. 173-175, 1981.
[17] M. Malek, A Comparison Connection Assignment for Diagnosis of Multiprocessor Systems Proc. Seventh Int'l Symp. Computer Architecture, pp. 31-35, 1980.
[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. 848-854, Dec. 1967.
[19] Y. Saad and M. Schultz, "Topological Properties of Hypercubes," IEEE Trans. Computers, vol. 37, no. 7, pp. 867-872, July 1988.
[20] A. Sengupta and A. Dahbura, “On Self-Diagnosable Multiprocessor Systems: Diagnosis by the Comparison Approach,” IEEE Trans. Computers, vol. 41, no. 11, pp. 1386-1396, Nov. 1992.
[21] D. Wang, “Diagnosability of Enhanced Hypercubes,” IEEE Trans. Computers, vol. 43, no. 9, pp. 1,054-1,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. 1369-1374, Dec. 1999.