Abstract
The Synchronization primitive P * was introduced by Conradi in order to present a more compact and efficient algorithm for synchronization of concurrent readers and writers. Unfortunately, Conradi's solutions fail when the conventional definitions of semaphores are used in conjunction with this primitive. This paper proposes a definition of the semaphore operations P, V and P * that make Conradi's readers-writers solutions correct. This definition is compatible with the definition given by Dijkstra.
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.
