Xuanli Liu, Weibei Fan, Jing He, Zhijie Han, Chi-Hung Chi
{"title":"Reliability Assessment of Multiprocessor System Based on Exchanged Crossed Cube Networks","authors":"Xuanli Liu, Weibei Fan, Jing He, Zhijie Han, Chi-Hung Chi","doi":"10.1002/cpe.8325","DOIUrl":null,"url":null,"abstract":"<div>\n \n <p>With the increasingly widespread application of multiprocessor systems, some processors in multiprocessor systems are inevitably prone to malfunctions. The reliability and effectiveness of the system are key issues. As a standard for measuring system fault tolerance, connectivity, and edge connectivity have many drawbacks. Therefore, Haray proposed conditional connectivity by restricting the connected components in disconnected subgraphs <span></span><math>\n <semantics>\n <mrow>\n <mi>G</mi>\n <mo>−</mo>\n <mi>F</mi>\n </mrow>\n <annotation>$$ G-F $$</annotation>\n </semantics></math> to satisfy certain properties, where <span></span><math>\n <semantics>\n <mrow>\n <mi>G</mi>\n </mrow>\n <annotation>$$ G $$</annotation>\n </semantics></math> and <span></span><math>\n <semantics>\n <mrow>\n <mi>F</mi>\n </mrow>\n <annotation>$$ F $$</annotation>\n </semantics></math> represent the interconnection network and its set of faulty vertices, respectively. Restricted connectivity is a special type of conditional connectivity. Exchanged crossed cube, as a deformation of hypercube, has more favorable properties, such as smaller diameter, smaller link size, and lower cost. We prove that the 2-restricted connectivity of the exchanged crossed cubes <span></span><math>\n <semantics>\n <mrow>\n <mtext>ECQ</mtext>\n <mo>(</mo>\n <mi>s</mi>\n <mo>,</mo>\n <mi>t</mi>\n <mo>)</mo>\n </mrow>\n <annotation>$$ \\mathrm{ECQ}\\left(s,t\\right) $$</annotation>\n </semantics></math> is <span></span><math>\n <semantics>\n <mrow>\n <mn>4</mn>\n <mi>s</mi>\n <mo>−</mo>\n <mn>4</mn>\n </mrow>\n <annotation>$$ 4s-4 $$</annotation>\n </semantics></math> for <span></span><math>\n <semantics>\n <mrow>\n <mn>2</mn>\n <mo>≤</mo>\n <mi>s</mi>\n <mo>≤</mo>\n <mi>t</mi>\n </mrow>\n <annotation>$$ 2\\le s\\le t $$</annotation>\n </semantics></math>.</p>\n </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"37 2","pages":""},"PeriodicalIF":1.5000,"publicationDate":"2024-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Concurrency and Computation-Practice & Experience","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/cpe.8325","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0
Abstract
With the increasingly widespread application of multiprocessor systems, some processors in multiprocessor systems are inevitably prone to malfunctions. The reliability and effectiveness of the system are key issues. As a standard for measuring system fault tolerance, connectivity, and edge connectivity have many drawbacks. Therefore, Haray proposed conditional connectivity by restricting the connected components in disconnected subgraphs to satisfy certain properties, where and represent the interconnection network and its set of faulty vertices, respectively. Restricted connectivity is a special type of conditional connectivity. Exchanged crossed cube, as a deformation of hypercube, has more favorable properties, such as smaller diameter, smaller link size, and lower cost. We prove that the 2-restricted connectivity of the exchanged crossed cubes is for .
期刊介绍:
Concurrency and Computation: Practice and Experience (CCPE) publishes high-quality, original research papers, and authoritative research review papers, in the overlapping fields of:
Parallel and distributed computing;
High-performance computing;
Computational and data science;
Artificial intelligence and machine learning;
Big data applications, algorithms, and systems;
Network science;
Ontologies and semantics;
Security and privacy;
Cloud/edge/fog computing;
Green computing; and
Quantum computing.