hrcak mascot   Srce   HID

Original scientific paper
https://doi.org/10.2498/cit.2005.01.04

Process Synchronization with Readers and Writers Revisited

Jalal Kawash

Fulltext: english, pdf (492 KB) pages 43-51 downloads: 9.378* cite
APA 6th Edition
Kawash, J. (2005). Process Synchronization with Readers and Writers Revisited. Journal of computing and information technology, 13 (1), 43-51. https://doi.org/10.2498/cit.2005.01.04
MLA 8th Edition
Kawash, Jalal. "Process Synchronization with Readers and Writers Revisited." Journal of computing and information technology, vol. 13, no. 1, 2005, pp. 43-51. https://doi.org/10.2498/cit.2005.01.04. Accessed 11 Apr. 2021.
Chicago 17th Edition
Kawash, Jalal. "Process Synchronization with Readers and Writers Revisited." Journal of computing and information technology 13, no. 1 (2005): 43-51. https://doi.org/10.2498/cit.2005.01.04
Harvard
Kawash, J. (2005). 'Process Synchronization with Readers and Writers Revisited', Journal of computing and information technology, 13(1), pp. 43-51. https://doi.org/10.2498/cit.2005.01.04
Vancouver
Kawash J. Process Synchronization with Readers and Writers Revisited. Journal of computing and information technology [Internet]. 2005 [cited 2021 April 11];13(1):43-51. https://doi.org/10.2498/cit.2005.01.04
IEEE
J. Kawash, "Process Synchronization with Readers and Writers Revisited", Journal of computing and information technology, vol.13, no. 1, pp. 43-51, 2005. [Online]. https://doi.org/10.2498/cit.2005.01.04

Abstracts
The readers-writers problem is one of the very well known problems in concurrency theory. It was first introduced by Courtois et.al. in 1971 [1] and requires the synchronization of processes trying to read and write a shared resource. Several readers are allowed to access the resource simultaneously, but a writer must be given exclusive access to that resource. Courtois et.al. gave semaphore-based solutions to what they called the first and second readers-writers problems. Both of their solutions are prone to starvation. The first allows readers to indefinitely lock out writers and the second allows writers to indefinitely lock out readers. This paper presents and proves correct a third semaphore-based solution, which is starvation-free for both reader and writer processes. To the best of our knowledge, this is the first fair semaphore-based solution that at the same time allows several readers to access the resource simultaneously.

Hrčak ID: 44701

URI
https://hrcak.srce.hr/44701

Visits: 9.596 *