
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
GueyYun Chang, Gerard J. Chang, GenHuey Chen, "Diagnosabilities of Regular Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 16, no. 4, pp. 314323, April, 2005.  
BibTex  x  
@article{ 10.1109/TPDS.2005.44, author = {GueyYun Chang and Gerard J. Chang and GenHuey Chen}, title = {Diagnosabilities of Regular Networks}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {16}, number = {4}, issn = {10459219}, year = {2005}, pages = {314323}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2005.44}, 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  Diagnosabilities of Regular Networks IS  4 SN  10459219 SP314 EP323 EPD  314323 A1  GueyYun Chang, A1  Gerard J. Chang, A1  GenHuey Chen, PY  2005 KW  Diagnosis KW  diagnosis by comparison KW  hypercube KW  multiprocessor system KW  pessimistic diagnosis strategy KW  PMC model KW  precise diagnosis strategy. VL  16 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—In this paper, we study diagnosabilities of multiprocessor systems under two diagnosis models: the PMC model and the comparison model. In each model, we further consider two different diagnosis strategies: the precise diagnosis strategy proposed by Preparata et al. [CHECK END OF SENTENCE] and the pessimistic diagnosis strategy proposed by Friedman [CHECK END OF SENTENCE]. The main result of this paper is to determine diagnosabilities of regular networks with certain conditions, which include several widely used multiprocessor systems such as variants of hypercubes and many others.
[1] S.B. Akers, D. Harel, and B. Krishnamurthy, “The Star Graph: An Attractive Alternative to the $N{\hbox{}}{\rm{Cube}}$ ,” Proc. Int'l Conf. Parallel Processing, pp. 393400, 1987.
[2] T. Araki and Y. Shibata, “Diagnosability of Butterfly Networks under the Comparison Approach,” IEICE Trans. Fundamentals of Electronics Comm. and Computer Science, vol. E85A, no. 5, pp. 11521160, 2002.
[3] J.R. Armstrong and F.G. Gray, “Fault Diagnosis in a Boolean $N{\hbox{}}{\rm{Cube}}$ Array of Microprocessors,” IEEE Trans. Computers, vol. 30, no. 8, pp. 587590, 1981.
[4] M. Barborak and M. Malek, “The Consensus Problem in FaultTolerant Computing,” ACM Computing Surveys, vol. 25, no. 2, pp. 171220, 1993.
[5] F. Barsi, F. Grandoni, and P. Maestrini, “Theory of Diagnosability of Digital Systems,” IEEE Trans. Computers, vol. 25, no. 6, pp. 585593, 1976.
[6] L. Bhuyan and D.P. Agrawal, “Generalized Hypercube and Hyperbus Structures for a Computer Network,” IEEE Trans. Computers, vol. 33, no. 4, pp. 323333, 1984.
[7] D.M. Blough, G.F. Sullivan, and G.M. Masson, “Efficient Diagnosis of Multiprocessor System under Probabilistic Models,” IEEE Trans. Computers, vol. 41, no. 9, pp. 11261136, 1992.
[8] M. Blough, “Probabilistic Treatment of Diagnosis in Digital Systems,” Proc. Seventh Digest of the Int'l Symp. Fault Tolerant Computing, pp. 7277, 1977.
[9] A. Caruso, S. Chessa, P. Maestrini, and P. Santi, “Diagnosability of Regular Systems,” J. Algorithms, vol. 1, no. 1, pp. 112, 2002.
[10] A. Caruso, S. Maestrini, and P. Santi, “Evaluation of a Diagnosis Algorithm for Regular Structures,” IEEE Trans. Computers, vol. 51, no. 7, pp. 850865, 2002.
[11] K.Y. Chwa and S.L. Hakimi, “On Fault Identification in Diagnosable Systems,” IEEE Trans. Computers, vol. 30, no. 6, pp. 414422, 1981.
[12] P. Cull and S.M. Larson, “The Möbius Cube,” IEEE Trans. Computers, vol. 44, no. 5, pp. 647659, 1995.
[13] A. Das, K. Thulasiraman, and V.K. Agarwal, “Diagnosis of $T/(T+1){\hbox{}}{\rm{Diagnosable}}$ Systems,” SIAM J. Computing, vol. 23, no. 5, pp. 895905, 1994.
[14] K. Efe, “A Variation on the Hypercube with Lower Diameter,” IEEE Trans. Computers, vol. 40, no. 11, pp. 13121316, 1991.
[15] A.H. Esfahanian, L.M. Ni, and B.E. Sagan, “The Twisted $N{\hbox{}}{\rm{Cube}}$ with Application to Multiprocessing,” IEEE Trans. Computers, vol. 40, no. 1, pp. 8893, 1991.
[16] J. Fan, “Diagnosability of the Möbius Cubes,” IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 9, pp. 923927, Sept. 1998.
[17] J. Fan, “Diagnosability of Crossed Cubes under the Comparison Diagnosis Model,” IEEE Trans. Parallel and Distributed Systems, vol. 13, no. 7, pp. 687692, 2002.
[18] A.D. Friedman, “A New Measure of Digital System Diagnosis,” Proc. Digest of the Int'l Symp. Fault Tolerant Computing, pp. 167170, 1975.
[19] H. Fugiwara and K. Kinoshita, “On the Computational Complexity of System Diagnosis,” IEEE Trans. Computers, vol. 27, no. 10, pp. 881885, 1978.
[20] S.L. Hakimi and A.T. Amin, “Characterization of Connection Assignment,” IEEE Trans. Computers, vol. 23, pp. 8688, 1974.
[21] A. Kavianpour and A.D. Freidman, “Efficient Design of Easily Diagnosable Systems,” Proc. Third USAJapan Computing Conf., pp. 251257, 1978.
[22] A. Kavianpour, “Sequential Diagnosability of Star Graphs,” Computers Electrical Eng., vol. 22, no. 1, pp. 3744, 1996.
[23] A. Kavianpour and K.H. Kim, “Diagnosabilities of Hypercubes under the Pessimistic OneStep Diagnosis Strategy,” IEEE Trans. Computers, vol. 40, no. 2, pp. 232237, 1991.
[24] S. Khanna and W.K. Fuchs, “A Graph Partitioning Approach to Sequential Diagnosis,” IEEE Trans. Computers, vol. 46, no. 1, pp. 3947, 1996.
[25] J. Maeng and M. Malek, “A Comparison Connection Assignment for SelfDiagnosis of Multiprocessor Systems,” Proc. Digest of the Int'l Symp. Fault Tolerant Computing, pp. 173175, 1981.
[26] S.N. Maheshwari and S.L. Hakimi, “On Models for Diagnosable Systems and Probabilistic Fault Diagnosis,” IEEE Trans. Computers, vol. 25, pp. 228326, 1976.
[27] M. Malek, “A Comparison Connection Assignment for Diagnosable of Multiprocessor Systems,” Proc. Seventh Ann. Symp. Computer Architecture, pp. 3136, 1980.
[28] F.P. Preparata, G. Metze, and R.T. Chien, “On the Connection Assignment Problem of Diagnosable Systems,” IEEE Trans. Electronic Computers, vol. 16, pp. 848854, 1967.
[29] F.P. Preparata and J. Vuillemin, “The CubeConnected Cycles: A Versatile Network for Parallel Computation,” Comm. ACM, vol. 24, pp. 300309, 1981.
[30] V. Raghavan and A. Tripathi, “Sequential Diagnosability is CoNP Complete,” IEEE Trans. Computers, vol. 40, no. 5, pp. 584595, 1991.
[31] Y. Saad and M.H. Schultz, “Topological Properties of Hypercubes,” IEEE Trans. Computers, vol. 37, no 7, pp. 867872, 1988.
[32] A. Sengupta and A.T. Danbura, “On SelfDiagnosable Multiprocessor Systems: Diagnosis by the Comparison Approach,” IEEE Trans. Computers, vol. 41, no. 11, pp. 13861396, 1992.
[33] G.F. Sullivan, “SystemLevel Fault Diagnosability in Probabilistic and Weighted Models,” Proc. 17th Digest of the Int'l Symp. Fault Tolerant Computing, pp. 190195, 1987.
[34] N.E. Tzeng and S. Wei, “Enhanced Hypercubes,” IEEE Trans. Computers, vol. 41, no. 11, pp. 13861396, 1992.
[35] D. Wang, “Diagnosability of Enhanced Hypercubes,” IEEE Trans. Computers, vol. 43, no. 9, pp. 10541061, 1994.
[36] D. Wang, “Diagnosability of Hypercubes and Enhanced Hypercubes under the Comparison Diagnosis Model,” IEEE Trans. Computers, vol. 48, no. 12, pp. 13691374, 1999.
[37] C.L. Yang, G.M. Masson, and R. Leonetti, “On Fault Identification and Isolation in $t_1/t_1{\hbox{}}{\rm{Diagnosable}}$ Systems,” IEEE Trans. Computers, vol. 35, no. 7, pp. 639644, 1986.