Abstract
For shared memory systems with time and resource constraints such as embedded real-time systems, mutual exclusion mechanism that is both fair and space-efficient can be very useful. In this paper, we present a bounded-bypass algorithm using only two shared variables, regardless of the number of contending processes, by operation fetch&store as well as atomic read/write. To achieve the same level of fairness, we show that, by the same set of operations, two shared variables are necessary, and therefore our algorithm is space-optimal.
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.
