Impossibility Results for Distributed Computing

To understand the power of distributed systems, it is necessary to understand their inherent limitations: what problems cannot be solved in particular systems, or without sufficient resources (such as time or space). This book presents key techniques for proving such impossibility results and applies them to a variety of different problems in a variety of different system models. Insights gained from these results are highlighted, aspects of a problem that make it difficult are isolated, features of an architecture that make it inadequate for solving certain problems efficiently are identified, and different system models are compared. Table of Contents: Acknowledgments / Introduction / Indistinguishability / Shifting and Scaling / Scenario Arguments / Information Theory Arguments / Covering Arguments / Valency Arguments / Combinatorial Arguments / Reductions and Simulations / Bibliography / Authors' Biographies

[1]  Hagit Attiya,et al.  Tight bounds for asynchronous randomized consensus , 2007, STOC '07.

[2]  Faith Ellen,et al.  Tight Bounds for Adopt-Commit Objects , 2013, Theory of Computing Systems.

[3]  Wojciech M. Golab,et al.  Linearizable implementations do not suffice for randomized distributed computation , 2011, STOC '11.

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

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

[6]  Faith Ellen,et al.  Efficient synchronous snapshots , 2004, PODC '04.

[7]  Nancy A. Lynch,et al.  Designing algorithms for distributed systems with partially synchronized clocks , 1993, PODC '93.

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

[9]  Faith Ellen,et al.  Lower bounds for adaptive collect and related objects , 2004, PODC '04.

[10]  Hagit Attiya,et al.  Polylogarithmic concurrent data structures from monotone circuits , 2012, JACM.

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

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

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

[14]  Yehuda Afek,et al.  A completeness theorem for a class of synchronization objects , 1993, PODC '93.

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

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

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

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

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

[20]  Andrew Chi-Chih Yao,et al.  Probabilistic computations: Toward a unified measure of complexity , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[21]  Hagit Attiya,et al.  Inherent Limitations on Disjoint-Access Parallel Implementations of Transactional Memory , 2010, Theory of Computing Systems.

[22]  Baruch Awerbuch,et al.  Atomic shared register access by asynchronous hardware , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[23]  Sam Toueg,et al.  Generalized Irreducibility of Consensus and the Equivalence of t-Resilient and Wait-Free Implementations of Consensus , 2004, SIAM J. Comput..

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

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

[26]  Hagit Attiya,et al.  Counting-Based Impossibility Proofs for Renaming and Set Agreement , 2012, DISC.

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

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

[29]  Faith Ellen,et al.  The complexity of updating snapshot objects , 2011, J. Parallel Distributed Comput..

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

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

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

[33]  Faith Ellen,et al.  Hundreds of impossibility results for distributed computing , 2003, Distributed Computing.

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

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

[36]  Nir Shavit,et al.  On the Inherent Sequentiality of Concurrent Objects , 2012, SIAM J. Comput..

[37]  Yoram Moses,et al.  Knowledge and Common Knowledge in a Byzantine Environment I: Crash Failures , 1986, TARK.

[38]  Faith Ellen,et al.  The space complexity of unbounded timestamps , 2008, Distributed Computing.

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

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

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

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

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

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

[45]  James Aspnes.  A modular approach to shared-memory consensus, with applications to the probabilistic-write model , 2010, PODC '10.

[46]  Hagit Attiya,et al.  Atomic snapshots in O(n log n) operations , 1993, PODC '93.

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

[48]  Danny Hendler,et al.  Time and Space Lower Bounds for Implementations Using k-CAS , 2005, IEEE Transactions on Parallel and Distributed Systems.

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

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

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

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

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

[54]  Maryam Helmi,et al.  The Space Complexity of Long-Lived and One-Shot Timestamp Implementations , 2011, JACM.

[55]  Amos Israeli,et al.  Linear-time snapshot implementations in unbalanced systems , 1995, Mathematical systems theory.

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

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

[58]  Yoram Moses,et al.  Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds , 1998, SIAM J. Comput..

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

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

[61]  Paul Beame.  Limits on the Power of Concurrent-Write Parallel Machines , 1988, Inf. Comput..

[62]  George Giakkoupis,et al.  A tight RMR lower bound for randomized mutual exclusion , 2012, STOC '12.

[63]  Faith Ellen,et al.  Time lower bounds for implementations of multi-writer snapshots , 2007, JACM.