Universal Cache Miss Equations for the Memory Hierarchy

Posted in Conferences, Companies, Science on July 06, 2007

Universal Cache Miss Equations for the Memory Hierarchy
Google Tech Talks
June 7, 2007


Computer systems in large enterprises and in the outsourcing industry are difficult to manage manually. This difficulty has led to a push for autonomic computing, where the goal is to have the system automatically configure its settings, tune its performance and recover from failures.

Such large systems have innumerable caches to enhance performance. One task in autonomic computing lies in sizing these caches and sharing them out among competing workloads. Cache miss equations can help to automate this task.

For the cache miss equations to be helpful, they must be universal: they must fit any real memory reference pattern and cache management policy, through parameters that can be calibrated automatically and dynamically.

This talk proposes a research program to derive such equations. This proposal is for a drastic departure from forty years of cache miss analysis. Three cache miss equations (for main memory, database buffers and processor caches) are presented as evidence for the feasibility of the research program.

Watch Video

Tags: Techtalks, Google, Conferences, Science, Lectures, Math, Computer Science, Broadcasting, Companies