From Principles of Cyber-Physical Systems

Exercise 4.14: For the leader election protocol of figure 4.21, consider s ring with 16 nodes where the identifiers of the processes in order are: 25, 3, 6, 15, 19. 8, 7, 14, 4, 22, 21. 18, 24. 1, 10, 23. Which process will be elected as the leader? nat in queue nat) xull; y- Enqueue(ny ID, null) A: Enqueue(in, x) AEnpty(y)outDequeue(y) Lead status! leader Checki ih := Dequeue(x) xEnqueue(idi.y) Undec { id := id ; id:= 0; i0; Enqueue(id, y) h ids := Dequeue(x) | | Check2 status!follower Follow Enqueue(Dequeue(x),y) leader, follover status nat out Figure 4.21: Asynchronous Leader Election in a Ring Exercise 4.14: For the leader election protocol of figure 4.21, consider s ring with 16 nodes where the identifiers of the processes in order are: 25, 3, 6, 15, 19. 8, 7, 14, 4, 22, 21. 18, 24. 1, 10, 23. Which process will be elected as the leader? nat in queue nat) xull; y- Enqueue(ny ID, null) A: Enqueue(in, x) AEnpty(y)outDequeue(y) Lead status! leader Checki ih := Dequeue(x) xEnqueue(idi.y) Undec { id := id ; id:= 0; i0; Enqueue(id, y) h ids := Dequeue(x) | | Check2 status!follower Follow Enqueue(Dequeue(x),y) leader, follover status nat out Figure 4.21: Asynchronous Leader Election in a Ring