Optimal fault-tolerant computing on multiprocessor systems
From MaRDI portal
Recommendations
- On an Optimally Fault-Tolerant Multiprocessor Network Architecture
- Publication:3348384
- Publication:4344152
- Revisiting Asynchronous Fault Tolerant Computation with Optimal Resilience
- Revisiting asynchronous fault tolerant computation with optimal resilience
- Organization of fault- and failure-tolerant computations in completely connected multicomputer systems
- Optimal recovery schemes in fault tolerant distributed computing
- Reconciling fault-tolerant distributed computing and systems-on-chip
Cited in
(17)- Analysis of probability distribution of a random variable of an execution time of the program in the presence of random failures
- Algorithms for testing fault-tolerance of sequenced jobs
- Scheduling Checks and Saves
- Determination of an optimal retry time in multiple-module computing systems
- Transparent fault tolerance for scalable functional computation
- scientific article; zbMATH DE number 4113967 (Why is no real title available?)
- scientific article; zbMATH DE number 4172380 (Why is no real title available?)
- Fast deterministic simulation of computations on faulty parallel machines
- Analytical study of migration-enhanced fault tolerance for long-running applications in IFR systems
- On the Optimum Checkpoint Selection Problem
- Optimal strategies for scheduling checkpoints and preventive maintenance
- Optimal computer crash performance precaution
- Organization of the control subsystem in real-time computing systems
- Processor shadowing: Maximizing expected throughput in fault-tolerant systems
- Closed form solution for response time of fault tolerant network of processors
- An optimal number of microprocessor units with watchdog processor.
- Reliability of a job execution process using signatures
This page was built for publication: Optimal fault-tolerant computing on multiprocessor systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1386442)
