测试诊断模型下正则网络混合可诊断性的持久性

IF 1.5 4区 计算机科学 Q4 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE
Guanqin Lian;Shuming Zhou;Eddie Cheng;Jiafei Liu;Gaolin Chen
{"title":"测试诊断模型下正则网络混合可诊断性的持久性","authors":"Guanqin Lian;Shuming Zhou;Eddie Cheng;Jiafei Liu;Gaolin Chen","doi":"10.1093/comjnl/bxaa065","DOIUrl":null,"url":null,"abstract":"Diagnosability is an important metric to fault tolerance and reliability for multiprocessor systems. However, plenty of research on fault diagnosability focuses on node failure. In practical scenario, not only node failures take place but also link malfunctions may arise. In this work, we investigate the diagnosability of general regular networks with failing nodes as well as missing malfunctional links. Let \n<tex>$S$</tex>\n be a set of the missing links and broken-down nodes. We first prove that the diagnosability of the survival graph \n<tex>$G\\setminus S$</tex>\n persists \n<tex>$\\delta (G\\setminus S)$</tex>\n under the PMC model (Preparata, F.P., Metze, G. and Chien, R.T. (1967) On the connection assignment problem of diagnosable systems. IEEE Trans. Electron. Comput., EC-16, 848–854) for a \n<tex>$t$</tex>\n-regular and \n<tex>$t$</tex>\n-connected triangle-free network \n<tex>$G$</tex>\n subject to \n<tex>$|S|\\leq t-1$</tex>\n and \n<tex>$|V(G)|\\geq 3t-2$</tex>\n (\n<tex>$t\\geq 3$</tex>\n). Furthermore, we determine the diagnosability of \n<tex>$G\\setminus S$</tex>\n for some kinds of extensively explored \n<tex>$t$</tex>\n-regular networks with triangles subject to \n<tex>$|S|\\leq t-1$</tex>\n (\n<tex>$t\\geq 3$</tex>\n).","PeriodicalId":50641,"journal":{"name":"Computer Journal","volume":null,"pages":null},"PeriodicalIF":1.5000,"publicationDate":"2020-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1093/comjnl/bxaa065","citationCount":"1","resultStr":"{\"title\":\"Persistence of Hybrid Diagnosability of Regular Networks Under Testing Diagnostic Model\",\"authors\":\"Guanqin Lian;Shuming Zhou;Eddie Cheng;Jiafei Liu;Gaolin Chen\",\"doi\":\"10.1093/comjnl/bxaa065\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Diagnosability is an important metric to fault tolerance and reliability for multiprocessor systems. However, plenty of research on fault diagnosability focuses on node failure. In practical scenario, not only node failures take place but also link malfunctions may arise. In this work, we investigate the diagnosability of general regular networks with failing nodes as well as missing malfunctional links. Let \\n<tex>$S$</tex>\\n be a set of the missing links and broken-down nodes. We first prove that the diagnosability of the survival graph \\n<tex>$G\\\\setminus S$</tex>\\n persists \\n<tex>$\\\\delta (G\\\\setminus S)$</tex>\\n under the PMC model (Preparata, F.P., Metze, G. and Chien, R.T. (1967) On the connection assignment problem of diagnosable systems. IEEE Trans. Electron. Comput., EC-16, 848–854) for a \\n<tex>$t$</tex>\\n-regular and \\n<tex>$t$</tex>\\n-connected triangle-free network \\n<tex>$G$</tex>\\n subject to \\n<tex>$|S|\\\\leq t-1$</tex>\\n and \\n<tex>$|V(G)|\\\\geq 3t-2$</tex>\\n (\\n<tex>$t\\\\geq 3$</tex>\\n). Furthermore, we determine the diagnosability of \\n<tex>$G\\\\setminus S$</tex>\\n for some kinds of extensively explored \\n<tex>$t$</tex>\\n-regular networks with triangles subject to \\n<tex>$|S|\\\\leq t-1$</tex>\\n (\\n<tex>$t\\\\geq 3$</tex>\\n).\",\"PeriodicalId\":50641,\"journal\":{\"name\":\"Computer Journal\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.5000,\"publicationDate\":\"2020-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1093/comjnl/bxaa065\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computer Journal\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/9579110/\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Journal","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/9579110/","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 1

摘要

可诊断性是衡量多处理器系统容错性和可靠性的重要指标。然而,大量关于故障诊断的研究主要集中在节点故障上。在实际场景中,不仅会出现节点故障,还可能出现链路故障。在这项工作中,我们研究了具有故障节点和缺失故障链路的一般规则网络的可诊断性。让$S$作为一组缺失的链接和被破坏的节点。我们首先证明了PMC模型下生存图$G\setminus S$的可诊断性持续$\delta (G\setminus S)$ (Preparata, f.p., Metze, G. and Chien, R.T.(1967)关于可诊断系统的连接分配问题。IEEE译。电子。计算。, EC-16, 848-854),以获取$t$ -规则和$t$连接的无三角网络$G$,但以$|S|\leq t-1$和$|V(G)|\geq 3t-2$ ($t\geq 3$)为准。此外,我们确定了$G\setminus S$对一些广泛探索的具有三角形服从$|S|\leq t-1$ ($t\geq 3$)的$t$ -正则网络的可诊断性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Persistence of Hybrid Diagnosability of Regular Networks Under Testing Diagnostic Model
Diagnosability is an important metric to fault tolerance and reliability for multiprocessor systems. However, plenty of research on fault diagnosability focuses on node failure. In practical scenario, not only node failures take place but also link malfunctions may arise. In this work, we investigate the diagnosability of general regular networks with failing nodes as well as missing malfunctional links. Let $S$ be a set of the missing links and broken-down nodes. We first prove that the diagnosability of the survival graph $G\setminus S$ persists $\delta (G\setminus S)$ under the PMC model (Preparata, F.P., Metze, G. and Chien, R.T. (1967) On the connection assignment problem of diagnosable systems. IEEE Trans. Electron. Comput., EC-16, 848–854) for a $t$ -regular and $t$ -connected triangle-free network $G$ subject to $|S|\leq t-1$ and $|V(G)|\geq 3t-2$ ( $t\geq 3$ ). Furthermore, we determine the diagnosability of $G\setminus S$ for some kinds of extensively explored $t$ -regular networks with triangles subject to $|S|\leq t-1$ ( $t\geq 3$ ).
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Computer Journal
Computer Journal 工程技术-计算机:软件工程
CiteScore
3.60
自引率
7.10%
发文量
164
审稿时长
4.8 months
期刊介绍: The Computer Journal is one of the longest-established journals serving all branches of the academic computer science community. It is currently published in four sections.
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信