Paris C. Kanellakis, Dimitrios Michailidis, Alex A. Shvartsman  Home/Search
Context
Related
Links: ACM DBLP | brown.edu/people/dm/paper...concur94.ps mit.edu/~alex/concur.ps brown.edu/pub/techreport...cs9429.ps.Z 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) From: jprc.com/Operating_System...index (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . Concurrent computations should combine efficiency with reliability, where efficiency is usually associated with parallel and reliability with distributed computing. Such a desirable combination is not always possible, because of an intuitive trade-off: efficiency requires removing redundancy from computations whereas reliability requires some redundancy. We survey a spectrum of algorithmic models (from fail-stop, synchronous to asynchronous and from approximate to exact computations) in which ... (Update)
Similar documents (at the sentence level):
17.3%: Controlling Memory Access Concurrency in Efficient.. - Kanellakis.. (1993) (Correct)
Active bibliography (related documents): More All
1.5: Parallel Algorithms with Processor Failures and Delays - Buss, Kanellakis, Ragde.. (1995) (Correct)
1.1: Fault-Tolerant and Efficient Parallel Computation - Shvartsman (1992) (Correct)
0.6: In Memoriam: Paris C. Kanellakis - Abiteboul, al. (1995) (Correct)
Similar documents based on text: More All
0.1: Efficient Robust Parallel Computations (Extended Abstract) - Kedem, Palem, Spirakis (1990) (Correct)
0.1: Efficient Parallel Computing with Memory Faults - Gasieniec, Indyk (Correct)
0.0: Towards Practical Deterministic Write-All Algorithms - Chlebus, Dobrev, Kowalski, .. (2001) (Correct)
BibTeX entry: (Update)
@inproceedings{ kanellakis94efficient,
author = "Paris C. Kanellakis and Dimitrios Michailidis and Alexander A. Shvartsman",
title = "Efficient Parallelism vs Reliable Distribution: A Trade-off for Concurrent Computations",
booktitle = "International Conference on Concurrency Theory",
pages = "242-266",
year = "1994",
url = "citeseer.ist.psu.edu/kanellakis94efficient.html" }
Citations (may not include all citations):218 Parallelism in Random Access Machines (context) - Fortune, Wyllie - 1978
177 Fail-Stop Processors: an Approach to Designing Fault-toleran.. - Schlichting, Schneider - 1983 DBLP
102 A Survey of Parallel Algorithms for SharedMemory Machines (context) - Karp, Ramachandran - 1990
85 The APRAM: Incorporating Asynchrony into the PRAM Model (context) - Cole, Zajicek - 1989 ACM DBLP
72 A More Practical PRAM Model (context) - Gibbons - 1989 ACM DBLP
60 Efficient Dispersal of Information for Security, Load Balanc.. (context) - Rabin - 1989
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 ACM DBLP
35 Work-optimal Asynchronous Algorithms for Shared Memory Paral.. (context) - Martel, Park et al. - 1992 ACM DBLP
35 The Expected Advantage of Asynchrony (context) - Cole, Zajicek - 1990 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
17 Achieving Optimal CRCW PRAM Fault Tolerance (context) - Shvartsman - 1991
17 Ultracomputers (context) - Schwartz - 1980 ACM DBLP
13 Efficient Parallel Algorithms On Restartable Fail-Stop Proce.. (context) - Kanellakis, Shvartsman - 1991 ACM DBLP
13 A Survey and Comparison of Faulttolerant Multistage Intercon.. (context) - Agrawal, Seigel - 1987
12 the Complexity of Certified Write-All Algorithms (context) - Martel, Subramonian - 1992
11 Time-Optimal Message-Efficient Work Performance in the Prese.. - DePrisco, Mayer et al. - 1994
8 Fault-Tolerant Semiconductor Memories (context) - Sarrazin, Malek - 1984
7 Combining Tentative and Definite Executions for Dependable P.. (context) - Kedem, Palem et al. - 1991 ACM
7 Parallel Techniques for Combinatorial Computation (context) - Eppstein, Galil - 1988
6 Asynchronous PRAMs are (Almost) as Good as Synchronous PRAMs (context) - Martel, Subramonian et al. - 1990 DBLP
5 Accomplishing Work in the Presence of Failures (context) - Dwork, Halpern et al. - 1992
4 personal communication (context) - Martel - 1991
3 Efficient Write-All Algorithm for Fail-Stop PRAM Without Ini.. (context) - Shvartsman - 1992
3 Controlling Memory Access Concurrency in Efficient Fault-Tol.. - Kanellakis, Michailidis et al. - 1993 ACM DBLP
2 Robust Computing with Fail-Stop Processors (context) - Kanellakis, Shvartsman - 1991
2 Fault Tolerance and Efficiency in Massively Parallel Algorit.. (context) - Kanellakis, Shvartsman - 1994
1 Fault-Tolerant and Efficient Parallel Computation - Shvartsman - 1992 ACM
1 Constructions of Permutation Arrays for Ceratin Scheduling C.. (context) - Naor, Roth - 1993
1 The Competitive Analysis of WaitFree Algorithms and its Appl.. (context) - Ajtai, Aspnes et al. - 1994
Documents on the same site (http://wilma.cs.brown.edu/people/pck/publications.html): More
Controlling Memory Access Concurrency in Efficient.. - Kanellakis.. (1993) (Correct)
Method Schemas - Abiteboul, Kanellakis, Ramaswamy.. (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