Article

Free access

Blocking: exploiting spatial locality for trace compaction

Authors:

Anant Agarwal,

Minor HuffmanAuthors Info & Claims

SIGMETRICS '90: Proceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of computer systems

Pages 48 - 57

https://doi.org/10.1145/98457.98503

Published: 01 April 1990 Publication History

PDF eReader

Abstract

Trace-driven simulation is a popular method of estimating the performance of cache memories, translation lookaside buffers, and paging schemes. Because the cost of trace-driven simulation is directly proportional to trace length, reducing the number of references in the trace significantly impacts simulation time. This paper concentrates on trace driven simulation for cache miss rate analysis. Previous schemes, such as cache filtering, exploited temporal locality for compressing traces and could yield an order of magnitude reduction in trace length. A technique called blocking and a variant called blocking with temporal data are presented that compress traces by exploiting spatial locality. Experimental results show that blocking filtering combined with cache filtering can reduce trace length by nearly two orders of magnitude while introducing about 10% error in cache miss rate estimates.

References

[1]

Anant Agarwal, John Hennessy, and Mark Horowitz. Cache Performance of Operating Systems and Multiprogramming. A CM Transactions on Computer Systems, 6(4):393-431, November 1988.

Digital Library

Google Scholar

[2]

M. D. Hill and A. J. Smith. Evaluating Associativity in CPU Caches. IEEE Transactions on Computers, 38(12):1612-1630, December 1989.

Digital Library

Google Scholar

[3]

R. L. Mattson, J. Gecsei, D. R. Slutz, and I. L. Traiger. Evaluation Techniques for Storage Hierarchies. IBM Systems Journal, 9(2):78-117, 1970.

Digital Library

Google Scholar

[4]

Subhasis Laha, Janak H. Patel, and Ravishankar K. Iyer. Accurate Low-Cost Methods for Performance Evaluation of Cache Memory Systems. IEEE Transactions on Computers, 37(11):1325-1336, November 1988.

Digital Library

Google Scholar

[5]

P. J. Denning. The Working Set Model for Program Behavior. Communications of the A CM, 11(5):323- 333, May 1968.

Digital Library

Google Scholar

[6]

Alan Jay Smith. Two Methods for the Efficient Analysis of Memory Address Trace Data. IEEE Transactions on Software Engineering, SE-3(1), January 1977.

Digital Library

Google Scholar

[7]

Thomas R. Puzak. Analysis of Cache Replacement Algorithms. PhD thesis, University of Massachusetts, Department of Electrical and Computer Engineering, February 1985.

Digital Library

Google Scholar

[8]

A. D~ia S~mples. M~che: No-Loss Tr~ce Comp~ctlon. In Proceedings of A CM SIGMETRICS 1989, May }989.

Digital Library

Google Scholar

[9]

J. L. Hodges Jr. and E. L. Lehmann. Basic Concepts of Probability and Statistics. Holden-day, Inc., San Francisco, 1964.

Google Scholar

[10]

Rupert G. Miller Jr. Beyond Anova- Basics of Applied Statistics. John Wiley ~nd Sons, inc. New York, 1986.

Google Scholar

[11]

Anant Agarwal, Richard L. Sites, and Mark Horowitz. ATUM: A New Techfiique fo~ Capturing Address Traces Using Microcode. In Proceedings of the 13th A nnual Symposium on Computer Architecture, pages 119- 127, IEEE, New York, June 1986.

Digital Library

Google Scholar

[12]

Arturo Salz. VTRACE. 1984. Computer Systems L~boratory, Stanford University.

Google Scholar

[13]

Minor Huffman. A Spatial Locality B~sed Trace Compaction Method. April 1989. Laboratory for Computer Science, Massachusetts Institute of Technology.

Google Scholar

[14]

Anant Agarwal and Mathews Cherish. Adaptive Backoff Synchronization Techniques. In Proceedings 16th Annual international Symposium on Computer Architecture, IEEE, New York, June 1989.

Digital Library

Google Scholar

Cited By

View all

Lee HJin LLee KDemetriades SMoeng MCho S(2010)Two-phase trace-driven simulation (TPTS): a fast multicore processor architecture simulation approachSoftware—Practice & Experience10.5555/1751626.175162940:3(239-258)Online publication date: 1-Mar-2010
https://dl.acm.org/doi/10.5555/1751626.1751629
Michaud P(2009)Online compression of cache-filtered address traces2009 IEEE International Symposium on Performance Analysis of Systems and Software10.1109/ISPASS.2009.4919650(185-194)Online publication date: Apr-2009
https://doi.org/10.1109/ISPASS.2009.4919650
Xiaofeng Gao Snavely ACarter L(2006)Path Grammar Guided Trace Compression and Trace Approximation2006 15th IEEE International Conference on High Performance Distributed Computing10.1109/HPDC.2006.1652136(57-68)Online publication date: 2006
https://doi.org/10.1109/HPDC.2006.1652136
Show More Cited By

