Reliability Assessment of Multiprocessor System Based on Exchanged Crossed Cube Networks
- 26 November 2024
- journal article
- research article
- Published by Wiley in Concurrency and Computation: Practice and Experience
- Vol. 37 (2)
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 .Keywords
Funding Information
- Science Fund for Distinguished Young Scholars of Fujian Province (62125203)
- National Natural Science Foundation of China (61932013, 62102195, 62102196, 62372248)
This publication has 32 references indexed in Scilit:
- Subgraph fault tolerance of distance optimally edge connected hypercubes and folded hypercubesJournal of Parallel and Distributed Computing, 2020
- -restricted connectivity of locally twisted cubesDiscrete Applied Mathematics, 2017
- The super connectivity of exchanged crossed cubeInformation Processing Letters, 2016
- The connectivity of exchanged crossed cubeInformation Processing Letters, 2015
- 3-extra connectivity of 3-ary n-cube networksInformation Processing Letters, 2014
- -Extraconnectivities of hypercube-like networksJournal of Computer and System Sciences, 2013
- A kind of conditional vertex connectivity of star graphsApplied Mathematics Letters, 2009
- On the extraconnectivity of graphsDiscrete Mathematics, 1996
- On computing a conditional edge-connectivity of a graphInformation Processing Letters, 1988
- Conditional connectivityNetworks, 1983