Efficient robust parallel computations.

Zvi M. Kedem, Krishna V. Palem, Paul G. Spirakis

Research output: Chapter in Book/Report/Conference proceedingConference contribution


A parallel computing system becomes increasingly prone to failure as the number of processing elements in it increases. In this paper, we describe a completely general strategy that takes an arbitrary step of an ideal CRCW PRAM and automatically translates it to run efficiently and robustly on a PRAM in which processors are prone to failure. The strategy relies on efficient robust algorithms for solving a core problem, the Certified Write-All Problem. This problem characterizes the core of robustness, because, as we show, its complexity is equal to that of any general strategy for realizing robustness in the model. We analyze the expected parallel time and work of various algorithms for solving this problem. Our results are a non-trivial generalization of R.P. Brent's Lemma. We consider the case where the number of the available processors decreases dynamically over time, whereas Brent's Lemma is only applicable in the case where the processor availability pattern is static.

Original languageEnglish (US)
Title of host publicationProc 22nd Annu ACM Symp Theory Comput
PublisherPubl by ACM
Number of pages11
ISBN (Print)0897913612, 9780897913614
StatePublished - 1990
EventProceedings of the 22nd Annual ACM Symposium on Theory of Computing - Baltimore, MD, USA
Duration: May 14 1990May 16 1990

Publication series

NameProc 22nd Annu ACM Symp Theory Comput


OtherProceedings of the 22nd Annual ACM Symposium on Theory of Computing
CityBaltimore, MD, USA

ASJC Scopus subject areas

  • General Engineering


Dive into the research topics of 'Efficient robust parallel computations.'. Together they form a unique fingerprint.

Cite this