Index Terms

Blocking: exploiting spatial locality for trace compaction

Recommendations

Blocking: exploiting spatial locality for trace compaction

Trace-driven simulation is a popular method of estimating the performance of cache memories, translation lookaside buffers, and paging schemes. Because the cost of trace-driven simulation is directly proportional to trace length, reducing the number of ...
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, ...

Comments

Information & Contributors

Information

Published In

SIGMETRICS '90: Proceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of computer systems

April 1990

273 pages

ISBN:0897913590

DOI:10.1145/98457

Chairman:
Gary J. Nutt
Univ. of Colorado, Boulder, CO

ACM SIGMETRICS Performance Evaluation Review Volume 18, Issue 1
May 1990
269 pages
ISSN:0163-5999
DOI:10.1145/98460
Editor:
M. K. Vernon
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 April 1990

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 459 of 2,691 submissions, 17%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

31
Total Citations
View Citations
428
Total Downloads

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

Reflects downloads up to 15 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Lee HJin LLee KDemetriades SMoeng MCho S(2010)Two-phase trace-driven simulation (TPTS): a fast multicore processor architecture simulation approachSoftware—Practice & Experience10.5555/1751626.175162940:3(239-258)Online publication date: 1-Mar-2010
https://dl.acm.org/doi/10.5555/1751626.1751629
Michaud P(2009)Online compression of cache-filtered address traces2009 IEEE International Symposium on Performance Analysis of Systems and Software10.1109/ISPASS.2009.4919650(185-194)Online publication date: Apr-2009
https://doi.org/10.1109/ISPASS.2009.4919650
Xiaofeng Gao Snavely ACarter L(2006)Path Grammar Guided Trace Compression and Trace Approximation2006 15th IEEE International Conference on High Performance Distributed Computing10.1109/HPDC.2006.1652136(57-68)Online publication date: 2006
https://doi.org/10.1109/HPDC.2006.1652136
Knupfer A(2005)Construction and Compression of Complete Call Graphs for Post-Mortem Program Trace AnalysisProceedings of the 2005 International Conference on Parallel Processing10.1109/ICPP.2005.28(165-172)Online publication date: 14-Jun-2005
https://dl.acm.org/doi/10.1109/ICPP.2005.28
Toomula ASubhlok JCox ASubhlok J(2004)Replicating memory behavior for performance predictionProceedings of the 7th workshop on Workshop on languages, compilers, and run-time support for scalable systems10.1145/1066650.1066666(1-8)Online publication date: 22-Oct-2004
https://dl.acm.org/doi/10.1145/1066650.1066666
Luo YJohn L(2004)Locality-Based Online Trace CompressionIEEE Transactions on Computers10.1109/TC.2004.1253:6(723-731)Online publication date: 1-Jun-2004
https://dl.acm.org/doi/10.1109/TC.2004.12
Gao XSnavely A(2003)Exploiting stability to reduce time-space cost for memory tracingProceedings of the 2003 international conference on Computational science: PartIII10.5555/1762418.1762524(966-975)Online publication date: 2-Jun-2003
https://dl.acm.org/doi/10.5555/1762418.1762524
Gao XSnavely A(2003)Exploiting Stability to Reduce Time-Space Cost for Memory TracingComputational Science — ICCS 200310.1007/3-540-44863-2_95(966-975)Online publication date: 18-Jun-2003
https://doi.org/10.1007/3-540-44863-2_95
Johnson EHa JZaidi M(2001)Lossless Trace CompressionIEEE Transactions on Computers10.1109/12.90899150:2(158-173)Online publication date: 1-Feb-2001
https://dl.acm.org/doi/10.1109/12.908991
Uhlig RMudge T(2001)Trace-Driven Memory Simulation: A SurveyPerformance Evaluation: Origins and Directions10.1007/3-540-46506-5_5(97-139)Online publication date: 9-Nov-2001
https://doi.org/10.1007/3-540-46506-5_5
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

Blocking: exploiting spatial locality for trace compaction

Exploiting spatial locality in data caches using spatial footprints

Exploiting spatial locality in data caches using spatial footprints