Editing Peterson's algorithm (section)

{{Short description|Concurrent programming algorithm for mutual exclusion}}
'''Peterson's algorithm''' (or '''Peterson's solution''') is a [[concurrent programming]] [[algorithm]] for [[mutual exclusion]] that allows two or more processes to share a single-use resource without conflict, using only shared memory for [[communication]]. It was formulated by [[Gary L. Peterson]] in 1981.<ref name="original">G. L. Peterson: "Myths About the Mutual Exclusion Problem", ''Information Processing Letters'' 12(3) 1981, 115–116</ref> While Peterson's original formulation worked with only two processes, the algorithm can be generalized for more than two.<ref>As discussed in ''Operating Systems Review'', January 1990 ("Proof of a Mutual Exclusion Algorithm", M Hofri).</ref>