Paris C. Kanellakis, Dimitrios Michailidis, Alex A. Shvartsman  Home/Search
Context Related
Links: ACM DBLP | brown.edu/people/dm/paper...nordic95.ps brown.edu/pub/techreport...cs9423.ps.Z brown.edu/people/dm/paper...nordic95.ps 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: brown.edu/people/p...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The CRCW PRAM under dynamic fail-stop (no restart) processor behavior is a faultprone multiprocessor model for which it is possible to both guarantee reliability and preserve efficiency. To handle dynamic faults some redundancy is necessary in the form of many processors concurrently performing a common read or write task. In this paper we show how to significantly decrease this concurrency by bounding it in terms of the number of actual processor faults. We describe a low concurrency,... (Update)
Context of citations to this paper: More
...by ONR grant N00014 91 J 1613 and by ONR contract N00014 91 J 4052 ARPA order 8225. Parts of this research were reported in [19] and [20]. y Department of Computer Science, Brown University, Box 1910, Providence, RI 02912 1910, USA. z Laboratory for Computer Science,...
...in the study of concurrency, is that true read write concurrency is necessary for fault tolerance. In particular, we outline (from [14]) how algorithms can be designed so that, in each execution, the total true concurrency used can be closely related to the faults that...
Cited by: More
Efficient Parallel Computing with Memory Faults - Gasieniec, Indyk (Correct)
Efficient Parallelism Vs Reliable Distribution: A.. - Kanellakis.. (1994) (Correct)
Controlling Memory Access Concurrency in Efficient.. - Kanellakis.. (1993) (Correct)
Active bibliography (related documents): More All
1.4: Parallel Algorithms with Processor Failures and Delays - Buss, Kanellakis, Ragde.. (1995) (Correct)
0.5: Fault-Tolerant and Efficient Parallel Computation - Shvartsman (1992) (Correct)
0.4: The Do-All Problem with Byzantine Processor Failures - Fernandez, Georgiou (2003) (Correct)
Similar documents based on text: More All
0.2: Efficient Robust Parallel Computations (Extended Abstract) - Kedem, Palem, Spirakis (1990) (Correct)
0.2: Uniform Circuits and Exclusive Read PRAMs - Niepel, Rossmanith (1991) (Correct)
0.2: The Owner Concept for PRAMs - Rossmanith (1991) (Correct)
Related documents from co-citation: More All
3: Parallel Algorithms with Processor Failures and Delays - Buss, Kanellakis et al. - 1991
3: Efficient robust parallel computations (context) - Kedem, Palem et al. - 1990
2: Fail-Stop Processors: An Approach to Designing Fault-Tolerant Computing Systems - Schlichting, Schneider - 1983
BibTeX entry: (Update)
P.C. Kanellakis, D. Michailidis and A.A. Shvartsman, Controlling Memory Access Concurrency in Efficient Fault-Tolerant Parallel Algorithms, Proc. 7th WDAG, Lecture Notes in Computer Science vol. 725 (1993) 99--114. http://citeseer.ist.psu.edu/kanellakis93controlling.html More
@inproceedings{ kanellakis93controlling,
author = "Paris C. Kanellakis and Dimitrios Michailidis and Alexander A. Shvartsman",
title = "Controlling Memory Access Concurrency in Efficient Fault-Tolerant Parallel Algorithms (Extended Abstract)",
booktitle = "Workshop on Distributed Algorithms",
pages = "99-114",
year = "1993",
url = "citeseer.ist.psu.edu/kanellakis93controlling.html" }
Citations (may not include all citations):218 Parallelism in Random Access Machines (context) - Fortune, Wyllie - 1978 ACM DBLP
181 Understanding Fault-Tolerant Distributed Systems - Cristian - 1991 ACM DBLP
177 Fail-Stop Processors: an Approach to Designing Faulttolerant.. - Schlichting, Schneider - 1983
174 The Parallel Evaluation of General Arithmetic Expressions (context) - Brent - 1974
102 A Survey of Parallel Algorithms for Shared-Memory Machines (context) - Karp, Ramachandran - 1990 ACM
85 The APRAM: Incorporating Asynchrony into the PRAM Model (context) - Cole, Zajicek - 1989
72 A More Practical PRAM Model (context) - Gibbons - 1989 ACM DBLP
57 Efficient Synchronization on Multiprocessors with Shared Mem.. - Kruskal, Rudolph et al. - 1988 DBLP
56 Efficient Robust Parallel Computations (context) - Kedem, Palem et al. - 1990 ACM
48 Clock Construction in Fully Asynchronous Parallel Systems an.. (context) - Aumann, Rabin - 1992 ACM DBLP
37 Asynchronous Shared Memory Parallel Computation (context) - Nishimura - 1990 ACM DBLP
36 Wait-Free Parallel Algorithms for the Union-Find Problem - Anderson, Woll - 1991 ACM DBLP
35 Parallel Algorithms with Processor Failures and Delays - Buss, Kanellakis et al. - 1991
35 The Expected Advantage of Asynchrony (context) - Cole, Zajicek - 1990
35 Work-optimal Asynchronous Algorithms for Shared Memory Paral.. (context) - Martel, Park et al. - 1992 ACM DBLP
32 Highly Efficient Asynchronous Execution of Large-Grained Par.. - Aumann, Kedem et al. - 1993 DBLP
28 Efficient Program Transformations for Resilient Parallel Com.. - Kedem, Palem et al. - 1992
27 as Good as Synchronous PRAMs (context) - Martel, Subramonian et al. - 1990
23 A Theory of Competitive Analysis for Distributed Algorithms - Ajtai, Aspnes et al. - 1994 DBLP
17 Achieving Optimal CRCWPRAM Fault-Tolerance (context) - Shvartsman - 1991
14 Performing Work Efficiently in the Presence of Faults - Dwork, Halpern et al. - 1992 ACM DBLP
13 A Survey and Comparison of Fault-tolerant Multistage Interco.. (context) - Agrawal, Seigel - 1987 ACM
12 the Complexity of Certified Write-All Algorithms (context) - Martel, Subramonian - 1994
11 Time-Optimal Message-Efficient Work Performance in the Prese.. - DePrisco, Mayer et al. - 1994
9 Information Broadcasting by Exclusive Read PRAMs - Beame, Kik et al. - 1992
8 Fault-Tolerant Semiconductor Memories (context) - Sarrazin, Malek - 1984
7 Parallel Techniques for Combinatorial Computation (context) - Eppstein, Galil - 1988
7 Combining Tentative and Definite Executions for Dependable P.. (context) - Kedem, Palem et al. - 1991 ACM
4 personal communication (context) - Martel - 1991
3 ACM TOPLAS (context) - Schwartz - 1980
3 Fault-Tolerance in Parallel Computation (context) - Kanellakis, Michailidis et al. - 1994
3 An Efficient Write-All Algorithm for Fail-Stop PRAM without .. (context) - Shvartsman - 1992 ACM DBLP
3 Controlling Memory Access Concurrency in Efficient Fault-Tol.. - Kanellakis, Michailidis et al. - 1993 ACM DBLP
2 IEEE Computer special issue (context) - Systems - 1990
2 IEEE Computer special issue (context) - Computing - 1984
1 Crash-failure Agreement (context) - Mayer, Yung et al. - 1994
Documents on the same site (http://wilma.cs.brown.edu/people/pck/publications.html): More
Method Schemas - Abiteboul, Kanellakis, Ramaswamy.. (1994) (Correct)
Efficient Parallelism Vs Reliable Distribution: A.. - Kanellakis.. (1994) (Correct)
OODB Indexing by Class-Division - Sridhar Ramaswamy (1995) (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