"Peterson's algorithm" meaning in English

See Peterson's algorithm in All languages combined, or Wiktionary

Proper name

Etymology: Formulated by Gary L. Peterson in 1981. Head templates: {{en-prop}} Peterson's algorithm
  1. (computing theory) 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. Categories (topical): Theory of computing Synonyms: Peterson's solution
{
  "etymology_text": "Formulated by Gary L. Peterson in 1981.",
  "head_templates": [
    {
      "args": {},
      "expansion": "Peterson's algorithm",
      "name": "en-prop"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "name",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Theory of computing",
          "orig": "en:Theory of computing",
          "parents": [
            "Computer science",
            "Computing",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "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."
      ],
      "id": "en-Peterson's_algorithm-en-name-kxiU54Lb",
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "concurrent",
          "concurrent"
        ],
        [
          "programming",
          "programming"
        ],
        [
          "algorithm",
          "algorithm"
        ],
        [
          "mutual",
          "mutual"
        ],
        [
          "exclusion",
          "exclusion"
        ],
        [
          "process",
          "process"
        ],
        [
          "share",
          "share"
        ],
        [
          "resource",
          "resource"
        ],
        [
          "conflict",
          "conflict"
        ],
        [
          "memory",
          "memory"
        ],
        [
          "communication",
          "communication"
        ]
      ],
      "raw_glosses": [
        "(computing theory) 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": [
        {
          "word": "Peterson's solution"
        }
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "word": "Peterson's algorithm"
}
{
  "etymology_text": "Formulated by Gary L. Peterson in 1981.",
  "head_templates": [
    {
      "args": {},
      "expansion": "Peterson's algorithm",
      "name": "en-prop"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "name",
  "senses": [
    {
      "categories": [
        "English entries with incorrect language header",
        "English eponyms",
        "English lemmas",
        "English multiword terms",
        "English proper nouns",
        "English uncountable nouns",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Theory of computing"
      ],
      "glosses": [
        "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."
      ],
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "concurrent",
          "concurrent"
        ],
        [
          "programming",
          "programming"
        ],
        [
          "algorithm",
          "algorithm"
        ],
        [
          "mutual",
          "mutual"
        ],
        [
          "exclusion",
          "exclusion"
        ],
        [
          "process",
          "process"
        ],
        [
          "share",
          "share"
        ],
        [
          "resource",
          "resource"
        ],
        [
          "conflict",
          "conflict"
        ],
        [
          "memory",
          "memory"
        ],
        [
          "communication",
          "communication"
        ]
      ],
      "raw_glosses": [
        "(computing theory) 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": [
        {
          "word": "Peterson's solution"
        }
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "word": "Peterson's algorithm"
}

Download raw JSONL data for Peterson's algorithm meaning in English (1.4kB)


This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2025-01-08 from the enwiktionary dump dated 2025-01-01 using wiktextract (9a96ef4 and 4ed51a5). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.

If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.