Cooperative diagnosis and routing in fault-tolerant multiprocessor systems

DOI10.1006/JPDC.1995.1083MaRDI QIDQ1898233zbMATH OpenOpenAlexFDO

Authors Douglas M. Blough, Honge Wang

Publication date 31 October 1995

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jpdc.1995.1083

zbMATH Keywords

fault-tolerant routingmultiprocessor systems

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Recommendations

• On diagnosability of large multiprocessor networks
• An algorithm for routing messages between processing elements in a multiprocessor system which tolerates a maximal number of faulty links
• Reliable distributed diagnosis for multiprocessor systems with random faults
• System diagnosis with smallest risk of error
• On diagnosability of large multiprocessor networks

Cited in

(3)

• An algorithm for routing messages between processing elements in a multiprocessor system which tolerates a maximal number of faulty links
• Artificial intelligence search techniques as fault-tolerant routing strategies
• scientific article; zbMATH DE number 1138358 (Why is no real title available?)

This page was built for publication: Cooperative diagnosis and routing in fault-tolerant multiprocessor systems

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