Partial mutual exclusion for infinitely many processes

Details Partial mutual exclusion for infinitely many processes Partial mutual exclusion for infinitely many processes

2011-11-24

arxiv.org/abs/1111.5775v2

Computer Science

Distributed, Parallel, and Cluster Computing

Scientific paper

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 the property of first-come first-served, in so far as this can be guaranteed by asynchronous messages. For every execution of CS and every process in nbh, between three and six messages are needed. The correctness of the solution is argued with invariants and temporal logic. It has been verified with the proof assistant PVS.

Affiliated with

Also associated with

No associations

Rating

Partial mutual exclusion for infinitely many processes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Partial mutual exclusion for infinitely many processes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Partial mutual exclusion for infinitely many processes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-157432