Advertisement

On the estimation of the execution frequency of sequential program code snippets

  • V. Yu. Korolev
  • R. L. Smelyanskii
  • T. R. Smelyanskii
  • A. V. Shalimov
Computer Methods
  • 45 Downloads

Abstract

Formulas that make it possible to obtain guaranteed interval estimates of the execution frequency of code snippets of the sequential program are given based on asymptotic approximations obtained using the probability theory’s limit theorems. The selection method of appropriate approximation is described based on current estimates of the approximation accuracy of the binomial distribution by normal and Poisson distributions.

Keywords

Larus System Science International Sequential Program Linear Section Control Flow Graph 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    A. V. Shalimov, “A method of determining the execution frequency of program basic blocks,” Modelir. Anal. Inform. Sist. 17 (2), 122–132 (2010).Google Scholar
  2. 2.
    Y. Wu and J. R. Larus, “Static branch frequency and program profile analysis,” in Proceedings of the 27th Annual International Symposium on Microarchitecture (San Jose, California USA, 1994), pp. 1–11.CrossRefGoogle Scholar
  3. 3.
    T. Ball and J. R. Larus, “Optimally profiling and tracing programs,” ACM Trans. Program. Languages Syst. (TOPLAS) 16 (4), 1319–1360 (1994).CrossRefGoogle Scholar
  4. 4.
    B. P. Pal’chun, “Method of software reliability testing,” in Functional Stability of Special Software of Automatic Systems (Moscow, 1989), pp. 111–117 [in Russian].Google Scholar
  5. 5.
    E. I. Parnov, On the Cross of Infinities (Atomizdat Moscow, 1967) [in Russian].Google Scholar
  6. 6.
    R. L. Smelianski and T. Alanko, “On the calculation of control transition probabilities in a program,” Inform. Proces. Lett., No. 3 (1984).Google Scholar
  7. 7.
    R. L. Smelyanskii, D. E. Gur’ev, and A. G. Bakhmurov, “On one mathematical model for program dynamical parameters calculation,” Programmirovanie, No. 6 (1986).Google Scholar
  8. 8.
    R. L. Smelyanskii, “On frequency analysis of sequential program code execution,” Program. Comp. Software 37, 153 (2011).CrossRefMathSciNetGoogle Scholar
  9. 9.
    A. Shalimov and R. Smeliansky, “Program compaction for real-time applications,” in Proceedings of EUCAS Symposium (St.-Petersburg, 2013), pp. 479–496.Google Scholar
  10. 10.
    V. Yu. Korolev, Doctoral (Phys. Math.) Dissertation (Moscow State Univ. Moscow, 1994).Google Scholar
  11. 11.
    V. Yu. Korolev and I. A. Sokolov, Principles of Mathematical Theory of Modified System Reliability (IPI RAN Moscow, 2006) [in Russian].Google Scholar
  12. 12.
    S. Nagaev, V. Chebotarev, and K. Mikhailov, “On the Gaussian asymptotics of the binomial distributions,” in Proceedings of the 30th International Seminar on Stability Problems for Stochastic Models, Svetlogorsk, Russia, Sept. 24–30, 2012, pp 54–56.Google Scholar
  13. 13.
    V. Yu. Korolev, V. E. Bening, and S. Ya. Shorgin, Mathematical Foundations of Risk Theory (Fizmatlit Moscow, 2011) [in Russian].zbMATHGoogle Scholar
  14. 14.
    I. G. Shevtsova, “On the absolute constants in the Berry-Esseen inequality and its structural and nonuniform improvements,” Inform. Primen. 7 (1), 124–125 (2013).Google Scholar
  15. 15.
    L. N. Bol’shev and N. V. Smirnov, Tables of Mathematical Statistics (Nauka Moscow, 1965) [in Russian].Google Scholar

Copyright information

© Pleiades Publishing, Ltd. 2015

Authors and Affiliations

  • V. Yu. Korolev
    • 1
    • 2
  • R. L. Smelyanskii
    • 1
    • 2
  • T. R. Smelyanskii
    • 1
    • 2
  • A. V. Shalimov
    • 1
    • 2
  1. 1.Faculty of Computational Mathematics and CyberneticsMoscow State UniversityMoscowRussia
  2. 2.The Institute of Informatics ProblemsRussian Academy of SciencesMoscowRussia

Personalised recommendations