Skip to main content

Determining the Conditional Diagnosability of k-Ary n-Cubes Under the MM* Model

  • Conference paper
Structural Information and Communication Complexity (SIROCCO 2011)

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

Abstract

Processor fault diagnosis plays an important role for measuring the reliability of multiprocessor systems, and the diagnosability of many well-known interconnection networks has been investigated widely. Conditional diagnosability is a novel measure of diagnosability, which is introduced by Lai et al., by adding an additional condition that any faulty set cannot contain all the neighbors of any vertex in a system. The class of k-ary n-cubes contains as special cases many topologies important to parallel processing, such as rings, hypercubes, and tori. In this paper, we study some topological properties of the k-ary n-cube, denoted by \(Q^k_n\). Then we apply them to show that the conditional diagnosability of \(Q^k_n\) under the comparison diagnosis model is \(t_c(Q^k_n)=6n-5\) for k ≥ 4 and n ≥ 4.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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 

  2. Araki, T., Shibata, Y.: Diagnosability of networks represented by the Cartesian product. IEICE Transactions on Fundamentals E83-A(3), 465–470 (2000)

    Google Scholar 

  3. Chang, C.P., Lai, P.L., Tan, J.J.M., Hsu, L.H.: Diagnosabilities of t-connected networks and product networks under the comparison diagnosis model. IEEE Transactions on Computers 53(12), 1582–1590 (2004)

    Article  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  Google Scholar 

  5. Day, K., Ai-Ayyoub, A.E.: Fault diameter of k-ary n-cube networks. IEEE Transactions on Parallel and Distributed Systems 8, 903–907 (1997)

    Article  Google Scholar 

  6. Day, K.: The conditional node connectivity of the k-ary n-cube. Journal of Interconnection Networks 5(1), 13–26 (2004)

    Article  Google Scholar 

  7. Friedman, A.D., Simoncini, L.: System-level fault diagnosis. The Computer Journal 13(3), 47–53 (1980)

    Article  Google Scholar 

  8. Fujiwara, H., Kinoshita, K.: On the computational complexity of system diagnosis. IEEE Transactions on Computers 27(10), 881–885 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  9. Fan, J.: Diagnosability of crossed cubes under the two strategies. Chinese Journal of Computers 21(5), 456–462 (1998)

    MathSciNet  Google Scholar 

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

    Article  Google Scholar 

  11. Hsu, G.H., Chiang, C.F., Shih, L.M., Hsu, L.H., Tan, J.J.M.: Conditional diagnosability of hypercubes under the comparison diagnosis model. Journal of Systems Architecture 55(2), 140–146 (2009)

    Article  Google Scholar 

  12. Hsu, G.H., Tan, J.J.M.: Conditional diagnosability of the BC Networks under the comparison diagnosis model. International Computer Symposium 1, 269–274 (2008)

    Google Scholar 

  13. Hakimi, S.L., Amin, A.T.: Characterization of connection assignment of diagnosable systems. IEEE Transactions on Computers 23, 86–88 (1974)

    Article  MATH  MathSciNet  Google Scholar 

  14. Hsieh, S.Y., Lin, T.J.: Embedding cycles and paths in a k-ary n-cube. In: Proceedings of International Conference on Parallel and Distributed Systems, vol. 2, pp. 1–7 (2007)

    Google Scholar 

  15. Hsieh, S.Y., Chen, Y.S.: Strongly diagnosable product networks under the comparison diagnosis model. IEEE Transactions on Computers 57(6), 721–732 (2008)

    Article  MathSciNet  Google Scholar 

  16. Hsieh, S.Y., Chen, Y.S.: Strongly diagnosable systems under the comparison diagnosis model. IEEE Transactions on Computers 57(12), 1720–1725 (2008)

    Article  MathSciNet  Google Scholar 

  17. Hsieh, S.Y., Lin, T.J.: Panconnectivity and Edge-Pancyclicity of k-Ary n-Cubes. Networks (SCI EI) 54(1), 1–11 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  18. Hsieh, S.Y., Lee, C.W.: Diagnosability of two-matching composition networks under the MM* model. IEEE Transactions on Dependable and Secure Computing 8(2), 246–255 (2011)

    Article  Google Scholar 

  19. Ishida, Y., Adachi, N., Tokumaru, H.: Diagnosability and distinguishability analysis and its applications. IEEE Transactions on Reliability 36(5), 531–538 (1987)

    Article  Google Scholar 

  20. Kavianpour, A.: Sequential diagnosability of star graphs. Computers and Electrical Engineering 22(1), 37–44 (1996)

    Article  Google Scholar 

  21. 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 

  22. Kavianpour, A., Kim, K.H.: A comparative evaluation of four basic system-level diagnosis strategies for hypercubes. IEEE Transactions on Reliability 41(1), 26–37 (1992)

    Article  MATH  Google Scholar 

  23. Kessler, R.E., Schwarzmeier, J.L.: Cray T3D: a new dimension for Cray research, in. In: Proceedings of the 38th IEEE Computer Society International Conference, pp. 176–182 (1993)

    Google Scholar 

  24. Lin, C.K., Tan, J.J.M., Hsu, L.H., Cheng, E., Lipták, L.: Conditional diagnosability of Cayley Graphs generated by transposition trees under the comparison diagnosis model. Journal of Interconnection Networks 9(1-2), 83–97 (2008)

    Article  Google Scholar 

  25. Lai, P.L., Tan, J.J.M., Chang, C.P., Hsu, L.H.: Conditional diagnosability measures for large multiprocessor systems. IEEE Transactions on Computers 54(2), 165–175 (2005)

    Article  Google Scholar 

  26. Lai, P.L., Tan, J.J.M., Tsai, C.H., Hsu, L.H.: The diagnosability of the matching composition network under the comparison diagnosis model. IEEE Transactions on Computers 53, 1064–1069 (2004)

    Article  Google Scholar 

  27. Maeng, J., Malek, M.: A comparison connection assignment for self-diagnosis of multiprocessors systems. In: Proceedings of the 11th International Symposium on Fault-Tolerant Computing, pp. 173–175 (1981)

    Google Scholar 

  28. Malek, M.: A comparison connection assignment for diagnosis of multiprocessor systems. In: Proceedings of the 7th International Symposium on Computer Architecture, pp. 31–36 (1980)

    Google Scholar 

  29. Mao, W., Nicol, D.M.: On k-ary n-cubes: theory and applications. Discrete Applied Mathematics 129, 171–193 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  30. Najjar, W., Gaudiot, J.L.: Network resilience: a measure of network fault tolerance. IEEE Transactions on Computers 39, 174–181 (1990)

    Article  Google Scholar 

  31. Preparata, F.P., Metze, G., Chien, R.T.: On the connection assignment problem of diagnosable systems. IEEE Transactions on Electronic Computers 16(6), 848–854 (1967)

    Article  MATH  Google Scholar 

  32. Pan, Y.: Fault tolerance in the block-shift network. IEEE Transactions on Reliability 50(1), 85–91 (2001)

    Article  Google Scholar 

  33. Sengupta, A., Dahbura, A.T.: On self-diagnosable multiprocessor systems: diagnosis by the comparison approach. IEEE Transactions on Computers 41(11), 1386–1396 (1992)

    Article  MathSciNet  Google Scholar 

  34. 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 

  35. Sarbazi-Azad, H., Ould-Khaoua, M., Mackenzie, L.M., Akl, S.G.: On some properties of k-ary n-cubes. In: Proceedings of the Eighth International Conference on Parallel and Distributed Systems (ICPADS), pp. 517–524. IEEE Computer Society, Los Alamitos (2001)

    Google Scholar 

  36. Wang, D.: Diagnosability of enhanced hypercubes. IEEE Transactions on Computers 43(9), 1054–1061 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  37. Wang, D.: Diagnosability of hypercubes and enhanced hypercubes under the comparison diagnosis model. IEEE Transactions on Computers 48(12), 1369–1374 (1999)

    Article  MathSciNet  Google Scholar 

  38. Xu, M., Thulasiraman, K., Hu, X.D.: Conditional diagnosability of matching composition networks under the PMC model. IEEE Transactions on Circuits and Systems 56(11), 875–879 (2009)

    Article  Google Scholar 

  39. Zhao, J., Meyer, F.J., Park, N., Lombardi, F.: Sequential diagnosis of processor array systems. IEEE Transactions on Reliability 53(4), 487–498 (2004)

    Article  Google Scholar 

  40. Zhou, S.: The conditional diagnosability of hypercubes under the comparison model. In: Proceedings of the 2009 WASE International Conference on Information Engineering, pp. 459–462 (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hsieh, SY., Kao, CY. (2011). Determining the Conditional Diagnosability of k-Ary n-Cubes Under the MM* Model. In: Kosowski, A., Yamashita, M. (eds) Structural Information and Communication Complexity. SIROCCO 2011. Lecture Notes in Computer Science, vol 6796. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22212-2_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22212-2_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22211-5

  • Online ISBN: 978-3-642-22212-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics