Unformatted text preview: FIFO ordering is implemented by stamping every message. Causal ordering can be implemented by: 1. Each message is time stamped by a vector where each entry in the vector is the number of messages received by the sender from that group member. 2. Accept a message from process i if a) you have received all previous messages from i and b) you have received all messages seen by i. Otherwise, delay accepting the message. 3. Reject any duplicated message. Figure 1 – Causal ordering diagram Total ordering means that all messages are received in the order they were sent out in. A multicast is not successful unless all recipients receive the message....
View Full Document
This note was uploaded on 01/25/2010 for the course CSC 7103 taught by Professor Kannan,r during the Fall '08 term at LSU.
- Fall '08
- Operating Systems