The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Speedup versus efficiency in parallel systems
Abstract
The tradeoff between speedup and efficiency that is inherent to a software system is investigated. The extent to which this tradeoff is determined by the average parallelism of the software system, as contrasted with other, more detailed, characterizations, is shown. The extent to which both speedup and efficiency can simultaneously be poor is bound: it is shown that for any software system and any number of processors, the sum of the average processor utilization (i.e. efficiency) and the attained fraction of the maximum possible speedup must exceed one. Bounds are given on speedup and efficiency, and on the incremental benefit and cost of allocating additional processors. An explicit formulation, as well as bounds, are given for the location of the knee of the execution time-efficiency profile, where the benefit per unit cost is maximized.>
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
Validity of the single processor approach to achieving large scale computing capabilities
Amdahl, G. M. (1967) · Proceedings of the April 18-20, 1967, spring joint computer conference on - AFIPS '67 (Spring) · doi:10.1145/1465482.1465560 · Cited by 4,339
Bounds for Certain Multiprocessing Anomalies
Graham, R. L. (1966) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1966.tb01709.x · Cited by 1,647
The Manchester prototype dataflow computer
Gurd, J. R., Kirkham, C. C., & Watson, I. (1985) · Communications of the ACM · doi:10.1145/2465.2468 · Cited by 463
Denning, P. J. (1980) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1980.230464 · Cited by 396
A Survey of Parallel Machine Organization and Programming
Kuck, D. J. (1977) · ACM Computing Surveys · doi:10.1145/356683.356686 · Cited by 202
Queueing Network Models for Parallel Processing with Asynchronous Tasks
Heidelberger, & Trivedi, T. (1982) · IEEE Transactions on Computers · doi:10.1109/tc.1982.1675926 · Cited by 104
Cited by
Scheduling multithreaded computations by work stealing
Blumofe, R. D., & Leiserson, C. E. (1999) · Journal of the ACM · doi:10.1145/324133.324234 · Cited by 1,336
State-of-the-art in privacy preserving data mining
Verykios, V. S., Bertino, E., Fovino, I. N., Provenza, L. P., Saygin, Y., & Theodoridis, Y. (2004) · ACM SIGMOD Record · doi:10.1145/974121.974131 · Cited by 816
Tuli, S., Ilager, S., Ramamohanarao, K., & Buyya, R. (2022) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2020.3017079 · Cited by 257
Romanov, S., Siqueira, A. S., de Bruin, J., Teijema, J., Hofstee, L., & van de Schoot, R. (2024) · Data Intelligence · doi:10.1162/dint_a_00244 · Cited by 7
Metadata
- Authors
- Eager, D. L., Zahorjan, J., & Lazowska, E. D.
- Venue
- IEEE Transactions on Computers
- Published
- 1989-03
- Volume
- 38
- Issue
- 3
- Pages
- 408-423
- ISSN
- 0018-9340 (ISSN-L)
- OpenAlex
- W2135490589
- Cited by
- 437
- References
- 6
- FWCI
- 24.10
- 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: Speedup versus efficiency in parallel systems. https://app.cochat.ai/papers/10.1109/12.21127
- The paper
- Eager, D. L., Zahorjan, J., & Lazowska, E. D. (1989). Speedup versus efficiency in parallel systems. IEEE Transactions on Computers. https://doi.org/10.1109/12.21127
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.