The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Why systolic architectures?
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
Introduction to V.L.S.I. Systems
Mead, C. (1981) · IEE Proceedings I Solid State and Electron Devices · doi:10.1049/ip-i-1.1981.0010 · Cited by 3,720
Gallager, R. G., & Peterson, W. W. (1962) · Mathematics of Computation · doi:10.2307/2003832 · Cited by 2,041
Stiffler, J. J. (1971) · Cited by 1,438
Kung, H. T., & Leiserson, C. E. (1978) · Defense Technical Information Center (DTIC) · Cited by 833
I/O complexity: The red-blue pebble game
Hong, J., & Kung, H. T. (1981) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/800076.802486 · Cited by 474
Matrix Triangularization By Systolic Arrays:
Gentleman, W. M., & Kung, H. T. (1982) · SPIE Proceedings · doi:10.1117/12.932507 · Cited by 459
Multidimensional Binary Search Trees in Database Applications
Bentley, J. L. (1979) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1979.234200 · Cited by 410
Hardware Algorithms for Nonnumeric Computation
Mukhopadhyay (1979) · IEEE Transactions on Computers · doi:10.1109/tc.1979.1675378 · Cited by 57
Cited by
Hogan, A., Blomqvist, E., Cochez, M., D’amato, C., Melo, G. D., Gutierrez, C., Kirrane, S., Gayo, J. E. L., Navigli, R., Neumaier, S., et al. (2022) · ACM Computing Surveys · doi:10.1145/3447772 · Cited by 1,904
Deep Learning with Limited Numerical Precision
Gupta, S., Agrawal, A., Gopalakrishnan, K., & Narayanan, P. (2015) · arXiv · doi:10.48550/arxiv.1502.02551 · Cited by 1,364
“The DSP units within the FPGA are organized as a massively parallel 2-dimensional systolic array (SA) (Kung, 1982) of size n such that n 2 840.”
BackgroundOptical interconnections for VLSI systems
Goodman, J. W., Leonberger, F. J., Kung, S.-Y., & Athale, R. A. (1984) · Proceedings of the IEEE · doi:10.1109/proc.1984.12943 · Cited by 1,052
Efficient Deep Learning: A Survey on Making Deep Learning Models Smaller, Faster, and Better
Menghani, G. (2023) · ACM Computing Surveys · doi:10.1145/3578938 · Cited by 605
The family of concurrent logic programming languages
Shapiro, E. (1989) · ACM Computing Surveys · doi:10.1145/72551.72555 · Cited by 440
Metadata
- Authors
- Kung
- Venue
- Computer
- Published
- 1982-01
- Volume
- 15
- Issue
- 1
- Pages
- 37-46
- ISSN
- 0018-9162 (ISSN-L)
- OpenAlex
- W2017369466
- Cited by
- 2,272
- References
- 8
- FWCI
- 100.99
- 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.