hw2-sol-sp11 - ECE428/CS425/CSE424 Distributed Systems...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Each question is worth 10 points. 1. In the illustration below, three processes perform multicast. Which of the following ordering property is achieved in this example? (i) FIFO ordering, (ii) total ordering, (iii) causal ordering. (i) FIFO ordering is achieved (ii) Since message b arrives before message c is sent, message a should arrive at P1 before message c to achieve causal ordering. Hence, causal ordering is not achieved. (iii) The order of message a and c at P1 is different from the order at other processes. Hence, total ordering is not achieved. 2. Suppose that the timeline below corresponds to a system that implements the causal ordering algorithm for multicast discussed in class (Figure 12.16 in the textbook, 4 th edition). Mark vector timestamp at each event in the figure, and indicate for each received message at each process whether it can be delivered immediately on receipt, or must be buffered until a later time. A means ‘Accepted’ and B means ‘Buffered’. A vector timestamp (a,b,c) represents (a=P1’s timestamp,b=P2’s timestamp, c=P3’s timestamp).
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 3

hw2-sol-sp11 - ECE428/CS425/CSE424 Distributed Systems...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online