Fair Solution to the Reader-Writer-Problem with Semaphores only

Simple item page
dc.creatorBallhausen, H.
dc.date2003-03-08
dc.date.accessioned2026-07-07T03:19:30Z
dc.date.available2026-07-07T03:19:30Z
dc.descriptionThe 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.
dc.description2 pages
dc.identifierhttps://arxiv.org/abs/cs/0303005
dc.identifierhttp://arxiv.org/abs/cs/0303005
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/31484
dc.subjectDistributed, Parallel, and Cluster Computing
dc.subjectD.1.3
dc.titleFair Solution to the Reader-Writer-Problem with Semaphores only
dc.typetext

Files

Collections

arXiv