{"title":"PMC 模型下互联网络的非包容性 g-extra 可诊断性","authors":"Weixing Zheng , Shuming Zhou , Eddie Cheng , Qifan Zhang","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":"1022 ","pages":"Article 114887"},"PeriodicalIF":0.9000,"publicationDate":"2024-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Non-inclusive g-extra diagnosability of interconnection networks under PMC model\",\"authors\":\"Weixing Zheng , Shuming Zhou , Eddie Cheng , Qifan Zhang\",\"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\":\"1022 \",\"pages\":\"Article 114887\"},\"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}","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
摘要
系统级故障诊断理论在多处理器系统的设计和维护中具有举足轻重的地位。在本文中,我们提出了一种新的可诊断性,称为非包容 g 外可诊断性,它要求所有故障集都是非包容的,并且每个无故障连接子图都至少有 g+1 个顶点。此外,我们还确定了一类图在 PMC 模型下的非包容 g 外诊断性。作为应用,我们先后确定了 (n,k) 星图 Sn,k、数据中心网络 DCell (Dk,n)、BCDC (Bn) 和 BCube (BCn,k) 在 PMC 模型下的非包容性 g 外诊断性。
Non-inclusive g-extra diagnosability of interconnection networks under PMC model
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 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 -star graph , data center networks DCell (), BCDC () and BCube () under PMC model are determined successively.
期刊介绍:
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.