Download
yo yo leader election n.
Skip this Video
Loading SlideShow in 5 Seconds..
YO-YO Leader Election PowerPoint Presentation
Download Presentation
YO-YO Leader Election

YO-YO Leader Election

458 Vues Download Presentation
Télécharger la présentation

YO-YO Leader Election

- - - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript

  1. YO-YO Leader Election Lijie Wang 6982704

  2. Using SPIN Used to detect design error in applications; descriptions of distributed algorithms.

  3. YO-YO Algorithm Minimum finding Leader(smallest id node) Consists two parts Preprocessing Iterations

  4. Basic Components Edge Between nodes Voting through Node Id Neighbors

  5. Edge Direction Small->large (id) Preprocessing Node Exchange its id with neighbors

  6. DAG

  7. Direction goes down using different ico

  8. Candidates Local minima ->source ->candidate Preprocessing completed Second part start…

  9. Two phases YO- -YO Iteration Remove candidates Leave the only one

  10. All sink done -> YO- end… Source: ⊙->id-> out neighbors Internal: ->all in neighbors->⊙->min->out neighbors Sink: ->all in neighbors-> ⊙

  11. -YO start… Sink: ⊙->Y ->min; ⊙-> N->others Internal: ->all out neighbors-> ⊙ Receive at least one N: ⊙->N-> all in neighbors Receive all Y: ⊙->Y->min; ⊙->N->others Source: all out neighbors -> ⊙

  12. Receive all Y Survives (this time) Eliminate candidates Receive at least one N No longer a candidate How?...

  13. Modify DAG Flip the link with N Reverse N-edge With reversing Sink and internal not become candidate Receive at least one N No longer a candidate Become sink or internal less candidate

  14. Drag down the dead candidates And start over…

  15. YO- [2]

  16. -YO [2]

  17. Flip [2]

  18. Termination? To reduce the message To detect termination Only left one source Count the only one candidate Become the leader Additional mechanism Pruning

  19. Pruning Eliminate redundant route Eliminate leaf

  20. Pruning [1]

  21. Pruning [2]

  22. Pruning more [2]

  23. Pruning [3]

  24. Complexity With pruning Though we do not know the exact number of reduced message in each iteration. Surely, the communication cost will be less remarkable Total: 2* Without pruning Each phase: 2 messages each link Number of phase: log (number of sources) Total: 2*m*log(s)

  25. For the spin result Ispin result will be show in the final report Fail to intallIspin on the 64-bit system Try to use the Virtual Machine with a 32-bit system Thank you