Peterson's algorithm
Peterson's algorithm proper noun: 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.
Proper noun
Peterson's algorithm
- 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.
- Synonyms:
- Peterson's solution
Synonyms of Peterson's algorithm
- Peterson's solution
Origin of Peterson's algorithm
Formulated by Gary L. Peterson in 1981.
Questions about Peterson's algorithm
- What does Peterson's algorithm mean?
- Peterson's algorithm means 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.
- What part of speech is Peterson's algorithm?
- Peterson's algorithm is a proper noun.
Words near Peterson's algorithm in the dictionary
Source and license
Adapted from Wiktionary: Peterson's algorithm (page history and authors). Text available under the Creative Commons Attribution-ShareAlike 4.0 license. Word.ws reformatted the entry and added links. Wiktionary data of 2026-09-02.
Last updated:
Cite this entry: “Peterson's algorithm.” Word.ws, https://word.ws/peterson%27s_algorithm. Based on Wiktionary, CC BY-SA 4.0.
