Fast diagnosis of multiprocessor systems with random faults

DOI10.1051/ITA/1993270503911MaRDI QIDQ4288202zbMATH OpenOpenAlexFDO

Authors Krzysztof Diks, Andrzej Pelc

Publication date 2 January 1995

Published in RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/92458

zbMATH Keywords

reliabilitytestingdiagnosismultiprocessor systemfault-free processors

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15)

Recommendations

• System diagnosis with smallest risk of error
• Reliable Fault Diagnosis with Few Tests
• Reliable distributed diagnosis for multiprocessor systems with random faults
• Fast Adaptive Diagnosis with a Minimum Number of Tests

Cites work

• A guided tour of Chernoff bounds
• Almost Sure Fault Tolerance in Random Graphs
• Fast probabilistic algorithms for Hamiltonian circuits and matchings
• On Models for Diagnosable Systems and Probabilistic Fault Diagnosis
• Optimization of Reduced Dependencies for Synchronous Sequential Machines

Cited in

(9)

• Reliable distributed diagnosis for multiprocessor systems with random faults
• scientific article; zbMATH DE number 1138358 (Why is no real title available?)
• A Quick Pessimistic Diagnosis Algorithm for Hypercube-Like Multiprocessor Systems under the PMC Model
• Fast deterministic simulation of computations on faulty parallel machines
• scientific article; zbMATH DE number 2080981 (Why is no real title available?)
• Almost Sure Fault Tolerance in Random Graphs
• 2-satisfiability and diagnosing fault processors in massively parallel computing systems
• Token transfer in a faulty network
• System diagnosis with smallest risk of error

This page was built for publication: Fast diagnosis of multiprocessor systems with random faults

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4288202)