scientific article; zbMATH DE number 599176

MaRDI QIDQ4297444zbMATH OpenFDO

Authors Sophie Chabridon

Publication date 3 July 1994

zbMATH Keywords

discrete event simulatorfault-tolerancemultiprocessor architectureparallel computationparallel programstask graph

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Parallel Algorithms with Processor Failures and Delays
• Processor shadowing: Maximizing expected throughput in fault-tolerant systems
• scientific article; zbMATH DE number 238016
• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
• Efficient parallel algorithms can be made robust

Cited in

(4)

• Credible execution of bounded-time parallel systems with delayed diagnosis
• Possibilities of using group operations and group instructions to detect and eliminate failures in the multiprocessor systems of data processing and control
• Parallel Algorithms with Processor Failures and Delays
• scientific article; zbMATH DE number 4187099 (Why is no real title available?)

This page was built for publication:

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