Hundreds of impossibility results for distributed computing

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 computing. There is a strong emphasis in our presentation on explaining the wide variety of techniques that are used to obtain the results described.

[1]  Maurice Herlihy,et al.  Linearizability: a correctness condition for concurrent objects , 1990, TOPL.

[2]  Nancy A. Lynch,et al.  Reliable communication over unreliable channels , 1994, JACM.

[3]  Hagit Attiya,et al.  Renaming in an asynchronous environment , 1990, JACM.

[4]  Rida A. Bazzi,et al.  The power of processor consistency , 1993, SPAA '93.

[5]  Michael J. Fischer,et al.  The wakeup problem , 1990, STOC '90.

[6]  Baruch Awerbuch,et al.  A trade-off between information and communication in broadcast protocols , 1990, JACM.

[7]  Vassos Hadzilacos,et al.  A knowledge-theoretic analysis of atomic commitment protocols , 1987, PODS '87.

[8]  Naoshi Sakamoto,et al.  Comparison of initial conditions for distributed algorithms on anonymous networks , 1999, PODC '99.

[9]  Eric Schenk,et al.  The consensus hierarchy is not robust , 1997, PODC '97.

[10]  Gadi Taubenfeld,et al.  A lower bound on wait-free counting , 1993, PODC '93.

[11]  Aaas News,et al.  Book Reviews , 1893, Buffalo Medical and Surgical Journal.

[12]  Robert Cori,et al.  Exotic Behaviour of Consensus Numbers , 1994, WDAG.

[13]  Boaz Patt-Shamir,et al.  A theory of clock synchronization (extended abstract) , 1994, STOC '94.

[14]  Bernadette Charron-Bost,et al.  On the impossibility of group membership , 1996, PODC '96.

[15]  Leslie Lamport,et al.  A fast mutual exclusion algorithm , 1987, TOCS.

[16]  L. Bourgé,et al.  On the existence of symmetric algorithms to find leaders in networks of communicating sequential processes , 1988 .

[17]  Eyal Kushilevitz,et al.  Lower bounds for randomized mutual exclusion , 1993, SIAM J. Comput..

[18]  Leslie Lamport,et al.  The mutual exclusion problem: partII—statement and solutions , 1986, JACM.

[19]  Ouri Wolfson,et al.  Transaction commitment at minimal communication cost , 1987, PODS '87.

[20]  Leslie Lamport,et al.  The Weak Byzantine Generals Problem , 1983, JACM.

[21]  Jan K. Pachl,et al.  A Lower Bound for Probabilistic Distributed Algorithms , 1987, J. Algorithms.

[22]  Baruch Awerbuch,et al.  Communication-time trade-offs in network synchronization , 1985, PODC '85.

[23]  Manfred K. Warmuth,et al.  The Distributed Bit Complexity of the Ring: From the Anonymous to the Non-anonymous Case , 1989, Inf. Comput..

[24]  P. Rosenstiehl,et al.  INTELLIGENT GRAPHS: NETWORKS OF FINITE AUTOMATA CAPABLE OF SOLVING GRAPH PROBLEMS , 1972 .

[25]  Prasad Jayanti,et al.  Robust wait-free hierarchies , 1997, JACM.

[26]  Gil Neiger,et al.  Set-linearizability , 1994, PODC '94.

[27]  Prasad Jayanti,et al.  A time complexity lower bound for randomized implementations of some shared objects , 1998, PODC '98.

[28]  Jeremy Gunawardena,et al.  Homotopy and Concurrency , 2001, Bull. EATCS.

[29]  David S. Greenberg,et al.  Choice Coordination with Multiple Alternatives (Preliminary Version) , 1992, WDAG.

[30]  Jan Friso Groote,et al.  An algorithm for the asynchronous Write-All problem based on process collision , 2001, Distributed Computing.

[31]  Nancy A. Lynch,et al.  Are wait-free algorithms fast? , 1994, JACM.

[32]  Roy Friedman,et al.  A Correctness Condition for High-Performance Multiprocessors , 1998, SIAM J. Comput..

[33]  Shmuel Katz,et al.  Initial failures in distributed computations , 1990, International Journal of Parallel Programming.

[34]  Danny Dolev,et al.  Early stopping in Byzantine agreement , 1990, JACM.

[35]  Nancy A. Lynch,et al.  Electing a leader in a synchronous ring , 1987, JACM.

[36]  Nancy A. Lynch,et al.  Easy impossibility proofs for distributed consensus problems , 1985, PODC '85.

[37]  Jennifer L. Welch,et al.  Simulating Synchronous Processors , 1987, Inf. Comput..

[38]  Yehuda Afek,et al.  The Power of Multiobjects , 1999, Inf. Comput..

