Une nouvelle approche à la résolubilité du consensus
Vendredi 17 juin 2005Bernadette Charron-Bost
In a recent paper, Gafni has generalized the round-based computational model for synchronous systems to any type of systems. We combine this approach with the one proposed by Santoro and Widmayer. The result is a round-by-round model (or RbR model) in which the responsibility of non-reception of a message is no more attributed to a specific component (process, link). We study various algorithms for Consensus in the RbR model, and show how their correctness can be expressed by predicates over transmissions. Some of the Consensus algorithms that we propose are derived from well-known algorithms, and our approach provides new insights into their structure.
Pierre.Sens (at) nulllip6.fr