The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.03 - March (2009 vol.20)
pp: 367-378
Sun-Yuan Hsieh , National Cheng Kung University, Tainan
Tsung-Yen Chuang , National Cheng Kung University, Tainan
ABSTRACT
Strong diagnosability is a more precise concept for measuring the reliability of multiprocessor systems than the traditional global measurement. In this paper, we study the strong diagnosability of multiprocessor systems under the PMC model. Our main objective is to determinate the strong diagnosability of two wide classes of networks, namely regular networks and product networks, subject to certain conditions. Based on our results, we demonstrate the strong diagnosability of several well-known networks, including variants of hypercubes and many others.
INDEX TERMS
Topology, Diagnostics, Hardware reliability, Reliability, Testing, and Fault-Tolerance, Network problems
CITATION
Sun-Yuan Hsieh, Tsung-Yen Chuang, "The Strong Diagnosability of Regular Networks and Product Networks under the PMC Model", IEEE Transactions on Parallel & Distributed Systems, vol.20, no. 3, pp. 367-378, March 2009, doi:10.1109/TPDS.2008.99
REFERENCES
[1] S.B. Akers, D. Horel, and B. Krishnamurthy, “The Star Graph: An Attractive Alternative to the $n\hbox{-}{\rm cube}$ ,” Proc. Int'l Conf. Parallel Processing (ICPP '87), pp. 393-400, 1987.
[2] T. Araki and Y. Shibata, “Diagnosability of Networks Represented by the Cartesian Product,” IEICE Trans. Fundamentals, vol. E83-A, no. 3, pp. 465-470, 2000.
[3] T. Araki and Y. Shibata, “$(t, k)\hbox{-}{\rm Diagnosable}$ System: A Generalization of the PMC Models,” IEEE Trans. Computers, vol. 52, no. 7, pp. 971-975, July 2003.
[4] 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, 1981.
[5] S. Bettayeb, “On the $k\hbox{-}{\rm ary}$ Hypercube,” Theoretical Computer Science, vol. 140, no. 2, pp. 333-339, 1995.
[6] C.P. Chang, P.L. Lai, J.J.M. Tan, and L.H. Hsu, “Diagnosability of $t\hbox{-}{\rm Connected}$ Networks and Product Networks under the Comparison Diagnosis Model,” IEEE Trans. Computers, vol. 53, no. 12, pp. 1582-1590, Dec. 2004.
[7] G.Y. Chang, G.J. Chang, and G.H. Chen, “Diagnosabilities of Regular Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 16, no. 4, pp. 314-323, Apr. 2005.
[8] G.Y. Chang and G.H. Chen, “$(t, k)\hbox{-}{\rm Diagnosability}$ of Multiprocessor Systems with Applications to Grids and Tori,” SIAM J.Computing, vol. 37, no. 4, pp. 1280-1298, 2007.
[9] G.Y. Chang, G.H. Chen, and G.J. Chang, “$(t, k)\hbox{-}{\rm Diagnosis}$ for Matching Composition Networks,” IEEE Trans. Computers, vol. 55, no. 1, pp. 88-92, Jan. 2006.
[10] G.Y. Chang, G.H. Chen, and G.J. Chang, “$(t, k)\hbox{-}{\rm Diagnosis}$ for Matching Composition Networks under the MM* Model,” IEEE Trans. Computers, vol. 56, no. 1, pp. 73-79, Jan. 2007.
[11] K.Y. Chwa and L. Hakimi, “On Fault Identification in Diagnosable Systems,” IEEE Trans. Computers, vol. 30, no. 6, pp. 414-422, 1981.
[12] 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, 1999.
[13] P. Cull and S.M. Larson, “The Möbius Cubes,” IEEE Trans. Computers, vol. 44, no. 5, pp. 647-659, May 1995.
[14] A.T. Dahbura and G.M. Masson, “An $O(n^{2.5})$ Fault Identification Algorithm for Diagnosable Systems,” IEEE Trans. Computers, vol. 33, no. 6, pp. 486-492, 1984.
[15] 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. 895-905, 1994.
[16] S.K. Das, S.R. Öhring, and A.K. Banerjee, “Embeddings into Hyper Petersen Network: Yet Another Hypercube-Like Interconnection Topology,” VLSI Design, vol. 2, no. 4, pp. 335-351, 1995.
[17] K. Day and A.E. Al-Ayyoub, “The Cross Product of Interconnection Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 2, pp. 109-118, Feb. 1997.
[18] K. Efe, “A Variation on the Hypercube with Lower Diameter,” IEEE Trans. Computers, vol. 40, no. 11, pp. 1312-1316, Nov. 1991.
[19] J. Fan, “Diagnosability of the Möbius Cubes,” IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 9, pp. 923-928, Sept. 1998.
[20] H. Fugiwara and K. Kinoshita, “On the Computational Complexity of System Diagnosis,” IEEE Trans. Computers, vol. 27, no. 10, pp. 881-885, 1978.
[21] S.L. Hakimi and A.T. Amin, “Characterization of Connection Assignment,” IEEE Trans. Computers, vol. 23, pp. 86-88, 1974.
[22] P.A.J. Hilbers, M.R.J. Koopman, and J.L.A. van de Snepscheut, “The Twisted Cube,” Proc. Parallel Architectures and Languages Europe (PARLE '87), pp. 152-159, June 1987.
[23] A. Kavianpour, “Sequential Diagnosability of Star Graphs,” Computers and Electrical Eng., vol. 22, no. 1, pp. 37-44, 1996.
[24] A. Kavianpour and K.H. Kim, “Diagnosability of Hypercubes under the Pessimistic One-Step Diagnosis Strategy,” IEEE Trans. Computers, vol. 40, no. 2, pp. 232-237, Feb. 1991.
[25] S. Khanna and W.K. Fuchs, “A Linear Time Algorithm for Sequential Diagnosis in Hypercubes,” J. Parallel and Distributed Computing, vol. 26, pp. 48-53, 1995.
[26] S. Khanna and W.K. Fuchs, “A Graph Partitioning Approach to Sequential Diagnosis,” IEEE Trans. Computers, vol. 46, no. 1, pp. 39-47, Jan. 1997.
[27] P.L. Lai, J.J.M. Tan, C.P. Chang, and L.H. Hsu, “Conditional Diagnosability Measures for Large Multiprocessor Systems,” IEEE Trans. Computers, vol. 54, no. 2, pp. 165-175, Feb. 2005.
[28] P.L. Lai, J.J.M. Tan, C.H. Tsai, and L.H. Hsu, “Diagnosability of the Matching Composition Network under the Comparison Diagnosis Model,” IEEE Trans. Computers, vol. 53, no. 8, pp.1064-1069, Aug. 2004.
[29] J.K. Lee and J.T. Butler, “A Characterization of $t/s\hbox{-}{\rm Diagnosability}$ and Sequential $t\hbox{-}{\rm Diagnosability}$ in Designs,” IEEE Trans. Computers, vol. 39, no. 10, pp. 1298-1304, Oct. 1990.
[30] J. Maeng and M. Malek, “A Comparison Connection Assignment for Self-Diagnosis of Multiprocessor Systems,” Proc. 11th Int'l Symp. Fault-Tolerant Computing (FTCS '81), pp. 173-175, 1981.
[31] F.P. Preparata, G. Metze, and R.T. Chien, “On the Connection Assignment Problem of Diagnosable Systems,” IEEE Trans. Computers, vol. EC-16, pp. 448-454, 1967.
[32] F.P. Preparata and J. Vuillemin, “The Cube-Connected Cycles: A Versatile Network for Parallel Computation,” Comm. ACM, vol. 24, pp. 300-309, 1981.
[33] Y. Saad and M.H. Schultz, “Topological Properties of Hypercubes,” IEEE Trans. Computers, vol. 37, no. 7, pp. 867-872, July 1988.
[34] A. Sengupta and A. Dahbura, “On Self-Diagnosable Multiprocessor System: Diagnosis by the Comparison Approach,” IEEE Trans. Computers, vol. 41, no. 11, pp. 1386-1396, Nov. 1992.
[35] A.K. Somani, “Sequential Fault Occurrence and Reconfiguration in System Level Diagnosis,” IEEE Trans. Computers, vol. 39, no. 12, pp. 1472-1475, Dec. 1990.
[36] A.K. Somani, V.K. Agarwal, and D. Avis, “A Generalized Theory for System Level Diagnosis,” IEEE Trans. Computers, vol. 36, no. 5, pp. 538-546, May 1987.
[37] A.K. Somani and O. Peleg, “On Diagnosability of Large Fault Sets in Regular Topology-Based Computer Systems,” IEEE Trans. Computers, vol. 45, no. 8, pp. 892-903, Aug. 1996.
[38] N.E. Tzeng and S. Wei, “Enhanced Hypercubes,” IEEE Trans. Computers, vol. 41, no. 11, pp. 1386-1396, Nov. 1992.
[39] D. Wang, “Diagnosability of Enhanced Hypercubes,” IEEE Trans. Computers, vol. 43, no. 9, pp. 1054-1061, Sept. 1994.
[40] C.L. Yang, G.M. Masson, and R.A. Leonetti, “On Fault Isolation and Identification in $t_{1}/t_{1}\hbox{-}{\rm Diagnosable}$ Systems,” IEEE Trans. Computers, vol. 35, no. 7, pp. 639-643, July 1986.
[41] X. Yang, D.J. Evans, and G.M. Megson, “The Locally Twisted Cubes,” Int'l J. Computer Math., vol. 82, no. 4, pp. 401-413, 2005.
[42] X. Yang and Y.Y. Tang, “Efficient Fault Identification of Diagnosable Systems under the Comparison Model,” IEEE Trans. Computers, vol. 56, no. 12, pp. 1612-1618, Dec. 2007.
17 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool