Browsing by Author "Lai, PL"

Now showing 1 - 4 of 4

Conditional diagnosability measures for large multiprocessor systems
(2005-02-01)
Lai, PL
;
Tan, JJM
;
Chang, CP
;
Hsu, LH
;
資訊工程學系
Diagnosability has played an important role in the reliability of an interconnection network. The classical problem of fault diagnosis is discussed widely and the diagnosability of many well-known networks have been explored. In this paper, we introduce a new measure of diagnosability, called conditional diagnosability, by restricting that any faulty set cannot contain all the neighbors of any vertex in the graph. Based on this requirement, the conditional diagnosability of the n-dimensional hypercube is shown to be 4(n - 2) + 1, which is about four times as large as the classical diagnosability. Besides, we propose some useful conditions for verifying if a system is t-diagnosable and introduce a new concept, called a strongly t-diagnosable system, under the PMC model. Applying these concepts and conditions, we investigate some t-diagnosable networks which are also strongly t-diagnosable.
Diagnosability of t-connected networks and product networks under the comparison diagnosis model
(2004-12-01)
Chang, CP
;
Lai, PL
;
Tan, JJM
;
Hsu, LH
;
資訊工程學系
Diagnosability is an important factor in measuring the reliability of an interconnection network, while the (node) connectivity is used to measure the fault tolerance of an interconnection network. We observe that there is a close relationship between the connectivity and the diagnosability. According to our results, a t-regular and t-connected network with at least 2t + 3 nodes is t-diagnosable. Furthermore, the diagnosability of the product networks is also investigated in this work. The product networks, including hypercube, mesh, and tori, comprise very important classes of interconnection networks. Herein, different combinations of t-diagnosable and t-connected are employed to study the diagnosability of the product networks.
Diagnosability of t-connected networks and product networks under the comparison diagnosis model
(2004-12-01)
Chang, CP
;
Lai, PL
;
Tan, JJM
;
Hsu, LH
;
資訊工程學系
Diagnosability is an important factor in measuring the reliability of an interconnection network, while the (node) connectivity is used to measure the fault tolerance of an interconnection network. We observe that there is a close relationship between the connectivity and the diagnosability. According to our results, a t-regular and t-connected network with at least 2t + 3 nodes is t-diagnosable. Furthermore, the diagnosability of the product networks is also investigated in this work. The product networks, including hypercube, mesh, and tori, comprise very important classes of interconnection networks. Herein, different combinations of t-diagnosable and t-connected are employed to study the diagnosability of the product networks.
The diagnosability of the matching composition network under the comparison diagnosis model
(2004-08-01)
Lai, PL
;
Tan, JJM
;
Tsai, CH
;
Hsu, LH
;
資訊工程學系
The classical problem of diagnosability is discussed widely and the diagnosability of many well-known networks have been explored. In this paper, we consider the diagnosability of a family of networks, called the Matching Composition Network (MCN); two components are connected by a perfect matching. The diagnosability of MCN under the comparison model is shown to be one larger than that of the component, provided some connectivity constraints are satisfied. Applying our result, the diagnosability of the Hypercube Q(n), the Crossed cube CQ(n), the Twisted cube TQ(n), and the Mobius cube MQ(n) can all be proven to be n, for n greater than or equal to 4. In particular, we show that the diagnosability of the four-dimensional Hypercube Q(4) is 4, which is not previously known.