Skip to main content
Springer Nature Link
Log in

Diagnosability of Two-Matching Composition Networks

  • Conference paper
Computing and Combinatorics (COCOON 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5092))

Included in the following conference series:

  • 990 Accesses

Abstract

Diagnosability is an important metric for measuring the reliability of multiprocessor systems. In this paper, we study the diagnosability of a class of networks, called Two-Matching Composition Networks (2-MCNs), each of which is constructed by connecting two graphs via two perfect matchings. By applying our result to multiprocessor systems, we also compute the diagnosability of folded hypercubes and augmented cubes, both of which belong to two-matching composition networks.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Araki, T., Shibata, Y.: Diagnosability of Butterfly Networks under the Comparison Approach. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences E85-A(5), 1152–1160 (2002)

    Google Scholar 

  2. Araki, T., Shibata, Y.: (t,k)-Diagnosable System: a Generalization of the PMC Models. IEEE Transactions on Computers 52(7), 971–975 (2003)

    Article  Google Scholar 

  3. Armstrong, J.R., Gray, F.G.: Fault Diagnosis in a Boolean n Cube Array of Multiprocessors. IEEE Transactions on Computers 30(8), 587–590 (1981)

    Article  MATH  Google Scholar 

  4. Chang, G.Y., Chang, G.J., Chen, G.H.: Diagnosabilities of Regular Networks. IEEE Transactions on Parallel and Distributed Systems 16(4), 314–323 (2005)

    Article  MathSciNet  Google Scholar 

  5. Chang, G.Y., Chen, G.H., Chang, G.J.: (t,k)-Diagnosis for Matching Composition Networks. IEEE Transactions on Computers 55(1), 88–92 (2006)

    Article  MathSciNet  Google Scholar 

  6. Chang, G.Y., Chen, G.H., Chang, G.J. (t,k)-Diagnosis for Matching Composition Networks under the MM* Model. IEEE Transactions on Computers 56(1), 73–79 (2007)

    Article  MATH  Google Scholar 

  7. Choudum, S.A., Sunitha, V.: Augmented Cubes. Networks 40(2), 71–84 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  8. Chwa, K.Y., Hakimi, L.: On Fault Identification in Diagnosable Systems. IEEE Transactions on Computers 30(6), 414–422 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  9. Das, A., Thulasiraman, K., Agarwal, V.K.: Diagnosis of t/(t + 1)-Diagnosable Systems. SIAM Journal on Computing 23(5), 895–905 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  10. EI-Awawy, A., Latifi, S.: Properties and Performance of Folded Hypercubes. IEEE Transactions on Parallel and Distributed Systems 2(1), 31–42 (1991)

    Article  Google Scholar 

  11. Fan, J.: Diagnosability of the Möbius Cubes. IEEE Transactions on Parallel and Distributed Systems 9(9), 923–928 (1998)

    Article  Google Scholar 

  12. Fan, J.: Diagnosability of Crossed Cubes under the Comparison Diagnosis Model. IEEE Transactions on Parallel and Distributed Systems 13(7), 687–692 (2002)

    Article  Google Scholar 

  13. Fan, J., Lin, X.: The t/k-Diagnosability of the BC Graphs. IEEE Transactions on Computers 54(2), 176–184 (2005)

    Article  Google Scholar 

  14. Kavianpour, A., Kim, K.H.: Diagnosability of Hypercubes under the Pessimistic One-Step Diagnosis Strategy. IEEE Transactions on Computers 40(2), 232–237 (1991)

    Article  Google Scholar 

  15. Lee, J.K., Butler, J.T.: A Characterization of t/s-Diagnosability and Sequential t-Diagnosability in Designs. IEEE Transactions on Computers 39(10), 1298–1304 (1990)

    Article  Google Scholar 

  16. Maeng, J., Malek, M.: A Comparison Connection Assignment for Self-diagnosis of Multiprocessor Systems. In: Proceeding of the 11th International Symposium on Fault-Tolerant Computing, pp. 173–175 (1981)

    Google Scholar 

  17. Preparata, F.P., Metze, G., Chien, R.T.: On the Connection Assignment Problem of Diagnosable Systems. IEEE Transactions on Computers EC-16, 448–454 (1967)

    Google Scholar 

  18. Sengupta, A., Dahbura, A.: On Self-diagnosable Multiprocessor System: Diagnosis by the Comparison Approach. IEEE Transactions on Computers 41(11), 1386–1396 (1992)

    Article  MathSciNet  Google Scholar 

  19. Somani, A.K.: Sequential Fault Cccurrence and Reconfiguration in System Level Diagnosis. IEEE Transactions on Computers 39(12), 1472–1475 (1990)

    Article  MathSciNet  Google Scholar 

  20. Somani, A.K., Agarwal, V.K., Avis, D.: A Generalized Theory for System Level Diagnosis. IEEE Transactions on Computers 36(5), 538–546 (1987)

    Article  MATH  Google Scholar 

  21. Somani, A.K., Peleg, O.: On Diagnosability of Large Fault Sets in Regular Topology-based Computer Systems. IEEE Transactions on Computers 45(8), 892–903 (1996)

    Article  MATH  Google Scholar 

  22. Wang, D.: Diagnosability of Hypercubes and Enhanced Hypercubes under the Comparison Diagnosis Model. IEEE Transactions on Computers 48(12), 1369–1374 (1999)

    Article  Google Scholar 

  23. Yang, C.L., Masson, G.M., Leonetti, R.A.: On Fault Isolation and Identification in t 1/t 1-Diagnosable Systems. IEEE Transactions on Computers 35(7), 639–643 (1986)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Information Engineering, National Cheng Kung University, No. 1, University Road, Tainan, 70101, Taiwan

    Sun-Yuan Hsieh & Chia-Wei Lee

Authors
  1. Sun-Yuan Hsieh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chia-Wei Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Xiaodong Hu Jie Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hsieh, SY., Lee, CW. (2008). Diagnosability of Two-Matching Composition Networks. In: Hu, X., Wang, J. (eds) Computing and Combinatorics. COCOON 2008. Lecture Notes in Computer Science, vol 5092. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69733-6_47

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-69733-6_47

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-69732-9

  • Online ISBN: 978-3-540-69733-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics