Article

Free access

To copy or not to copy: a compile-time technique for assessing when data copying should be used to eliminate cache conflicts

Authors:

O. Temam,

E. D. Granston,

W. JalbyAuthors Info & Claims

Supercomputing '93: Proceedings of the 1993 ACM/IEEE conference on Supercomputing

Pages 410 - 419

https://doi.org/10.1145/169627.169762

Published: 01 December 1993 Publication History

PDF eReader

References

[1]

F. Bodin, C. Eisenbeis, W. Jalby, and D. Windheiser. A Quantitative Algorithm for Data Locality Optimization. In Code Generation-Concepts, Tools, Techniques. Springer-Verlag, 1992.

Google Scholar

[2]

C. Eisenbeis, W. Jalby, D. Windheiser, and F. Bodin. A Strategy for Array Management in Local Memory. In Proceedings of the Third Workshop on Programming Languages and Compilers for Pardllel Computing, 1990.

Google Scholar

[3]

J. Ferrante, V. Sarkar, and W. Thrash. On Estimating and Enhancing Cache Effectiveness (Extended Abstract). In Proceedings o} the Fourth Workshop on Languages and Compilers for Parallel Computing, 1991.

Digital Library

Google Scholar

[4]

C. Fricker, O. Temam, and W. J alby. Accurate Evaluation of Blocked Algorithms Cache Interferences. Technical report, Leiden University, Mar. 1993.

Google Scholar

[5]

K. Gallivan, W. J alby, and D. Gannon. On the Problem of Optimizing Data Transfers for Complex Memory Systems. In Proceedings o~ the International Conference on Supercomputing, pages 238-253, July 1988.

Digital Library

Google Scholar

[6]

K. Kennedy and K. S. McKinley. Optimizing for Parallelism and Data Locality. In Proceedings of the International Conference on Supercomputing, pages 323-334, July 1992.

Digital Library

Google Scholar

[7]

M. Lam, E. E. Rothberg, and M. E. Wolf. The Cache Performance of Blocked Algorithms. In Fourth International Conference on Architectural Support for Programming Languages and Operating Systems, Apr. 1991.

Digital Library

Google Scholar

[8]

R. L. Sites, editor. Alpha Architecture Reference Manual. Digital Press, 1992.

Digital Library

Google Scholar

[9]

O. Temam. Study and Optimization of Numerical Codes Cache Behavior. PhD thesis, University of Rennes, France, May 1993.

Google Scholar

[10]

O. Temam, E. Granston, and W. Jalby. To Copy or Not to Copy: A Compile-Time Technique for Assessing When Data Copying Should be Used to Eliminate Cache Conflicts. Technical Report 93-11, University of Leiden, 1993.

Digital Library

Google Scholar

[11]

M. Wolf and M. Lam. A Data Locality Optimizing Algorithm. In Proceedings of the A CM SIG- PLAN '91 Conference on Programming Language Design and Implementation, volume 26(6), pages 30-44, June 1991.

Digital Library

Google Scholar

[12]

M. J. Wolfe. Iteration Space Tiling for Memory Hierarchies. In Proceedings of the 3rd SIAM Conference on Parallel Processing.for Scientific Computing, pages 357-361, 1987.

Digital Library

Google Scholar

[13]

M. J. Wolfe. More Iteration Space Tiling. In Supercomputing '89, 1989.

Digital Library

Google Scholar

[14]

S. Zhiyu, Z. Li, and P.-C. Yew. An Empirical Study on Array Subscripts and and Data Dependendencies Technical Report 840, Center for Supercomputing Research and Development, University of Illinois at Urbana-Champaign, Aug. 1989.

Google Scholar

Cited By

View all

Salvador Rohwedder CL. De Carvalho JAmaral JRodríguez GSadayappan PSukumaran-Rajam A(2024)Region-Based Data Layout via Data Reuse AnalysisProceedings of the 33rd ACM SIGPLAN International Conference on Compiler Construction10.1145/3640537.3641571(49-59)Online publication date: 17-Feb-2024
https://dl.acm.org/doi/10.1145/3640537.3641571
Salvador Rohwedder CHenderson NDe Carvalho JChen YAmaral JDubach CBruening DHardekopf B(2023)To Pack or Not to Pack: A Generalized Packing Analysis and TransformationProceedings of the 21st ACM/IEEE International Symposium on Code Generation and Optimization10.1145/3579990.3580024(14-27)Online publication date: 17-Feb-2023
https://dl.acm.org/doi/10.1145/3579990.3580024
Crawford CGilbert J(2019)Brains and BlocksACM Transactions on Computing Education10.1145/333581519:4(1-27)Online publication date: 16-Jul-2019
https://dl.acm.org/doi/10.1145/3335815
Show More Cited By

Index Terms

To copy or not to copy: a compile-time technique for assessing when data copying should be used to eliminate cache conflicts
1. Software and its engineering
  1. Software notations and tools
    1. Compilers

Recommendations

