This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: P1 P2 P3 P1.1 P1.2 P1.3 P1.4 P1.5 P2.1 P2.2 P2.3 P2.4 P2.5 P3.1 P3.2 P3.3 P3.4 P3.5 Figure 2: Timeline for P1, P2, and P3 1 2. (30 points) Consider an event A on P1, and an event B on P2, and an event C on P3. 1. Assume that logical clocks was used, and the time.A=5, time.B=5, and time.C=10. What can you say about the happened-before relationships between events A, B, and C. 2. Assume that vector clocks was used, and the time.A=[5,5,5], time.B=[2,5,5], and time.C=[2,7,10]. What can you say about the happened-before relationships between events A, B, and C. 2...
View Full Document
- Spring '09
- AirTrain Newark, Vector clock, Distributed algorithms, P1.1 P1.2 P1