Journal
THEORETICAL COMPUTER SCIENCE
Volume 851, Issue -, Pages 14-23Publisher
ELSEVIER
DOI: 10.1016/j.tcs.2020.09.012
Keywords
Bicube; Connectivity; Diagnosability; Multiprocessor systems; PMC model
Categories
Funding
- National Natural Science Foundation of China [61977016, 61572010]
- Natural Science Foundation of Fujian Province [2017J01738]
Ask authors/readers for more resources
The fault diagnosability of a network is a crucial indicator of its reliability, with the original definition often being too strict. To better measure actual reliability, many variants of diagnosability have been proposed.
A network's fault diagnosability is the maximum number of nodes (or processors) that are allowed to fail, while still being able to be identified by analyzing the syndrome of mutual testing, under the well-known PMC diagnostic model. It is a crucial indicator of the network's reliability. The original definition of diagnosability is often too strict to realistically reflect a network's robustness, because it is limited by the network's minimum degree. To better measure the actual reliability, many variants of diagnosability have been proposed, with g-extra diagnosability being one of the most noticeable diagnostic strategies. In this paper, we determine both the diagnosability and g-extra diagnosability for Bicube BQ(n), a recently proposed variant of the classic hypercube. We first show that the diagnosability for BQn, the n-dimensional Bicube, is n; and then prove that the g-extra diagnosability for B Q(n) is (g+1) n - g - (g/2) (C) 2020 Elsevier B.V. All rights reserved.
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