Path: utzoo!attcan!uunet!lll-winken!ncis.llnl.gov!helios.ee.lbl.gov!pasteur!agate!bionet!csd4.milw.wisc.edu!bbn!rochester!pt.cs.cmu.edu!k.gp.cs.cmu.edu!dkirk
From: dkirk@k.gp.cs.cmu.edu (Dave Kirk)
Newsgroups: comp.arch
Subject: Cache models and program behavior
Message-ID: <4122@pt.cs.cmu.edu>
Date: 26 Jan 89 21:32:58 GMT
Organization: Carnegie-Mellon University, CS/RI/ECE
Lines: 17

I am looking for references to techniques for modelling memory access
patterns and approximate cache hit (miss) rates.  I'd like to reduce
specific access strings to a few parameters which could be used to
determine approximate cache hit (miss) rates.

I know of at least two such techniques.  A fractal model was proposed
by Thiebaut (1987), and models a fully associative cache hit rate using
four program parameters.  Another approach was proposed by Strecker
(1983) in which he modified a linear approach presented by Saltzer (1974).
Strecker's approach derived two parameters by measuring the program
miss rate in a large and small cache.  These parameters can then be
used to calculate the miss rate for any other cache size.

Additional references have been hard to come by, and would be greatly
appreciated.  

(replies can be sent to above account, or kirk@maxwell.ece.cmu.edu)
--