Hirschberg–Sinclair algorithm

The Hirschberg–Sinclair algorithm is a distributed algorithm designed for leader election problem in a synchronous ring network. It is named after its inventors, Dan Hirschberg and . The algorithm requires the use of unique IDs (UID) for each process. The algorithm works in phases and sends its UID out in both directions. The message goes out a distance of 2Phase Number hops and then the message heads back to the originating process. While the messages are heading "out" each receiving process will compare the incoming UID to its own. If the UID is greater than its own UID then it will continue the message on. Otherwise if the UID is less than its own UID, it will not pass the information on. At the end of a phase, a process can determine if it will send out messages in the next round by if

Comment
enThe Hirschberg–Sinclair algorithm is a distributed algorithm designed for leader election problem in a synchronous ring network. It is named after its inventors, Dan Hirschberg and . The algorithm requires the use of unique IDs (UID) for each process. The algorithm works in phases and sends its UID out in both directions. The message goes out a distance of 2Phase Number hops and then the message heads back to the originating process. While the messages are heading "out" each receiving process will compare the incoming UID to its own. If the UID is greater than its own UID then it will continue the message on. Otherwise if the UID is less than its own UID, it will not pass the information on. At the end of a phase, a process can determine if it will send out messages in the next round by if
Has abstract
enThe Hirschberg–Sinclair algorithm is a distributed algorithm designed for leader election problem in a synchronous ring network. It is named after its inventors, Dan Hirschberg and . The algorithm requires the use of unique IDs (UID) for each process. The algorithm works in phases and sends its UID out in both directions. The message goes out a distance of 2Phase Number hops and then the message heads back to the originating process. While the messages are heading "out" each receiving process will compare the incoming UID to its own. If the UID is greater than its own UID then it will continue the message on. Otherwise if the UID is less than its own UID, it will not pass the information on. At the end of a phase, a process can determine if it will send out messages in the next round by if it received both of its incoming messages. Phases continue until a process receives both of its out messages, from both of its neighbors. At this time the process knows it is the largest UID in the ring and declares itself the leader.
Is primary topic of
Hirschberg–Sinclair algorithm
Label
enHirschberg–Sinclair algorithm
Link from a Wikipage to an external page
books.google.com/books%3Fid=2wsrLg-xBGgC&pg=PA482%7Cisbn=9780080504704
books.google.com/books%3Fid=NlVBtVPeR0QC&pg=PA111%7Ctitle=Elements
books.google.com/books%3Fid=vlpnS25qAJQC&pg=PA232
Link from a Wikipage to another Wikipage
Category:Distributed algorithms
Communications of the ACM
Dan Hirschberg
Distributed algorithm
J. B. Sinclair
Leader election
Ring network
SameAs
4kRei
Q5636019
Subject
Category:Distributed algorithms
WasDerivedFrom
Hirschberg–Sinclair algorithm?oldid=1055321317&ns=0
WikiPageLength
2329
Wikipage page ID
7817272
Wikipage revision ID
1055321317
WikiPageUsesTemplate
Template:Algorithm-stub
Template:Citation