[39]  Jalal Kawash,et al.  Bounds for Mutual Exclusion with only Processor Consistency , 2000, DISC.

[40]  G. S. Graham.  A New Solution of Dijkstra ' s Concurrent Programming Problem , 2022 .

[41]  Eli Gafni,et al.  Round-by-Round Fault Detectors: Unifying Synchrony and Asynchrony (Extended Abstract). , 1998, PODC 1998.

[42]  David Peleg,et al.  A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction , 2000, SIAM J. Comput..

[43]  Juan A. Garay,et al.  A Continuum of Failure Models for Distributed Computing , 1992, WDAG.

[44]  Charles U. Martel,et al.  On the Complexity of Certified Write-All Algorithms , 1994, J. Algorithms.

[45]  Yishay Mansour,et al.  On the bit complexity of distributed computations in a ring with a leader , 1986, PODC '86.

[46]  Maurice Herlihy,et al.  A methodology for implementing highly concurrent data objects , 1993, TOPL.

[47]  Gadi Taubenfeld,et al.  Possibility and Impossibility Results in a Shared Memory Environment , 1989, WDAG.

[48]  Nir Shavit,et al.  Towards a topological characterization of asynchronous complexity , 1997, PODC '97.

[49]  Rajeev Alur,et al.  Time-adaptive algorithms for synchronization , 1994, STOC '94.

[50]  Gary L. Peterson,et al.  Properties of a family of booster types , 1999, PODC '99.

[51]  Rida A. Bazzi,et al.  Simplifying fault-tolerance: providing the abstraction of crash failures , 2001, JACM.

[52]  Toshimitsu Masuzawa,et al.  Optimal Wait-Free Clock Synchronisation Protocol on a Shared-Memory Multi-processor System , 1997, WDAG.

[53]  Alexander A. Shvartsman,et al.  Efficient parallel algorithms can be made robust , 1989, PODC '89.

[54]  Baruch Awerbuch,et al.  Cost-sensitive analysis of communication protocols , 1990, PODC '90.

[55]  Z. M. Kedem,et al.  Combining tentative and definite executions for very fast dependable parallel computing , 1991, STOC '91.

[56]  Sam Toueg,et al.  Optimal clock synchronization , 1985, PODC '85.

[57]  John H. Reif,et al.  Synthesis of Parallel Algorithms , 1993 .

[58]  Gurdip Singh,et al.  Leader election in complete networks , 1992, PODC '92.

[59]  Hagit Attiya,et al.  Efficiency of semisynchronous versus asynchronous networks , 1994, Mathematical systems theory.

[60]  Vassos Hadzilacos,et al.  On the power of shared object types to implement one-resilient Consensus , 1997, PODC '97.

[61]  James Aspnes,et al.  Spreading rumors rapidly despite an adversary , 1996, PODC '96.

[62]  Eric Goubault,et al.  Homology of Higher Dimensional Automata , 1992, CONCUR.

[63]  Michael O. Rabin,et al.  The choice coordination problem , 1982, Acta Informatica.

[64]  Özalp Babaoglu,et al.  Reliable broadcasts and communication models: tradeoffs and lower bounds , 1988, Distributed Computing.

[65]  Richard E. Ladner,et al.  Counting Protocols for Reliable End-to-End Transmission , 1998, J. Comput. Syst. Sci..

[66]  Nancy A. Lynch,et al.  A new fault-tolerant algorithm for clock synchronization , 1984, PODC '84.

[67]  Gary L. Peterson,et al.  An O(nlog n) Unidirectional Algorithm for the Circular Extrema Problem , 1982, TOPL.

[68]  Michael Merritt,et al.  Fairness of Shared Objects , 1998, DISC.

[69]  Vassos Hadzilacos,et al.  Connectivity requirements for Byzantine agreement under restricted types of failures , 1987, Distributed Computing.

[70]  Prasad Jayanti,et al.  On the Power of Multi-objects , 1997, WDAG.

[71]  Nancy A. Lynch,et al.  An Upper and Lower Bound for Clock Synchronization , 1984, Inf. Control..

[72]  Daniel Lehmann,et al.  On the advantages of free choice: a symmetric and fully distributed solution to the dining philosophers problem , 1981, POPL '81.

[73]  Alexander A. Shvartsman,et al.  Fault-Tolerant Parallel Computation , 1997 .

[74]  Jennifer L. Welch,et al.  Crash Resilient Communication in Dynamic Networks , 1997, IEEE Trans. Computers.

[75]  Nancy A. Lynch,et al.  Cryptographic protocols , 1982, STOC '82.

[76]  Larry Rudolph,et al.  Efficient synchronization of multiprocessors with shared memory , 1988, TOPL.

