"Amdahl's law" meaning in All languages combined

See Amdahl's law on Wiktionary

Proper name [English]

Etymology: Named after American computer scientist Gene Amdahl (1922–2015). Etymology templates: {{named-after/list|computer scientist||||}} computer scientist, {{!}} |, {{lang|en|Gene Amdahl}} Gene Amdahl, {{named-after|en|Gene Amdahl|born=1922|died=2015|nat=American|occ=computer scientist|wplink==}} Named after American computer scientist Gene Amdahl (1922–2015) Head templates: {{en-proper noun}} Amdahl's law
  1. (computing theory) A formula giving the theoretical speedup in latency of the execution of a task at fixed workload that can be expected of a system whose resources are improved. Categories (topical): Theory of computing
{
  "etymology_templates": [
    {
      "args": {
        "1": "computer scientist",
        "2": "",
        "3": "",
        "4": "",
        "5": ""
      },
      "expansion": "computer scientist",
      "name": "named-after/list"
    },
    {
      "args": {},
      "expansion": "|",
      "name": "!"
    },
    {
      "args": {
        "1": "en",
        "2": "Gene Amdahl"
      },
      "expansion": "Gene Amdahl",
      "name": "lang"
    },
    {
      "args": {
        "1": "en",
        "2": "Gene Amdahl",
        "born": "1922",
        "died": "2015",
        "nat": "American",
        "occ": "computer scientist",
        "wplink": "="
      },
      "expansion": "Named after American computer scientist Gene Amdahl (1922–2015)",
      "name": "named-after"
    }
  ],
  "etymology_text": "Named after American computer scientist Gene Amdahl (1922–2015).",
  "head_templates": [
    {
      "args": {},
      "expansion": "Amdahl's law",
      "name": "en-proper noun"
    }
  ],
  "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"
        }
      ],
      "examples": [
        {
          "ref": "2011, David A. Patterson, John L. Hennessy, Computer Organization and Design: The Hardware/Software Interface, Elsevier, →ISBN, page 52:",
          "text": "We can use Amdahl's law to estimate performance improvements when we know the time consumed for some function and its potential speedup.",
          "type": "quote"
        }
      ],
      "glosses": [
        "A formula giving the theoretical speedup in latency of the execution of a task at fixed workload that can be expected of a system whose resources are improved."
      ],
      "id": "en-Amdahl's_law-en-name-RI6alIre",
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "formula",
          "formula"
        ],
        [
          "theoretical",
          "theoretical"
        ],
        [
          "speedup",
          "speedup"
        ],
        [
          "latency",
          "latency"
        ],
        [
          "execution",
          "execution"
        ],
        [
          "task",
          "task"
        ],
        [
          "workload",
          "workload"
        ],
        [
          "system",
          "system"
        ]
      ],
      "raw_glosses": [
        "(computing theory) A formula giving the theoretical speedup in latency of the execution of a task at fixed workload that can be expected of a system whose resources are improved."
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "word": "Amdahl's law"
}
{
  "etymology_templates": [
    {
      "args": {
        "1": "computer scientist",
        "2": "",
        "3": "",
        "4": "",
        "5": ""
      },
      "expansion": "computer scientist",
      "name": "named-after/list"
    },
    {
      "args": {},
      "expansion": "|",
      "name": "!"
    },
    {
      "args": {
        "1": "en",
        "2": "Gene Amdahl"
      },
      "expansion": "Gene Amdahl",
      "name": "lang"
    },
    {
      "args": {
        "1": "en",
        "2": "Gene Amdahl",
        "born": "1922",
        "died": "2015",
        "nat": "American",
        "occ": "computer scientist",
        "wplink": "="
      },
      "expansion": "Named after American computer scientist Gene Amdahl (1922–2015)",
      "name": "named-after"
    }
  ],
  "etymology_text": "Named after American computer scientist Gene Amdahl (1922–2015).",
  "head_templates": [
    {
      "args": {},
      "expansion": "Amdahl's law",
      "name": "en-proper noun"
    }
  ],
  "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 terms with quotations",
        "English uncountable nouns",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Theory of computing"
      ],
      "examples": [
        {
          "ref": "2011, David A. Patterson, John L. Hennessy, Computer Organization and Design: The Hardware/Software Interface, Elsevier, →ISBN, page 52:",
          "text": "We can use Amdahl's law to estimate performance improvements when we know the time consumed for some function and its potential speedup.",
          "type": "quote"
        }
      ],
      "glosses": [
        "A formula giving the theoretical speedup in latency of the execution of a task at fixed workload that can be expected of a system whose resources are improved."
      ],
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "formula",
          "formula"
        ],
        [
          "theoretical",
          "theoretical"
        ],
        [
          "speedup",
          "speedup"
        ],
        [
          "latency",
          "latency"
        ],
        [
          "execution",
          "execution"
        ],
        [
          "task",
          "task"
        ],
        [
          "workload",
          "workload"
        ],
        [
          "system",
          "system"
        ]
      ],
      "raw_glosses": [
        "(computing theory) A formula giving the theoretical speedup in latency of the execution of a task at fixed workload that can be expected of a system whose resources are improved."
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "word": "Amdahl's law"
}

Download raw JSONL data for Amdahl's law meaning in All languages combined (2.1kB)


This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2024-12-15 from the enwiktionary dump dated 2024-12-04 using wiktextract (8a39820 and 4401a4c). 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.