(en.wikipedia.org) Peterson's algorithm - Wikipedia

ROAM_REFS: https://en.wikipedia.org/wiki/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. While Peterson's original formulation worked with only two processes, the algorithm can be generalized for more than two.

Local Graph

org-roam 2c97c02a-9707-456f-8182-c4ae9fdd97b3 (en.wikipedia.org) Peterson's algorit... //en.wikipedia.org/wiki/Concurrent_programming https://en.wikipedia.org/wiki/Concurrent_programming 2c97c02a-9707-456f-8182-c4ae9fdd97b3->//en.wikipedia.org/wiki/Concurrent_programming //en.wikipedia.org/wiki/Algorithm https://en.wikipedia.org/wiki/Algorithm 2c97c02a-9707-456f-8182-c4ae9fdd97b3->//en.wikipedia.org/wiki/Algorithm //en.wikipedia.org/wiki/Mutual_exclusion https://en.wikipedia.org/wiki/Mutual_exclusion 2c97c02a-9707-456f-8182-c4ae9fdd97b3->//en.wikipedia.org/wiki/Mutual_exclusion //en.wikipedia.org/wiki/Communication https://en.wikipedia.org/wiki/Communication 2c97c02a-9707-456f-8182-c4ae9fdd97b3->//en.wikipedia.org/wiki/Communication //en.wikipedia.org/w/index.php?title=Gary_L._Peterson&action=edit&redlink=1 //en.wikipedia.org/w/index.php?title=Gary_L._Peterson&action=edit&redlink=1 2c97c02a-9707-456f-8182-c4ae9fdd97b3->//en.wikipedia.org/w/index.php?title=Gary_L._Peterson&action=edit&redlink=1 //en.wikipedia.org/w/index.php?title=Gary_L._Peterson&action=edit&redlink=1 https://en.wikipedia.org/w/index.php?title=Gary_L._Peterson&action=edit&redlink=1 2a07e4ea-610b-4c9a-bb84-d961fb2450e5 Code and Coffee Book Club 2a07e4ea-610b-4c9a-bb84-d961fb2450e5->2c97c02a-9707-456f-8182-c4ae9fdd97b3