PRAM computations resilient to memory faults

B. S. Chlebus, A. Gambin, P. Indyk

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

16 Scopus citations

Abstract

PRAMs with faults in their shared memory are investigated. Efficient general simulations on such machines of algorithms designed for fully reliable PRAMs are developed. The PRAM we work with is the Concurrent-Read Concurrent-Write (CRCW) variant. Two possible settings for error occurrence are considered: the errors may be either static (once a memory cell is checked to be operational it remains so during the computation) or dynamic (a potentially faulty cell may crash at any time, the total number of such cells being bounded). A simulation consists of two phases: memory formatting and the proper part done in a step-by-step way. For each error setting (static or dynamic), two simulations are presented: one with a O(1)-time per-step cost, the other with a O(log n)-time per-step cost. The other parameters of these simulations (number of processors, memory size, formatting time) are shown in table 1 in section 6. The simulations are randomized and Monte Carlo: they always operate within the given time bounds, and are guaranteed to be correct with a large probability.

Original languageEnglish (US)
Title of host publicationAlgorithms - ESA'94 - 2nd Annual European Symposium, Proceedings
EditorsJan van Leeuwen
PublisherSpringer Verlag
Pages401-412
Number of pages12
ISBN (Print)9783540584346
StatePublished - Jan 1 1994
Externally publishedYes
Event2nd Annual European Symposium on Algorithms, ESA 1994 - Utrecht, Netherlands
Duration: Sep 26 1994Sep 28 1994

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume855 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference2nd Annual European Symposium on Algorithms, ESA 1994
CountryNetherlands
CityUtrecht
Period9/26/949/28/94

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'PRAM computations resilient to memory faults'. Together they form a unique fingerprint.

  • Cite this

    Chlebus, B. S., Gambin, A., & Indyk, P. (1994). PRAM computations resilient to memory faults. In J. van Leeuwen (Ed.), Algorithms - ESA'94 - 2nd Annual European Symposium, Proceedings (pp. 401-412). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 855 LNCS). Springer Verlag.