作者: Carole Delporte-Gallet , Stéphane Devismes , Hugues Fauconnier , Franck Petit , Sam Toueg
DOI: 10.1007/978-3-540-92221-6_5
关键词: Process memory 、 Failure detector 、 Asynchronous distributed systems 、 Process (computing) 、 Theoretical computer science 、 Consensus 、 Computer science 、 Terminating Reliable Broadcast
摘要: We consider asynchronous distributed systems with message losses and process crashes. study the impact of finite memory on solution to consensus , repeated reliable broadcast . With memory, we show that in some sense is easier solve than broadcast, as difficult consensus: More precisely, can be solved failure detector $\cal S$, ${\cal P}^-$ (a variant perfect which stronger S$) necessary sufficient consensus.