Conditional Diagnosability of <formula formulatype="inline"><tex Notation="TeX">$(n,k)$</tex></formula>-Star Networks Under the Comparison Diagnosis Model

Abstract

The -star graph, denoted by , is an enhanced version of -dimensional star graphs , that has better scalability than , and possesses several good properties, compared with hypercubes. Diagnosis has been one of the most important issues for maintaining multiprocessor-system reliability. Conditional diagnosability, which is more general than classical diagnosability, measures the multiprocessor-system diagnosability under the assumption that all neighbors of any processor in the system cannot fail simultaneously. In this paper, we investigate the conditional diagnosability of for ( and ) and ( and ) under the comparison diagnosis model. Index Terms-Comparison diagnosis model, conditional diagnosability, diagnosability,-star graphs, multiprocessor systems. Acronyms and Abbreviations: PMC Preparata, Metze, Chien MM Maeng, Malek MM Maeng, Malek (a special case of the MM model) Notations: a simple graph with the vertex set , and edge set the vertex set of the edge set of the number of elements in the set the set of all vertices adjacent to in the degree of in (i.e., the number of vertices adjacent to in ) the graph obtained by deleting all the vertices in from Manuscript

The 2-good-neighbor connectivity and 2-good-neighbor diagnosability of bubble-sort star graph networks

“…They consider the situation that any fault set cannot contain all the neighbor vertices of any vertex in a system. The restricted diagnosability of the system has received much attention [5,6,20,24,25,38]. In 2012, Peng et al [27] proposed a measure for fault diagnosis of the system, namely, the g-good-neighbor diagnosability (which is also called the ggood-neighbor conditional diagnosability), which requires that every fault-free node has at least g fault-free neighbors.…”

The Extra Connectivity, Extra Conditional Diagnosability, and <inline-formula> <tex-math notation="LaTeX"> $t/m$</tex-math> </inline-formula>-Diagnosability of Arrangement Graphs

“…Since it is impossible that all neighbors of some processor are simultaneously faulty, Zhang and Yang [36] proposed the gextra conditional diagnosability (defined in Section II), which is a generalization of conditional diagnosability [3], [19], [20]. The g-extra conditional diagnosability is defined under the assumption that every component of the system removing a set of faulty vertices has more than g vertices.…”

On g-good-neighbor conditional diagnosability of (n,k)-star networks

“…Then |A| = (n − 4) + 3 = n − 1 and |F 1 | = |F 2 | = n. See Figure 10. We conclude that F 1 and F 2 are indistinguishable 1-good-neighbor conditional faulty sets under the MM * model from the proof of [4]. By Lemma 2.11, we have t 1 (S n,2 ) ≤ n − 1 under the MM * model, where n ≥ 4.…”