Changzhen Li

Prof. Changzhen Li


Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
5 November 2021 in The Journal of Supercomputing
Verified
Journal Article
Closed access
PDF file
YXYuhao Xie
Yuhao Xie
JLJiarong Liang
Jiarong Liang
WYWen Yin
Wen Yin
CLChangzhen Li
Changzhen Li

29 June 2021 in IEEE Access
Verified
Journal Article
Open access
JLJiarong Liang
Jiarong Liang
QZQian Zhang
Qian Zhang
CLChangzhen Li
Changzhen Li
Fault diagnosis for a multiprocessor system is a process of identifying the faulty nodes in the system and is an important issue on the reliability of the system. As to the problem that there are few effective algorithms to diagnose faulty nodes in a given star network system in the literature, this paper proposes a precise fault diagnosis algorithm to identify faulty nodes in a star network system with a given syndrome under the comparison model. Such an algorithm contains three main parts. In the first part, we present an algorithm called Partition-Cycle for partitioning a cycle into sequences based on a given syndrome of the cycle. In the second part, we introduce an algorithm called Digout to diagnose these cycle sequences obtained the first part, which can diagnose each node in the cycle to be faulty or fault-free or unknown. In the third part, we design a diagnosis algorithm called Star-Digout to diagnose faulty nodes in an $n$ -dimensional ( $n\geqslant 6$ ) star networks, which is proved to contain a cycle that contains all nodes in the network and is not the same two nodes. Our theoretical analysis shows the time complexity of the diagnosis algorithm is $O(n!)$ . Our simulation results show that our algorithm is a precise diagnosis algorithm for a star network system.

4 April 2024 in Sensors
Verified
Journal Article
Open access
PDF file
JLJiarong Liang
Jiarong Liang
MXMengdie Xiao
Mengdie Xiao
ZLZhi Lin
Zhi Lin
CLChangzhen Li
Changzhen Li
As multiprocessor systems continue to grow in processor scale, the incidence of faults also increases. As a result, fault diagnosis is becoming a key mechanism for maintaining the normal operation of multiprocessor systems. To explore more effective diagnostic methods, Somani et al. introduced a generalized pessimistic diagnostic strategy, named t/k-diagnosis, in which all faulty nodes are isolated in a set of nodes and at most k fault-free nodes are misdiagnosed, provided that the quantity of faults is limited by t. By imposing certain conditions or restrictions, the t/k-diagnosability of some regular networks under the Preparata, Metze, and Chien (PMC) model has been determined. However, the t/k-diagnosability of many networks under the comparison model remains unidentified. In this paper, we provide new insights into the study of t/k-diagnosability under the comparison model. After introducing some new notions, such as the 0-test unit, 0-test set and 0-test subgraph, under the comparison model, we study the relationship in a system G between the 0-test subgraphs and the components of G−F, where F is the set of faulty nodes, and we obtain some important correlation properties. Based on these results, we study t/k-diagnosability under the comparison model. As a result, the t/k-diagnosability of some regular interconnection networks can be efficiently determined.

24 June 2020 in Complexity
Verified
Journal Article
Open access
PDF file
JLJiarong Liang
Jiarong Liang
QZQian Zhang
Qian Zhang
CLChangzhen Li
Changzhen Li
In a multiprocessor system, as a key measure index for evaluating its reliability, diagnosability has attracted lots of attentions. Traditional diagnosability and conditional diagnosability have already been widely discussed. However, the existing diagnosability measures are not sufficiently comprehensive to address a large number of faulty nodes in a system. This article introduces a novel concept of diagnosability, called two-round diagnosability, which means that all faulty nodes can be identified by at most a one-round replacement (repairing the faulty nodes). The characterization of two-round t-diagnosable systems is provided; moreover, several important properties are also presented. Based on the abovementioned theories, for the n-dimensional hypercube Qn, we show that its two-round diagnosability is n2+n/2, which is n+1/2 times its classic diagnosability. Furthermore, a fault diagnosis algorithm is proposed to identify each node in the system under the PMC model. For Qn, we prove that the proposed algorithm is the time complexity of On2n.

2 December 2021 in The Journal of Supercomputing
Verified
Journal Article
Closed access
PDF file
YXYuhao Xie
Yuhao Xie
JLJiarong Liang
Jiarong Liang
WYWen Yin
Wen Yin
CLChangzhen Li
Changzhen Li