D. Callahan, S. Carr, and K. Kennedy. Improving register allocation for subscripted variables. In Proceedings of the ACM SIGPLAN '90 Conference on Programming Language Design and Implementation, June 1990.

Digital Library

Google Scholar

[6]

J. Dongarra, J. Du Croz, S. Hammarling, and I. Duff. A set of level 3 basic linear algebra subprograms. ACM Transactions on Mathematical Software, pages 1-17, March 1990.

Digital Library

Google Scholar

[7]

K. Gallivan, W. Jalby, U. Meier, and A. Sameh. The impact Of hierarchical memory systems on linear algebra algorithm design. Technical report, University of Ulinios, 1987.

Google Scholar

[8]

D. Oannon, W. Jalby, ancl K. Oallivan. Strategies for cache and local memory management by global program transformation. Journal of Parallel and Distributed Computing, 5:587-616, 1988.

Digital Library

Google Scholar

[9]

G. H. Golub and C. F. Van Loan. Matrix Computations. Johns Hopkins University Press, 1989.

Google Scholar

[10]

F. Irigoin and R. Triolet. Computing dependence direction vectors and dependence cones. Technical Report E94, Centre D'Automatique et Informatique, 1988.

Google Scholar

[11]

F. Irigoin and R. Triolet. Supemode partitioning. In Proc. 15th Annual ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, January 1988.

Digital Library

Google Scholar

[12]

M. S. Lam, E. E. Rothberg, and M. E. Wolf. The cache performance and opfimizations of blocked algorithms. In Proceedings of the Sixth International Conference on Architectural Support for Programming Languages and Operating Systems, April 1991.

Digital Library

Google Scholar

[13]

A. C. McKeller and E. G. Coffman. The organization of matrices and matrix operations in a paged multiprogramming environment. CACM, 12(3):153-165, 1969.

Digital Library

Google Scholar

[14]

A. Porterfield. Software Methods for Improvement of Cache Performance on Supercomputer Applications. PhD thesis, Rice University, May 1989.

Digital Library

Google Scholar

[15]

R. Schreiber and J. Dongarra. Automatic blocking of nested loops. 1990.

Google Scholar

[16]

M. E. Wolf and M. S. Lam. A loop transformation theory and an algorithm to maximize parallelism. IEEE Transactions on Parallel and Distributed Systems, July 1991.

Digital Library

Google Scholar

[17]

M. j. Wolfe. Techniques for improving the inherent parallelism in programs. Technical Report UIUCDCS-R-78-929, University of Illinois, 1978.

Google Scholar

[18]

M. j. Wolfe. More iteration space tiling. In Supercomputing '89, Nov 1989.

Digital Library

Google Scholar

Cited By

View all

Liu HGalindo MXie HWong LShuai HLi YCheng W(2024)Lightweight Deep Learning for Resource-Constrained Environments: A SurveyACM Computing Surveys10.1145/365728256:10(1-42)Online publication date: 24-Jun-2024
https://dl.acm.org/doi/10.1145/3657282
Canesche MRosário VBorin EQuintão Pereira F(2024)The Droplet Search Algorithm for Kernel SchedulingACM Transactions on Architecture and Code Optimization10.1145/365010921:2(1-28)Online publication date: 21-May-2024
https://dl.acm.org/doi/10.1145/3650109
Tauro BSuchy BCampanoni SDinda PHale KTsafrir DMUSUVATHI MGupta RAbu-Ghazaleh N(2024)TrackFM: Far-out Compiler Support for a Far Memory WorldProceedings of the 29th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 110.1145/3617232.3624856(401-419)Online publication date: 27-Apr-2024
https://dl.acm.org/doi/10.1145/3617232.3624856
Show More Cited By

Index Terms

A data locality optimizing algorithm
1. Mathematics of computing
  1. Mathematical analysis
    1. Numerical analysis
      1. Computations on matrices
2. Software and its engineering
  1. Software notations and tools
    1. Compilers

Recommendations

