Abstract
The problem of real-time leader election in a shared memory environment requires a single processor to be distinguished as the leader and requires an upper bound on the duration for which no leader is present. This processor can be used to provide services that must be continuously available. We propose an improved protocol, which requires O(log N) time and O( N/log N) variables.
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.
