43
Views
1
CrossRef citations to date
0
Altmetric
Articles

The g-good-neighbour conditional diagnosability of multiprocessor system based on half hypercube

, , , &
Pages 160-176 | Received 26 Sep 2017, Accepted 30 Jul 2018, Published online: 21 Sep 2018

References

  • N.-W. Chang and S.-Y. Hsieh, Structural properties and conditional diagnosability of star graphs by using the PMC model, IEEE Trans. Parallel Distrib. Syst. 25(11) (2014), pp. 3002–3011. doi: 10.1109/TPDS.2013.290
  • K. Ghose and K.R. Desai, Hierarchical cubic network, IEEE Trans. Parallel Distrib. Syst. 6(4) (1995), pp. 427–435. doi: 10.1109/71.372797
  • R.-X. Hao, Z.-X. Tian, and J.-M. Xu, Relationship between conditional diagnosability and 2-extra connectivity of symmetric graphs, Theoret. Comput. Sci. 627 (2016), pp. 36–53. doi: 10.1016/j.tcs.2016.02.024
  • J.-S. Kim, M.-H. Kim, and H.-O. Lee, Analysis and design of a half hypercube interconnection network, in Multimedia and Ubiquitous Engineering, Vol. 240, Springer, Berlin, 2013, pp. 537–543.
  • M.-H. Kim, J.-S. Kim, and H.-O. Lee, Broadcasting and embedding algorithms for a half hypercube interconnection network, in Multimedia and Ubiquitous Engineering, Vol. 240, Springer, Berlin, 2013, pp. 553–559.
  • 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
  • S. Latifi, M. Hegde, and M. Naraghi-Pour, Conditional connectivity measures for large multiprocessor systems, IEEE Trans. Comput. 43(2) (1994), pp. 218–222. doi: 10.1109/12.262126
  • X. Li, Strong diagnosability and conditional diagnosability of optical multi-mesh hypercube networks under the PMC model, Int. J. Comput. Math. 93(12) (2016), pp. 2054–2063. doi: 10.1080/00207160.2015.1084416
  • D. Li and M. Lu, The g-good-neighbor conditional diagnosability of star graphs under the PMC model and MM* model, Theoret. Comput. Sci. 674 (2017), pp. 53–59. doi: 10.1016/j.tcs.2017.02.011
  • L. Lin, S.-Y. Hsieh, R. Chen, L. Xu, and C.-W. Lee, The relationship between g-restricted connectivity and g-good-neighbor fault-diagnosability of general regular networks, IEEE Trans. Reliab. 67(1) (2018), pp. 285–296. doi: 10.1109/TR.2017.2760905
  • C.-K. Lin, J.J.M. Tan, L.H. Hsu, E. Cheng, and L. Lipták, Conditional diagnosability of Cayley graphs generalized by transposition tree under the comparison diagnosais model, J. Interconnect. Networks 9(1–2) (2008), pp. 83–97. doi: 10.1142/S0219265908002175
  • L. Lin, L. Xu, D. Wang, and S. Zhou, The g-good-neighbor conditional diagnosability of arrangement graphs, IEEE Trans. Dependable Secur. Comput. (2016). Available at http://doi.org/10.1109/TDSC.2016.2593446.
  • L. Lin, S. Zhou, L. Xu, and D. Wang, Conditional diagnosability of arrangement graphs under the PMC model, Theoret. Comput. Sci. 548 (2014), pp. 79–97. doi: 10.1016/j.tcs.2014.06.041
  • Y. Lv, Y. Xiang, and J. Fan, Conditional fault-tolerant routing of -star graph, Int. J. Comput. Math. 93(10) (2016), pp. 1695–1707. doi: 10.1080/00207160.2015.1071798
  • M. Maeng and M. Malek, A Comparison Connection Assignment for Diagnosis of Multiprocessor Systems, Proceedings of the 11th International Fault-Tolerant Computing, Portland, 1981, pp. 173–175.
  • A.D. Oh and A.-H. Choi, Generalized measures of fault tolerance in n-cube networks, IEEE Trans. Parallel Distrib. Syst. 4(6) (1993), pp. 702–703. doi: 10.1109/71.242153
  • S.-L. Peng, C.-K. Lin, J.J.M. Tan, and L.-H. Hsu, The g-good-neighbor conditional diagnosability of hypercube under the PMC model, Appl. Math. Comput. 218(21) (2012), pp. 10406–10412.
  • F.P. Preparata, G. Metze, and R.T. Chien, On the connection assignment problem of diagnosable systems, IEEE Trans. Electron. Comput. 16(6) (1967), pp. 848–854. doi: 10.1109/PGEC.1967.264748
  • A. Sengupta and A.T. Dahbura, On self-diagnosable multiprocessor systems: Diagnosis by the comparison approach, IEEE Trans. Comput. 41(11) (1992), pp. 1386–1396. doi: 10.1109/12.177309
  • M. Wang, Y. Guo, and S. Wang, The 1-good-neighbor conditional diagnosability of cayley graphs generated by transposition trees under the PMC and MM* model, Int. J. Comput. Math. 94(3) (2017), pp. 620–631. doi: 10.1080/00207160.2015.1119817
  • S. Wang and W. Han, The g-good-neighbor conditional diagnosability of n-dimensional hypercubes under the MM* model, Inf. Process. Lett. 116(9) (2016), pp. 574–577. doi: 10.1016/j.ipl.2016.04.005
  • S. Wang and Y. Yang, The 2-good-neighbor diagnosability of alternating group graph networks under the PMC model and MM* model, Appl. Math. Comput. 305 (2017), pp. 241–250.
  • Y. Wei and M. Xu, The g-good-neighbor conditional diagnosability of locally twisted cubes, J. Oper. Res. Soc. China 6 (2017). Available at http://doi.org/10.1007/s40305-017-0166-2.
  • J.-M. Xu, Combinatorial Theory in Networks, Science Press, Beijing/China, 2013.
  • X. Xu, X. Li, S. Zhou, R.-X. Hao, and M. Gu, The g-good-neighbor diagnosability of -star graphs, Theoret. Comput. Sci. 659 (2017), pp. 53–63. doi: 10.1016/j.tcs.2016.11.007
  • X. Xu, S. Zhou, and J. Li, Reliability of complete cubic networks under the condition of g-good-neighbor, Comput. J. 60(5) (2017), pp. 625–635.
  • J. Yuan, A. Liu, X. Ma, X. Liu, X. Qin, and J. Zhang, The g-good-neighbor conditional diagnosability of k-ary n-cubes under the PMC model and MM* model, IEEE Trans. Parallel Distrib. Syst. 26(4) (2015), pp. 1165–1177. doi: 10.1109/TPDS.2014.2318305
  • S. Zhou, S. Song, X. Yang, and L. Chen, On conditional fault tolerance and diagnosability of hierarchical cubic networks, Theoret. Comput. Sci. 609 (2016), pp. 421–433. doi: 10.1016/j.tcs.2015.10.030

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.