Neither Vector Wins
Three processes A, B and C keep vector clocks indexed [A, B, C]. The rules in use: a process increments its own entry on every event it performs, including sends and receives, and a receive first takes the element-wise maximum with the vector piggybacked on the message.
| event | process | what happened | vector after |
|---|---|---|---|
| e1 | A | local update | [1,0,0] |
| e2 | A | send m1 to B | [2,0,0] |
| e3 | B | receive m1 | [2,1,0] |
| e4 | C | local update | [0,0,1] |
| e5 | B | send m2 to C | [2,2,0] |
| e6 | C | receive m2 | [2,2,2] |
| e7 | A | local update | [3,0,0] |
Which of these pairs is concurrent?
Sign in to answer questions and track your progress
Sign In