Name
Abstract | ||
|---|---|---|
The probability that a multiprocessor computer system has faults arises as the cardinality of the system grows. The subsystem reliability in a system, defined as the probability that there exists a fault-free subsystem of a specified cardinality when the system has faults. In this paper, we derive an upper bound and a lower bound on the probability of a (n - 1)-dimensional subgraph being fault-free in a n-dimensional balanced hypercube under the probabilistic fault model. Numerical simulations indicate that these two analytical results we get are in good consistency, especially when the value of node reliability goes low. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1109/ACCESS.2020.2971274 | IEEE ACCESS |
Keywords | DocType | Volume |
Balanced hypercube, principle of inclusion-exclusion, probabilistic fault model, subsystem reliability | Journal | 8 |
ISSN | Citations | PageRank |
2169-3536 | 2 | 0.37 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Qifan Zhang | 1 | 6 | 4.13 |
| Liqiong Xu | 2 | 16 | 11.04 |
| Shuming Zhou | 3 | 2 | 0.37 |
| Litao Guo | 4 | 2 | 0.71 |