Non-inclusive g-extra diagnosability of interconnection networks under PMC model

IF 0.9 4区 计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS Theoretical Computer Science Pub Date : 2024-09-25 DOI:10.1016/j.tcs.2024.114887
{"title":"Non-inclusive g-extra diagnosability of interconnection networks under PMC model","authors":"","doi":"10.1016/j.tcs.2024.114887","DOIUrl":null,"url":null,"abstract":"<div><div>System level fault diagnosis theory is of great weight in the design and maintenance of multiprocessor systems. In this paper, we propose a novel kind of diagnosability, called non-inclusive <em>g</em>-extra diagnosability, that requires all faulty sets to be non-inclusive and every connected fault-free subgraph has at least <span><math><mi>g</mi><mo>+</mo><mn>1</mn></math></span> vertices. Furthermore, we determine the non-inclusive <em>g</em>-extra diagnosability of a class of graphs under PMC model. As applications, the non-inclusive <em>g</em>-extra diagnosability of <span><math><mo>(</mo><mi>n</mi><mo>,</mo><mi>k</mi><mo>)</mo></math></span>-star graph <span><math><msub><mrow><mi>S</mi></mrow><mrow><mi>n</mi><mo>,</mo><mi>k</mi></mrow></msub></math></span>, data center networks DCell (<span><math><msub><mrow><mi>D</mi></mrow><mrow><mi>k</mi><mo>,</mo><mi>n</mi></mrow></msub></math></span>), BCDC (<span><math><msub><mrow><mi>B</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span>) and BCube (<span><math><mi>B</mi><msub><mrow><mi>C</mi></mrow><mrow><mi>n</mi><mo>,</mo><mi>k</mi></mrow></msub></math></span>) under PMC model are determined successively.</div></div>","PeriodicalId":49438,"journal":{"name":"Theoretical Computer Science","volume":null,"pages":null},"PeriodicalIF":0.9000,"publicationDate":"2024-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Theoretical Computer Science","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0304397524005048","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

Abstract

System level fault diagnosis theory is of great weight in the design and maintenance of multiprocessor systems. In this paper, we propose a novel kind of diagnosability, called non-inclusive g-extra diagnosability, that requires all faulty sets to be non-inclusive and every connected fault-free subgraph has at least g+1 vertices. Furthermore, we determine the non-inclusive g-extra diagnosability of a class of graphs under PMC model. As applications, the non-inclusive g-extra diagnosability of (n,k)-star graph Sn,k, data center networks DCell (Dk,n), BCDC (Bn) and BCube (BCn,k) under PMC model are determined successively.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
PMC 模型下互联网络的非包容性 g-extra 可诊断性
系统级故障诊断理论在多处理器系统的设计和维护中具有举足轻重的地位。在本文中,我们提出了一种新的可诊断性,称为非包容 g 外可诊断性,它要求所有故障集都是非包容的,并且每个无故障连接子图都至少有 g+1 个顶点。此外,我们还确定了一类图在 PMC 模型下的非包容 g 外诊断性。作为应用,我们先后确定了 (n,k) 星图 Sn,k、数据中心网络 DCell (Dk,n)、BCDC (Bn) 和 BCube (BCn,k) 在 PMC 模型下的非包容性 g 外诊断性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Theoretical Computer Science
Theoretical Computer Science 工程技术-计算机:理论方法
CiteScore
2.60
自引率
18.20%
发文量
471
审稿时长
12.6 months
期刊介绍: Theoretical Computer Science is mathematical and abstract in spirit, but it derives its motivation from practical and everyday computation. Its aim is to understand the nature of computation and, as a consequence of this understanding, provide more efficient methodologies. All papers introducing or studying mathematical, logic and formal concepts and methods are welcome, provided that their motivation is clearly drawn from the field of computing.
期刊最新文献
Editorial Board Finding and counting small tournaments in large tournaments Truthful two-facility location with candidate locations Path partitions of phylogenetic networks On the existence of funneled orientations for classes of rooted phylogenetic networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1