Skip to Main content Skip to Navigation
Conference papers

Time-based Consensus

Abstract : Reaching consensus is fundamental in distributed computing. For each execution of a consensus algorithm, there is no difference between the proposed values by different nodes with respect to their proposed times. By presenting a realistic application scenario related to distributed asynchronous mobile robots in dynamic environments, we argue some safety-critical, real-time systems require reaching consensus on the newest proposed values when the old proposed values may not be valid anymore. Afterward, we formulate a new type of consensus problem called time-based consensus, which requires to take into account the times of proposed values. Finally, to tackle such a consensus problem, we determine an essential characteristic which should be considered.
Document type :
Conference papers
Complete list of metadata

Cited literature [8 references]  Display  Hide  Download
Contributor : Laurence Porte Connect in order to contact the contributor
Submitted on : Monday, June 3, 2019 - 11:02:04 AM
Last modification on : Wednesday, November 3, 2021 - 8:12:40 AM


Files produced by the author(s)




Hasan Heydari, Guthemberg Silvestre, Nicolas Larrieu, Alain Pirovano. Time-based Consensus. Euro-Par 2019, European conference on parallel and distributed processing,, Aug 2019, Gottingen, Germany. ⟨10.1007/978-3-030-48340-1_63⟩. ⟨hal-02145644⟩



Les métriques sont temporairement indisponibles