Fair Solution to the Reader-Writer-Problem with Semaphores only
<|reference_start|>Fair Solution to the Reader-Writer-Problem with Semaphores only: 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.<|reference_end|>
@article{ballhausen2003fair,
    title={Fair Solution to the Reader-Writer-Problem with Semaphores only},
    author={H. Ballhausen},
    journal={arXiv preprint arXiv:cs/0303005},
    year={2003},
    archivePrefix={arXiv},
    eprint={cs/0303005},
    primaryClass={cs.DC}
}