Peterson's algorithm

When working at the hardware level, Peterson's algorithm is typically not needed to achieve atomic access.

Dekker's or Peterson's algorithm are possible substitutes if atomic locking operations are not available.

Peterson's algorithm is the step 2 of the generalized BCH decoding procedure.

The filter algorithm generalizes Peterson's algorithm for N processes.

On architectures without such operations, or if high-level language implementation is required, a non-atomic locking algorithm may be used, e.g. Peterson's algorithm.

Peterson's algorithm (AKA Peterson's solution) is a concurrent programming algorithm for mutual exclusion that allows two processes to share a single-use resource without conflict, using only shared memory for communication.