Automatically Adjusting Concurrency to the Level of Synchrony

The state machine approach is a well-known technique for building distributed services requiring high performance and high availability, by replicating servers, and by coordinating client interactions with server replicas using consensus. Indulgent consensus algorithms exist for realistic eventually partially synchronous models, that never violate safety and guarantee liveness once the system becomes synchronous. Unavoidably, these algorithms may never terminate, even when no processor crashes, if the system never becomes synchronous.

[1]  Marcos K. Aguilera,et al.  Partial synchrony based on set timeliness , 2012, Distributed Computing.

[2]  Leslie Lamport,et al.  Time, clocks, and the ordering of events in a distributed system , 1978, CACM.

[3]  Michel Raynal,et al.  The renaming problem in shared memory systems: An introduction , 2011, Comput. Sci. Rev..

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

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

[6]  Alan M. Frieze,et al.  The Cover Times of Random Walks on Hypergraphs , 2011, SIROCCO.

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

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

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

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

[11]  Rachid Guerraoui,et al.  Generalized Universality , 2011, CONCUR.

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

[13]  Leslie Lamport,et al.  The part-time parliament , 1998, TOCS.

[14]  Fred B. Schneider,et al.  Implementing fault-tolerant services using the state machine approach: a tutorial , 1990, CSUR.

[15]  Nancy A. Lynch,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[16]  Eli Gafni.  The extended BG-simulation and the characterization of t-resiliency , 2009, STOC '09.

[17]  Marek Karpinski,et al.  Foundations of Computation Theory , 1983 .

[18]  Flaviu Cristian,et al.  The Timed Asynchronous Distributed System Model , 1998, IEEE Trans. Parallel Distributed Syst..

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

[20]  Michel Raynal,et al.  Renaming Is Weaker Than Set Agreement But for Perfect Renaming: A Map of Sub-consensus Tasks , 2012, LATIN.

[21]  Dan Alistarh,et al.  Generating Fast Indulgent Algorithms , 2011, Theory of Computing Systems.

[22]  Marcos K. Aguilera,et al.  Dynamic atomic storage without consensus , 2009, PODC '09.

[23]  Marcos K. Aguilera,et al.  Adaptive progress: a gracefully-degrading liveness property , 2010, Distributed Computing.

[24]  Idit Keidar,et al.  On the cost of fault-tolerant consensus when there are no faults: preliminary version , 2001, SIGA.

[25]  Parosh Aziz Abdulla,et al.  Advanced Ramsey-Based Büchi Automata Inclusion Testing , 2011, CONCUR.

[26]  Hagit Attiya,et al.  Sharing memory robustly in message-passing systems , 1990, PODC '90.

[27]  Nancy A. Lynch,et al.  On the Borowsky-Gafni simulation algorithm , 1996, PODC '96.

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

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

[30]  David Fernández-Baca.  LATIN 2012: Theoretical Informatics , 2012, Lecture Notes in Computer Science.

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

[32]  Michel Raynal,et al.  The universe of symmetry breaking tasks , 2011, PODC '11.

[33]  Hagit Attiya.  Adapting to Point Contention with Long-Lived Safe Agreement , 2006, SIROCCO.

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

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

[36]  Christian Scheideler,et al.  Stabilization, Safety, and Security of Distributed Systems , 2012, Lecture Notes in Computer Science.

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

[38]  Michel Raynal,et al.  The multiplicative power of consensus numbers , 2010, PODC '10.

[39]  Michel Raynal,et al.  Visiting Gafni's Reduction Land: From the BG Simulation to the Extended BG Simulation , 2009, SSS.

[40]  Nancy A. Lynch,et al.  Impossibility of distributed consensus with one faulty process , 1985, JACM.

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