Non-inclusive diagnosability of folded hypercube-like networks

IF 1 3区 数学 Q3 MATHEMATICS, APPLIED Discrete Applied Mathematics Pub Date : 2025-03-31 Epub Date: 2025-01-14 DOI:10.1016/j.dam.2025.01.006
Nengjin Zhuo , Shumin Zhang , Jou-Ming Chang , Chengfu Ye
{"title":"Non-inclusive diagnosability of folded hypercube-like networks","authors":"Nengjin Zhuo ,&nbsp;Shumin Zhang ,&nbsp;Jou-Ming Chang ,&nbsp;Chengfu Ye","doi":"10.1016/j.dam.2025.01.006","DOIUrl":null,"url":null,"abstract":"<div><div>Processor fault diagnosis is of great significance in fault-tolerant computing of multiprocessor systems. Since interconnection networks are the underlying topology of many multiprocessor systems, the fault tolerance of interconnection networks will directly affect the stability of multiprocessor systems. Non-inclusive diagnosability is a new parameter for fault tolerance evaluation of interconnection networks. In 2023, Guo and Ekinci proposed a new type of network topology called folded hypercube-like networks ( <span><math><mrow><mi>F</mi><msub><mrow><mi>H</mi></mrow><mrow><mi>n</mi></mrow></msub></mrow></math></span>). This article studies and analyzes the structure of <span><math><mrow><mi>F</mi><msub><mrow><mi>H</mi></mrow><mrow><mi>n</mi></mrow></msub></mrow></math></span> and finds that the family of <span><math><mrow><mi>F</mi><msub><mrow><mi>H</mi></mrow><mrow><mi>n</mi></mrow></msub></mrow></math></span> has a more diverse structure than the hypercube-like networks. Besides, we divide <span><math><mrow><mi>F</mi><msub><mrow><mi>H</mi></mrow><mrow><mi>n</mi></mrow></msub></mrow></math></span> into three categories and solve the non-inclusive diagnosability of <span><math><mrow><mi>F</mi><msub><mrow><mi>H</mi></mrow><mrow><mi>n</mi></mrow></msub></mrow></math></span>, which are <span><math><mrow><mn>2</mn><mi>n</mi></mrow></math></span>, <span><math><mrow><mn>2</mn><mi>n</mi><mo>−</mo><mn>1</mn></mrow></math></span> and <span><math><mrow><mn>2</mn><mi>n</mi><mo>−</mo><mn>2</mn></mrow></math></span>, respectively.</div></div>","PeriodicalId":50573,"journal":{"name":"Discrete Applied Mathematics","volume":"364 ","pages":"Pages 237-246"},"PeriodicalIF":1.0000,"publicationDate":"2025-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Applied Mathematics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0166218X25000071","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/1/14 0:00:00","PubModel":"Epub","JCR":"Q3","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

Abstract

Processor fault diagnosis is of great significance in fault-tolerant computing of multiprocessor systems. Since interconnection networks are the underlying topology of many multiprocessor systems, the fault tolerance of interconnection networks will directly affect the stability of multiprocessor systems. Non-inclusive diagnosability is a new parameter for fault tolerance evaluation of interconnection networks. In 2023, Guo and Ekinci proposed a new type of network topology called folded hypercube-like networks ( FHn). This article studies and analyzes the structure of FHn and finds that the family of FHn has a more diverse structure than the hypercube-like networks. Besides, we divide FHn into three categories and solve the non-inclusive diagnosability of FHn, which are 2n, 2n1 and 2n2, respectively.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
折叠超立方体网络的非包容性可诊断性
处理器故障诊断在多处理器系统的容错计算中具有重要意义。由于互连网络是许多多处理机系统的底层拓扑结构,因此互连网络的容错性将直接影响到多处理机系统的稳定性。非包容性可诊断性是评价互连网络容错性的一个新参数。2023年,Guo和Ekinci提出了一种新的网络拓扑,称为折叠超立方体网络(FHn)。本文对FHn的结构进行了研究和分析,发现FHn家族比超立方体网络具有更多样化的结构。此外,我们将FHn分为三类,并解决了FHn的非包容性可诊断性,分别为2n、2n−1和2n−2。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Discrete Applied Mathematics
Discrete Applied Mathematics 数学-应用数学
CiteScore
2.30
自引率
9.10%
发文量
422
审稿时长
4.5 months
期刊介绍: The aim of Discrete Applied Mathematics is to bring together research papers in different areas of algorithmic and applicable discrete mathematics as well as applications of combinatorial mathematics to informatics and various areas of science and technology. Contributions presented to the journal can be research papers, short notes, surveys, and possibly research problems. The "Communications" section will be devoted to the fastest possible publication of recent research results that are checked and recommended for publication by a member of the Editorial Board. The journal will also publish a limited number of book announcements as well as proceedings of conferences. These proceedings will be fully refereed and adhere to the normal standards of the journal. Potential authors are advised to view the journal and the open calls-for-papers of special issues before submitting their manuscripts. Only high-quality, original work that is within the scope of the journal or the targeted special issue will be considered.
期刊最新文献
Order and chain polytopes of maximal ranked posets A note on distance-hereditary graphs whose complement is also distance-hereditary The 3-restricted edge-connectivity of the direct product graphs A polyhedral study of a relaxation of the routing and spectrum allocation problem On sufficient degree conditions for a graph to be disjoint path coverable
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1