[77]  Anoop Gupta,et al.  Memory consistency and event ordering in scalable shared-memory multiprocessors , 1990, ISCA '90.

[78]  Gadi Taubenfeld,et al.  Constructing a reliable test&set bit , 1996, PODC '96.

[79]  Ophir Rachman,et al.  Anomalies in the Wait-Free Hierarchy , 1994, WDAG.

[80]  Eric Ruppert,et al.  Consensus numbers of multi-objects , 1998, PODC '98.

[81]  Da-Wei Wang,et al.  Tight bounds for the sequence transmission problem , 1989, PODC '89.

[82]  James Aspnes,et al.  Time-and space-efficient randomized consensus , 1990, PODC '90.

[83]  William R. Crowther,et al.  The Data Transfer Protocol , 1971, RFC.

[84]  Marcin Paprzycki,et al.  Distributed Computing: Fundamentals, Simulations and Advanced Topics , 2001, Scalable Comput. Pract. Exp..

[85]  Sam Toueg,et al.  Wait-freedom vs. t-resiliency and the robustness of wait-free hierarchies (extended abstract) , 1994, PODC '94.

[86]  Eric Ruppert,et al.  Determining consensus numbers , 1997, PODC '97.

[87]  Boaz Patt,et al.  A theory of clock synchronization , 1994 .

[88]  Benny Chor,et al.  Solvability in asynchronous environments , 1989, 30th Annual Symposium on Foundations of Computer Science.

[89]  George Varghese,et al.  Crash failures can drive protocols to arbitrary states , 1996, PODC '96.

[90]  Danny Dolev,et al.  An O(n log n) Unidirectional Distributed Algorithm for Extrema Finding in a Circle , 1982, J. Algorithms.

[91]  Tushar Deepak Chandra,et al.  A polylog time wait-free construction for closed objects , 1998, PODC '98.

[92]  Sam Toueg,et al.  Fault-tolerant wait-free shared objects , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[93]  Wei Chen,et al.  Linear-Time Snapshot Using Multi-writer Multi-reader Registers , 1994, WDAG.

[94]  Sam Toueg,et al.  Some Results on the Impossibility, Universality, and Decidability of Consensus , 1992, WDAG.

[95]  Michael J. Fischer,et al.  The Consensus Problem in Unreliable Distributed Systems (A Brief Survey) , 1983, FCT.

[96]  Nancy A. Lynch,et al.  Data Requirements for Implementation of N-Process Mutual Exclusion Using a Single Shared Variable , 1982, JACM.

[97]  I. Keidar,et al.  Group Communication Speci cations: A Comprehensive Study , 1999 .

[98]  Prasad Jayanti,et al.  A lower bound on the local time complexity of universal constructions , 1998, PODC '98.

[99]  Jean-Pierre Banâtre,et al.  Parallel Program Design , 1991, Research Directions in High-Level Parallel Programming Languages.

[100]  Larry Rudolph,et al.  ParC—An Extension of C for Shared Memory Parallel Processing , 1996 .

[101]  Nancy A. Lynch,et al.  Tight bounds for k-set agreement , 2000, J. ACM.

[102]  Mustaque Ahamad,et al.  Slow memory: weakening consistency to enhance concurrency in distributed shared memories , 1990, Proceedings.,10th International Conference on Distributed Computing Systems.

[103]  Maurice Herlihy,et al.  The decidability of distributed decision tasks (extended abstract) , 1997, STOC '97.

[104]  Nancy A. Lynch,et al.  On Describing the Behavior and Implementation of Distributed Systems , 1979, Theor. Comput. Sci..

[105]  Boaz Patt-Shamir,et al.  Distributed MST for constant diameter graphs , 2001, PODC '01.

[106]  Alan Fekete.  Asynchronous approximate agreement , 1987, PODC '87.

[107]  John Havlicek.  Computable obstructions to wait-free computability , 2000, Distributed Computing.

[108]  Eli Gafni,et al.  Round-by-round fault detectors (extended abstract): unifying synchrony and asynchrony , 1998, PODC '98.

[109]  Sam Toueg,et al.  Time and Space Lower Bounds for Nonblocking Implementations , 2000, SIAM J. Comput..

[110]  Oded Goldreich,et al.  Cryptography and cryptographic protocols , 2003, Distributed Computing.

[111]  Nancy A. Lynch,et al.  A hundred impossibility proofs for distributed computing , 1989, PODC '89.

[112]  Shmuel Zaks,et al.  A Combinatorial Characterization of the Distributed 1-Solvable Tasks , 1990, J. Algorithms.

[113]  Gil Neiger,et al.  Automatically Increasing the Fault-Tolerance of Distributed Algorithms , 1990, J. Algorithms.

[114]  Ronald J. Watro,et al.  Fault-tolerant decision making in totally asynchronous distributed systems , 1987, ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing.

