151
Views
5
CrossRef citations to date
0
Altmetric
Original Articles

The pessimistic diagnosability of bubble-sort star graphs and augmented k-ary n-cubes

, &
Pages 98-112 | Received 27 Jan 2016, Accepted 03 Nov 2016, Published online: 24 Jan 2017

References

  • H. Cai, H. Liu, and M. Lu, Fault-tolerant maximal local-connectivity on Bubble-sort star graphs, Discrete Appl. Math. 181 (2015), pp. 33–40. doi: 10.1016/j.dam.2014.10.006
  • G.-Y. Chang, G.-H. Chen, and G.-J. Chang, -diagnosis for matching composition networks, IEEE Trans. Comput. 55(1) (2006), pp. 88–92. doi: 10.1109/TC.2006.1
  • N.-W. Chang, E. Cheng, and S.-Y. Hsieh, Conditional diagnosability of Cayley graphs generated by transposition trees under the PMC model, ACM Trans. Des. Autom. Electron. Syst. 20(2) (2015), pp. 1–16. 20.
  • N.-W. Chang, W.-H. Deng, and S.-Y. Hsieh, Conditional diagnosability of -star networks under the comparison diagnosis model, IEEE Trans. Reliab. 64(1) (2015), pp. 132–143. doi: 10.1109/TR.2014.2354912
  • C.-A. Chen and S.-Y. Hsieh, -Diagnosis for component-composition graphs under the MM model, IEEE Trans. Comput. 60(12) (2011), pp. 1704–1717. doi: 10.1109/TC.2010.201
  • C.-A. Chen and S.-Y. Hsieh, t/t-Diagnosability of regular graphs under the PMC model, ACM Trans. Des. Autom. Electron. Syst. 18(2) (2013), pp. 1–13. 20. doi: 10.1145/2442087.2442091
  • E. Cheng, L. Lipták, and D. Sherman, Matching preclusion for the -bubble-sort graphs, Int. J. Comput. Math. 87 (2010), pp. 2408–2418. doi: 10.1080/00207160902883514
  • E. Cheng, L. Lipták, K. Qiu, and Z. Shen, On deriving conditional diagnosability of interconnection networks, Inf. Process. Lett. 112 (2012), pp. 674–677. doi: 10.1016/j.ipl.2012.06.008
  • E. Cheng, L. Lipták, K. Qiu, and Z. Shen, A unified approach to the conditional diagnosability of interconnection networks, J. Int. Netw. 13 (2012), pp. 1–19. 1250007.
  • E. Cheng and N. Shawash, The -bubble sort graphs, Congressus Numerantium 193 (2008), pp. 97–117.
  • E. Cheng, K. Qiu, and Z. Shen, On the conditional diagnosability of matching composition networks, Theor. Comput. Sci. 557 (2014), pp. 101–114. doi: 10.1016/j.tcs.2014.09.008
  • C.-F. Chiang, G.-H. Hsu, L.-M. Shih, and J.J.M. Tan, Diagnosability of star graphs with missing edges, Inf. Sci. 188 (2012), pp. 253–259. doi: 10.1016/j.ins.2011.11.012
  • Z.-T. Chou, C.-C. Hsu, and J.-P. Sheu, Bubble-sort star graphs: A new interconnection network, in International Conference on Parallel Distributed Systems, 1996, pp. 41–48.
  • K.-Y. Chwa and S.-L. Hakimi, On fault identification in diagnosable systems, IEEE Trans. Comput. 30(6) (1981), pp. 414–422. doi: 10.1109/TC.1981.1675807
  • J. Fan, Diagnosability of the Möbius cubes, IEEE Trans. Parallel Distrib. Syst. 40(1) (1991), pp. 88–93.
  • R.-X. Hao, M.-M. Gu, and Y.-Q. Feng, The pessimistic diagnosabilities of some general regular graphs, Theor. Comput. Sci. 609 (2016), pp. 413–420. doi: 10.1016/j.tcs.2015.10.025
  • A. Kavianpour and K.H. Kim, Diagnosabilities of hypercubes under the pessimistic one-step diagnosis strategy, IEEE Trans. Comput. 40(2) (1991), pp. 232–237. doi: 10.1109/12.73595
  • P.L. Lai, J.J.M. Tan, C.P. Chang, and L.H. Hsu, Conditional diagnosability measures for large multiprocessor systems, IEEE Trans. Comput. 54(2) (2005), pp. 165–175. doi: 10.1109/TC.2005.19
  • R. Lin and H. Zhang, The restricted edge-connectivity and restricted connectivity of augmented k-ary n-cubes, Int. J. Comput. Math. 93(8) (2016), pp. 1281–1298. doi: 10.1080/00207160.2015.1067690
  • L. Lin, L. Xu, S. Zhou, and S.-Y. Hsieh, The extra, restricted connectivity and conditional diagnosability of Split-star networks, IEEE Trans. Parallel Distrib. Syst. 27(2) (2016), pp. 533–545. doi: 10.1109/TPDS.2015.2400459
  • F.P. Preparata, G. Metze, and R.T. Chien, On the connection assignment problem of diagnosis systems, IEEE Trans. Electron. Comput. 16(12) (1967), pp. 848–854. doi: 10.1109/PGEC.1967.264748
  • I.A. Stewart, A general technique to establish the asymptotic conditional diagnosability of interconnection networks, Theor. Comput. Sci. 452 (2012), pp. 132–147. doi: 10.1016/j.tcs.2012.05.015
  • C.-H. Tsai, A quick pessimistic diagnosis algorithm for hypercube-like multiprocessor systems under the PMC model, IEEE Trans. Comput. 62(2) (2013), pp. 259–267. doi: 10.1109/TC.2011.228
  • C.-H. Tsai, The pessimistic diagnosability of alternating group graphs under the PMC model, Inf. Process. Lett. 115 (2015), pp. 151–154. doi: 10.1016/j.ipl.2014.09.003
  • C.-H. Tsai and J.-C. Chen, Fault isolation and identification in general biswapped networks under the PMC diagnostic model, Theor. Comput. Sci. 501 (2013), pp. 62–71. doi: 10.1016/j.tcs.2013.06.002
  • S. Wang, R. Wang, S. Lin, and J. Li, Matching preclusion for k-ary n-cubes, Discrete Appl. Math. 158(18) (2010), pp. 2066–2070. doi: 10.1016/j.dam.2010.08.017
  • X.-K. Wang, Q. Zhu, and R. Feng, The diagnosability of the k-ary n-cubes using the pessimistic strategy, Int. J. Comput. Math. 89(1) (2012), pp. 1–10. doi: 10.1080/00207160.2011.628386
  • Y. Xiang and I.A. Stewart, Augmented k-ary n-cubes, Inf. Sci. 181 (2011), pp. 239–256. doi: 10.1016/j.ins.2010.09.005
  • J.-M. Xu, Combination of Network Theory, Science Press, Beijing, 2013.
  • X. Yang, A fast pessimistic one-step diagnosis algorithm for hypercube multicomputer systems, J. Parallel Distrib. Comput. 64 (2004), pp. 546–553. doi: 10.1016/j.jpdc.2004.02.002
  • S. Zhou, L. Lin, L. Xu, and D. Wang, The t/k-diagnosability of star graph networks, IEEE Trans. Comput. 64(2) (2015), pp. 547–555. doi: 10.1109/TC.2013.228

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.