The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf
.
Partial mutual exclusion for infinitely many processes
[article]
2011
arXiv
pre-print
Partial mutual exclusion is the drinking philosophers problem for complete graphs. It is the problem that a process may enter a critical section CS of its code only when some finite set nbh of other processes are not in their critical sections. For each execution of CS, the set nbh can be given by the environment. We present a starvation free solution of this problem in a setting with infinitely many processes, each with finite memory, that communicate by asynchronous messages. The solution has
arXiv:1111.5775v2
fatcat:mulbn7ykxngbrbs44nkt7345oe