Improved Solution to the MUTUAL EXCLUSION Problem
Original Publication Date: 1984-Jul-01
Included in the Prior Art Database: 2005-Feb-04
The mutual exclusion problem is the problem of ensuring that, at most, one of N independent processes is engaged in its CRITICAL_SECTION at any one time. Any method addressing this problem must deal with two issues: Ensuring mutual exclusion. Preventing deadlocks. The problem presented here only addresses the case where N equals 2; it does not deal with the generalized mutual exclusion problem. Dijkstra [*] discusses a number of unsatisfactory solutions to this problem before quoting the correct solution discovered by T. J. Decker. The method presented here is an improvement to this solution. Two versions are quoted: one in Dijkstra's formalism and one in a more modern formalism. They are shown respectively in Table 1 and Table 2.