Bounds for certain multiprocessing anomalies

Graham, R. L. (1966). Bounds for certain multiprocessing anomalies. Bell System Technical Journal, 45(9), 1563-1581.

Type

Journal article

Intellectual base

Primary research

Year

1966

Volume

45

Issue

9

Pages

1563-1581

DOI registrant

Wiley

Link

https://doi.org/10.1002/j.1538-7305.1966.tb01709.xmatched

Cited from

computer_science

Cited by

1 citation across 1 artifact.

Each citation links to the sentence it supports in the citing article.

Primes

• Load Balancing
  • The system's throughput, latency, or reliability is governed not by how much capacity it owns in total but by how evenly that capacity is engaged.

    This sourceFoundational result on assigning jobs to identical processors to minimize the makespan (the completion time of the most-loaded machine); establishes that the objective is governed by the busiest unit, a min-max criterion, and bounds greedy list scheduling within 2 − 1/m of optimal.

Verification

Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.

Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

Registry ID ref:096bc3022f90 · see in the full table