Round-by-Round Fault Detectors: Unifying Synchrony and Asynchrony”

Eli M. Gafni · 1998

and insights. 1 Introduction For many years, researchers studying synchronous message-passing systems have considered algorithms composed of rounds of computation. In each round, a process sends a message to the others and then waits to receive messages from the other processes. The synchronous nature of the system ensures that, by the end of the round, each process receives all messages sent to it in that round by correct processes. In the parlance of Elrad and Frances [1] then, each round of a synchronous system is a communication-closed-layer.

Read the paper · More papers on PaperTik