AWhat changed
Graham bounded how much a fixed-list schedule can worsen when task priorities, durations, precedence constraints or the number of identical processors are changed.
Scientific scope
Graham bounded how much a fixed-list schedule can worsen when task priorities, durations, precedence constraints or the number of identical processors are changed. The scheduling results use the paper’s machine, dependency and task-duration model. They bound specified list-scheduling behavior and illustrate anomalies; they do not establish that adding resources always worsens performance or solve every scheduling objective optimally. Changes in precedence, communication cost and processor heterogeneity need separate analysis.
Evidence
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.
Contributors
- R. L. Graham · SCIENCE: Original source-listed scientific author of this scoped work; byline does not determine effort fractions.
- R. L. Graham, Bounds for Certain Multiprocessing Anomalies, author-hosted original scan
- Publisher Crossref deposit for Graham 1966 scheduling-anomaly paper
Provisional WRS assessment, edition 2026-10-16.1. Independent expert calibration is pending. This grade does not certify correctness or assign ownership.
Full scientific record · Browse contribution grades · Request a correction