poster

A higher order theory of locality

Authors:

Chen Ding,

Xiaoya XiangAuthors Info & Claims

MSPC '12: Proceedings of the 2012 ACM SIGPLAN Workshop on Memory Systems Performance and Correctness

Pages 68 - 69

https://doi.org/10.1145/2247684.2247697

Published: 16 June 2012 Publication History

Get Access

Abstract

This short paper outlines a theory for deriving the traditional metrics of miss rate and reuse distance from a single measure called the footprint. It gives the correctness condition and discusses the uses of the new theory in on-line locality analysis and multicore cache management.

References

[1]

A. J. Smith. On the effectiveness of set associative page mapping and its applications in main memory management. In Proceedings of ICSE, 1976.

Digital Library

Google Scholar

[2]

X. Xiang, B. Bao, and C. Ding. Program locality sampling in shared cache: A theory and a real-time solution. Technical Report URCS #972, Department of Computer Science, University of Rochester, December 2011.

Google Scholar

[3]

X. Xiang, B. Bao, C. Ding, and Y. Gao. Linear-time modeling of program working set in shared cache. In Proceedings of PACT, pages 350--360, 2011.

Digital Library

Google Scholar

[4]

X. Xiang, B. Bao, C. Ding, and K. Shen. Cache conscious task regrouping on multicore processors. In Proceedings of CCGrid, 2012.

Digital Library

Google Scholar

Cited By

View all

Liu JEspina PSun X(2021)A Study on Modeling and Optimization of Memory SystemsJournal of Computer Science and Technology10.1007/s11390-021-0771-836:1(71-89)Online publication date: 30-Jan-2021
https://doi.org/10.1007/s11390-021-0771-8
Byrne DOnder NWang Z(2018)mPart: miss-ratio curve guided partitioning in key-value storesACM SIGPLAN Notices10.1145/3299706.321057153:5(84-95)Online publication date: 18-Jun-2018
https://dl.acm.org/doi/10.1145/3299706.3210571
Byrne DOnder NWang ZPayer HSartor J(2018)mPart: miss-ratio curve guided partitioning in key-value storesProceedings of the 2018 ACM SIGPLAN International Symposium on Memory Management10.1145/3210563.3210571(84-95)Online publication date: 18-Jun-2018
https://dl.acm.org/doi/10.1145/3210563.3210571
Show More Cited By

Index Terms

A higher order theory of locality

Recommendations

Two Fast and High-Associativity Cache Schemes

A traditional implementation of the set-associative cache has the disadvantage of longer access cycle times than that of a direct-mapped cache. Several methods have been proposed for implementing associativity in non-traditional ways. However, most of ...
Locality approximation using time
Proceedings of the 2007 POPL Conference

Reuse distance (i.e. LRU stack distance) precisely characterizes program locality and has been a basic tool for memory system research since the 1970s. However, the high cost of measuring has restricted its practical uses in performance debugging, ...
Locality approximation using time
POPL '07: Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Reuse distance (i.e. LRU stack distance) precisely characterizes program locality and has been a basic tool for memory system research since the 1970s. However, the high cost of measuring has restricted its practical uses in performance debugging, ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

MSPC '12: Proceedings of the 2012 ACM SIGPLAN Workshop on Memory Systems Performance and Correctness

June 2012

82 pages

ISBN:9781450312196

DOI:10.1145/2247684

General Chair:
Lixin Zhang
ICT, Chinese Academy of Sciences
,
Program Chair:
Onur Mutlu
Carnegie Mellon University

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 16 June 2012

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Poster

Conference

PLDI '12

Sponsor:

SIGPLAN

PLDI '12: ACM SIGPLAN Conference on Programming Language Design and Implementation

June 16, 2012

Beijing, China

Acceptance Rates

Overall Acceptance Rate 6 of 20 submissions, 30%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
134
Total Downloads

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

Reflects downloads up to 18 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Liu JEspina PSun X(2021)A Study on Modeling and Optimization of Memory SystemsJournal of Computer Science and Technology10.1007/s11390-021-0771-836:1(71-89)Online publication date: 30-Jan-2021
https://doi.org/10.1007/s11390-021-0771-8
Byrne DOnder NWang Z(2018)mPart: miss-ratio curve guided partitioning in key-value storesACM SIGPLAN Notices10.1145/3299706.321057153:5(84-95)Online publication date: 18-Jun-2018
https://dl.acm.org/doi/10.1145/3299706.3210571
Byrne DOnder NWang ZPayer HSartor J(2018)mPart: miss-ratio curve guided partitioning in key-value storesProceedings of the 2018 ACM SIGPLAN International Symposium on Memory Management10.1145/3210563.3210571(84-95)Online publication date: 18-Jun-2018
https://dl.acm.org/doi/10.1145/3210563.3210571
Liu YSun X(2018)CaL: Extending Data Locality to Consider Concurrency for Performance OptimizationIEEE Transactions on Big Data10.1109/TBDATA.2017.27538254:2(273-288)Online publication date: 1-Jun-2018
https://doi.org/10.1109/TBDATA.2017.2753825

View Options

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

Two Fast and High-Associativity Cache Schemes

Locality approximation using time

Locality approximation using time