research-article

Benchmark Synthesis Using the LRU Cache Hit Function

Authors:

Wing Shing Wong,

Robert J. T. MorrisAuthors Info & Claims

IEEE Transactions on Computers, Volume 37, Issue 6

Pages 637 - 645

https://doi.org/10.1109/12.2202

Published: 01 June 1988 Publication History

Publisher Site

Abstract

The LRU cache hit function is used as a general characterization of locality of reference to address the synthesis question of whether benchmarks can be created that have a required locality of reference. Several results are given that show circumstances under which this synthesis can or cannot be achieved. An additional characterization called the warm-start cache hit function is introduced and shown to be efficiently computable. The operations of repetition and replication are used to form new programs, and their characteristics are derived. Using these operations, a general benchmark synthesis technique is obtained and demonstrated with an example.

References

[1]

{1} D. Ferrari, Computer Systems Performance Evaluation. Englewood Cliffs, NJ: Prentice-Hall, 1978.

Google Scholar

[2]

{2} R. P. Weicker, "Dhrystone: A synthetic systems programming benchmark," Commun. ACM, vol. 27, pp. 1013-1030, Oct. 1984.

Digital Library

Google Scholar

[3]

{3} AIM Benchmark<sup>TM</sup> Suite II--Evaluating UNIX<sup>TM</sup> Computers, AIM Technology, Santa Clara, CA 95050.

Google Scholar

[4]

{4} Proc. IEEE Int. Conf. Computer-Aided Design, Santa Clara, CA, Nov. 18-21, 1985.

Google Scholar

[5]

{5} R. P. Colwell et al., "Computers, complexity and controversy," Computer, vol. 18, no. 9, pp. 8-20.

Digital Library

Google Scholar

[6]

{6} C. H. Sauer and K. M. Chandy, Computer Systems Performance Modeling. Englewood Cliffs, NJ: Prentice-Hall, 1981.

Google Scholar

[7]

{7} W. S. Wong and R. J. T. Morris, "Synthesizing benchmarks with appropriate instruction mix and locality," in Proc. Second Int. Conf. Comput. Appl., IEEE, Beijing, China, June 24-26, 1987.

Google Scholar

[8]

{8} E. G. Coffman and P. J. Denning, Operating Systems Theory. Englewood Cliffs, NJ: Prentice-Hall, 1973.

Digital Library

Google Scholar

[9]

{9} R. L. J. Mattson, J. Gecsei, D. R. Slutz, and I. L. Traiger, "Evaluation techniques for storage hierarchies," IBM Syst. J., vol. 9, no. 2, pp. 778-117, 1970.

Digital Library

Google Scholar

[10]

{10} V. C. Hamacher, Z. G. Vranesic, and S. G. Zaky, Computer Organization, 2nd ed. New York: McGraw-Hill, 1984.

Crossref

Google Scholar

[11]

{11} M. C. Easton and R. Fagin, "Cold-start vs. warm-start miss ratios," Commun. ACM, vol. 21, no. 10, pp. 866-872.

Digital Library

Google Scholar

[12]

{12} B. W. Kernighan and D. M. Ritchie, The C Programming Language . Englewood Cliffs, NJ: Prentice-Hall, 1978.

Digital Library

Google Scholar

Cited By

View all

Nagendra NGodala BChaturvedi IPatel AKanev SMoseley TStark JPokam GCampanoni SAugust DSolihin YHeinrich M(2023)EMISSARY: Enhanced Miss Awareness Replacement Policy for L2 Instruction CachingProceedings of the 50th Annual International Symposium on Computer Architecture10.1145/3579371.3589097(1-13)Online publication date: 17-Jun-2023
https://dl.acm.org/doi/10.1145/3579371.3589097
Wu XMueller FPakin S(2014)A methodology for automatic generation of executable communication specifications from parallel MPI applicationsACM Transactions on Parallel Computing10.1145/26602491:1(1-30)Online publication date: 3-Oct-2014
https://dl.acm.org/doi/10.1145/2660249
Bertran RBuyuktosunoglu AGupta MGonzalez MBose P(2012)Systematic Energy Characterization of CMP/SMT Processor Systems via Automated Micro-BenchmarksProceedings of the 2012 45th Annual IEEE/ACM International Symposium on Microarchitecture10.1109/MICRO.2012.27(199-211)Online publication date: 1-Dec-2012
https://dl.acm.org/doi/10.1109/MICRO.2012.27
Show More Cited By

Index Terms

Benchmark Synthesis Using the LRU Cache Hit Function