[115]  Nancy A. Lynch,et al.  Bounds on the time to reach agreement in the presence of timing uncertainty , 1991, STOC '91.

[116]  Flaviu Cristian,et al.  Lower bounds for convergence function based clock synchronization , 1995, PODC '95.

[117]  Yonatan Aumann,et al.  Efficient asynchronous consensus with the weak adversary scheduler , 1997, PODC '97.

[118]  Stephen A. Cook,et al.  Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes , 1986, SIAM J. Comput..

[119]  Gadi Taubenfeld,et al.  Concurrent counting , 1992, PODC '92.

[120]  Shlomo Moran,et al.  Closed schedulers: a novel technique for analyzing asynchronous protocols , 1995, Distributed Computing.

[121]  Nancy A. Lynch,et al.  Impossibility of distributed consensus with one faulty process , 1983, PODS '83.

[122]  Maurice Herlihy,et al.  On the existence of booster types , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[123]  Israel Cidon,et al.  Message Terminating Algorithms for Anonymous Rings of Unknown Size , 1995, Inf. Process. Lett..

[124]  Gary L. Peterson,et al.  The ambiguity of choosing , 1989, PODC '89.

[125]  Vassos Hadzilacos,et al.  On the message complexity of binary byzantine agreement under crash failures , 1992, Distributed Computing.

[126]  Elizabeth Borowsky,et al.  Capturing the power of resiliency and set consensus in distributed systems , 1996 .

[127]  Shlomo Moran,et al.  Extended Impossibility Results for Asynchronous Complete Networks , 1987, Inf. Process. Lett..

[128]  Faith Ellen,et al.  Space-optimal multi-writer snapshot objects are slow , 2002, PODC '02.

[129]  Sam Toueg,et al.  Fault-tolerant wait-free shared objects , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[130]  Sam Toueg,et al.  A Modular Approach to Fault-Tolerant Broadcasts and Related Problems , 1994 .

[131]  Maurice Herlihy,et al.  Contention in shared memory algorithms , 1993, JACM.

[132]  Amos Israeli,et al.  On processor coordination using asynchronous hardware , 1987, PODC '87.

[133]  Rüdiger Reischuk,et al.  Lower Bounds for Synchronous Networks and the Advantage of Local Information , 1987, WDAG.

[134]  Sam Toueg,et al.  The weakest failure detector for solving consensus , 1992, PODC '92.

[135]  Maurice Herlihy,et al.  Impossibility results for asynchronous PRAM (extended abstract) , 1991, SPAA '91.

[136]  Karl R. Abrahamson.  On achieving consensus using a shared memory , 1988, PODC '88.

[137]  James H. Anderson,et al.  Composite registers , 1990, PODC '90.

[138]  Hagit Attiya,et al.  Distributed Computing: Fundamentals, Simulations and Advanced Topics , 1998 .

[139]  Maurice Herlihy,et al.  On the decidability of distributed decision tasks , 1996, PODC '96.

[140]  Eli Gafni,et al.  Generalized FLP impossibility result for t-resilient asynchronous computations , 1993, STOC.

[141]  Michael K. Reiter,et al.  On k-set consensus problems in asynchronous systems , 1999, PODC '99.

[142]  E. Sperner.  Neuer beweis für die invarianz der dimensionszahl und des gebietes , 1928 .

[143]  Alon Itai,et al.  Symmetry breaking in distributed networks , 1990, Inf. Comput..

[144]  Idit Keidar,et al.  Group communication specifications: a comprehensive study , 2001, CSUR.

[145]  Sam Toueg,et al.  Unreliable failure detectors for reliable distributed systems , 1996, JACM.

[146]  Maurice Herlihy,et al.  Algebraic Topology and Distributed Computing: A Primer , 1995, Computer Science Today.

[147]  Luc Bougé,et al.  On the existence of symmetric algorithms to find leaders in networks of communicating sequential processes , 1988, Acta Informatica.

[148]  Prasad Jayanti,et al.  Solvability of Consensus: Composition Breaks Down for NonDeterministic Types , 1999, SIAM J. Comput..

[149]  Rajive L. Bagrodia,et al.  Process Synchronization: Design and Performance Evaluation of Distributed Algorithms , 1989, IEEE Trans. Software Eng..

[150]  Yehuda Afek,et al.  Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks , 1991, SIAM J. Comput..

[151]  Soma Chaudhuri,et al.  More Choices Allow More Faults: Set Consensus Problems in Totally Asynchronous Systems , 1993, Inf. Comput..

[152]  Maurice Herlihy,et al.  Wait-free data structures in the asynchronous PRAM model , 1990, SPAA '90.

[153]  Leslie Lamport,et al.  How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs , 2016, IEEE Transactions on Computers.

