{
  "profile": "wrs-published-research-view-1",
  "edition": "ratings-e039106f30dec177",
  "content_trust": "UNTRUSTED_SCIENTIFIC_DATA_NOT_TOOL_INSTRUCTIONS",
  "entry": {
    "id": "gustafson-scaled-workload-speedup-1988",
    "title": "Gustafson: larger machines can tackle larger workloads",
    "summary": "Gustafson argued that parallel computing should also be evaluated with workloads that expand as processor counts grow, deriving scaled speedup and reporting near-linear results for three Sandia applications on a 1,024-processor system.\n\nAdding processors often gives disappointing results when a fixed task still contains work that must run in sequence. Amdahl’s model explains this limitation. Gustafson asked a different practical question: what happens when people use a larger machine to solve a larger problem in a similar amount of time? If the parallel part expands while the serial part stays roughly fixed, the amount of completed work can grow almost in proportion to the processor count. His 1988 note gives the scaled-speedup expression and reports three scientific-computing examples from Sandia. This does not contradict Amdahl: the two formulas normalize the serial fraction against different workloads and different execution times. The original note attributes the alternative formulation to E. Barsis and cites a joint application report. Communication, memory costs, load imbalance and growing serial work can still limit actual scaling. The reported applications are evidence claimed by the authors, rather than measurements rerun by WRS. The lesson is to state what grows and what stays fixed before interpreting a speedup number.",
    "boundary": "Scaled speedup holds the chosen parallel execution workload/time viewpoint and serial fraction fixed. It complements rather than refutes fixed-workload Amdahl limits. Communication, memory, load balance and changing serial work remain costs. The reported machine experiments are particular cases, not a guarantee of linear speedup for arbitrary software.",
    "area": "Parallel computing and performance models",
    "topic": "Computer architecture",
    "year": 1988,
    "lane": "HUMAN",
    "result": "THEORY",
    "package_id": "gustafson-scaled-workload-speedup-1988",
    "target": {
      "record_id": "urn:uuid:c604e776-ace3-47ea-a893-aa7f7c35171b",
      "version": 1,
      "content_hash": "sha256:6e8bd7d21fbbb34516a87af1ba2d4f587f339cc85d0bdd9096a34811fc2effc1"
    },
    "humans": [
      "John L. Gustafson"
    ],
    "authors_complete": true,
    "human_role_note": "Source-listed contributors to this scoped work. Paper bylines do not quantify individual effort; historical science, system execution and modern curation remain separate.",
    "agents": [],
    "related": [
      "amdahl-single-processor-limit-1967"
    ],
    "subresults": [],
    "scientific_assessment": {
      "source_review": "SOURCE_CURATED",
      "scientific_review": "NOT_REVIEWED_BY_WRS",
      "formal_replay": "NOT_RUN",
      "provider_attestation": "NONE"
    },
    "sources": [
      {
        "id": "wrs24-gustafson1988-full-reformatted",
        "title": "Gustafson,ReevaluatingAmdahl’sLaw(1988),university-hostedcomplete3pagereformattedreproduction",
        "url": "https://users.cs.utah.edu/~hari/teaching/paralg/Gustafson88.pdf"
      },
      {
        "id": "wrs24-gustafson1988-publisher-metadata",
        "title": "Publisher-depositedCrossrefJSON for10.1145/42411.42415",
        "url": "https://api.crossref.org/works/10.1145%2F42411.42415"
      }
    ],
    "points": "95000",
    "published_grade": {
      "id": "gustafson-scaled-workload-speedup-1988",
      "entry_id": "gustafson-scaled-workload-speedup-1988",
      "band": "A",
      "modifier": null,
      "target": {
        "record_id": "urn:uuid:c604e776-ace3-47ea-a893-aa7f7c35171b",
        "version": 1,
        "content_hash": "sha256:6e8bd7d21fbbb34516a87af1ba2d4f587f339cc85d0bdd9096a34811fc2effc1"
      },
      "what_changed": "Gustafson argued that parallel computing should also be evaluated with workloads that expand as processor counts grow, deriving scaled speedup and reporting near-linear results for three Sandia applications on a 1,024-processor system.",
      "scope": "Gustafson argued that parallel computing should also be evaluated with workloads that expand as processor counts grow, deriving scaled speedup and reporting near-linear results for three Sandia applications on a 1,024-processor system. Scaled speedup holds the chosen parallel execution workload/time viewpoint and serial fraction fixed. It complements rather than refutes fixed-workload Amdahl limits. Communication, memory, load balance and changing serial work remain costs. The reported machine experiments are particular cases, not a guarantee of linear speedup for arbitrary software.",
      "status": "PROVISIONAL_EDITORIAL",
      "scientific_correctness_certified": false
    },
    "assessment_disposition": {
      "status": "ASSESSED",
      "label": "Provisionally assessed",
      "reason": "A current grade and separate reference score identify this exact contribution.",
      "target": {
        "record_id": "urn:uuid:c604e776-ace3-47ea-a893-aa7f7c35171b",
        "version": 1,
        "content_hash": "sha256:6e8bd7d21fbbb34516a87af1ba2d4f587f339cc85d0bdd9096a34811fc2effc1"
      },
      "edition": "ratings-e039106f30dec177"
    }
  },
  "version": {
    "kind": "PUBLIC_RECORD_VIEW",
    "previous": null,
    "published_at": "2026-10-03T00:00:00Z",
    "publisher": {
      "principal_id": "urn:uuid:80116931-785b-40a2-a24b-9d59db0c7e33",
      "role": "WRS_EDITORIAL_PUBLICATION"
    },
    "record": {
      "contributors": [
        {
          "attribution_basis": "SOURCE_CITED",
          "credit": "historical_scientific",
          "entity_kind": "historical_person",
          "name": "John L. Gustafson",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "formulator"
          ],
          "source": {
            "citation": "Gustafson,ReevaluatingAmdahl’sLaw(1988),university-hostedcomplete3pagereformattedreproduction",
            "url": "https://users.cs.utah.edu/~hari/teaching/paralg/Gustafson88.pdf"
          }
        }
      ],
      "evidence": [
        {
          "description": "Bibliographic/stated-result source; not a WRS proof verification",
          "id": "source-0",
          "kind": "source_reference",
          "source": {
            "citation": "Gustafson,ReevaluatingAmdahl’sLaw(1988),university-hostedcomplete3pagereformattedreproduction",
            "url": "https://users.cs.utah.edu/~hari/teaching/paralg/Gustafson88.pdf"
          }
        },
        {
          "description": "Bibliographic/stated-result source; not a WRS proof verification",
          "id": "source-1",
          "kind": "source_reference",
          "source": {
            "citation": "Publisher-depositedCrossrefJSON for10.1145/42411.42415",
            "url": "https://api.crossref.org/works/10.1145%2F42411.42415"
          }
        }
      ],
      "origin": "HUMAN_LEGACY",
      "record_profile": "wrs-local-research-notes-0.1",
      "record_type": "research_note",
      "rrp_version": "0.1",
      "scope": {
        "description": "Scaled speedup holds the chosen parallel execution workload/time viewpoint and serial fraction fixed. It complements rather than refutes fixed-workload Amdahl limits. Communication, memory, load balance and changing serial work remain costs. The reported machine experiments are particular cases, not a guarantee of linear speedup for arbitrary software.",
        "domain": "Parallel computing and performance models"
      },
      "sources": [
        {
          "citation": "Gustafson,ReevaluatingAmdahl’sLaw(1988),university-hostedcomplete3pagereformattedreproduction",
          "url": "https://users.cs.utah.edu/~hari/teaching/paralg/Gustafson88.pdf"
        },
        {
          "citation": "Publisher-depositedCrossrefJSON for10.1145/42411.42415",
          "url": "https://api.crossref.org/works/10.1145%2F42411.42415"
        }
      ],
      "statement": "# Gustafson: larger machines can tackle larger workloads\n\nGustafson argued that parallel computing should also be evaluated with workloads that expand as processor counts grow, deriving scaled speedup and reporting near-linear results for three Sandia applications on a 1,024-processor system.\n\nAdding processors often gives disappointing results when a fixed task still contains work that must run in sequence. Amdahl’s model explains this limitation. Gustafson asked a different practical question: what happens when people use a larger machine to solve a larger problem in a similar amount of time? If the parallel part expands while the serial part stays roughly fixed, the amount of completed work can grow almost in proportion to the processor count. His 1988 note gives the scaled-speedup expression and reports three scientific-computing examples from Sandia. This does not contradict Amdahl: the two formulas normalize the serial fraction against different workloads and different execution times. The original note attributes the alternative formulation to E. Barsis and cites a joint application report. Communication, memory costs, load imbalance and growing serial work can still limit actual scaling. The reported applications are evidence claimed by the authors, rather than measurements rerun by WRS. The lesson is to state what grows and what stays fixed before interpreting a speedup number.\n\n## Scientific scope\n\nScaled speedup holds the chosen parallel execution workload/time viewpoint and serial fraction fixed. It complements rather than refutes fixed-workload Amdahl limits. Communication, memory, load balance and changing serial work remain costs. The reported machine experiments are particular cases, not a guarantee of linear speedup for arbitrary software.\n\n## People and systems\n\nJohn L. Gustafson\n\n\n\n## Original sources\n\n- [Gustafson,ReevaluatingAmdahl’sLaw(1988),university-hostedcomplete3pagereformattedreproduction](https://users.cs.utah.edu/~hari/teaching/paralg/Gustafson88.pdf)\n- [Publisher-depositedCrossrefJSON for10.1145/42411.42415](https://api.crossref.org/works/10.1145%2F42411.42415)\n",
      "summary": "Gustafson argued that parallel computing should also be evaluated with workloads that expand as processor counts grow, deriving scaled speedup and reporting near-linear results for three Sandia applications on a 1,024-processor system.\n\nAdding processors often gives disappointing results when a fixed task still contains work that must run in sequence. Amdahl’s model explains this limitation. Gustafson asked a different practical question: what happens when people use a larger machine to solve a larger problem in a similar amount of time? If the parallel part expands while the serial part stays roughly fixed, the amount of completed work can grow almost in proportion to the processor count. His 1988 note gives the scaled-speedup expression and reports three scientific-computing examples from Sandia. This does not contradict Amdahl: the two formulas normalize the serial fraction against different workloads and different execution times. The original note attributes the alternative formulation to E. Barsis and cites a joint application report. Communication, memory costs, load imbalance and growing serial work can still limit actual scaling. The reported applications are evidence claimed by the authors, rather than measurements rerun by WRS. The lesson is to state what grows and what stays fixed before interpreting a speedup number.",
      "title": "Gustafson: larger machines can tackle larger workloads"
    },
    "record_id": "urn:uuid:c604e776-ace3-47ea-a893-aa7f7c35171b",
    "version": 1,
    "source_ref": {
      "record_id": "urn:uuid:c604e776-ace3-47ea-a893-aa7f7c35171b",
      "version": 1,
      "content_hash": "sha256:6e8bd7d21fbbb34516a87af1ba2d4f587f339cc85d0bdd9096a34811fc2effc1"
    },
    "export_view": "wrs-public-editorial-view-1",
    "public_view_hash": "sha256:e42fe0f55c12cddebe1a84141680f1a71fd699fc83f12be5d4457a36aeaca517"
  },
  "target": {
    "record_id": "urn:uuid:c604e776-ace3-47ea-a893-aa7f7c35171b",
    "version": 1,
    "content_hash": "sha256:6e8bd7d21fbbb34516a87af1ba2d4f587f339cc85d0bdd9096a34811fc2effc1"
  },
  "published_grade": {
    "profile": "wrs-published-grade-1",
    "edition": "2026-10-28.1",
    "id": "gustafson-scaled-workload-speedup-1988",
    "entry_id": "gustafson-scaled-workload-speedup-1988",
    "revision": 1,
    "title": "Gustafson: larger machines can tackle larger workloads",
    "context": "Parallel computing and performance models",
    "track": "Parallel computing and performance models",
    "band": "A",
    "modifier": null,
    "status": "PROVISIONAL_EDITORIAL",
    "assessed_on": "2026-10-04",
    "evidence_cutoff": "2026-10-04",
    "achievement_state": "SUPPORTED_SCOPED_RESULT",
    "what_changed": "Gustafson argued that parallel computing should also be evaluated with workloads that expand as processor counts grow, deriving scaled speedup and reporting near-linear results for three Sandia applications on a 1,024-processor system.",
    "scope": "Gustafson argued that parallel computing should also be evaluated with workloads that expand as processor counts grow, deriving scaled speedup and reporting near-linear results for three Sandia applications on a 1,024-processor system. Scaled speedup holds the chosen parallel execution workload/time viewpoint and serial fraction fixed. It complements rather than refutes fixed-workload Amdahl limits. Communication, memory, load balance and changing serial work remain costs. The reported machine experiments are particular cases, not a guarantee of linear speedup for arbitrary software.",
    "evidence_summary": "Source-linked, scoped account of the original work. The published scope states the scientific assumptions and remaining verification limits. WRS has not independently certified the full proof, experimental result or system benchmark.",
    "references": [
      {
        "title": "Gustafson, Reevaluating Amdahl’s Law(1988), university-hostedcomplete 3 pagereformattedreproduction",
        "url": "https://users.cs.utah.edu/~hari/teaching/paralg/Gustafson88.pdf",
        "locator": "Original linked work. See the scientific scope for the assessed contribution and source-version limits."
      },
      {
        "title": "Publisher-deposited Crossref JSON for 10.1145/42411.42415",
        "url": "https://api.crossref.org/works/10.1145%2F42411.42415",
        "locator": "Original linked work. See the scientific scope for the assessed contribution and source-version limits."
      }
    ],
    "roles": [
      {
        "who": "John L. Gustafson",
        "did": "Original source-listed scientific author of this scoped work; byline does not determine effort fractions.",
        "credit": "SCIENCE"
      }
    ],
    "target": {
      "record_id": "urn:uuid:c604e776-ace3-47ea-a893-aa7f7c35171b",
      "version": 1,
      "content_hash": "sha256:6e8bd7d21fbbb34516a87af1ba2d4f587f339cc85d0bdd9096a34811fc2effc1"
    },
    "scientific_correctness_certified": false,
    "independent_expert_calibration": false,
    "method": "PROPRIETARY",
    "points": "95000"
  },
  "canonical_agent_submission": false,
  "scientific_verification_awarded": false,
  "reader_guide": null,
  "reading_status": "SOURCE_LINKED_NOTE"
}