Recommendations

Modeling LRU cache with invalidation

Least Recently Used (LRU) is a very popular caching replacement policy. It is very easy to implement and offers good performance, especially when data requests are temporally correlated, as in the case of web traffic.When the data content can change ...
Minimizing Area Cost of On-Chip Cache Memories by Caching Address Tags

This paper presents a technique for minimizing chip-area cost of implementing an on-chip cache memory of microprocessors. The main idea of the technique is Caching Address Tags, or CAT cache, for short. The CAT cache exploits locality property that ...
Advising cache for lower cache
IMCOM '17: Proceedings of the 11th International Conference on Ubiquitous Information Management and Communication

In a virtualized environment, such as a cloud computing environment, guest and host operating systems run simultaneously. Both of the operating systems have page caches for disk accesses. In such an environment, the host operating system cache does not ...

Comments

Information & Contributors

Information

Published In

cover image IEEE Transactions on Computers

IEEE Transactions on Computers Volume 37, Issue 6

June 1988

136 pages

ISSN:0018-9340

Editor:
Bruce D. Shriver

Issue’s Table of Contents

Publisher

IEEE Computer Society

United States

Publication History

Published: 01 June 1988

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

9
Total Citations
View Citations
0
Total Downloads

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

Reflects downloads up to 03 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Nagendra NGodala BChaturvedi IPatel AKanev SMoseley TStark JPokam GCampanoni SAugust DSolihin YHeinrich M(2023)EMISSARY: Enhanced Miss Awareness Replacement Policy for L2 Instruction CachingProceedings of the 50th Annual International Symposium on Computer Architecture10.1145/3579371.3589097(1-13)Online publication date: 17-Jun-2023
https://dl.acm.org/doi/10.1145/3579371.3589097
Wu XMueller FPakin S(2014)A methodology for automatic generation of executable communication specifications from parallel MPI applicationsACM Transactions on Parallel Computing10.1145/26602491:1(1-30)Online publication date: 3-Oct-2014
https://dl.acm.org/doi/10.1145/2660249
Bertran RBuyuktosunoglu AGupta MGonzalez MBose P(2012)Systematic Energy Characterization of CMP/SMT Processor Systems via Automated Micro-BenchmarksProceedings of the 2012 45th Annual IEEE/ACM International Symposium on Microarchitecture10.1109/MICRO.2012.27(199-211)Online publication date: 1-Dec-2012
https://dl.acm.org/doi/10.1109/MICRO.2012.27
Ganesan KJohn LLathrop SCosta JKramer W(2011)MAximum Multicore POwer (MAMPO)Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis10.1145/2063384.2063455(1-12)Online publication date: 12-Nov-2011
https://dl.acm.org/doi/10.1145/2063384.2063455
Joshi AEeckhout LBell RJohn L(2008)Distilling the essence of proprietary workloads into miniature benchmarksACM Transactions on Architecture and Code Optimization10.1145/1400112.14001155:2(1-33)Online publication date: 3-Sep-2008
https://dl.acm.org/doi/10.1145/1400112.1400115
Weinberg JSnavely APapatheodorou TBanerjee UMendelson AGallivan K(2008)Accurate memory signatures and synthetic address traces for HPC applicationsProceedings of the 22nd annual international conference on Supercomputing10.1145/1375527.1375536(36-45)Online publication date: 7-Jun-2008
https://dl.acm.org/doi/10.1145/1375527.1375536
Bell RJohn LArvind Rudolph L(2005)Improved automatic testcase synthesis for performance model validationProceedings of the 19th annual international conference on Supercomputing10.1145/1088149.1088164(111-120)Online publication date: 20-Jun-2005
https://dl.acm.org/doi/10.1145/1088149.1088164
Varki EMerchant AXu JQiu X(2004)Issues and Challenges in the Performance Analysis of Real Disk ArraysIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2004.915:6(559-574)Online publication date: 1-Jun-2004
https://dl.acm.org/doi/10.1109/TPDS.2004.9
Wolf JStone HThiébaut D(1992)Synthetic Traces for Trace-Driven Simulation of Cache MemoriesIEEE Transactions on Computers10.1109/12.13555241:4(388-410)Online publication date: 1-Apr-1992
https://dl.acm.org/doi/10.1109/12.135552

Abstract

References

Cited By

Index Terms

Recommendations

Modeling LRU cache with invalidation

Minimizing Area Cost of On-Chip Cache Memories by Caching Address Tags

Advising cache for lower cache

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations