Failure Detection Lower Bounds on Registers and Consensus

  • Authors:
  • Carole Delporte-Gallet;Hugues Fauconnier;Rachid Guerraoui

  • Affiliations:
  • -;-;-

  • Venue:
  • DISC '02 Proceedings of the 16th International Conference on Distributed Computing
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper addresses the problem of determining the weakest failure detector for consensus in a message passing system when t out of n processes can crash (including when n/2 驴 t n-1), by addressing the problem of determining the weakest failure detector for register problem. We complement and, in a precise sense, generalize previous results on the implementability of consensus and registers in a message passing model (augmented with the failure detector abstraction).