The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Bounds for Certain Multiprocessing Anomalies
Abstract
It is known that in multiprocessing systems composed of many identical processing units operating in parallel, certain timing anomalies may occur; e.g., an increase in the number of processing units can cause an increase in the total length of time needed to process a fixed set of tasks. In this paper, precise bounds are derived for several anomalies of this type.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Production and Stabilization of Real-Time Task Schedules
Manacher, G. K. (1967) · Journal of the ACM · doi:10.1145/321406.321408 · Cited by 90
Sequencing Aspects of Multiprogramming
Heller, J. (1961) · Journal of the ACM · doi:10.1145/321075.321086 · Cited by 28
Cited by
Scheduling algorithms for multiprogramming in a hard-real-time environment
Liu, C. L., & Layland, J. W. (1973) · Journal of the ACM · doi:10.1145/321738.321743 · Cited by 8,433
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
LIU, C. L., & LAYLAND, J. W. (2002) · Readings in Hardware/Software Co-Design · doi:10.1016/b978-155860702-6/50016-8 · Cited by 3,233
The worst-case execution-time problem—overview of methods and survey of tools
Wilhelm, R., Engblom, J., Ermedahl, A., Holsti, N., Thesing, S., Whalley, D., Bernat, G., Ferdinand, C., Heckmann, R., Mitra, T., et al. (2008) · ACM Transactions on Embedded Computing Systems · doi:10.1145/1347375.1347389 · Cited by 1,871
Proof verification and the hardness of approximation problems
Arora, S., Lund, C., Motwani, R., Sudan, M., & Szegedy, M. (1998) · Journal of the ACM · doi:10.1145/278298.278306 · Cited by 1,413
Static scheduling algorithms for allocating directed task graphs to multiprocessors
Kwok, Y.-K., & Ahmad, I. (1999) · ACM Computing Surveys · doi:10.1145/344588.344618 · Cited by 1,314
Metadata
- Authors
- Graham, R. L.
- Venue
- Bell System Technical Journal
- Published
- 1966-11
- Volume
- 45
- Issue
- 9
- Pages
- 1563-1581
- ISSN
- 0005-8580 (ISSN-L)
- OpenAlex
- W2089269509
- Cited by
- 1,647
- References
- 2
- FWCI
- 0.75
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Bounds for Certain Multiprocessing Anomalies. https://app.cochat.ai/papers/10.1002/j.1538-7305.1966.tb01709.x
- The paper
- Graham, R. L. (1966). Bounds for Certain Multiprocessing Anomalies. Bell System Technical Journal. https://doi.org/10.1002/j.1538-7305.1966.tb01709.x
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.