[154]  Nancy A. Lynch,et al.  Distributed Computing: Models and Methods , 1990, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[155]  Roy Friedman.  Implementing hybrid consistency with high-level synchronization operations , 1993, PODC '93.

[156]  Baruch Awerbuch,et al.  Complexity of network synchronization , 1985, JACM.

[157]  Manfred K. Warmuth,et al.  Gap Theorems for Distributed Computation , 1993, SIAM J. Comput..

[158]  Yehuda Afek,et al.  Optimal Time-Space Tradeoff for Shared Memory Leader Election , 1997, J. Algorithms.

[159]  Baruch Awerbuch,et al.  A Tradeoff between Information and Communication in Broadcast Protocols , 1988, AWOC.

[160]  Brian A. Coan,et al.  Transaction commit in a realistic timing model , 1990, Distributed Computing.

[161]  Maurice Herlihy,et al.  New Perspectives in Distributed Computing , 1999, MFCS.

[162]  Nancy A. Lynch,et al.  A Lower Bound for the Time to Assure Interactive Consistency , 1982, Inf. Process. Lett..

[163]  P. M. Melliar-Smith,et al.  Synchronizing clocks in the presence of faults , 1985, JACM.

[164]  Jalal Kawash,et al.  DEFINING AND COMPARING MEMORY CONSISTENCY MODELS , 1997 .

[165]  Yehuda Afek,et al.  Wait-free made fast , 1995, STOC '95.

[166]  Oded Goldreich,et al.  On the complexity of global computation in the presence of link failures: the case of uni-directional faults , 1992, PODC '92.

[167]  Maurice Herlihy,et al.  A Wait-Free Classification of Loop Agreement Tasks , 1998, DISC.

[168]  Thomas H. Bredt.  The mutual exclusion problem , 1970 .

[169]  Sam Toueg,et al.  The weakest failure detector for solving consensus , 1996, JACM.

[170]  Maurice Herlihy,et al.  Unifying synchronous and asynchronous message-passing models , 1998, PODC '98.

[171]  Jon M. Kleinberg,et al.  Resource bounds and combinations of consensus objects , 1993, PODC '93.

[172]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[173]  A. W. Roscoe,et al.  Topology and category theory in computer science , 1991 .

[174]  Ophir Rachman,et al.  Randomized Consensus in Expected O(n²log n) Operations , 1991, WDAG.

[175]  Anna R. Karlin,et al.  Asymptotically tight bounds for computing with faulty arrays of processors , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[176]  David G. Kirkpatrick,et al.  Tight lower bounds for probabilistic solitude verification on anonymous rings , 1994, JACM.

[177]  Shlomo Moran,et al.  On the Robustness of h^r_m , 1996, WDAG.

[178]  Injong Rhee,et al.  The impact of time on the session problem , 1992, PODC '92.

[179]  Eric Schenk,et al.  Faster approximate agreement with multi-writer registers , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[180]  Yoram Moses,et al.  A Layered Analysis of Consensus , 2002, SIAM J. Comput..

[181]  Shlomi Dolev,et al.  Self Stabilization , 2004, J. Aerosp. Comput. Inf. Commun..

[182]  David S. Greenberg,et al.  Choice coordination with multiple alternatives , 1992 .

[183]  MosesYoram,et al.  Knowledge and common knowledge in a byzantine environment: crash failures , 1990 .

[184]  John D. Valois.  Space bounds for transactional synchronization , 1996, PODC '96.

[185]  Maurice Herlihy,et al.  Algebraic spans , 1995, PODC '95.

[186]  Danny Dolev,et al.  On the minimal synchronism needed for distributed consensus , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[187]  Nancy A. Lynch,et al.  Efficiency of Synchronous Versus Asynchronous Distributed Systems , 1983, J. ACM.

[188]  David G. Kirkpatrick,et al.  Randomized function evaluation on a ring , 1987, Distributed Computing.

[189]  Ambuj K. Singh,et al.  Fault tolerance bounds for memory consistency , 1997, PODC '97.

[190]  Shmuel Zaks,et al.  Deciding 1-sovability of distributed task is NP-hard , 1990, WG.

[191]  Maurice Herlihy,et al.  The topological structure of asynchronous computability , 1999, JACM.

[192]  Nicola Santoro,et al.  Time is Not a Healer , 1989, STACS.

[193]  Eli Gafni,et al.  Immediate atomic snapshots and fast renaming , 1993, PODC '93.

[194]  Maurice Herlihy,et al.  Wait-Free Implementations in Message-Passing Systems , 1999, Theor. Comput. Sci..

[195]  Ziv Bar-Joseph,et al.  A tight lower bound for randomized synchronous consensus , 1998, PODC '98.

