Program behavior and its models

  • Takashi Masuda
  • Tong-Haing Fin
Part II, Program Behavior And Performance Models
First Online:
Part of the Lecture Notes in Computer Science book series (LNCS, volume 143)

Abstract

This paper first discusses the program behavior models developed until now. It includes non-locality models, locality models and phase/transition models. Then a new model of program behavior is proposed. The previous models are based only on the information in the reference string generated by the program during its execution. Our approach is to utilize the information in the source programs as well as the one in the program's reference string. It seems to be useful not only for modeling of program behavior, but also it suggests a new locality concept. that compilers can implant instructions (e.g., at the entry and exit of each repetitive contour) that advise dynamically the memory management (such as working set algorithm) when certain pages or segments have been referenced for the last time in the current phase. We are currently investigating some of the applications of the locality contour concept to control the parameter of the memory management, and the validation of this model in the actual reference strings.

Keywords

Active Contour Micro Model Source Program Program Behavior Replacement Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aho A.V., Denning P.J. (1971). Principles of optimal page replacement. J. ACM, Vol 18, No 1, January 1981, pp 80–93.Google Scholar
  2. Arvind, Kain R.Y., Sadeh E. (1973). On reference string generation process. Proc. 4th ACM Symposium on Operating Systems Principles. October 1973, pp 80–87.Google Scholar
  3. Baskett F., Rafii A. (1976). The A0 inversion model of program paging behavior. Stanford University, Computer Science Dept., Report STAN-CS-76-579, November 1976.Google Scholar
  4. Batson A.P. (1976a). Program behavior at the symbolic level. Computer, Vol 9, No 11, November 1976, pp 21–26.Google Scholar
  5. Batson A.P., Madison A.W. (1976b). Measurements of major locality phases in symbolic reference strings. Proc. Int'l Symposium on Computer Performance Modeling, Measurement, and Evaluation. ACM SIGMETRICS and IFIP WG 7.3 March 1976, pp 75–84.Google Scholar
  6. Belady L.A. (1966). A study of replacement algorithms for virtual storage computers. IBM Syst. J., Vol 5, No 2, 1966, pp 78–101.Google Scholar
  7. Courtois P.J., Vantilborgh H. (1976). A decomposable model of program paging behavior. Acta Informatica, Vol 6, No 3, 1976, pp 251–276.Google Scholar
  8. Courtois P.J. (1977). Decomposability. Academic Press. 1977.Google Scholar
  9. Denning P.J. (1968). The working set model for program behavior. Comm. ACM, Vol 11, No 5, May 1968, pp 323–333.Google Scholar
  10. Denning P.J. (1972). On modeling program behavior. AFIPS Conf. Proc. 40. 1972 JSCC, pp 937–944.Google Scholar
  11. Ferrari D. (1974). Improving program locality by strategy oriented restructuring. Proc. IFIP Conf., 1974, pp 266–270.Google Scholar
  12. Franklin M.A., Gupta R.K. (1974). Computation of page fault probability from program transition diagram. Comm. ACM, Vol 17, No 4, April 1974, pp 186–191.Google Scholar
  13. Graham G.S. (1976). A study of program and memory policy behavior. Ph.D. Thesis, Dept. Computer Sciences, Purdue Univ., December 1976.Google Scholar
  14. Gupta R.K. (1974). Program reference behavior and dynamic memory management. Ph.D. Thesis, Washington University, 1974.Google Scholar
  15. Hatfield D., Gerald J. (1971). Program restructuring for virtual memory. IBM Syst. J., Vol 10, No 3, 1971, pp 168–192.Google Scholar
  16. Hofri M., Tzelnic P. (1979). On the working set size for the markov chain model of program behavior. Performance of computer systems, edited by M. Arato et al., North-Holland, 1979, pp 393–405.Google Scholar
  17. Kahn K.C., Denning P.J. (1975). A study of program locality and lifetime functions. Proc. 5th ACM Symposium on Operating Systems Principles, November 1975, pp 207–216.Google Scholar
  18. Kobayashi M. (1980). Instruction reference behavior and locality of reference in paging. Ph.D. Thesis, Univ. of California, Berkeley, 1980.Google Scholar
  19. Madison A.W., Batson A.P. (1975, 1976). Characteristics of program localities. Proc. 5th ACM Symbosium on Operating System Principles, November 1975, pp 64–73. See also Comm. ACM. Vol 19, No 5, May 1976, pp 285–294.Google Scholar
  20. Masuda T., Shoita H., Noguchi K., Ohki T. (1974). Optimization of program organization by cluster analysis. Proc. IFIP Conf., 1974, pp 261–265.Google Scholar
  21. Mattson R.L., Gescei J., Slutz D.R., Traiger I.L. (1970). Evaluation techniques for storage hierarchies. IBM Syst. J., Vol 9, No 2, 1970, pp 78–117.Google Scholar
  22. Shedler G.S., Tung C. (1972). Locality in page reference strings. SIAM J. Computing, Vol 1, No 3, September 1972, pp 218–241.Google Scholar
  23. Spirn J.R., Denning P.J. (1972). Experiments with program locality. AFIPS Conf. Proc. 41. 1972 FJCC, pp 611–621.Google Scholar
  24. Spirn J.R. (1976). Distance string models for program behavior. Computer, Vol 9, No 11, November 1976, pp 14–20.Google Scholar
  25. Spirn J.R. (1977). Program behavior: Models and Measurement. Elsevier/North-Holland Publishing Co., 1977.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1982

Authors and Affiliations

  • Takashi Masuda
    • 1
  • Tong-Haing Fin
    • 2
  1. 1.Institute of Information Sciences and ElectronicsUniversity of TsukubaIbarakiJapan
  2. 2.Department of System ScienceTokyo Institute of TechnologyTokyoJapan

Personalised recommendations