A test round controllable local diagnosis algorithm under the PMC diagnosis model

An efficient diagnosis is very important for a multiprocessor system. The ability of identifying all the faulty devices in a multiprocessor system is known as diagnosability. The PMC model is the tested-based diagnosis with a processor performing the diagnosis by testing on the neighboring processors via the links between them. Recently, some researches such as the conditional diagnosability and the local diagnosability, are concerned with the measure which is able to better reflect fault patterns in real systems. In this paper, we propose a specific structure for local diagnosis. Under the PMC model, we design a test round controllable local diagnosis algorithm for a t∗-diagnosable network. For some conditional constraint, we give a conditional local diagnosis algorithm for a (2t-1)∗-diagnosable network. With our algorithm, a diagnosis is completed in k test rounds.