1,173
Views
11
CrossRef citations to date
0
Altmetric
Section A

The diagnosability of the k-ary n-cubes using the pessimistic strategy

, &
Pages 1-10 | Received 20 Apr 2011, Accepted 12 Sep 2011, Published online: 17 Nov 2011

References

  • Araki , T. and Shibata , Y. 2003 . (t, k)-diagnosable system: A generalization of the PMC models . IEEE Trans. Comput , 52 ( 7 ) : 971 – 975 .
  • Bondy , J. A. and Murty , U. S.R. 1976 . Graph Theory with Applications , New York : North Holland .
  • Bose , B. , Broeg , B. , Kwon , Y. and Ashir , Y. 1995 . Lee distance and topological properties of k-ary n-cubes . IEEE Trans. Comput , 44 ( 8 ) : 1021 – 1030 .
  • Chen , D. , Coteus , P. , Gara , A. , Giampapa , M. E. , Heidelberger , P. , Singh , S. , Steinmacher-Burow , B. D. , Takken , T. , Tsao , M. , Adiga , N. R. , Blumrich , M. A. and Vranas , P. 2005 . Blue gene/l torus interconnection network . IBM J. Res. Dev , 49 : 265 – 276 .
  • Chwa , K.-Y. and Hakimi , S. L. 1981 . On fault identification in diagnosable systems . IEEE Trans. Comput , C-30 ( 6 ) : 414 – 422 .
  • Fan , J. 1998 . Diagnosability of the mobius cubes . IEEE Trans. Parallel Distrib. Syst , 9 ( 9 ) : 923 – 928 .
  • W.J. Dally, A. Chien, S. Fiske, W. Horwat, J. Keen, M. Larivee, R. Nuth, S. Wills, P. Carrick, and G. Flyer, The J-Machine: A fine-grain concurrent computer, in Information Processing 89. Proceeding of the IFIP 11th World Computer Congress, G.X. Ritter, ed., Elsevier Science Publishers B.V./North-Holland, Inc., New York, 1989, pp. 1147–1153
  • Friedman , A. D. A new measure of digital system diagnosis . Proceedings of the 5th IEEE Fault-Tolerant Computing Symposium . June . pp. 167 – 170 .
  • Hsieh , S.-Y. and Chen , Y.-S. 2008 . Strongly diagnosable systems under the comparison diagnosis model . IEEE Trans. Comput , 57 ( 12 ) : 1720 – 1725 .
  • Hsieh , S.-Y. and Chen , Y.-S. 2008 . Strongly diagnosable product networks under the comparison diagnosis model . IEEE Trans. Comput , 57 ( 6 ) : 721 – 732 .
  • Hsieh , S.-Y. and Chuang , T.-Y. 2009 . The strong diagnosability of regular networks and product networks under the pmc model . IEEE Trans. Parallel Distrib. Syst , 20 ( 3 ) : 367 – 378 .
  • Kavianpour , A. and Friedman , A. D. Efficient design of easily diagnosable systems . Proceedings of the 3rd USA–Japan Computer Conference . pp. 251 – 257 .
  • Kavianpour , A. and Kim , K. H. 1991 . Diagnosabilities of hypercubes under the pessimistic one-step diagnosis strategy . IEEE Trans. Comput , 40 ( 2 ) : 232 – 237 .
  • Lee , C.-W. and Hsieh , S.-Y. 2011 . Determining the diagnosability of (1,2)-matching composition networks and its applications . IEEE Trans. Dependable Secur. Comput , 8 ( 3 ) : 353 – 362 .
  • Metie , G. , Preparata , F. P. and Chien , R. T. 1967 . On the connection assignment problem of diagnosable systems . IEEE Trans. Electron. Comput , 16 : 848 – 854 .
  • Oed , W. 1993 . The cray research massively parallel processor system: Cray T3D . Technical Report, Gray Research Inc., November
  • Somani , A. K. and Peleg , O. 1996 . On diagnosability of large fault sets in regular topology-based computer systems . IEEE Trans. Comput , 45 ( 8 ) : 892 – 903 .
  • Wang , D. 1994 . Diagnosability of enhanced hypercubes . IEEE Trans. Comput , 43 ( 9 ) : 1054 – 1061 .
  • Zhu , Q. 2008 . On conditional diagnosability and reliability of the BC networks . J. Supercomput , 45 ( 2 ) : 173 – 184 .
  • Zhu , Q. , Liu , S.-Y. and Xu , M. 2008 . On conditional diagnosability of the folded hypercubes . Inform. Sci , 178 ( 4 ) : 1069 – 1077 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.