Efficient parallel computing with memory faults

Leszek Gasieniec, Piotr Indyk

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

1 Scopus citations

Abstract

In this paper we show two results on PRAM with constant fraction of memory faults. First we show how to preprocess (i.e. connect a constant fraction of processors into a binary tree) a faulty EREW PRAM with n/log n processors and O(n) memory cells in 0(log n) time. The preprocessing is a basic step of simulations from [7, 9, 17]. Our algorithm, together with the results from [17], gives a first fully work-optimal randomized simulations of EREW on EREW with faults with logarithmic overhead. In the second part of this paper, we consider the CRCW PRAM with memory faults. We show that (after 0(log n)-time preprocessing) any algorithm for 0(n)-processor PRAM can be simulated with optimal work in 0(log * n) time on CRCW with memory faults. The simulation improves the result of [7], All simulations assume static faults, i.e. that the errors are determined before the computation starts and that no new errors occur during the computation.

Original languageEnglish (US)
Title of host publicationFundamentals of Computation Theory - 11th International Symposium, FCT 1997, Proceedings
EditorsBogdan S. Chlebus, Ludwik Czaja
PublisherSpringer Verlag
Pages188-197
Number of pages10
ISBN (Print)3540633863, 9783540633860
DOIs
StatePublished - Jan 1 1997
Externally publishedYes
Event11th International Symposium on Fundamentals of Computation Theory, FCT 1997 - Krakow, Poland
Duration: Sep 1 1997Sep 3 1997

Publication series

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

Conference

Conference11th International Symposium on Fundamentals of Computation Theory, FCT 1997
CountryPoland
CityKrakow
Period9/1/979/3/97

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Efficient parallel computing with memory faults'. Together they form a unique fingerprint.

  • Cite this

    Gasieniec, L., & Indyk, P. (1997). Efficient parallel computing with memory faults. In B. S. Chlebus, & L. Czaja (Eds.), Fundamentals of Computation Theory - 11th International Symposium, FCT 1997, Proceedings (pp. 188-197). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1279). Springer Verlag. https://doi.org/10.1007/BFb0036183