The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.04 - April (1992 vol.41)
pp: 388-410
ABSTRACT
<p>Two techniques for producing synthetic address traces that produce good emulations of the locality of reference of real programs are presented. The first algorithm generates synthetic addresses by simulating a random walk in an infinite address-space with references governed by a hyperbolic probability law. The second algorithm is a refinement of the first in which the address space has a given finite size. The basic model for the random walk has two parameters that correspond to the working set size and the locality of reference. By comparing synthetic traces with real traces of identical locality parameters, it is demonstrated that synthetic traces exhibit miss ratios and lifetime functions that compare well with those of the real traces they mimic, both in fully associative and in set-associative memories.</p>
INDEX TERMS
trace-driven simulation; cache memories; synthetic address traces; random walk; infinite address-space; synthetic traces; buffer storage; content-addressable storage; digital simulation; memory architecture.
CITATION
D. Thiebaut, J.L. Wolf, H.S. Stone, "Synthetic Traces for Trace-Driven Simulation of Cache Memories", IEEE Transactions on Computers, vol.41, no. 4, pp. 388-410, April 1992, doi:10.1109/12.135552
5 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool