Journal
IEEE ACCESS
Volume 8, Issue -, Pages 26478-26486Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/ACCESS.2020.2971274
Keywords
Balanced hypercube; principle of inclusion-exclusion; probabilistic fault model; subsystem reliability
Categories
Funding
- Natural Science Foundation of Fujian Province, China [2018J01419, 2019J01857]
- National Natural Science Foundation of China [11301217, 61977016, 11961051]
- New Century Excellent Talents in Fujian Province University [JA14168]
- Xiamen University of Technology [XPDKT19001]
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available