poster

Relative competitiveness of cache replacement policies

Authors:

SIGMETRICS '08: Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems

Pages 431 - 432

https://doi.org/10.1145/1375457.1375506

Published: 02 June 2008 Publication History

Get Access

Abstract

No abstract available.

References

[1]

C. Ferdinand and R. Wilhelm. Efficient and precise cache behavior prediction for real-time systems. Real-Time Systems, 17(2-3):131--181, 1999.

Digital Library

Google Scholar

[2]

A. Hergenhan and W. Rosenstiel. Static timing analysis of embedded software on advanced processor architectures. In DATE '00, pages 552--559, New York, NY, USA, 2000. ACM Press.

Digital Library

Google Scholar

[3]

J. Reineke and D. Grund. Relative competitive analysis of cache replacement policies. In LCTES, 2008 (to appear).

Digital Library

Google Scholar

[4]

J. Reineke, D. Grund, C. Berg, and R. Wilhelm. Timing predictability of cache replacement policies. Real-Time Systems, 37(2):99--122, November 2007.

Digital Library

Google Scholar

[5]

D. D. Sleator and R. E. Tarjan. Amortized efficiency of list update and paging rules. Commun. ACM, 28(2):202--208, 1985.

Digital Library

Google Scholar

Cited By

View all

Griffin DLesage BBurns ADavis RJan MBen Hedia BGoossens JMaiza C(2014)Lossy Compression for Worst-Case Execution Time Analysis of PLRU CachesProceedings of the 22nd International Conference on Real-Time Networks and Systems10.1145/2659787.2659807(203-212)Online publication date: 8-Oct-2014
https://dl.acm.org/doi/10.1145/2659787.2659807
Reineke JGrund D(2008)Relative competitive analysis of cache replacement policiesACM SIGPLAN Notices10.1145/1379023.137566543:7(51-60)Online publication date: 12-Jun-2008
https://dl.acm.org/doi/10.1145/1379023.1375665
Reineke JGrund DFlautner KRegehr J(2008)Relative competitive analysis of cache replacement policiesProceedings of the 2008 ACM SIGPLAN-SIGBED conference on Languages, compilers, and tools for embedded systems10.1145/1375657.1375665(51-60)Online publication date: 12-Jun-2008
https://dl.acm.org/doi/10.1145/1375657.1375665
Show More Cited By

Index Terms

Relative competitiveness of cache replacement policies
1. Computing methodologies
  1. Modeling and simulation
    1. Model development and analysis
      1. Modeling methodologies
2. Hardware
  1. Hardware validation

Recommendations

An analytical model for cache replacement policy performance
SIGMETRICS '06/Performance '06: Proceedings of the joint international conference on Measurement and modeling of computer systems

Due to the increasing gap between CPU and memory speed, cache performance plays an increasingly critical role in determining the overall performance of microprocessor systems. One of the important factors that a affect cache performance is the cache ...
Relative competitive analysis of cache replacement policies
LCTES '08

Caches are commonly employed to hide the latency gap between memory and the CPU by exploiting locality in memory accesses. On today's architectures a cache miss may cost several hundred CPU cycles.

In order to fulfill stringent performance requirements, ...
Sensitivity of cache replacement policies
Special section on ESTIMedia'12, LCTES'11, rigorous embedded systems design, and multiprocessor system-on-chip for cyber-physical systems

The sensitivity of a cache replacement policy expresses to what extent the execution history may influence the number of cache hits and misses during program execution. We present an algorithm to compute the sensitivity of a replacement policy. We have ...

Comments

Information & Contributors

Information

Published In

SIGMETRICS '08: Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems

June 2008

486 pages

ISBN:9781605580050

DOI:10.1145/1375457

General Chair:
Zhen Liu
IBM T. J. Watson Research Center, USA
,
Program Chairs:
Vishal Misra
Columbia University, USA
,
Prashant Shenoy
University of Massachusetts, USA

ACM SIGMETRICS Performance Evaluation Review Volume 36, Issue 1
SIGMETRICS '08
June 2008
469 pages
ISSN:0163-5999
DOI:10.1145/1384529
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: 02 June 2008

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Poster

Conference

SIGMETRICS08

Sponsor:

SIGMETRICS08: ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems

June 2 - 6, 2008

MD, Annapolis, USA

Acceptance Rates

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

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
296
Total Downloads

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

Reflects downloads up to 09 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Griffin DLesage BBurns ADavis RJan MBen Hedia BGoossens JMaiza C(2014)Lossy Compression for Worst-Case Execution Time Analysis of PLRU CachesProceedings of the 22nd International Conference on Real-Time Networks and Systems10.1145/2659787.2659807(203-212)Online publication date: 8-Oct-2014
https://dl.acm.org/doi/10.1145/2659787.2659807
Reineke JGrund D(2008)Relative competitive analysis of cache replacement policiesACM SIGPLAN Notices10.1145/1379023.137566543:7(51-60)Online publication date: 12-Jun-2008
https://dl.acm.org/doi/10.1145/1379023.1375665
Reineke JGrund DFlautner KRegehr J(2008)Relative competitive analysis of cache replacement policiesProceedings of the 2008 ACM SIGPLAN-SIGBED conference on Languages, compilers, and tools for embedded systems10.1145/1375657.1375665(51-60)Online publication date: 12-Jun-2008
https://dl.acm.org/doi/10.1145/1375657.1375665
Ardelius JGrönvall BWestberg LArvidsson ÅKutscher DOhlman BSolis I(2012)On the effects of caching in access aggregation networksProceedings of the second edition of the ICN workshop on Information-centric networking10.1145/2342488.2342503(67-72)Online publication date: 17-Aug-2012
https://dl.acm.org/doi/10.1145/2342488.2342503

View Options

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

An analytical model for cache replacement policy performance

Relative competitive analysis of cache replacement policies

Sensitivity of cache replacement policies