Abstract
The Lamport's mutual exclusion exclusion algorithm, also known as the bakery algorithm, is very simple and easy to implement. However, the ticket numbers assigned to the processes wishing to enter the critical section can become indeterminately large. This paper resolves this problem by allowing the ticket numbers to move around a ring of length 2 N , where N is the number of processes. The comparison of two ticket numbers is based the distance between them and their magnitudes.
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.
