2-satisfiability and diagnosing fault processors in massively parallel computing systems

DOI10.1016/0166-218X(94)00041-BzbMath0836.68033MaRDI QIDQ1894350

Brigitte Servatius, Weigeng Shi, Ansuman Bagchi

Publication date: 6 September 1995

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

faulty processorsfault diagram

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (1)

2-cnfs and logical embeddings

Cites Work

• Uniquely solvable quadratic Boolean equations
• A switching algorithm for the solution of quadratic Boolean equations
• A linear-time algorithm for testing the truth of certain quantified Boolean formulas
• Schemes for fault-tolerant computing: A comparison of modularly redundant and t-diagnosable systems
• Optimization of Reduced Dependencies for Synchronous Sequential Machines

This page was built for publication: 2-satisfiability and diagnosing fault processors in massively parallel computing systems