The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Design and evaluation of a compiler algorithm for prefetching
Open accessAbstract
Software-controlled data prefetching is a promising technique for improving the performance of the memory subsystem to match today's high-performance processors.While prefctching is useful in hiding the latency, issuing prefetches incurs an instruction overhead and can increase the load on the memory subsystem.As a resu 1~ care must be taken to ensure that such overheads do not exceed the benefits.This paper proposes a compiler algorithm to insert prefetch instructions into code that operates on dense matrices.Our algorithm identiEes those references that are likely to be cache misses, and issues prefetches only for them.We have implemented our algorithm in the SUfF (Stanford University Intermediate Form) optimizing compiler.By generating fully functional code, we have been able to measure not only the improvements in cache miss rates, but also the oversdl performance of a simulated system.We show that our algorithm significantly improves the execution speed of our benchmark programs-some of the programs improve by as much as a factor of two.When compared to an algorithm that indiscriminately prefetches alf array accesses, our algorithm can eliminate many of the unnecessary prefetches without any significant decrease in the coverage of the cache misses.
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
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
Bailey, D. H., Barszcz, E., Barton, J. T., Browning, D. S., Carter, R. L., Dagum, L., Fatoohi, R. A., Frederickson, P. O., Lasinski, T. A., Schreiber, R. S., et al. (1991) · The International Journal of Supercomputing Applications · doi:10.1177/109434209100500306 · Cited by 2,395
A data locality optimizing algorithm
Wolf, M. E., & Lam, M. S. (1991) · Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation - PLDI '91 · doi:10.1145/113445.113449 · Cited by 1,331
Self-citationSPLASH: Stanford parallel applications for shared-memory
Singh, J. P., Weber, W.-D., & Gupta, A. (1992) · ACM SIGARCH Computer Architecture News · doi:10.1145/130823.130824 · Cited by 925
Self-citationThe cache performance and optimizations of blocked algorithms
Lam, M. D., Rothberg, E. E., & Wolf, M. E. (1991) · Proceedings of the fourth international conference on Architectural support for programming languages and operating systems - ASPLOS-IV · doi:10.1145/106972.106981 · Cited by 921
Self-citationSoftware pipelining: an effective scheduling technique for VLIW machines
Lam, M. S. (2004) · ACM SIGPLAN Notices · doi:10.1145/989393.989420 · Cited by 884
Self-citationSoftware pipelining: an effective scheduling technique for VLIW machines
Lam, M. (1988) · Proceedings of the ACM SIGPLAN 1988 conference on Programming language design and implementation · doi:10.1145/53990.54022 · Cited by 641
Self-citationAn effective on-chip preloading scheme to reduce data access penalty
Baer, J.-L., & Chen, T.-F. (1991) · Proceedings of the 1991 ACM/IEEE conference on Supercomputing - Supercomputing '91 · doi:10.1145/125826.125932 · Cited by 466
Strategies for cache and local memory management by global program transformation
Gannon, D., Jalby, W., & Gallivan, K. (1988) · Journal of Parallel and Distributed Computing · doi:10.1016/0743-7315(88)90014-7 · Cited by 350
Organizing matrices and matrix operations for paged memory systems
McKellar, A. C., & Coffman, E. G. (1969) · Communications of the ACM · doi:10.1145/362875.362879 · Cited by 175
On estimating and enhancing cache effectiveness
Ferrante, J., Sarkar, V., & Thrash, W. (2006) · Lecture Notes in Computer Science · doi:10.1007/bfb0038674 · Cited by 159
Overlapped loop support in the Cydra 5
Dehnert, J. C., Hsu, P., & Bratt, J. P. (1989) · ACM SIGARCH Computer Architecture News · doi:10.1145/68182.68185 · Cited by 130
Automatic program transformations for virtual memory computers
Abu-Sufah, W., Kuck, D. J., & Lawrie, D. H. (1979) · International Workshop on Managing Requirements Knowledge (MARK) · doi:10.1109/mark.1979.8817192 · Cited by 47
Cited by
SPIRAL: Code Generation for DSP Transforms
Puschel, M., Moura, J. M. F., Johnson, J. R., Padua, D., Veloso, M. M., Singer, B. W., Xiong, J., Franchetti, F., Gacic, A., Voronenko, Y., et al. (2005) · Proceedings of the IEEE · doi:10.1109/jproc.2004.840306 · Cited by 826
Value locality and load value prediction
Lipasti, M. H., Wilkerson, C. B., & Shen, J. P. (1996) · Proceedings of the seventh international conference on Architectural support for programming languages and operating systems · doi:10.1145/237090.237173 · Cited by 672
Runahead execution: an alternative to very large instruction windows for out-of-order processors
Mutlu, O., Stark, J., Wilkerson, C., & Patt, Y. N. (2003) · The Ninth International Symposium on High-Performance Computer Architecture, 2003. HPCA-9 2003. Proceedings. · doi:10.1109/hpca.2003.1183532 · Cited by 440
Memory bandwidth limitations of future microprocessors
Burger, D., Goodman, J. R., & Kägi, A. (1996) · Proceedings of the 23rd annual international symposium on Computer architecture · doi:10.1145/232973.232983 · Cited by 392
Cache-conscious structure layout
Chilimbi, T. M., Hill, M. D., & Larus, J. R. (1999) · Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation · doi:10.1145/301618.301633 · Cited by 334
Metadata
- Authors
- Mowry, T. C., Lam, M. S., & Gupta, A.
- Venue
- Proceedings of the fifth international conference on Architectural support for programming languages and operating systems
- Publisher
- ACM
- Published
- 1992-09
- Pages
- 62-73
- OpenAlex
- W2099958604
- Cited by
- 767
- References
- 13
- FWCI
- 20.31
- Type
- conference paper
- Language
- en
- Open access
- bronze
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.