[196]  Nir Shavit,et al.  Atomic snapshots of shared memory , 1990, JACM.

[197]  Manhoi Choy,et al.  Mixed consistency: a model for parallel programming (extended abstract) , 1994, PODC '94.

[198]  James H. Anderson,et al.  An improved lower bound for the time complexity of mutual exclusion , 2001, PODC '01.

[199]  Brian A. Coan,et al.  The Distributed Firing Squad Problem , 1989, SIAM J. Comput..

[200]  R. Stephenson.  A and V , 1962, The British journal of ophthalmology.

[201]  Michael K. Reiter,et al.  Objects shared by Byzantine processes , 2000, Distributed Computing.

[202]  James Aspnes,et al.  Randomized Consensus in Expected O(n log² n) Operations Per Processor , 1996, SIAM J. Comput..

[203]  Miguel Oom Temudo de Castro,et al.  Practical Byzantine fault tolerance , 1999, OSDI '99.

[204]  Sam Toueg,et al.  Effects of Message Loss on the Termination of Distributed Protocols , 1988, Inf. Process. Lett..

[205]  Nancy A. Lynch,et al.  The Need for Headers: An Impossibility Result for Communication over Unreliable Channels , 1990, CONCUR.

[206]  Michael Saks,et al.  Optimal Space Distributed Order-Preserving Lists , 1999, J. Algorithms.

[207]  Andrew Chi-Chih Yao,et al.  On the improbability of reaching Byzantine agreements , 1989, STOC '89.

[208]  Hans L. Bodlaender,et al.  New Lower Bound Techniques for Distributed Leader Finding and Other Problems on Rings of Processors , 1991, Theor. Comput. Sci..

[209]  Danny Dolev,et al.  The Byzantine Generals Strike Again , 1981, J. Algorithms.

[210]  Benny Chor,et al.  Solvability in Asynchronous Environments II: Finite Interactive Tasks , 1999, SIAM J. Comput..

[211]  Soma Chaudhuri,et al.  Understanding the Set Consensus Partial Order Using the Borowsky-Gafni Simulation (Extended Abstract) , 1996, WDAG.

[212]  Baruch Schieber,et al.  The intractability of bounded protocols for on-line sequence transmission over non-FIFO channels , 1992, JACM.

[213]  Faith Ellen,et al.  A tight time lower bound for space-optimal implementations of multi-writer snapshots , 2003, STOC '03.

[214]  Nancy A. Lynch,et al.  Bounds on Shared Memory for Mutual Exclusion , 1993, Inf. Comput..

[215]  Achour Mostéfaoui,et al.  Conditions on input vectors for consensus solvability in asynchronous distributed systems , 2001, STOC '01.

[216]  Faith Ellen,et al.  Lower Bounds in Distributed Computing , 2000, DISC.

[217]  Joseph Y. Halpern,et al.  Optimal precision in the presence of uncertainty , 1985, J. Complex..

[218]  Danny Dolev,et al.  Authenticated Algorithms for Byzantine Agreement , 1983, SIAM J. Comput..

[219]  Gil Neiger,et al.  Causal memory: definitions, implementation, and programming , 1995, Distributed Computing.

[220]  T. Kameda,et al.  Computing functions on asynchronous anonymous networks , 1998, Theory of Computing Systems.

[221]  Yuh-Jzer Joung,et al.  Two decentralized algorithms for strong interaction fairness for systems with unbounded speed variability , 2000, Theor. Comput. Sci..

[222]  Dan Roth,et al.  Linearizable Read/Write Objects , 1999, Theor. Comput. Sci..

[223]  J. Aspnes.  Time-and Space-eecient Randomized Consensus , 1992 .

[224]  Hagit Attiya,et al.  Computing in Totally Anonymous Asynchronous Shared Memory Systems , 1998, DISC.

[225]  Eli Gafni,et al.  A simple algorithmically reasoned characterization of wait-free computation (extended abstract) , 1997, PODC '97.

[226]  Richard J. Anderson,et al.  Wait-free parallel algorithms for the union-find problem , 1991, STOC '91.

[227]  Prabhakar Ragde,et al.  Parallel Algorithms with Processor Failures and Delays , 1996, J. Algorithms.

[228]  Joseph Y. Halpern,et al.  Knowledge and common knowledge in a distributed environment , 1984, JACM.

[229]  Dana Angluin,et al.  Local and global properties in networks of processors (Extended Abstract) , 1980, STOC '80.

[230]  Jennifer L. Welch,et al.  Bounds on the Costs of Multivalued Register Implementations , 1994, SIAM J. Comput..

[231]  Cynthia Dwork,et al.  The inherent cost of nonblocking commitment , 1983, PODC '83.

