Reevaluating Amdahl’s law in the multicore era
The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Computer Architecture: A Quantitative Approach
Hennessy, J. L., & Patterson, D. A. (1989) · UCLA - Biblioteca de Ciencias y Tecnologia Felix Morales Bueno · Cited by 9,374
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 · cited 1×
“The original idea presented by Amdahl [1] was a general observation about the performance improvement limitation of any enhancement, and was later summarized as Amdahl’s law.”
MethodParallel Computer Architecture: A Hardware/Software Approach
Culler, D., Gupta, A., & SINGH, J. P. (1998) · Cited by 1,716
Hitting the memory wall: implications of the obvious
Wulf, W. A., & McKee, S. A. (1995) · ACM SIGARCH Computer Architecture News · doi:10.1145/216585.216588 · Cited by 1,624
Gustafson, J. L. (1988) · Communications of the ACM · doi:10.1145/42411.42415 · Cited by 1,450 · cited 2×
“(1) When m increases to infinity, the speedup upper bound is: limm→∞ SpeedupAmdahl = 1 1−f .”
BackgroundHitting the Memory Wall: Implications of the Obvious
Wulf, W. A., & McKee, S. A. (1995) · Cited by 1,379
Amdahl's Law in the Multicore Era
Hill, M. D., & Marty, M. R. (2008) · Computer · doi:10.1109/mc.2008.209 · Cited by 1,262 · cited 3×
“Therefore, the memory-bounded speedup for matrix multiplication is: SpeedupMB = (1− f )+ f · g(m) (1− f )+ f ·g(m)m = (1− f )+ f ·m3/2 (1− f )+ f ·m1/2 .”
BackgroundComputer Architecture, Fifth Edition: A Quantitative Approach
Hennessy, J. L., & Patterson, D. A. (2011) · Morgan Kaufmann Publishers Inc. eBooks · Cited by 880
Parallel Computer Architecture: A Hardware/Software Approach
Garraway, H. (1999) · IEEE Concurrency · doi:10.1109/mcc.1999.766975 · Cited by 750
Scalable Parallel Computing: Technology, Architecture, Programming
Hwang, K., & Xu, Z. (1998) · Medical Entomology and Zoology · Cited by 227
Extending Amdahl's Law for Energy-Efficient Computing in the Many-Core Era
Woo, D. H., & Lee, H.-H. S. (2008) · Computer · doi:10.1109/mc.2008.494 · Cited by 222 · cited 1×
“All rights reserved.”
Scalable Problems and Memory-Bounded Speedup
Sun, X. H., & Ni, L. M. (1993) · Journal of Parallel and Distributed Computing · doi:10.1006/jpdc.1993.1087 · Cited by 163 · cited 1×
“Let f be the portion of the workload that can be parallelized andm be the number of processors; then the parallel processing speedup implied by Amdahl’s law is: SpeedupAmdahl = 1 (1− f )+ fm .”
Self-citationChip multiprocessing and the cell broadband engine
Gschwind, M. K. (2006) · ACM International Conference on Computing Frontiers (CF) · doi:10.1145/1128022.1128023 · Cited by 133 · cited 1×
“These models show that there is no inherent, immovable upper bound on the scalability of multicore architectures.”
BackgroundAnother view on parallel speedup
Sun, X., & Ni, L. M.-S. (1990) · Conference on High Performance Computing (Supercomputing) · doi:10.5555/110382.110450 · Cited by 107
Self-citation
Metadata
- Authors
- Sun, X.-H., & Chen, Y.
- Venue
- Journal of Parallel and Distributed Computing
- Publisher
- Elsevier BV
- Published
- 2010-02
- Volume
- 70
- Issue
- 2
- Pages
- 183-188
- ISSN
- 0743-7315 (ISSN-L)
- OpenAlex
- W2023274306
- Cited by
- 176
- References
- 14
- FWCI
- 18.79
- 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
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.