Safe registers can achieve correct implementation of peterson’s two process mutual exclusion algorithm

Abstract

Most of the mutual exclusion algorithms in a shared memory system assume that memory reference to at least one shared variable used in the algorithm is mutually exclusive. However, we claim that Peterson’s two-process mutual exclusion algorithm need not assume such low level mutual exclusion for its correct implementation. It is shown that the shared variables used in this algorithm need to obey only the safe register axioms. To prove this assertion we propose a temporal logic viz., Temporal ordering Related to Observation. This logic does not allow any assertion related to the future behavior of the predicates.