2-SATISFIABILITY AND DIAGNOSING FAULTY PROCESSORS IN MASSIVELY-PARALLEL COMPUTING SYSTEMS

Citation
A. Bagchi et al., 2-SATISFIABILITY AND DIAGNOSING FAULTY PROCESSORS IN MASSIVELY-PARALLEL COMPUTING SYSTEMS, Discrete applied mathematics, 60(1-3), 1995, pp. 25-37
Citations number
12
Categorie Soggetti
Mathematics,Mathematics
Volume
60
Issue
1-3
Year of publication
1995
Pages
25 - 37
Database
ISI
SICI code
Abstract
A fault diagnosis model for multiprocessor computers is proposed. Unde r normal operating mode each processor executes its own data. When an error occurs, the system is switched to the diagnostic mode. Previous input data for each processor is shifted to a different unit, to obtai n a set of comparison results. We show that analysis of the test data to diagnose or locate faulty processors is equivalent to a 2-satisfiab ility problem. Under the assumption that discrepancy in a comparison r esult occurs if and only if at least one of the processors (being comp ared) is faulty, we prove that all the faulty processors can be diagno sed in O(n(2)) time, where n denotes the number of processors in the s ystem.