Self-stabilizing mutual exclusion on a ring, even if K=N

Simple item page
dc.creatorHoepman, Jaap-Henk
dc.date1999-09-21
dc.date.accessioned2026-07-07T03:24:21Z
dc.date.available2026-07-07T03:24:21Z
dc.descriptionWe show that, contrary to common belief, Dijkstra's self-stabilizing mutual exclusion algorithm on a ring [Dij74,Dij82] also stabilizes when the number of states per node is one less than the number of nodes on the ring.
dc.description2 pages
dc.identifierhttps://arxiv.org/abs/cs/9909013
dc.identifierhttp://arxiv.org/abs/cs/9909013
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/33292
dc.subjectDistributed, Parallel, and Cluster Computing
dc.subjectD.4.5; D.1.3
dc.titleSelf-stabilizing mutual exclusion on a ring, even if K=N
dc.typetext

Files

Collections

arXiv