Consensus in the presence of partial synchrony

  • Authors:

  • Cynthia Dwork;Nancy Lynch;Larry Stockmeyer

  • Affiliations:

  • IBM Almaden Research Center, San Jose, CA/ and Massachusetts Institute of Technology, Cambridge;Massachusetts Institute of Technology, Cambridge;IBM Almaden Research Center, San Jose, CA/ and Massachusetts Institute of Technology, Cambridge

  • Venue:
  • Journal of the ACM (JACM)
  • Year:
  • 1988

Quantified Score

Hi-index 0.03

Visualization

Abstract

The concept of partial synchrony in a distributed system is introduced. Partial synchrony lies between the cases of a synchronous system and an asynchronous system. In a synchronous system, there is a known fixed upper bound &Dgr; on the time required for a message to be sent from one processor to another and a known fixed upper bound &PHgr; on the relative speeds of different processors. In an asynchronous system no fixed upper bounds &Dgr; and &PHgr; exist. In one version of partial synchrony, fixed bounds &Dgr; and &PHgr; exist, but they are not known a priori. The problem is to design protocols that work correctly in the partially synchronous system regardless of the actual values of the bounds &Dgr; and &PHgr;. In another version of partial synchrony, the bounds are known, but are only guaranteed to hold starting at some unknown time T, and protocols must be designed to work correctly regardless of when time T occurs. Fault-tolerant consensus protocols are given for various cases of partial synchrony and various fault models. Lower bounds that show in most cases that our protocols are optimal with respect to the number of faults tolerated are also given. Our consensus protocols for partially synchronous processors use new protocols for fault-tolerant “distributed clocks” that allow partially synchronous processors to reach some approximately common notion of time.