[232]  Sam Toueg,et al.  Wakeup under Read/Write Atomicity , 1990, WDAG.

[233]  Vassos Hadzilacos,et al.  All of Us Are Smarter than Any of Us: Nondeterministic Wait-Free Hierarchies Are Not Robust , 2000, SIAM J. Comput..

[234]  James H. Anderson,et al.  Time/Contention Trade-Offs for Multiprocessor Synchronization , 1996, Inf. Comput..

[235]  Anoop Gupta,et al.  Memory consistency and event ordering in scalable shared-memory multiprocessors , 1990, [1990] Proceedings. The 17th Annual International Symposium on Computer Architecture.

[236]  Hagit Attiya,et al.  Optimal clock synchronization under different delay assumptions , 1993, PODC '93.

[237]  Nancy A. Lynch,et al.  Easy impossibility proofs for distributed consensus problems , 1985, PODC '85.

[238]  Richard J. Anderson,et al.  Algorithms for the Certified Write-All Problem , 1997, SIAM J. Comput..

[239]  Rajiv Gupta,et al.  On randomization in sequential and distributed algorithms , 1994, CSUR.

[240]  Eric Shenk,et al.  The consensus hierarchy is not robust , 1997, PODC 1997.

[241]  AbrahamsonKarl,et al.  Tight lower bounds for probabilistic solitude verification on anonymous rings , 1994 .

[242]  Hagit Attiya,et al.  Sequential consistency versus linearizability , 1994, TOCS.

[243]  Prasad Jayanti,et al.  Wait-free Computing , 1995, WDAG.

[244]  FeldmanPesech,et al.  An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement , 1997 .

[245]  Michael E. Saks,et al.  Lower bounds for leader election and collective coin-flipping in the perfect information model , 1999, STOC '99.

[246]  Rajeev Alur,et al.  Contention—free complexity of shared memory algorithms , 1994, PODC '94.

[247]  Maurice Herlihy,et al.  Wait-free synchronization , 1991, TOPL.

[248]  Hagit Attiya,et al.  Computing on an anonymous ring , 1988, JACM.

[249]  Hagit Attiya,et al.  Time Bounds for Decision Problems in the Presence of Timing Uncertainty and Failures , 1993, J. Parallel Distributed Comput..

[250]  Nancy A. Lynch,et al.  An Overview of Clock Synchronization , 1986, Fault-Tolerant Distributed Computing.

[251]  K. Mani Chandy,et al.  Parallel program design - a foundation , 1988 .

[252]  Sebastiano Vigna,et al.  An Effective Characterization of Computability in Anonymous Networks , 2001, DISC.

[253]  Zvi Galil,et al.  Two Lower Bounds in Asynchronous Distributed Computation , 1991, J. Comput. Syst. Sci..

[254]  Sebastiano Vigna,et al.  Computing anonymously with arbitrary knowledge , 1999, PODC '99.

[255]  Zvi Galil,et al.  Two lower bounds in asynchronous distributed computation , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[256]  Hagit Attiya,et al.  Language Complexity on the Synchronous Anonymous Ring , 1987, Theor. Comput. Sci..

[257]  Marcos K. Aguilera,et al.  A Simple Bivalency Proof that t-Resilient Consensus Requires t + 1 Rounds , 1998, Inf. Process. Lett..

[258]  Michael E. Saks,et al.  Wait-free k-set agreement is impossible: the topology of public knowledge , 1993, STOC.

[259]  Alon Itai,et al.  Average and Randomized Complexity of Distributed Problems , 1994, SIAM J. Comput..

[260]  Jim Gray,et al.  Notes on Data Base Operating Systems , 1978, Advanced Course: Operating Systems.

[261]  Edsger W. Dijkstra,et al.  Solution of a problem in concurrent programming control , 1965, CACM.

[262]  Silvio Micali,et al.  An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement , 1997, SIAM J. Comput..

[263]  Leslie Lamport,et al.  The Byzantine Generals Problem , 1982, TOPL.

[264]  Maurice Herlihy,et al.  On the space complexity of randomized synchronization , 1993, PODC '93.

[265]  Lisa Higham,et al.  Asymptotically Optimal Election on Weighted Rings , 1994, SIAM J. Comput..

[266]  Leslie Lamport,et al.  Reaching Agreement in the Presence of Faults , 1980, JACM.

[267]  Hagit Attiya,et al.  Better Computing on the Anonymous Ring , 1988, J. Algorithms.

[268]  David G. Kirkpatrick,et al.  The Bit Complexity of Randomized Leader Election on a Ring , 1989, SIAM J. Comput..

[269]  Alan Fekete,et al.  Asymptotically optimal algorithms for approximate agreement , 1986, PODC '86.

