Distributed Mutual Exclusion on a Ring of Processes

Martin, Alain J. (1984) Distributed Mutual Exclusion on a Ring of Processes. Technical Report. California Institute of Technology. [CaltechCSTR:1984.5080-tr-83]

Full text available as:

	Other (Adobe PDF (842KB))
	Postscript - Requires a viewer, such as GhostView

Abstract

A set of processes called "masters" are sharing a critical section on a mutual exclusion basis. The servers communicate with each other in a ring. Three solutions for solving the mutual exclusion problem are presented. They all rely on the presence of a unique privilege in the ring. The notation used extends CSP input and output commands with a Boolean primitive, the "probe", which makes it possible to determine whether a communication action is pending on a channel. A master communicates only with its private "server". In the correctness proofs, the concept of "trace" is introduced, i.e. a total ordering of actions corresponding to a possible interleaving of the atomic actions of a concurrent computation. [Note: report includes the date April 83/October 83 but published in 1984]

EPrint Type:	Monograph (Technical Report)
Subjects:	All Records
ID Code:	403
Deposited By:	Caltech Library System
Deposited On:	07 August 2002
Record Number:	CaltechCSTR:1984.5080-tr-83
Official Persistent URL:	http://resolver.caltech.edu/CaltechCSTR:1984.5080-tr-83
Usage Policy:	You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format.

Archive Staff Only: edit this record