增强比较模型下多处理机系统的可诊断性

IF 1 4区 计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS
Shiying Wang, Wei Feng
{"title":"增强比较模型下多处理机系统的可诊断性","authors":"Shiying Wang,&nbsp;Wei Feng","doi":"10.1016/j.tcs.2025.115534","DOIUrl":null,"url":null,"abstract":"<div><div>Diagnosability of a multiprocessor system <span><math><mi>G</mi></math></span> is a fundamental topic. The <span><math><mi>g</mi></math></span>-extra diagnosability of <span><math><mi>G</mi></math></span> requires that every fault-free component in <span><math><mrow><mi>G</mi><mo>−</mo><mi>F</mi></mrow></math></span> has at least <span><math><mrow><mi>g</mi><mo>+</mo><mn>1</mn></mrow></math></span> vertices, while the <span><math><mi>g</mi></math></span>-good-neighbor diagnosability requires that every fault-free vertex has at least <span><math><mi>g</mi></math></span> fault-free neighbors. In this paper, we first propose a new model, the <em>enhanced comparison</em> (EC) model on <span><math><mi>G</mi></math></span>, and establish the relationship between the <span><math><mi>g</mi></math></span>-extra diagnosability and the <span><math><mi>g</mi></math></span>-good-neighbor diagnosability of <span><math><mi>G</mi></math></span>. Second, we present and prove necessary and sufficient conditions for the <span><math><mi>g</mi></math></span>-extra diagnosability of <span><math><mi>G</mi></math></span>, and determine the <span><math><mi>g</mi></math></span>-extra diagnosability of the hyper Petersen network. Finally, we present and prove necessary and sufficient conditions for the <span><math><mi>g</mi></math></span>-good-neighbor diagnosability of <span><math><mi>G</mi></math></span>, and determine the <span><math><mi>g</mi></math></span>-good-neighbor diagnosability of the star graph.</div></div>","PeriodicalId":49438,"journal":{"name":"Theoretical Computer Science","volume":"1057 ","pages":"Article 115534"},"PeriodicalIF":1.0000,"publicationDate":"2025-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The diagnosability of multiprocessor systems under the enhanced comparison model\",\"authors\":\"Shiying Wang,&nbsp;Wei Feng\",\"doi\":\"10.1016/j.tcs.2025.115534\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Diagnosability of a multiprocessor system <span><math><mi>G</mi></math></span> is a fundamental topic. The <span><math><mi>g</mi></math></span>-extra diagnosability of <span><math><mi>G</mi></math></span> requires that every fault-free component in <span><math><mrow><mi>G</mi><mo>−</mo><mi>F</mi></mrow></math></span> has at least <span><math><mrow><mi>g</mi><mo>+</mo><mn>1</mn></mrow></math></span> vertices, while the <span><math><mi>g</mi></math></span>-good-neighbor diagnosability requires that every fault-free vertex has at least <span><math><mi>g</mi></math></span> fault-free neighbors. In this paper, we first propose a new model, the <em>enhanced comparison</em> (EC) model on <span><math><mi>G</mi></math></span>, and establish the relationship between the <span><math><mi>g</mi></math></span>-extra diagnosability and the <span><math><mi>g</mi></math></span>-good-neighbor diagnosability of <span><math><mi>G</mi></math></span>. Second, we present and prove necessary and sufficient conditions for the <span><math><mi>g</mi></math></span>-extra diagnosability of <span><math><mi>G</mi></math></span>, and determine the <span><math><mi>g</mi></math></span>-extra diagnosability of the hyper Petersen network. Finally, we present and prove necessary and sufficient conditions for the <span><math><mi>g</mi></math></span>-good-neighbor diagnosability of <span><math><mi>G</mi></math></span>, and determine the <span><math><mi>g</mi></math></span>-good-neighbor diagnosability of the star graph.</div></div>\",\"PeriodicalId\":49438,\"journal\":{\"name\":\"Theoretical Computer Science\",\"volume\":\"1057 \",\"pages\":\"Article 115534\"},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2025-09-21\",\"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/S0304397525004724\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Theoretical Computer Science","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0304397525004724","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

摘要

多处理器系统的可诊断性是一个基本问题。G的G额外可诊断性要求G−F中每个无故障分量至少有G +1个顶点,而G近邻可诊断性要求每个无故障顶点至少有G个无故障邻居。本文首先在G上提出了一个新的模型——增强比较(EC)模型,建立了G的G额外可诊断性与G的G近邻可诊断性之间的关系。其次,给出并证明了G的G额外可诊断性的充分必要条件,并确定了超Petersen网络的G额外可诊断性。最后,我们给出并证明了G的G近邻可诊断性的充分必要条件,并确定了星图的G近邻可诊断性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
The diagnosability of multiprocessor systems under the enhanced comparison model
Diagnosability of a multiprocessor system G is a fundamental topic. The g-extra diagnosability of G requires that every fault-free component in GF has at least g+1 vertices, while the g-good-neighbor diagnosability requires that every fault-free vertex has at least g fault-free neighbors. In this paper, we first propose a new model, the enhanced comparison (EC) model on G, and establish the relationship between the g-extra diagnosability and the g-good-neighbor diagnosability of G. Second, we present and prove necessary and sufficient conditions for the g-extra diagnosability of G, and determine the g-extra diagnosability of the hyper Petersen network. Finally, we present and prove necessary and sufficient conditions for the g-good-neighbor diagnosability of G, and determine the g-good-neighbor diagnosability of the star graph.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
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.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信