Impossibility of Boosting Distributed Service

[1]  Rachid Guerraoui,et al.  On Failure Detectors and Type Boosters , 2003, DISC.

[2]  Rachid Guerraoui,et al.  A realistic look at failure detectors , 2002, Proceedings International Conference on Dependable Systems and Networks.

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

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

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

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

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

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

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

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

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

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

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

[14]  Soma Chaudhuri,et al.  Agreement is harder than consensus: set consensus problems in totally asynchronous systems , 1990, PODC '90.

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

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