Chryssis Georgiou, Alexander Russell, Alex A. Shvartsman  Home/Search
Context Related
| uconn.edu/~acr/Papers/faults.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: uconn.edu/~acr/academic (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Do-All is the problem of performing N tasks in a distributed system of P failure-prone processors [9]. Many distributed and parallel algorithms have been developed for this basic problem and several algorithm simulations have been developed by iterating Do-All algorithms. The eciency of the solutions for Do-All is measured in terms of work complexity where all processing steps taken by the processors are counted. Work is ideally expressed as a function of N , P , and f , the number of... (Update)
Context of citations to this paper: More
.... overhead in work occurs after the second (synchronous) step when U] a b processors perform a mere a b remaining tasks [9, 10]. Another interesting scenario to consider is a truly global case of possibly unbounded set of processors [24] where Jcd . These...
.... of the Do All problem under Byzantine processor failures: prior work on Do All has dealt with processor stop failures (e.g. [19, 9, 11, 15, 7]) with processor stop failures and restarts (e.g. 20, 5] with communication link crashes and recoveries partitionable...
Cited by: More
Bounding Work and Communication in Robust.. - Chlebus, Gasieniec, .. (2002) (Correct)
The Do-All Problem with Byzantine Processor Failures - Fernández.. (2003) (Correct)
Local Scheduling for Distributed Cooperation - Grzegorz Greg Malewicz (Correct)
Active bibliography (related documents): More All
1.0: Towards Practical Deterministic Write-All Algorithms - Chlebus, Dobrev, Kowalski, .. (2001) (Correct)
1.0: The Do-All Problem in Broadcast Networks - Chlebus, Kowalski (2001) (Correct)
0.8: Randomization Helps to Perform Tasks on Processors Prone to.. - Chlebus, Kowalski (1999) (Correct)
Similar documents based on text: More All
0.5: Model-space bounds for the Grandine-Klein intersector - Mow, Peters, Stewart (2001) (Correct)
0.4: Performing Work with Asynchronous Processors.. - Kowalski, Shvartsman (2002) (Correct)
0.4: Multi-Agent Logistics Management - Santos, Jr., Zhang, Luh (Correct)
Related documents from co-citation: More All
4: Performing Tasks on Restartable Message-Passing Processors - Chlebus, De Prisco et al. - 1997
4: Fault-Tolerant Parallel Computation (context) - Kanellakis, Shvartsman - 1997
4: Performing Work Efficiently in the Presence of Faults - Dwork, Halpern et al. - 1992
BibTeX entry: (Update)
Georgiou, Ch., Russell, A., Shvartsman, A.: The Complexity of Synchronous Iterative Do-All with Crashes. To appear. 15th International Conference on Distributed Computing, (2000) http://citeseer.ist.psu.edu/georgiou01complexity.html More
@article{ georgiou01complexity,
author = "Chryssis Georgiou and Alexander Russell and Alex A. Shvartsman",
title = "The Complexity of Synchronous Iterative Do-All with Crashes",
journal = "Lecture Notes in Computer Science",
volume = "2180",
pages = "151--??",
year = "2001",
url = "citeseer.ist.psu.edu/georgiou01complexity.html" }
Citations (may not include all citations):739 Impossibility of Distributed Consensus with one Faulty Proce.. (context) - Fischer, Lynch et al. - 1985
256 Reaching Agreement in the Presence of Faults (context) - Pease, Shostak et al. - 1980
241 The Byzantine Generals Problem - Lamport, Shostak et al. - 1982
230 Fault-Tolerant Broadcasts and Related Problems (context) - Hadzilacos, Toueg - 1993
177 Fail-Stop Processors: An Approach to Designing Fault-Toleran.. - Schlichting, Schneider - 1983
54 Distributed Computing: Models and Methods (context) - Lamport, Lynch - 1990
48 Clock Construction in Fully Asynchronous Parallel Systems an.. (context) - Aumann, Rabin - 1993
43 Parallel Processing on Networks of Workstation: A FaultToler.. - Dasgupta, Kedem et al. - 1995
42 Fault-Tolerant Parallel Computation (context) - Kanellakis, Shvartsman - 1997
35 Work-Optimal Asynchronous Algorithms for Shared Memory Paral.. (context) - Martel, Park et al. - 1992
35 Parallel Algorithms with Processor Failures and Delays - Buss, Kanellakis et al. - 1996
27 as Good as Synchronous PRAMs (context) - Martel, Subramonian et al. - 1990
25 Resolving Message Complexity of Byzantine Agreement and Beyo.. - Galil, Mayer et al. - 1995
18 An Algorithm for the Asynchronous WriteAll Problem Based on .. - Groote, Hesselink et al. - 2001
17 Achieving Optimal CRCW PRAM Fault-Tolerance (context) - Shvartsman - 1991
17 Dynamic Load Balancing with Group Communication - Dolev, Segala et al. - 1999
16 Performing Tasks on Restartable Message-Passing Processors - Chlebus, De Prisco et al. - 2001
15 Time-Optimal Message-Ecient Work Performance in the Presence.. (context) - De Prisco, Mayer et al. - 1994
13 Ecient Robust Parallel Computations (context) - Kedem, Palem et al. - 1990
13 Ecient Program Transformations for Resilient Parallel Comput.. (context) - Kedem, Palem et al. - 1992
12 Ecient Parallel Algorithms Can Be Made Robust (context) - Kanellakis, Shvartsman - 1992
9 Performing Work Eciently in the Presence of Faults (context) - Dwork, Halpern et al. - 1998
8 the Complexity of Certied Write-All Algorithms (context) - Martel, Subramonian - 1994
8 Waitfree Distributed Memory Management by Create - Hesselink, Groote - 1998
7 Combining Tentative and Denite Executions for Dependable Par.. (context) - Kedem, Palem et al. - 1991
7 Algorithms for the Certied Write All Problem (context) - Anderson, Woll - 1997
7 Highly Ecient Asynchronous Execution of Large-Grained Parall.. (context) - Aumann, Kedem et al. - 1993
7 Cooperative Computing with Fragmentable and Mergeable Groups - Georgiou, Shvartsman - 2000
6 The Complexity of Distributed Cooperation in the Presence of.. (context) - Georgiou, Russell et al. - 2000
5 Synchronization-free Parallel Accessible Hash-Table (context) - Groote, Hesselink - 1999
1 Distributed Cooperation in the Absence of Communication (context) - Malewicz, Russell et al. - 2000
Documents on the same site (http://www.engr.uconn.edu/~acr/academic.html): More
Lower Bounds for Leader Election and Collective.. - Russell, Saks, Zuckerman (1999) (Correct)
Extraction of Optimally Unbiased Bits from a Biased Source - Naslund, Russell (Correct)
Faster Algorithms for Optical Switch Configuration - Kumar, Russell, Sundaram (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