A general framework to solve agreement problems

@article{Hurfin1999AGF,
  title={A general framework to solve agreement problems},
  author={Michel Hurfin and Raimundo J. A. Mac{\^e}do and Michel Raynal and Fr{\'e}d{\'e}ric Tronel},
  journal={Proceedings of the 18th IEEE Symposium on Reliable Distributed Systems},
  year={1999},
  pages={56-65}
}
  • M. Hurfin, R. Macêdo, F. Tronel
  • Published 18 October 1999
  • Computer Science
  • Proceedings of the 18th IEEE Symposium on Reliable Distributed Systems
Agreement problems are among the most important problems designers of distributed systems have to cope with. A way to solve them is to first provide a solution to the Consensus problem and then to reduce each agreement problem to Consensus. This "run-time customizing" approach is particularly relevant when upper layer applications have to solve several distinct agreement problems. We investigate a "compile-time customizing" approach to automatically generate ad hoc agreement protocols. A… 

Figures and Tables from this paper

Making Consensus Practical
This paper presents the abstraction of lazy consensus and argues for its use as an effective component for building distributed agreement protocols in practical asynchronous systems where processes
Open consensus
This paper presents the abstraction of open consensus and argues for its use as an effective component for building reliable agreement protocols in practical asynchronous systems where processes and
A Backward Algorithm in a Distributed Agreement Computing
TLDR
A flexible agreement protocol of multiple peers is discussed by taking into account human behaviors in social agreement procedures in a fully unstructured peer-to-peer (P2P) model which defines a recoverable cut which is a satisfiable set of previous values which every peer can back.
Consensus in asynchronous distributed systems
TLDR
This paper focuses on the models proposed to overcome the impossibility of deterministically reaching consensus when even one single fault occurs in an asynchronous system and the research originated from them.
Design and Performance Evaluation of a Resource Allocation System Based on Agreement Services
  • M. Hurfin, J. Narzul
  • Computer Science
    2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
  • 2008
TLDR
The major aim of this paper is to investigate the benefits and the limits of the adaptive control mechanisms proposed through some performance evaluations.
Using Agreement Services in Grid Computing
TLDR
Paradis is presented, an adaptive middleware based on a set of basic agreement services that has been integrated within an experimental Grid dedicated to genomic applications.
A protocol for reliably, flexibly, and efficiently making agreement among peers
TLDR
A flexible agreement protocol of multiple peers by taking into account human behaviours in a fully unstructured P2P system model is discussed, which discusses how peers cooperate to take consistent strategies at each round.
A NEGOTIATION-BASED APPROACH OF CONSISTENCY FOR DYNAMIC ADAPTATION JÉRÉMY BUISSON
TLDR
This article presents a negotiation-based approach for reaching an agreement on the distributed algorithm executed by the threads to find a special point in the future of its execution path at which it is able to modify itself.
AGREEMENT-RELATED PROBLEMS: FROM SEMI-PASSIVE REPLICATION TO TOTALLY ORDERED BROADCAST
TLDR
This dissertation mainly focuses on three important agreements problems: Replication, Total Order Broadcast, and Con-sensus.
A Reconfigurable System Architecture for Consensus-based Group Communication
TLDR
This paper presents a system architecture focusing on (re-)configurability of group communication systems with total message ordering that can be configured to work with different failure models and low-level communication protocols without changing the application.
...
...

References

SHOWING 1-10 OF 12 REFERENCES
Consensus service: a modular approach for building agreement protocols in distributed systems
TLDR
This work describes a consensus service and suggests its use for the construction of fault-tolerant agreement protocols, using a classical client-server interaction, and illustrates its approach on non-blocking atomic commitment and on view synchronous multicast.
A solution to atomic commitment based on an extended consensus protocol
  • M. Hurfin, F. Tronel
  • Computer Science
    Proceedings of the Sixth IEEE Computer Society Workshop on Future Trends of Distributed Computing Systems
  • 1997
TLDR
An extension of an algorithm that Chandra and Toueg proposed to solve consensus using /spl square/S failure detectors is presented, arguing that this extension is a simple and efficient building block which can be used to solve various agreement problems.
Solving the consensus problem in a mobile environment
  • N. Badache, M. Hurfin, R. Macêdo
  • Computer Science
    1999 IEEE International Performance, Computing and Communications Conference (Cat. No.99CH36305)
  • 1999
TLDR
This paper presents an extension of Chandra and Toueg's protocol that allows to solve this fundamental problem in a mobile environment: based on their initial states, a set of mobile hosts must agree on a common decision, despite disconnections, changes of location and failures of mobile/fixed hosts.
A lightweight solution to uniform atomic broadcast for asynchronous systems
  • E. Anceaume
  • Computer Science
    Proceedings of IEEE 27th International Symposium on Fault Tolerant Computing
  • 1997
TLDR
This paper presents an extension of the Consensus problem that enables all the processes to propose a flow of messages during an execution and uses all these proposed messages to compose its decision value.
Revistiting the Relationship Between Non-Blocking Atomic Commitment and Consensus
TLDR
This paper confirms that NB-AC is harder than Consensus, and shows actually that any algorithm that solves Consensus with unreliable failure detectors also solves Uniform Consensus.
Impossibility of distributed consensus with one faulty process
TLDR
It is shown that every protocol for this problem has the possibility of nontermination, even with only one faulty process, in the asynchronous consensus problem.
Non blocking atomic commitment with an unreliable failure detector
TLDR
This paper presents a non-blocking atomic commitment protocol in an asynchronous system augmented with an unreliable failure detector that can make an infinity of false failure suspicions.
Unreliable failure detectors for reliable distributed systems
TLDR
It is proved that Consensus and Atomic Broadcast are reducible to each other in asynchronous systems with crash failures; thus, the above results also apply to Atomic Broadcast.
Fault-tolerant Total Order Multicast to asynchronous groups
TLDR
The paper proposes a protocol based on two underlying building blocks, namely, Uniform Reliable Multicast and Uniform Consensus, based on which only the sender of a message and processes of its destination groups have to participate in the multicast of the message.
Semi-passive replication
TLDR
This paper presents the semi-passive replication technique, a variant of passive replication, that can be implemented in the asynchronous system model without requiring a membership service to agree on a primary, and can benefit from an aggressive time-out value significantly lower than what a group membership allows.
...
...