Efficient parallel algorithms on restartable fail-stop processors

DOI10.1145/112600.112603zbMath1314.68362OpenAlexW1987917925MaRDI QIDQ5255803

Paris C. Kanellakis, Alexander A. Schwarzmann

Publication date: 19 June 2015

Published in: Proceedings of the tenth annual ACM symposium on Principles of distributed computing - PODC '91 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/112600.112603

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Parallel algorithms in computer science (68W10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Randomized algorithms (68W20)

Related Items (5)

Clock construction in fully asynchronous parallel systems and PRAM simulation ⋮ Efficient execution of nondeterministic parallel programs on asynchronous systems ⋮ Fast deterministic simulation of computations on faulty parallel machines ⋮ Efficient parallel algorithms can be made robust ⋮ An efficient write-all algorithm for fail-stop PRAM without initialized memory

This page was built for publication: Efficient parallel algorithms on restartable fail-stop processors