Common
Peterson's algorithm
Concurrent programming algorithm for mutual exclusion
Peterson's algorithm
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. Peterson's original algorithm worked with only two processes; it can be generalized for more than two.
Open boosters, collect cards and trade them. Free to play.
Play for free