This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The Stack Growth Function: Cache Line Reference Models
June 1989 (vol. 38 no. 6)
pp. 798-805
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

[1] A. Smith, "Cache Memories,"Computing Surveys, Vol. 14, No. 3, Sept. 1982, pp. 473- 530.
[2] A.J. Smith, "Bibliography and Readings on CPU Cache Memories and Related Topics,"Computer Architecture News, Jan. 1986, pp. 22-42.
[3] M. H. MacDougall, "Instruction-level program and processor modeling,"Computer, pp. 14-24, July 1984.
[4] M. Kobayashi, "An empirical study of task switching locality in MVS,"IEEE Trans. Comput., vol. C-35, pp. 720-731, Aug. 1986.
[5] J. R. Spirn,Program Behavior: Models and Measurements, Operating and Programming Systems Series. Amsterdam, The Netherlands: Elsevier Computer Science Library, Elsevier North-Holland. 1977.
[6] M. Kobayashi, "The working set size distribution of the Markov program behavior model," Memo. UCB/ERL M79/46, Univ. of California, Berkeley, July 1979.
[7] M. Hofri and P. Tzelnic, "On the working set size for the Markov chain model of program behaviour," inPerformance of Computer Systems, M. Arato, A. Butrimenko, E. Gelenbe, Eds. Amsterdam. The Netherlands: North-Holland, 1979, pp. 393-405.
[8] P. J. Denning and S. C. Schwartz, "Properties of the working-set model,"Commun. ACM, vol. 15, no. 3, pp. 191-198, Mar. 1972.
[9] P. J. Denning, J. R. Spirn, and J. E. Savage, "Some thoughts about locality in program behavior," inProc. Symp. Comput.-Commun. Networks and Teletraffic, Polytechnic Instit. of Brooklyn, Apr. 4-6, 1972, pp. 101-112.
[10] R. Turner and B. Strecker, "Use of the LRU stack depth distribution for simulation of paging behavior,"Commun. ACM, vol. 20, pp. 795-798, Nov. 1977.
[11] J. Lenfant, Evaluation sur des modeles de comportement de programme dela traille d'un ensemble de travail,Revue d'Automatique, Informatique et Recherche Operationnelle B-2, pp. 77-92, June 1974.
[12] S. E. Madnick, "Storage hierarchy systems," Massachusetts Instit. of Technology, Project MAC, TR-107, Apr. 1973.
[13] P. J. Denning, "Virtual memory,"ACM Comput. Surveys, vol. 2, pp. 153-189, 1970.
[14] P. J. Denning, "The working set model for program behavior,"Commun. ACM, vol. 11, no. 5, pp. 323-333, May 1968.
[15] P. J. Denning, "Working sets past and present,"IEEE Trans. Software Eng., vol. SE-6, pp. 64-84, Jan. 1980.
[16] M. Kobayashi, Instruction reference behavior and locality of reference in paging," Ph.D. dissertation, May 1980, Comput. Sci. Division, Dep. Elec. Eng. Comput. Sci., Univ. of California, Berkeley.
[17] J. Lenfant, "Comparison of the working sets and bounded locality intervals," inModelling and Performance Evaluation of Computer Systems, E. Gelenbe, Ed. 1976, pp. 217-239.
[18] J. R. Spirn, "Program locality and dynamic memory management," Ph.D dissertation, Dep. Elec. Eng., Princeton Univ., 1973.
[19] P. J. Denning, "The computation and use of optimal paging curves," Purdue Univ. Comput. Sci. Tech. Rep. CSD-TR-154, June 1975.
[20] OS/VS2 MVS Overview, GC28-0984-1, IBM Corp.
[21] H. Katzan, Jr. and D. Thayarill,Invitation To MVS: Logic and Debugging. Princeton, NJ: Van Nostrand Reinhold, Oct. 1984.
[22] I. J. Haikala, "Cache hit ratios with geometric task switch intervals," inProc. 11th Annu. Int. Symp. Comput. Architecture, vol. 12, no. 3, June 1984, pp. 364-371.
[23] H. S. Stone and D. Thiebaut, "Footprints in the cache," inProc. Perform. '86 and ACM SIGMETRICS 1986, May 27-30, 1986, North Carolina State Univ., Raleigh, NC: Perform. Eval. Rev., vol. 14, pp. 4-8.
[24] M. C. Easton and R. Fagin, "Cold-start versus warm-start miss ratios,"Commun. ACM, vol. 21, no. 10, pp. 866-872, Oct. 1978.
[25] M. Kobayashi, "An algorithm to measure the buffer growth function," Rep. 820413-700A, Amdahl Corp., Sunnyvale, CA, Aug. 1980.
[26] M. Kobayashi, "An algorithm to measure the stack growth function and the measurement results," Tech. Rep. 820882-700A, Amdahl Corp., Sunnyvale, CA, Apr. 1987.

Index Terms:
cache behavior; multiprogramming environment; execution interval; stack growth function; SGF; one-pass algorithm; inverse exponential model; buffer storage; multiprogramming; performance evaluation.
Citation:
M. Kobayashi, M.H. MacDougall, "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
Usage of this product signifies your acceptance of the Terms of Use.