[270]  Keith A. Bartlett,et al.  A note on reliable full-duplex transmission over half-duplex links , 1969, Commun. ACM.

[271]  Shmuel Zaks,et al.  Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks , 1990, Theor. Comput. Sci..

[272]  Ralph E. Johnson,et al.  Symmetry and similarity in distributed systems , 1985, PODC '85.

[273]  Wai-Kau Lo,et al.  More on t-resilience vs. wait-freedom (extended abstract) , 1995, PODC '95.

[274]  Alan Fekete,et al.  Approximate Agreement with Mixed Mode Faults: Algorithm and Lower Bound , 1998, DISC.

[275]  Maurice Herlihy,et al.  Set consensus using arbitrary objects (preliminary version) , 1994, PODC '94.

[276]  Edsger W. Dijkstra,et al.  Hierarchical ordering of sequential processes , 1971, Acta Informatica.

[277]  Eric Schenk,et al.  Computability and complexity results for agreement problems in shared memory distributed systems , 1996 .

[278]  Nancy A. Lynch,et al.  Consensus in the presence of partial synchrony , 1988, JACM.

[279]  Hagit Attiya,et al.  Asynchronous Byzantine consensus , 1984, PODC '84.

[280]  Roger Wattenhofer,et al.  An inherent bottleneck in distributed counting , 1997, PODC '97.

[281]  Larry Rudolph,et al.  Efficient synchronization of multiprocessors with shared memory , 1986, PODC '86.

[282]  Noga Alon,et al.  Tight bounds for shared memory systems accessed by Byzantine processes , 2002, Distributed Computing.

[283]  M. Stojev.  Fault-tolerant parallel computation , 1998 .

[284]  Lewis Carroll,et al.  Alice Through the Looking-Glass and What Alice Found There , 1871 .

[285]  Yehuda Afek,et al.  Time and message bounds for election in synchronous and asynchronous complete networks , 1985, PODC '85.

[286]  John M. Rushby,et al.  Systematic Formal Verification for Fault-Tolerant Time-Triggered Algorithms , 1999, IEEE Trans. Software Eng..

[287]  Sam Toueg,et al.  Asynchronous consensus and broadcast protocols , 1985, JACM.

[288]  Nancy A. Lynch,et al.  The impossibility of implementing reliable communication in the face of crashes , 1993, JACM.

[289]  Nancy A. Lynch,et al.  Reaching approximate agreement in the presence of faults , 1986, JACM.

[290]  Yoram Moses,et al.  Programming simultaneous actions using common knowledge , 1987, Algorithmica.

[291]  Jennifer L. Welch,et al.  Closed form bounds for clock synchronization under simple uncertainty assumptions , 2001, Inf. Process. Lett..

[292]  Adarshpal S. Sethi,et al.  Minimal Shared Information for Concurrent Reading and Writing , 1991, WDAG.

[293]  Martha J. Kosa.  Time Bounds for Strong and Hybrid Consistency for Arbitrary Abstract Data Types , 1999, Chic. J. Theor. Comput. Sci..

[294]  Danny Dolev,et al.  On the possibility and impossibility of achieving clock synchronization , 1984, STOC '84.

[295]  Shmuel Zaks,et al.  Optimal Lower Bounds for Some Distributed Algorithms for a Complete Network of Processors , 1989, Theor. Comput. Sci..

[296]  Hagit Attiya,et al.  The Combinatorial Structure of Wait-Free Solvable Tasks , 2002, SIAM J. Comput..

[297]  Naomi Nishimura,et al.  A Model for Asynchronous Shared Memory Parallel Computation , 1994, SIAM J. Comput..

[298]  J FischerMichael,et al.  Efficiency of Synchronous Versus Asynchronous Distributed Systems , 1983 .

[299]  Larry Rudolph,et al.  ParC - An Extension of C for Shared Memory Parallel Processing , 1996, Softw. Pract. Exp..

[300]  David S. Greenberg,et al.  Computing with faulty shared objects , 1995, JACM.

[301]  James Aspnes,et al.  Lower bounds for distributed coin-flipping and randomized consensus , 1997, STOC '97.

[302]  Brian A. Coan,et al.  Simultaneity Is Harder than Agreement , 1991, Inf. Comput..

[303]  Nancy A. Lynch,et al.  The BG distributed simulation algorithm , 2001, Distributed Computing.

[304]  Eli Gafni,et al.  Three-Processor Tasks Are Undecidable , 1999, SIAM J. Comput..

[305]  M. Kaufmann.  What Can Be Computed Locally ? , 2003 .

[306]  Faith Ellen,et al.  The complexity of end-to-end communication in memoryless networks , 1999, PODC '99.

[307]  Amos Israeli,et al.  The Time Complexity of Updating Snapshot Memories , 1994, Inf. Process. Lett..