To RTO-multicast (reliable, totally-ordered multicast) a message m, a process attaches a totally-ordered, unique identifier to m and R-multicasts it. Each process records the set of message it has R-delivered and the set of messages it has RTO-delivered. Thus it knows which messages have not yet been RTO-delivered. From time to time it proposes its set of not-yet-RTO-delivered messages as those that should be delivered next. A sequence of runs of the consensus algorithm takes place, where the k’th proposals (k = 1, 2, 3, ...) of all the processes are collected and a unique decision set of messages is the result. When a process receives the k’th consensus decision, it takes the intersection of the decision value and its set of not-yet-RTO-delivered messages and delivers them in the order
What will be an ideal response?
If we used a reliable but not totally ordered multicast, the majority function can only be used meaningfully if it is applied to the same set of values. But, in an asynchronous system, we cannot know how long to wait for the set of all values – the source of a missing message might be slow or it might have crashed. Waiting for the first message delivered by a reliable totally ordered multicast finesses that problem.
You might also like to view...
Local variables must be ________.
a. initialized when they're declared. b. initialized before their values are used in an expression. c. declared and initialized in two steps. d. declared at the top of the method’s body.
What are the benefits of inheritance and Object Oriented Programming?
What will be an ideal response?
A(n) ____________________ is a word, phrase, symbol, or picture that, when tapped or clicked, directs you to another document or website.
Fill in the blank(s) with the appropriate word(s).
One example of a WYSIWYG text editor is a program such as Drupal.
Answer the following statement true (T) or false (F)