Report Number: CSL-TR-77-138
Institution: Stanford University, Computer Systems Laboratory
Title: Program behavior and the performance of interleaved memories
Author: Rau, B. Ramakrishna
Date: May 1977
Abstract: One of the major factors influencing the performance of an
interleaved memory system is the behavior of the request
sequence, but this is normally ignored. This report examines
this issue. Using trace driven simulations it is shown that
the commonly used assumption, that all requests are equally
likely to be to any module, is not valid. The duality of
memory interference with paging is noted and this suggests
the use of the Least-Recently-Used Stack Model to model
program behavior. Simulation shows that this model is quite
successful. An accurate expression for the bandwidth is
derived based upon this model.
http://i.stanford.edu/pub/cstr/reports/csl/tr/77/138/CSL-TR-77-138.pdf