@inproceedings{33aab0aa8a66480b90bfe2a59099ca3c,

title = "Efficient parallel computing with memory faults",

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.",

author = "Leszek Gasieniec and Piotr Indyk",

year = "1997",

month = jan,

day = "1",

doi = "10.1007/BFb0036183",

language = "English (US)",

isbn = "3540633863",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "188--197",

editor = "Chlebus, {Bogdan S.} and Ludwik Czaja",

booktitle = "Fundamentals of Computation Theory - 11th International Symposium, FCT 1997, Proceedings",

note = "11th International Symposium on Fundamentals of Computation Theory, FCT 1997 ; Conference date: 01-09-1997 Through 03-09-1997",

}