A Leaner, More Efficient, Available Copy Protocol
SPDP '96: Proceedings of the 8th IEEE Symposium on Parallel and Distributed Processing (SPDP '96)

Available copy protocols provide the highest data availability and data reliability of all replication protocols that do not regenerate failed replicas. Unfortunately, all existing implementations of available copy protocols either rely on complex ...
Secure hybrid robust watermarking resistant against tampering and copy attack
Special section: Security of data hiding technologies

Digital watermarking appears today as an efficient mean of securing multimedia documents. Several application scenarios in the security of digital watermarking have been pointed out, each of them with different requirements. The three main identified ...
Use of "emergable watermarks" as copy indicators for securing video content
IWDW'11: Proceedings of the 10th international conference on Digital-Forensics and Watermarking

We propose using emergable watermarks as copy indicators that become visible in video content that has been copied under designated conditions. A watermark pattern is designed that is sensitive to image processing specific to illegal copying. This is ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

Supercomputing '93: Proceedings of the 1993 ACM/IEEE conference on Supercomputing

December 1993

935 pages

ISBN:0818643404

DOI:10.1145/169627

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 December 1993

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SC '93

Sponsor:

SIGARCH
IEEE-CS

SC '93: International Conference for High Performance Computing, Networking, Storage and Analysis

November 15 - 19, 1993

Oregon, Portland, USA

Acceptance Rates

Supercomputing '93 Paper Acceptance Rate 72 of 300 submissions, 24%;

Overall Acceptance Rate 1,516 of 6,373 submissions, 24%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

137
Total Citations
View Citations
336
Total Downloads

Downloads (Last 12 months)55
Downloads (Last 6 weeks)12

Reflects downloads up to 14 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Salvador Rohwedder CL. De Carvalho JAmaral JRodríguez GSadayappan PSukumaran-Rajam A(2024)Region-Based Data Layout via Data Reuse AnalysisProceedings of the 33rd ACM SIGPLAN International Conference on Compiler Construction10.1145/3640537.3641571(49-59)Online publication date: 17-Feb-2024
https://dl.acm.org/doi/10.1145/3640537.3641571
Salvador Rohwedder CHenderson NDe Carvalho JChen YAmaral JDubach CBruening DHardekopf B(2023)To Pack or Not to Pack: A Generalized Packing Analysis and TransformationProceedings of the 21st ACM/IEEE International Symposium on Code Generation and Optimization10.1145/3579990.3580024(14-27)Online publication date: 17-Feb-2023
https://dl.acm.org/doi/10.1145/3579990.3580024
Crawford CGilbert J(2019)Brains and BlocksACM Transactions on Computing Education10.1145/333581519:4(1-27)Online publication date: 16-Jul-2019
https://dl.acm.org/doi/10.1145/3335815
Clarke-Midura JSun CPantic KPoole FAllan V(2019)Using Informed Design in Informal Computer Science Programs to Increase Youths’ Interest, Self-efficacy, and Perceptions of Parental SupportACM Transactions on Computing Education10.1145/331944519:4(1-24)Online publication date: 2-Aug-2019
https://dl.acm.org/doi/10.1145/3319445
Khan TZhao YPokam GMozafari BKasikci BMcKinley KFisher K(2019)Huron: hybrid false sharing detection and repairProceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation10.1145/3314221.3314644(453-468)Online publication date: 8-Jun-2019
https://dl.acm.org/doi/10.1145/3314221.3314644
Lukyanenko RParsons J(2015)Information Quality Research Challenge: Adapting Information Quality Principles to User-Generated ContentJournal of Data and Information Quality10.1145/27231666:1(1-3)Online publication date: 4-Mar-2015
https://dl.acm.org/doi/10.1145/2723166
Rietveld KWijshoff H(2015)Re-Engineering Compiler Transformations to Outperform Database Query OptimizersLanguages and Compilers for Parallel Computing10.1007/978-3-319-17473-0_20(300-314)Online publication date: 1-May-2015
https://doi.org/10.1007/978-3-319-17473-0_20
González AAliagas CValero M(2014)A data cache with multiple caching strategies tuned to different types of localityACM International Conference on Supercomputing 25th Anniversary Volume10.1145/2591635.2667170(217-226)Online publication date: 10-Jun-2014
https://dl.acm.org/doi/10.1145/2591635.2667170
Kim MRo W(2014)Architectural investigation of matrix data layout on multicore processorsFuture Generation Computer Systems10.1016/j.future.2013.10.02037(64-75)Online publication date: Jul-2014
https://doi.org/10.1016/j.future.2013.10.020
Mehta SBeeraka GYew P(2013)Tile size selection revisitedACM Transactions on Architecture and Code Optimization10.1145/2541228.255529210:4(1-27)Online publication date: 1-Dec-2013
https://dl.acm.org/doi/10.1145/2541228.2555292
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

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

A Leaner, More Efficient, Available Copy Protocol

Secure hybrid robust watermarking resistant against tampering and copy attack

Use of "emergable watermarks" as copy indicators for securing video content