• DocumentCode
    1971164
  • Title

    One-step Consensus with Zero-Degradation

  • Author

    Dobre, Dan ; Suri, Neeraj

  • Author_Institution
    Dept. of Comput. Sci., Tech. Hochschule Darmstadt
  • fYear
    2006
  • fDate
    25-28 June 2006
  • Firstpage
    137
  • Lastpage
    146
  • Abstract
    In the asynchronous distributed system model, consensus is obtained in one communication step if all processes propose the same value. Assuming f<n/3, this is regardless of the failure detector output. A zero-degrading protocol reaches consensus in two communication steps in every stable run, i.e., when the failure detector makes no mistakes and its output does not change. We show that no leader-based consensus protocol can be simultaneously one-step and zero-degrading. We propose two approaches to circumvent the impossibility result and present corresponding consensus protocols. Further, we present an atomic broadcast protocol that has a latency of 3delta in every stable run and a latency of 2delta in case of no collisions. Finally, we evaluate its performance in a cluster of workstations
  • Keywords
    computational complexity; distributed processing; fault tolerant computing; protocols; asynchronous distributed system model; atomic broadcast protocol; failure detector output; leader-based consensus protocol; one-step consensus; workstation cluster; zero-degrading protocol; Atomic measurements; Broadcasting; Change detection algorithms; Computer science; Delay; Detectors; Fault tolerant systems; Protocols; Stability; Workstations;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Dependable Systems and Networks, 2006. DSN 2006. International Conference on
  • Conference_Location
    Philadelphia, PA
  • Print_ISBN
    0-7695-2607-1
  • Type

    conf

  • DOI
    10.1109/DSN.2006.55
  • Filename
    1633503