Exploiting spatial locality in data caches using spatial footprints
Special Issue: Proceedings of the 25th annual international symposium on Computer architecture (ISCA '98)

Modern cache designs exploit spatial locality by fetching large blocks of data called cache lines on a cache miss. Subsequent references to words within the same cache line result in cache hits. Although this approach benefits from spatial locality, ...
Exploiting spatial locality in data caches using spatial footprints
ISCA '98: Proceedings of the 25th annual international symposium on Computer architecture

Modern cache designs exploit spatial locality by fetching large blocks of data called cache lines on a cache miss. Subsequent references to words within the same cache line result in cache hits. Although this approach benefits from spatial locality, ...
A split data cache organization based on run-time data locality estimation

Comments

Information & Contributors

Information

Published In

PLDI '91: Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation

May 1991

356 pages

ISBN:0897914287

DOI:10.1145/113445

Chairman:
David S. Wise
Indiana Univ., Bloomington

ACM SIGPLAN Notices Volume 26, Issue 6
June 1991
352 pages
ISSN:0362-1340
EISSN:1558-1160
DOI:10.1145/113446
Editor:
Richard L. Wexelblat
IDA/CSED, Alexandria, VA
Issue’s Table of Contents

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 May 1991

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

PLDI91

Sponsor:

SIGPLAN

PLDI91: Conference on Programming Languages Design and Implementation

June 24 - 28, 1991

Ontario, Toronto, Canada

Acceptance Rates

Overall Acceptance Rate 406 of 2,067 submissions, 20%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1,205
Total Citations
View Citations
3,951
Total Downloads

Downloads (Last 12 months)415
Downloads (Last 6 weeks)51

Reflects downloads up to 09 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Liu HGalindo MXie HWong LShuai HLi YCheng W(2024)Lightweight Deep Learning for Resource-Constrained Environments: A SurveyACM Computing Surveys10.1145/365728256:10(1-42)Online publication date: 24-Jun-2024
https://dl.acm.org/doi/10.1145/3657282
Canesche MRosário VBorin EQuintão Pereira F(2024)The Droplet Search Algorithm for Kernel SchedulingACM Transactions on Architecture and Code Optimization10.1145/365010921:2(1-28)Online publication date: 21-May-2024
https://dl.acm.org/doi/10.1145/3650109
Tauro BSuchy BCampanoni SDinda PHale KTsafrir DMUSUVATHI MGupta RAbu-Ghazaleh N(2024)TrackFM: Far-out Compiler Support for a Far Memory WorldProceedings of the 29th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 110.1145/3617232.3624856(401-419)Online publication date: 27-Apr-2024
https://dl.acm.org/doi/10.1145/3617232.3624856
Błaszyński PBielecki W(2023)High-Performance Computation of the Number of Nested RNA Structures with 3D Parallel Tiled CodeEng10.3390/eng40100304:1(507-525)Online publication date: 3-Feb-2023
https://doi.org/10.3390/eng4010030
Ahmad ZChowdhury RDas RGanapathi PGregory AZhu Y(2023)A Fast Algorithm for Aperiodic Linear Stencil Computation using Fast Fourier TransformsACM Transactions on Parallel Computing10.1145/360633810:4(1-34)Online publication date: 24-Jul-2023
https://dl.acm.org/doi/10.1145/3606338
Wu ZWu YLiu YShang HGao YZhang ZZhang YLong YFeng XCui HMohror KArnold DBadia R(2023)Portable and Scalable All-Electron Quantum Perturbation Simulations on Exascale SupercomputersProceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis10.1145/3581784.3607085(1-13)Online publication date: 12-Nov-2023
https://dl.acm.org/doi/10.1145/3581784.3607085
Essadki MMichel BMaugars BZinenko OVasilache NCohen ADubach CBruening DHardekopf B(2023)Code Generation for In-Place StencilsProceedings of the 21st ACM/IEEE International Symposium on Code Generation and Optimization10.1145/3579990.3580006(2-13)Online publication date: 17-Feb-2023
https://dl.acm.org/doi/10.1145/3579990.3580006
Patabandi THall MVerbrugge CLhoták OShen X(2023)Efficiently Learning Locality Optimizations by Decomposing Transformation DomainsProceedings of the 32nd ACM SIGPLAN International Conference on Compiler Construction10.1145/3578360.3580272(37-49)Online publication date: 17-Feb-2023
https://dl.acm.org/doi/10.1145/3578360.3580272
Kandemir MAkbulut GChoi WKarakoy M(2023)Architecture-Aware Currying2023 32nd International Conference on Parallel Architectures and Compilation Techniques (PACT)10.1109/PACT58117.2023.00029(250-264)Online publication date: 21-Oct-2023
https://doi.org/10.1109/PACT58117.2023.00029
Roy PEshete BSu P(2023)Designing Secure Performance Metrics for Last Level Cache2023 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)10.1109/IPDPSW59300.2023.00069(383-392)Online publication date: May-2023
https://doi.org/10.1109/IPDPSW59300.2023.00069
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Exploiting spatial locality in data caches using spatial footprints

Exploiting spatial locality in data caches using spatial footprints

A split data cache organization based on run-time data locality estimation