"superoptimization" meaning in English

See superoptimization in All languages combined, or Wiktionary

Noun

Etymology: Coined by American computer scientist and programmer Alexia Massalin in 1987, from super- + optimization. Etymology templates: {{coin|en|Q14073|in=1987|nobycat=1}} Coined by American computer scientist and programmer Alexia Massalin in 1987, {{prefix|en|super|optimization}} super- + optimization Head templates: {{en-noun|-}} superoptimization (uncountable)
  1. (software compilation) A form of peephole optimization that typically uses an exhaustive brute-force search across all possible sequences of machine instructions. Wikipedia link: superoptimization Tags: uncountable Categories (topical): Compilation Related terms: superoptimizer

Download JSON data for superoptimization meaning in English (2.4kB)

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "Q14073",
        "in": "1987",
        "nobycat": "1"
      },
      "expansion": "Coined by American computer scientist and programmer Alexia Massalin in 1987",
      "name": "coin"
    },
    {
      "args": {
        "1": "en",
        "2": "super",
        "3": "optimization"
      },
      "expansion": "super- + optimization",
      "name": "prefix"
    }
  ],
  "etymology_text": "Coined by American computer scientist and programmer Alexia Massalin in 1987, from super- + optimization.",
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "superoptimization (uncountable)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English terms prefixed with super-",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Compilation",
          "orig": "en:Compilation",
          "parents": [
            "Computing",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "examples": [
        {
          "ref": "2023 June 5, Daniel J. Mankowitz, Andrea Michi, Anton Zhernov, Marco Gelmi, Marco Selvi, “Faster sorting algorithms discovered using deep reinforcement learning”, in Nature, volume 618, number 7964, →DOI, →ISSN, pages 257–263",
          "text": "As such, we implemented a state-of-the-art stochastic superoptimization approach, adapted it to the sort setting and used it as the learning algorithm in AlphaDev.",
          "type": "quotation"
        }
      ],
      "glosses": [
        "A form of peephole optimization that typically uses an exhaustive brute-force search across all possible sequences of machine instructions."
      ],
      "id": "en-superoptimization-en-noun-GMJcPuhG",
      "links": [
        [
          "software",
          "software"
        ],
        [
          "compilation",
          "compilation"
        ],
        [
          "peephole optimization",
          "peephole optimization"
        ],
        [
          "exhaustive",
          "exhaustive"
        ],
        [
          "brute-force",
          "brute force"
        ],
        [
          "search",
          "search"
        ],
        [
          "machine instruction",
          "machine instruction"
        ]
      ],
      "raw_glosses": [
        "(software compilation) A form of peephole optimization that typically uses an exhaustive brute-force search across all possible sequences of machine instructions."
      ],
      "related": [
        {
          "word": "superoptimizer"
        }
      ],
      "tags": [
        "uncountable"
      ],
      "topics": [
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences",
        "software-compilation"
      ],
      "wikipedia": [
        "superoptimization"
      ]
    }
  ],
  "word": "superoptimization"
}
{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "Q14073",
        "in": "1987",
        "nobycat": "1"
      },
      "expansion": "Coined by American computer scientist and programmer Alexia Massalin in 1987",
      "name": "coin"
    },
    {
      "args": {
        "1": "en",
        "2": "super",
        "3": "optimization"
      },
      "expansion": "super- + optimization",
      "name": "prefix"
    }
  ],
  "etymology_text": "Coined by American computer scientist and programmer Alexia Massalin in 1987, from super- + optimization.",
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "superoptimization (uncountable)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "related": [
    {
      "word": "superoptimizer"
    }
  ],
  "senses": [
    {
      "categories": [
        "English coinages",
        "English entries with incorrect language header",
        "English lemmas",
        "English nouns",
        "English terms prefixed with super-",
        "English terms with quotations",
        "English uncountable nouns",
        "en:Compilation"
      ],
      "examples": [
        {
          "ref": "2023 June 5, Daniel J. Mankowitz, Andrea Michi, Anton Zhernov, Marco Gelmi, Marco Selvi, “Faster sorting algorithms discovered using deep reinforcement learning”, in Nature, volume 618, number 7964, →DOI, →ISSN, pages 257–263",
          "text": "As such, we implemented a state-of-the-art stochastic superoptimization approach, adapted it to the sort setting and used it as the learning algorithm in AlphaDev.",
          "type": "quotation"
        }
      ],
      "glosses": [
        "A form of peephole optimization that typically uses an exhaustive brute-force search across all possible sequences of machine instructions."
      ],
      "links": [
        [
          "software",
          "software"
        ],
        [
          "compilation",
          "compilation"
        ],
        [
          "peephole optimization",
          "peephole optimization"
        ],
        [
          "exhaustive",
          "exhaustive"
        ],
        [
          "brute-force",
          "brute force"
        ],
        [
          "search",
          "search"
        ],
        [
          "machine instruction",
          "machine instruction"
        ]
      ],
      "raw_glosses": [
        "(software compilation) A form of peephole optimization that typically uses an exhaustive brute-force search across all possible sequences of machine instructions."
      ],
      "tags": [
        "uncountable"
      ],
      "topics": [
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences",
        "software-compilation"
      ],
      "wikipedia": [
        "superoptimization"
      ]
    }
  ],
  "word": "superoptimization"
}

This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-05-06 from the enwiktionary dump dated 2024-05-02 using wiktextract (f4fd8c9 and c9440ce). 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.