PRAM computations resilient to memory faults

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

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

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

Fingerprint

Fault
Data storage equipment
Simulation
Concurrent
Cell
Costs
Crash
Shared Memory
Table

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

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.

PRAM computations resilient to memory faults. / Chlebus, B. S.; Gambin, A.; Indyk, P.

Algorithms - ESA'94 - 2nd Annual European Symposium, Proceedings. ed. / Jan van Leeuwen. Springer Verlag, 1994. p. 401-412 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 855 LNCS).

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

Chlebus, BS, Gambin, A & Indyk, P 1994, PRAM computations resilient to memory faults. in J van Leeuwen (ed.), Algorithms - ESA'94 - 2nd Annual European Symposium, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 855 LNCS, Springer Verlag, pp. 401-412, 2nd Annual European Symposium on Algorithms, ESA 1994, Utrecht, Netherlands, 9/26/94.
Chlebus BS, Gambin A, Indyk P. PRAM computations resilient to memory faults. In van Leeuwen J, editor, Algorithms - ESA'94 - 2nd Annual European Symposium, Proceedings. Springer Verlag. 1994. p. 401-412. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Chlebus, B. S. ; Gambin, A. ; Indyk, P. / PRAM computations resilient to memory faults. Algorithms - ESA'94 - 2nd Annual European Symposium, Proceedings. editor / Jan van Leeuwen. Springer Verlag, 1994. pp. 401-412 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{2f1f3269ca564bd2b5739ecdede3bc53,
title = "PRAM computations resilient to memory faults",
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.",
author = "Chlebus, {B. S.} and A. Gambin and P. Indyk",
year = "1994",
month = "1",
day = "1",
language = "English (US)",
isbn = "9783540584346",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "401--412",
editor = "{van Leeuwen}, Jan",
booktitle = "Algorithms - ESA'94 - 2nd Annual European Symposium, Proceedings",

}

TY - GEN

T1 - PRAM computations resilient to memory faults

AU - Chlebus, B. S.

AU - Gambin, A.

AU - Indyk, P.

PY - 1994/1/1

Y1 - 1994/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84947739267&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84947739267&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84947739267

SN - 9783540584346

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 401

EP - 412

BT - Algorithms - ESA'94 - 2nd Annual European Symposium, Proceedings

A2 - van Leeuwen, Jan

PB - Springer Verlag

ER -