Fast deterministic simulation of computations on faulty parallel machines
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4001488
- Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
- Parallel fault simulation on a multiprocessor
- The parallel simulation of functional single-state-transition faults
- scientific article; zbMATH DE number 1033646
- ON SIMULATING A CLASS OF PARALLEL ARCHITECTURES
- Fast diagnosis of multiprocessor systems with random faults
- scientific article; zbMATH DE number 1728388
- Optimal fault-tolerant computing on multiprocessor systems
Cites work
- A complexity theory of efficient parallel algorithms
- Achieving optimal CRCW PRAM fault-tolerance
- Efficient dispersal of information for security, load balancing, and fault tolerance
- Efficient parallel algorithms can be made robust
- Efficient parallel algorithms on restartable fail-stop processors
- scientific article; zbMATH DE number 43583 (Why is no real title available?)
- scientific article; zbMATH DE number 107951 (Why is no real title available?)
- scientific article; zbMATH DE number 108004 (Why is no real title available?)
- scientific article; zbMATH DE number 1142306 (Why is no real title available?)
Cited in
(6)- The parallel simulation of functional single-state-transition faults
- Parallel fault simulation on a multiprocessor
- scientific article; zbMATH DE number 1998328 (Why is no real title available?)
- Efficient parallel computing with memory faults
- Fully scalable fault-tolerant simulations for BSP and CGM
- Robust parallel computations through randomization
This page was built for publication: Fast deterministic simulation of computations on faulty parallel machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6102293)