Handling memory cache policy with integer points countings

DOI10.1007/BFB0002746MaRDI QIDQ4536941zbMATH OpenFDO

Authors Philippe Clauss

Publication date 25 June 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0002746

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Computing methodologies and applications (68U99)

Recommendations

• On the complexity of cache analysis for different replacement policies
• Counting integer points in parametric polytopes using Barvinok's rational functions
• Optimal Worst Case Formulas Comparing Cache Memory Associativity
• An analysis of optimum caching
• A polynomial-time algorithm for memory space reduction

This page was built for publication: Handling memory cache policy with integer points countings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4536941)