Location of Repository

The Inherent Price of Indulgence

By Partha Dutta and Rachid Guerraoui

Abstract

This paper presents a tight lower bound on the time complexity of indulgent consensus algorithms, i.e., consensus algorithms that use unreliable failure detectors. We state and prove our tight lower bound in the unifying framework of round-by-round fault detectors

Year: 2002
OAI identifier: oai:CiteSeerX.psu:10.1.1.19.3551
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://lpdwww.epfl.ch/rachid/p... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.