• DocumentCode
    3549413
  • Title

    How fast can eventual synchrony lead to consensus?

  • Author

    Dutta, Partha ; Guerraoui, Rachid ; Lamport, Leslie

  • Author_Institution
    Ecole Polytech. Fed. de Lausanne, Switzerland
  • fYear
    2005
  • fDate
    28 June-1 July 2005
  • Firstpage
    22
  • Lastpage
    27
  • Abstract
    It is well known that the consensus problem can be solved in a distributed system if, after some time TS, no process fails and there is some upper bound δ on how long it takes to deliver a message. We know of no existing algorithm that guarantees consensus among N processes before time TS+O(Nδ). We show that consensus can be achieved by time TS+O(δ).
  • Keywords
    computational complexity; distributed algorithms; fault tolerant computing; message passing; synchronisation; computational complexity; consensus problem; distributed algorithms; distributed system; eventual synchrony; fault tolerant computing; message passing; Clocks; Delay; Stability; Upper bound;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Dependable Systems and Networks, 2005. DSN 2005. Proceedings. International Conference on
  • Print_ISBN
    0-7695-2282-3
  • Type

    conf

  • DOI
    10.1109/DSN.2005.54
  • Filename
    1467776
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3549413