Leszek Gasieniec, Piotr Indyk  Home/Search
Context
Related
| csc.liv.ac.uk/~leszek/pap...fct97.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: csc.liv.ac.uk/~leszek/pub (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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 O(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... (Update)
Active bibliography (related documents): More All
0.7: Deterministic Computations on a PRAM with Static Faults - Chlebus, Gasieniec, Pelc (Correct)
0.6: PRAM Computations Resilient to Memory Faults - Chlebus Gambin (Correct)
0.5: Efficient Computations on fault-prone BSP machines - Kontogiannis, Pantziou.. (1997) (Correct)
Similar documents based on text: More All
0.3: Fast Deterministic Computations on a Faulty PRAM - Chlebus, Gasieniec, Pelc (Correct)
0.3: Real-Time String Matching in Sublinear Space - Gasieniec, Kolpakov (Correct)
0.3: External Inverse Pattern Matching - Gasieniec, Indyk, Krysta (1997) (Correct)
BibTeX entry: (Update)
@inproceedings{ gasieniec97efficient,
author = "Leszek Gasieniec and Piotr Indyk",
title = "Efficient Parallel Computing with Memory Faults",
booktitle = "Fundamentals of Computation Theory",
pages = "188-197",
year = "1997",
url = "citeseer.ist.psu.edu/84325.html" }
Citations (may not include all citations):1749 An Introduction to Probability Theory and Its Applications (context) - Feller - 1950
314 An Introduction to Parallel Algorithms (context) - J'aJ'a - 1992
268 Parallel algorithms for shared-memory machines (context) - Karp, Ramachandran - 1990
163 Efficient dispersal of information for security (context) - Rabin - 1989
148 Ramanujan graphs (context) - Lubotzky, Philips et al. - 1988
136 Efficient Parallel Algorithms (context) - Gibbons, Rytter - 1988
71 Explicit constructions of linear-sized superconcentrators (context) - Gabber, Galil - 1981
58 Expander Codes - Sipser, Spielman - 1994
56 Efficient robust parallel computations (context) - Kedem, Palem et al. - 1990
53 Chernoff-Hoeffding Bounds for Applications with Limited Inde.. - Schmidt, Siegel et al. - 1993
49 A Guided Tour of Chernoff Bounds (context) - Hagerup, Rub - 1989
44 On Universal Classes of Fast High Performance Hash Functions (context) - Siegel - 1989
40 Efficient parallel algorithms can be made robust (context) - Kanellakis, Shvartsman - 1992
35 Parallel algorithms with processor failures and delays - Buss, Kanellakis et al. - 1996
35 Recursive star-tree parallel data structure (context) - Berkman, Vishkin - 1993
35 Explicit construction of linear sized tolerant networks (context) - Alon, Chung - 1988
24 Computing with Faulty Shared Memory (context) - Afek, Greenberg et al. - 1992
24 Combining tentative and definite executions for very fast de.. - Kedem, Palem et al. - 1991
17 PRAM computations resilient to memory faults - Chlebus, Gambin et al. - 1994
15 Fast and reliable parallel hashing (context) - Bast, Hagerup - 1991
14 Hashing strategies for simulating shared memory on distribut.. - auf - 1992
13 Fast Deterministic Simulation of Computations on Faulty Para.. - Chlebus, asieniec et al. - 1995
7 Fault-Tolerant Shared Memory Simulations (context) - Berenbrink, auf et al. - 1996
5 On Word-Level Parallelism in Fault-Tolerant Computing (context) - Indyk - 1996
5 Shared-Memory Simulations on a Faulty DMM (context) - Chlebus, Gambin et al. - 1996
5 Reliable computations on faulty EREW PRAM (context) - Diks, Pelc
3 the Method of Bounded Differences (context) - Diarmid - 1989
3 Controlling memory access concurrency in efficient fault-tol.. - Kanellakis, Michailidis - 1995
2 th Annual Symposium on Theoretical Aspects of Computer Scien.. (context) - Hagerup, Revolution - 1992
1 Personal Communication (context) - Diks
Documents on the same site (http://www.csc.liv.ac.uk/~leszek/pub.html): More
Optimal Pattern Matching on Meshes - Chlebus, Gasieniec (1993) (Correct)
Constant-Space String Matching with Smaller Number of.. - Gasieniec.. (1995) (Correct)
Approximate Dictionary Queries - Brodal, Gasieniec (1996) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC