Fair Solution to the Reader-Writer-Problem with Semaphores only
Distributed, Parallel, and Cluster Computing
2007-05-23 v1
Abstract
The reader-writer-problem is a standard problem in concurrent programming. A resource is shared by several processes which need either inclusive reading or exclusive writing access. The known solutions to this problem typically involve a number of global counters and queues. Here a very simple algorithm is presented which needs only two semaphores for synchronisation and no other global objects. The approach yields a fair solution without starving.
Keywords
Cite
@article{arxiv.cs/0303005,
title = {Fair Solution to the Reader-Writer-Problem with Semaphores only},
author = {H. Ballhausen},
journal= {arXiv preprint arXiv:cs/0303005},
year = {2007}
}
Comments
2 pages