Abstract
In this paper we study the message complexity of the problem of distributively electing a leader in chordal rings. We present an election algorithm for a class of chordal rings with constant number of chords at each processor and O( n log log n) message complexity. We also prove that O(log log n) chords at each processor suffice to obtain an O( n) algorithm. This improves a previous work where O(log n) chords at each processor give an O( n) election algorithm. All algorithms are referred to base 2.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
