Fast deterministic simulation of computations on faulty parallel machines

DOI10.1007/3-540-60313-1_136zbMath1512.68032OpenAlexW1686849869MaRDI QIDQ6102293

Andrzej Pelc, Leszek Gąsieniec, Bogdan S. Chlebus

Publication date: 8 May 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60313-1_136

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (1)

Efficient parallel computing with memory faults

Cites Work

• A complexity theory of efficient parallel algorithms
• Achieving optimal CRCW PRAM fault-tolerance
• Efficient parallel algorithms can be made robust
• Efficient dispersal of information for security, load balancing, and fault tolerance
• Efficient parallel algorithms on restartable fail-stop processors
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Fast deterministic simulation of computations on faulty parallel machines