Issue No.06 - June (1989 vol.38)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.24288
To model cache behavior in a multiprogramming environment, it is necessary to know the number of distinct lines referenced in an execution interval. The stack growth function (SGF) relates the mean number of references (or instructions) to the number of distinct lines referenced; it can be viewed as the inverse function of the mean working set size. A fast, one-pass algorithm to compute the SGF
cache behavior; multiprogramming environment; execution interval; stack growth function; SGF; one-pass algorithm; inverse exponential model; buffer storage; multiprogramming; performance evaluation.
M. Kobayashi, "The Stack Growth Function: Cache Line Reference Models", IEEE Transactions on Computers, vol.38, no. 6, pp. 798-805, June 1989, doi:10.1109/12.24288