See this document in CiteSeerX!

Hundreds of Impossibility Results for Distributed Computing (2003)  (Make Corrections)  (5 citations)
Faith Fich, Eric Ruppert



  Home/Search   Context   Related

 
View or download:
cs.yorku.ca/~ruppert/papers/hirdc.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  cs.yorku.ca/~ruppert/ (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: We survey results from distributed computing that show tasks to be impossible, either outright or within given resource bounds, in various models. The parameters of the models considered include synchrony, fault-tolerance, different communication media, and randomization. The resource bounds refer to time, space and message complexity. These results are useful in understanding the inherent difficulty of individual problems and in studying the power of different models of distributed... (Update)

Context of citations to this paper:   More

.... arguments, introduced by Burns and Lynch [14] have been used to prove a variety of lower bounds in distributed computing [2, 5, 10, 16, 17, 25, 27], mostly for space complexity. In a covering argument, a configuration is constructed in which some processes are poised to...

Cited by:   More
Relationships between Broadcast and Shared Memory in.. - Aspnes, Fich, Ruppert (2004)   (Correct)
ACM SIGACT News Distributed Computing Column 13 - Sergio Rajsba Um   (Correct)
What Cannot Be Computed Locally! - Kuhn, Moscibroda, Wattenhofer   (Correct)

Similar documents (at the sentence level):
11.3%:   Hundreds of Impossibility Results for Distributed Computing - Fich, Ruppert   (Correct)
9.3%:   Lower Bounds in Distributed Computing - Fich, Ruppert (2000)   (Correct)

Active bibliography (related documents):   More   All
1.5:   A Hundred Impossibility Proofs for Distributed Computing - Lynch (1989)   (Correct)
1.5:   On the Existence of Booster Types - Herlihy, Ruppert (2000)   (Correct)
1.4:   Space-Optimal Multi-Writer Snapshot Objects Are Slow - Fatourou, Fich, Ruppert (2002)   (Correct)

Similar documents based on text:   More   All
0.8:   A Tight Time Lower Bound for Space-Optimal.. - Fatourou, Fich, Ruppert (2003)   (Correct)
0.3:   Time-Space Lower Bounds for Undirected and Directed.. - Edmonds (1993)   (Correct)
0.3:   Determiningcotermin Numbers - Ruppert (2000)   (Correct)

Related documents from co-citation:   More   All
2:   The local detection paradigm and its applications to self-stabilization - Afek, Kutten et al. - 1997
2:   Locality in distributed graph algorithms (context) - Linial - 1992
2:   Local computations on static and dynamic graphs - Mayer, Naor et al. - 1995

BibTeX entry:   (Update)

Faith Fich and Eric Ruppert. Hundreds of impossibility results for distributed computing. Distributed Computing. To appear. http://citeseer.ist.psu.edu/fich03hundreds.html   More

@misc{ fich-hundreds,
  author = "F. Fich and E. Ruppert",
  title = "Hundreds of impossibility results for distributed computing",
  text = "Faith Fich and Eric Ruppert. Hundreds of impossibility results for distributed
    computing. Distributed Computing. To appear.",
  url = "citeseer.ist.psu.edu/fich03hundreds.html" }
Citations (may not include all citations):
739   Impossibility of distributed consensus with one faulty proce.. (context) - Fischer, Lynch et al. - 1985
718   Distributed Algorithms (context) - Lynch - 1996
606   How to make a multiprocessor computer that correctly execute.. (context) - Lamport - 1979
345   Notes on data base operating systems (context) - Gray - 1979
326   Linearizability: A correctness condition for concurrent obje.. (context) - Herlihy, Wing - 1990
264   Knowledge and common knowledge in a distributed environment - Halpern, Moses - 1990
256   Reaching agreement in the presence of faults (context) - Pease, Shostak et al. - 1980
235   Practical Byzantine fault tolerance - Castro, Liskov - 1999
214   Consensus in the presence of partial synchrony - Dwork, Lynch et al. - 1988
195   Parallel Program Design (context) - Chandy, Misra - 1988
186   A methodology for implementing highly concurrent data object.. - Herlihy - 1993
181   ACM Transactions on Programming Languages and Systems (context) - Herlihy - 1991
153   the minimal synchronism needed for distributed consensus (context) - Dolev, Dwork et al. - 1987
148   A fast mutual exclusion algorithm - Lamport - 1987
142   Synchronizing clocks in the presence of faults (context) - Lamport, Melliar-Smith - 1985
142   Solution of a problem in concurrent programming control (context) - Dijkstra - 1965
141   Synthesis of Parallel Algorithms (context) - Reif - 1993
130   Memory consistency and event ordering in scalable shared-mem.. (context) - Gharachorloo, Lenoski et al. - 1990
120   ACM Transactions on Programming Languages and Systems (context) - Lamport, Shostak et al. - 1982
117   Complexity of network synchronization (context) - Awerbuch - 1985
107   A new solution of Dijkstra's concurrent programming problem (context) - Lamport - 1974
99   Atomic snapshots of shared memory - Afek, Attiya et al. - 1993
97   Asynchronous consensus and broadcast protocols (context) - Bracha, Toueg - 1985
94   Upper and lower time bounds for parallel random access machi.. (context) - Cook, Dwork et al. - 1986
94   Knowledge and common knowledge in a Byzantine environment: C.. (context) - Dwork, Moses - 1990
92   Memory requirements for agreement among unreliable asynchron.. (context) - Loui, Abu-Amara - 1987
87   Group communication specifications: A comprehensive study - Chockler, Keidar et al. - 2001
85   Optimal clock synchronization - Srikanth, Toueg - 1987
84   Local and global properties in networks of processors (context) - Angluin - 1980
84   A new fault-tolerant algorithm for clock synchronization - Welch, Lynch - 1988
83   Hierarchical ordering of sequential processes (context) - Dijkstra - 1971
83   A modular approach to fault-tolerant broadcasts and related .. - Hadzilacos, Toueg - 1994
82   Generalized FLP impossibility result for t-resilient asynchr.. (context) - Borowsky, Gafni - 1993
77   Reaching approximate agreement in the presence of faults - Dolev, Lynch et al. - 1986
75   Unreliable failure detectors for reliable distributed system.. - Chandra, Toueg - 1996
75   Renaming in an asynchronous environment (context) - Attiya, Bar-Noy et al. - 1990
73   A lower bound for the time to assure interactive consistency - Fischer, Lynch - 1982
72   Authenticated algorithms for Byzantine agreement (context) - Dolev, Strong - 1983
71   Sequential consistency versus linearizability (context) - Attiya, Welch - 1994
70   The consensus problem in unreliable distributed systems - Fischer - 1983
67   The Byzantine generals strike again (context) - Dolev - 1982
66   Self-stabilization (context) - Dolev - 2000
65   the possibility and impossibility of achieving clock synchro.. (context) - Dolev, Halpern et al. - 1986
61   Immediate atomic snapshots and fast renaming (context) - Borowsky, Gafni - 1993
59   An upper and lower bound for clock synchronization (context) - Lundelius, Lynch - 1984
58   Contention in shared memory algorithms - Dwork, Herlihy et al. - 1997
58   Programmingsimultaneous actions using common knowledge - Moses, Tuttle - 1988
57   The advantages of free choice: A symmetric and fully distrib.. (context) - Rabin, Lehmann - 1994
57   Efficient synchronization on multiprocessors with shared mem.. - Kruskal, Rudolph et al. - 1988
56   Computing on an anonymous ring (context) - Attiya, Snir et al. - 1988
56   Distributed Computing: Fundamentals (context) - Attiya, Welch - 1998
56   Slow memory: Weakening consistency to enhance concurrency in.. (context) - Hutto, Ahamad - 1990
55   A correctness condition for high-performance multiprocessors (context) - Attiya, Friedman - 1998
55   set agreement is impossible: The topology of public knowledg.. (context) - Saks, Zaharoglou - 2000
55   On achieving consensus using a shared memory (context) - Abrahamson - 1988
54   Distributed computing: Models and methods (context) - Lamport, Lynch - 1990
54   Easy impossibility proofs for distributed consensus problems - Fischer, Lynch et al. - 1986
53   Automatically increasing the fault-tolerance of distributed .. (context) - Neiger, Toueg - 1990
46   On processor coordination using asynchronous hardware (context) - Chor, Israeli et al. - 1987
46   Fault-tolerant wait-free shared objects - Jayanti, Chandra et al. - 1998
45   Wait-free data structures in the asynchronous PRAM model - Aspnes, Herlihy - 1990
45   Cost-sensitive analysis of communication protocols (context) - Awerbuch, Baratz et al. - 1990
44   unidirectional distributed algorithm for extrema finding in .. (context) - Dolev, Klawe et al. - 1982
43   On describing the behavior and implementation of distributed.. - Lynch, Fischer - 1981
42   Homology of higher dimensional automata - Goubault, Jensen - 1992
42   Early stopping in Byzantine agreement (context) - Dolev, Reischuk et al. - 1990
41   Reliable communication over unreliable channels - Afek, Attiya et al. - 1994
40   Efficient parallel algorithms can be made robust (context) - Kanellakis, Shvartsman - 1992
39   The power of processor consistency - Ahamad, Bazzi et al. - 1993
39   A data transfer protocol (context) - Stenning - 1976
38   The weakest failure detector for solving consensus - Chandra, Hadzilacos et al. - 1996
38   Are wait-free algorithms fast - Attiya, Lynch et al. - 1994
36   Wait-free made fast (context) - Afek, Dauber et al. - 1995
36   Wait-free parallel algorithms for the union-find problem - Anderson, Woll - 1991
36   Asymptotically tight bounds for computing with faulty arrays.. (context) - Kaklamanis, Karlin et al. - 1990
36   Cryptographic protocols - DeMillo, Lynch et al. - 1982
35   An overview of clock synchronization (context) - Simons, Welch et al. - 1990
35   Parallel algorithms with processor failures and delays - Buss, Kanellakis et al. - 1996
33   part II: Algorithms (context) - Lamport, communication - 1986
33   Byzantine generals and transaction commit protocols - Lamport, Fischer - 1982
32   Set consensus using arbitrary objects - Herlihy, Rajsbaum - 1994
31   Bounds on the time to reach agreement in the presence of tim.. - Attiya, Dwork et al. - 1994
31   The topological structure of asynchronous computability - Herlihy, Shavit - 1999
29   Electing a leader in a synchronous ring - Frederickson, Lynch - 1987
29   What can be computed locally - Naor, Stockmeyer - 1995
28   The choice coordination problem (context) - Rabin - 1982
28   An optimal probabilistic protocol for synchronous Byzantine .. (context) - Feldman, Micali - 1997
26   Time- and space-efficient randomized consensus - Aspnes - 1993
24   Combining tentative and definite executions for very fast de.. - Kedem, Palem et al. - 1991
24   Linearizable counting networks - Herlihy, Shavit et al. - 1996
24   Randomized consensus in expected O (context) - Bracha, Rachman - 1991
23   Process synchronization: Design and performance evaluation o.. (context) - Bagrodia - 1989
23   unidirectional algorithm for the circular extrema problem (context) - Peterson, log - 1982
23   On randomization in sequential and distributed algorithms - Gupta, Smolka et al. - 1994
22   Homotopy and concurrency - Gunawardena - 1994
22   Capturing the power of resiliency and set consensus in distr.. (context) - Borowsky - 1995
22   Mixed consistency: A model for parallel programming - Agrawal, Choy et al. - 1994
22   A formal model for message passing systems (context) - Burns - 1980
21   Simple constant-time consensus protocols in realistic failur.. (context) - Chor, Merritt et al. - 1989
21   Bounds on shared memory for mutual exclusion - Burns, Lynch - 1993
21   A knowledge theoretic analysis of atomic commitment protocol.. (context) - Hadzilacos - 1987
20   Conditions on input vectors for consensus solvability in asy.. (context) - Mostefaoui, Rajsbaum et al. - 2001
20   Asymptotically optimal algorithms for approximate agreement (context) - Fekete - 1990
20   Systematic formal verification for fault-tolerant time-trigg.. - Rushby - 1999
20   Efficiency of synchronous versus asynchronous distributed sy.. (context) - Arjomandi, Fischer et al. - 1983
20   Optimal precision in the presence of uncertainty (context) - Halpern, Megiddo et al. - 1985
20   The weak Byzantine generals problem (context) - Lamport - 1983
19   resiliency and the robustness of wait-free hierarchies (context) - Chandra, Hadzilacos et al. - 1994
19   A continuum of failure models for distributed computing - Garay, Perry - 1992
18   An algorithm for the asynchronous write-all problem based on.. - Groote, Hesselink et al. - 2001
18   Distributed Computing (context) - Anderson - 1993
18   Tight bounds for the sequence transmission problem (context) - Wang, Zuck - 1989
18   Extended impossibility results for asynchronous complete net.. (context) - Moran, Wolfstahl - 1987
18   Time and message bounds for election in synchronous and asyn.. - Afek, Gafni - 1991
18   Leader election in complete networks - Singh - 1992
17   Fault-tolerant decision making in totally asynchronous distr.. (context) - Bridgland, Watro - 1987
17   Computing with faulty shared objects - Afek, Greenberg et al. - 1995
17   Bounds on information exchange for Byzantine agreement (context) - Dolev, Reischuk - 1985
17   The BG distributed simulation algorithm - Borowsky, Gafni et al. - 2001
17   Algebraic spans - Herlihy, Rajsbaum - 1995
17   Crash failures can drive protocols to arbitrary states (context) - Jayaram, Varghese - 1996
17   Causal memory: definitions (context) - Ahamad, Neiger et al. - 1995
16   The decidability of distributed decision tasks - Herlihy, Rajsbaum - 1997
16   Symmetry breaking in distributed networks - Itai, Rodeh - 1990
16   A lower bound for Byzantine agreement with fail-stop process.. (context) - Hadzilacos - 1983
16   Time-adaptive algorithms for synchronization - Alur, Attiya et al. - 1997
15   A simple algorithmically reasoned characterization of waitfr.. - Borowsky, Gafni - 1997
15   the existence of symmetric algorithms to find leaders in net.. (context) - Boug'e - 1988
15   The impossibility of implementing reliable communication in .. - Fekete, Lynch et al. - 1993
15   A combinatorial characterization of the distributed 1-solvab.. (context) - Biran, Moran et al. - 1990
15   Crash resilient communication in dynamic networks - Dolev, Welch - 1997
15   Better computing on the anonymous ring (context) - Attiya, Snir - 1991
14   New lower bound techniques for distributed leader finding an.. - Bodlaender - 1991
14   The inherent cost of nonblocking commitment (context) - Dwork, Skeen - 1983
14   Counting protocols for reliable end-to-end transmission (context) - Ladner, LaMarca et al. - 1998
14   Symmetry and similarity in distributed systems (context) - Johnson, Schneider - 1985
14   Implementing hybrid consistency with high-level synchronizat.. (context) - Friedman - 1995
14   Impossibility results for asynchronous PRAM (context) - Herlihy - 1991
14   An improved lower bound for the time complexity of mutual ex.. - Anderson, Kim - 2001
14   Three-processor tasks are undecidable - Gafni, Koutsoupias - 1999
14   Algorithms for the certified write-all problem - Anderson, Woll - 1997
14   Efficiency of semisynchronous versus asynchronous networks (context) - Attiya, Mavronicolas - 1994
14   Optimal clock synchronization under different delay assumpti.. - Attiya, Herzberg et al. - 1996
13   the impossibility of group membership - Chandra, Hadzilacos et al. - 1996
13   Algebraic topology and distributed computing: A primer - Herlihy, Rajsbaum - 1995
13   Towards a topological characterization of asynchronous compl.. - Hoest, Shavit - 1997
13   A hundred impossibility proofs for distributed computing - Lynch - 1989
13   A theory of clock synchronization (context) - Patt-Shamir, Rajsbaum - 1994
13   The distributed firing squad problem - Coan, Dolev et al. - 1989
12   Robust wait-free hierarchies (context) - Jayanti - 1997
12   Optimal lower bounds for some distributed algorithms for a c.. (context) - Korach, Moran et al. - 1989
12   A lower bound on wait-free counting (context) - Moran, Taubenfeld - 1997
12   Gap theorems for distributed computation (context) - Moran, Warmuth - 1993
12   the complexity of certified write-all algorithms (context) - Martel, Subramonian - 1994
12   Part II: Statement and solutions (context) - Lamport, exclusion - 1986
12   Understanding the set consensus partial order using the Boro.. - Chaudhuri, Reiners - 1996
12   A trade-off between information and communication in broadca.. - Awerbuch, Goldreich et al. - 1990
11   Message-optimal protocols for Byzantine agreement - Hadzilacos, Halpern - 1993
11   Solvability in asynchronous environments (context) - Chor, Moscovici - 1989
11   Possibility and impossibility results in a shared memory env.. (context) - Taubenfeld, Moran - 1996
11   Time is not a healer (context) - Santoro, Widmayer - 1989
11   Data requirements for implementation of n-process mutual exc.. - Burns, Jackson et al. - 1982
10   The consensus hierarchy is not robust - Schenk - 1997
10   Lower bounds for distributed coin-flipping and randomized co.. - Aspnes - 1998
10   Determining consensus numbers - Ruppert - 2000
10   Transaction commit in a realistic timing model (context) - Coan, Welch - 1990
10   the space complexity of randomized synchronization - Fich, Herlihy et al. - 1998
10   Computing anonymously with arbitrary knowledge - Boldi, Vigna - 1999
10   Computability and Complexity Results for Agreement Problems .. - Schenk - 1996
9   The need for headers: An impossibility result for communicat.. - Fekete, Lynch - 1990
9   The complexity of end-to-end communication in memoryless net.. - Adler, Fich - 1999
9   Effects of message loss on the termination of distributed pr.. (context) - Koo, Toueg - 1988
9   Time and space lower bounds for nonblocking implementations (context) - Jayanti, Tan et al. - 2000
9   Round-by-round fault detectors: Unifying synchrony and async.. (context) - Gafni - 1998
9   Language complexity on the synchronous anonymous ring (context) - Attiya, Mansour - 1987
9   The combinatorial structure of wait-free solvable tasks - Attiya, Rajsbaum - 2002
9   Topology and Category Theory in Computer Science (context) - Reed, Roscoe et al. - 1991
9   Deciding 1-solvability of distributed task is NP-hard (context) - Biran, Moran et al. - 1990
9   The distributed bit complexity of the ring: From the anonymo.. - Bodlaender, Moran et al. - 1994
9   Asynchronous approximate agreement (context) - Fekete - 1994
8   full-duplex transmission over half-duplex links (context) - Bartlett, Scantlebury et al. - 1969
8   Lower bounds for convergence function based clock synchroniz.. (context) - Fetzer, Cristian - 1995
8   The impact of time on the session problem (context) - Rhee, Welch - 1992
8   Distributed computing (context) - Gafni - 1998
8   the improbability of reaching Byzantine agreements (context) - Graham, Yao - 1989
8   Unifying synchronous and asynchronous message-passing models - Herlihy, Rajsbaum et al. - 1998
8   Simultaneity is harder than agreement (context) - Coan, Dwork - 1991
8   Distributed consensus revisited - Neiger - 1994
8   Defining and comparing memory consistency models - Higham, Kawash et al. - 1997
8   Spreading rumors rapidly despite an adversary - Aspnes, Hurwood - 1998
7   Two lower bounds in asynchronous distributed computation (context) - Duris, Galil - 1991
7   An inherent bottleneck in distributed counting - Wattenhofer, Widmayer - 1998
7   The intractability of bounded protocols for on-line sequence.. (context) - Mansour, Schieber - 1992
7   Connectivity requirements for Byzantine agreement under rest.. (context) - Hadzilacos - 1987
7   Computable obstructions to wait-free computability - Havlicek - 2000
7   Intelligent graphs: Networks of finite automata capable of s.. (context) - Rosenstiehl, Fiksel et al. - 1972
7   Computing in totally anonymous asynchronous shared memory sy.. - Attiya, Gorbach et al. - 2002
7   operations per processor (context) - Aspnes, Waarts et al. - 1996
7   Information and Computation (context) - Afek, Merritt et al. - 1999
7   Wait-free computing (context) - Jayanti - 1995

[Article contains additional citations not shown here]

Documents on the same site (http://www.cs.yorku.ca/~ruppert/):   More
On the Existence of Booster Types - Herlihy, Ruppert (2000)   (Correct)
Finding the k Shortest Paths in Parallel - Ruppert (2000)   (Correct)
Determiningcotermin Numbers - Ruppert (2000)   (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