Name
Abstract | ||
|---|---|---|
The probability of failing processors in the multiprocessor system increases as the cardinality of system grows. The subsystem reliability in a system, defined as the probability that a subsystem of a specified cardinality is operational with the emergence of failed nodes. In this paper, we derive an approximation and an upper bound on the probability of a subgraph Dn−1 being fault-free under the probabilistic fault model. Numerical simulations indicate that these two analytical results we get are in good consistency, especially when the node reliability is at a low level. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1016/j.tcs.2020.02.028 | Theoretical Computer Science |
Keywords | DocType | Volume |
Dual cube,Subsystem reliability,Principle of inclusion-exclusion,Probabilistic fault model | Journal | 816 |
Issue | ISSN | Citations |
C | 0304-3975 | 2 |
PageRank | References | Authors |
0.35 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Qifan Zhang | 1 | 6 | 4.13 |
| Liqiong Xu | 2 | 16 | 11.04 |
| Shuming Zhou | 3 | 36 | 14.36 |
| Weihua Yang | 4 | 11 | 3.88 |