The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Some Computer Organizations and Their Effectiveness
Abstract
A hierarchical model of computer organizations is developed, based on a tree model using request/service type resources as nodes. Two aspects of the model are distinguished: logical and physical. General parallel- or multiple-stream organizations are examined as to type and effectiveness-especially regarding intrinsic logical difficulties. The overlapped simplex processor (SISD) is limited by data dependencies. Branching has a particularly degenerative effect. The parallel processors [single-instruction stream-multiple-data stream (SIMD)] are analyzed. In particular, a nesting type explanation is offered for Minsky's conjecture-the performance of a parallel processor increases as log M instead of M (the number of data stream processors). Multiprocessors (MIMD) are subjected to a saturation syndrome based on general communications lockout. Simplified queuing models indicate that saturation develops when the fraction of task time spent locked out (L/E) approaches 1/n, where n is the number of processors. Resources sharing in multiprocessors can be used to avoid several other classic organizational problems.
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
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
Computability and Unsolvability.
Elgot, C., & Davis, M. (1959) · Mathematical Tables and Other Aids to Computation · doi:10.2307/2002808 · Cited by 980
Very high-speed computing systems
Flynn, M. J. (1966) · Proceedings of the IEEE · doi:10.1109/proc.1966.5273 · Cited by 959
Self-citationLogical basis for information theory and probability theory
Kolmogorov, A. (1968) · IEEE Transactions on Information Theory · doi:10.1109/tit.1968.1054210 · Cited by 592
Computer Structures: Readings and Examples,
Bell, C. G., & Newell, A. (1971) · CERN Document Server (European Organization for Nuclear Research) · Cited by 488
An Adaptation of the Fast Fourier Transform for Parallel Processing
Pease, M. C. (1968) · Journal of the ACM · doi:10.1145/321450.321457 · Cited by 381
Detection and Parallel Execution of Independent Instructions
Tjaden, G. S., & Flynn, M. J. (1970) · IEEE Transactions on Computers · doi:10.1109/t-c.1970.222795 · Cited by 198
Self-citationA survey of problems and preliminary results concerning parallel processing and parallel processors
Lehman, M. M. (1966) · Proceedings of the IEEE · doi:10.1109/proc.1966.5272 · Cited by 56
Cited by
Readings in Distributed Artificial Intelligence
(1988) · Elsevier eBooks · doi:10.1016/c2013-0-07700-6 · Cited by 986
A Survey on Distributed Machine Learning
Verbraeken, J., Wolting, M., Katzy, J., Kloppenburg, J., Verbelen, T., & Rellermeyer, J. S. (2021) · ACM Computing Surveys · doi:10.1145/3377454 · Cited by 872
A study of branch prediction strategies
Smith, J. E. (1998) · 25 years of the international symposia on Computer architecture (selected papers) · doi:10.1145/285930.285980 · Cited by 797
A new golden age for computer architecture
Hennessy, J. L., & Patterson, D. A. (2019) · Communications of the ACM · doi:10.1145/3282307 · Cited by 690
Metaheuristics: A bibliography
Osman, I. H., & Laporte, G. (1996) · Annals of Operations Research · doi:10.1007/bf02125421 · Cited by 672
Metadata
- Authors
- Flynn, M. J.
- Venue
- IEEE Transactions on Computers
- Published
- 1972-09
- Volume
- C-21
- Issue
- 9
- Pages
- 948-960
- ISSN
- 0018-9340 (ISSN-L)
- OpenAlex
- W2094969361
- Cited by
- 1,713
- References
- 8
- FWCI
- 6.85
- 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.