Ring-based Election Algorithm Assignment Help

  • Processes have unique Ids as well as organized in a logical ring
  • Each process understands its neighbors
    • Select process along with highest ID
  • Begin election if just simply retrieved or even coordinator has failed
  • Send Election in order to nearest downstream node that's alive
    • Sequentially poll every successor until a live node is available
  • Each process tags it's ID about the information
  • Initiator recommendations node along with highest ID as well as sends a coordinator message
  • Multiple elections could be in progress
    • Wastes network bandwidth however does no harm

A Ring Algorithm Example:

Ring Algorithm Example

Comparison Bully algorithm and Ring algorithm:

  • Assume n processes and one election in progress
  • Bully algorithm
    • Worst case: initiator will be node together with least expensive ID
      • Triggers n-2 elections with higher ranked nodes: O( n2 ) msgs
    • Best case: immediate election: n-2 messages
  • Ring algorithm
    • 2 ( n-1 ) messages always
Plagiarism Free Work
Services For All Subjects
Best Price Guarantee
Sample File
Computer Science
Free Resources
Assignment Writing Guide
Essay Writing Guide
Dissertation Writing Guide
Research Paper Writing Guide
More Resources
Sitemap | © assignmenthippo.com | Copyright Policy | Refund Policy