Advanced search
Publication Cover
International Journal of Parallel, Emergent and Distributed Systems Volume 35, 2020 - Issue 1: Diagnosability of Interconnection Networks
Submit an article Journal homepage
59
Views
2
CrossRef citations to date
0
Altmetric
Articles

Diagnosability of expanded k-ary n-cubes with missing edges under the comparison model

Zhipeng ZhouSchool of Mathematics and Information Science, Henan Normal University, Xinxiang, People's Republic of ChinaView further author information
,
Shiying WangSchool of Mathematics and Information Science, Henan Normal University, Xinxiang, People's Republic of ChinaCorrespondence[email protected]
[email protected]
View further author information
,
Xiaolei MaSchool of Mathematics and Information Science, Henan Normal University, Xinxiang, People's Republic of ChinaView further author information
&
Yunxia RenSchool of Mathematics and Information Science, Henan Normal University, Xinxiang, People's Republic of ChinaView further author information
Pages 16-28 | Received 26 May 2019, Accepted 22 Jul 2019, Published online: 31 Jul 2019

References

  • Dahbura AT, Masson GM. An O(n2.5) fault identification algorithm for diagnosable systems. IEEE Trans Comput. 1984;33(6):486–492. doi: 10.1109/TC.1984.1676472
  • Fan J. Diagnosability of crossed cubes under the comparison diagnosis model. IEEE Trans Parallel Distrib Syst. 2002;13(10):1099–1104. doi: 10.1109/TPDS.2002.1041887
  • Gu M-M, Hao R-X, Zhou S. Fault diagnosability of data center networks. Theor Comput Sci. 2019;776(12):138–147. doi: 10.1016/j.tcs.2019.01.020
  • Gu M-M, Hao R-X, Feng Y-Q, et al. The 3-extra connectivity and faulty diagnosability. Comput J. 2018;61(5):672–686. doi: 10.1093/comjnl/bxx089
  • Lai PL, Tan JJ-M, Chang CP, et al. Conditional diagnosability measures for large multiprocessor systems. IEEE Trans Comput. 2005;54(2):165–175. doi: 10.1109/TC.2005.19
  • Maeng J, Malek M. A comparison connection assignment for self-diagnosis of multiprocessor systems. Proceeding of 11th international symposium on fault-tolerant computing. Portland, Maine; June, 1981. p. 173–175.
  • Hsu G-H, Tan JJ-M. A local diagnosability measure for multiprocessor systems. IEEE Trans Parallel Distrib Syst. 2007;18:598–607. doi: 10.1109/TPDS.2007.1022
  • Chiang C-F, Tan JJ-M. Using node diagnosability to determine t-diagnosability under the comparison diagnosis model. IEEE Trans Comput. 2009;58:251–259. doi: 10.1109/TC.2008.158
  • Chiang C-F, Hsu G-H, Shih L-M, et al. Diagnosability of star graphs with missing edges. Inf Sci. 2012;188:253–259. doi: 10.1016/j.ins.2011.11.012
  • Cheng E, Liptàk L. Diagnosability of Cayley graphs generated by transposition trees with missing edges. Inf Sci. 2013;238:250–252. doi: 10.1016/j.ins.2013.03.009
  • Cheng E, Liptàk L, Steffy DE. Strong local diagnosability of (n,k)-star graphs and Cayley graphs generated by 2-trees with missing edges. Inf Process Lett. 2013;113(12):452–456. doi: 10.1016/j.ipl.2013.03.002
  • Bondy JA, Murty USR. Graph theory. New York: Springer; 2007.
  • Hungerford W. Algebra. New York: Springer-Verlag; 1974.
  • Yuan J, Liu A, Ma X, et al. The g-good-neighbor conditional diagnosability of k- ary n-cubes under the PMC model and MM* model. IEEE Trans Parallel Distrib Syst. 2015;26:1165–1177. doi: 10.1109/TPDS.2014.2318305
  • Wang M, Lin Y, Wang S. The connectivity and nature diagnosability of expanded k-ary n-cubes. RAIRO-Theor Inform Appl. 2017;51(2):71–89. doi: 10.1051/ita/2017008
  • Wang S, Wang Y. Diagnosability of bubble-sort star graphs with missing edges. J Interconnect Netw. 2019;19(2):1950002. doi: 10.1142/S0219265919500026

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:

Order Reprints Request Corporate Permissions

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:

Request Academic Permissions

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.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.