Achieving optimal CRCW PRAM fault-tolerance

Alex A. Shvartsman

Research output: Contribution to journalArticlepeer-review

Abstract

As was shown by P.C. Kanellakis and A.A. Shvartsman (1989), it is possible to combine efficiency and fault-tolerance in many PRAM algorithms in the presence of arbitrary dynamic fail-stop processor errors. Here we describe a technique for efficient and fault-tolerant simulation of arbitrary PRAM algorithms. Given a P-processor PRAM algorithm we simulate it efficiently and fault-tolerantly by a P'-processor CRCW PRAM algorithm, for P'≤P. The simulation is optimal for P'≤ P log2P.

Original languageEnglish (US)
Pages (from-to)59-66
Number of pages8
JournalInformation Processing Letters
Volume39
Issue number2
DOIs
StatePublished - Jul 31 1991
Externally publishedYes

Keywords

  • Fault-tolerance
  • PRAM
  • efficiency
  • parallel algorithms

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Signal Processing
  • Information Systems
  • Computer Science Applications

Fingerprint

Dive into the research topics of 'Achieving optimal CRCW PRAM fault-tolerance'. Together they form a unique fingerprint.

Cite this