FAIR MUTUAL EXCLUSION ON A GRAPH OF PROCESSES
作者： Jan L. A. van de Snepscheut
DOI: 10.1007/BF01667083
关键词:
摘要: We represent a set of communicating processes by graph. The mutual exclusion problem is solved for an arbitrary connected solution shown to be fair.
springer.com
narcis.nl参考文章(1)
Alain J. Martin, Distributed mutual exclusion on a ring of processes Science of Computer Programming. ,vol. 5, pp. 265- 276 ,(1985) , 10.1016/0167-6423(85)90015-2