Modeling Live and Dead Lines in Cache Memory Systems

An analytical model that predicts the fraction of live and dead lines present in a cache memory in a multitasking environment is presented. The model is two-fold. The first portion evaluates the number of live lines created in a fully associative cache during the execution of a process. The second portion models the interaction of two processes that share a cache and run in an interleaved fashion. The model admits direct-mapped, set-associative, and fully associative cache architectures. The complete model assumes a hyperbolic (or fractal) model of program behavior. It predicts the variations of the total number of lines (footprint) as well as the number of live lines held by a process in the various caches as a function of the number of cache accesses. The accuracy of the model is validated through trace driven simulations. >

[1]  Dhiraj K. Pradhan,et al.  Two economical directory schemes for large-scale cache coherent multiprocessors , 1991, CARN.

[2]  Philip L. Rosenfeld,et al.  Fractal Nature of Software-Cache Interaction , 1983, IBM J. Res. Dev..

[3]  Malcolm C. Easton,et al.  Computation of Cold-Start Miss Ratios , 1978, IEEE Transactions on Computers.

[4]  Makoto Kobayashi,et al.  The Stack Growth Function: Cache Line Reference Models , 1989, IEEE Trans. Computers.

[5]  Ronald Fagin,et al.  Cold-start vs. warm-start miss ratios , 1978, CACM.

[6]  Abhinav Gupta,et al.  Analysis of cache invalidation patterns in multiprocessors , 1989, ASPLOS 1989.

[7]  Thomas Roberts Puzak,et al.  Analysis of cache replacement-algorithms , 1985 .

[8]  Alan Jay Smith,et al.  Cache Memories , 1982, CSUR.

[9]  Mark Horowitz,et al.  An analytical cache model , 1989, TOCS.

[10]  Dhiraj K. Pradhan,et al.  Modeling of Live Lines and True Sharing in Multi-Cache Memory Systems , 1990, ICPP.

[11]  G. Weiss,et al.  Expected Number of Distinct Sites Visited by a Random Walk with an Infinite Variance , 1970 .

[12]  Alan Jay Smith,et al.  Cache evaluation and the impact of workload choice , 1985, ISCA '85.

[13]  Dominique Thiébaut,et al.  On the Fractal Dimension of Computer Programs and its Application to the Prediction of the Cache Miss Ratio , 1989, IEEE Trans. Computers.

[14]  Harold S. Stone,et al.  Footprints in the cache , 1987, TOCS.

[15]  Peter J. Denning,et al.  The working set model for program behavior , 1968, CACM.

[16]  Janak H. Patel,et al.  Accurate Low-Cost Methods for Performance Evaluation of Cache Memory Systems , 1988, IEEE Trans. Computers.

[17]  Joel L. Wolf,et al.  Synthetic Traces for Trace-Driven Simulation of Cache Memories , 1992, IEEE Trans. Computers.