Computational Mathematics and Modeling

, Volume 9, Issue 4, pp 366–374 | Cite as

Methods and means of predicting the run time of serial programs

  • D. V. Kalinichenko
  • A. P. Kapitonova
  • N. V. Yushchenko


We study methods of predicting the run time of serial programs on modern computers. To solve this problem we propose a combined static-dynamic approach to program analysis. Along with methods of prediction we study means of describing the computer architecture. Particular attention is paid to the specifics of the problem of prediction for the class of RISC computers.


Mathematical Modeling Computational Mathematic Industrial Mathematic Program Analysis Computer Architecture 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literature Cited

  1. 1.
    D. Ferrari,Performance Evaluation of Computer Systems, Prentice-Hall (1978).Google Scholar
  2. 2.
    R. L. Smelyanskii,Methods of Analyzing and Evaluating the Productivity of Computer Systems [in Russian], Moscow University Press (1990).Google Scholar
  3. 3.
    J. W. Davidson, J. R. Rabung, and D. B. Whalley, “Relating static and dynamic machine code measurements”,IEEE Trans. Computers, 41, No. 4, 444–454 (1992).CrossRefGoogle Scholar
  4. 4.
    A. G. Bakhmurov and R. L. Smeliansky, “DYANA: An environment for distributed system design and analysis”,Proc. Parcella'96, pp. 85–96.Google Scholar
  5. 5.
    A. P. Kapitonova, R. L. Smelyanskii, and I. V. Terekhov, “An instrumental system for estimating the computing capacity in programs”, in:System Programming and Models for Studying Operations [in Russian], Moscow State University (1993), pp. 57–72.Google Scholar
  6. 6.
    A. P. Kapitonova, R. L. Smelyanskii, and I. V. Terekhov, “A system for estimating the time characteristics of programs: architecture and implementation”, in:Program-Equipment Means and Mathematical Components of Computer Systems [in Russian], Moscow State University (1994), pp. 92–103.Google Scholar
  7. 7.
    K. D. Nilsen and B. Rygg, “Worst-case execution time analysis on modern processors”,Second ACM SIGPLAN Workshop on Languages, Compilers and Tools for Real-Time Systems, June, 1995.Google Scholar
  8. 8.
    S. S. Lim, J. H. Bae, and G. T. Jang, “An accurate worst-case timing analysis technique for RISC processors”,Proc. Fifteenth IEEE Real-Time Systems Symposium, Dec. 1994, pp. 97–108.Google Scholar
  9. 9.
    C. A. Healy, D. B. Whalley, and M. g. Harmon, “Integrating the timing analysis of pipelining and instruction caching”,Proceedings of the IEEE Real-Time Systems Symposium, December, 1995, pp. 288–297.Google Scholar
  10. 10.
    T. A. Diep and J. P. Shen, “Systematic validation of pipeline interlock for superscalar microarchitectures”,Proceedings of the International Symposium on Fault-Tolerant Computing, 1995.Google Scholar
  11. 11.
    J. L. Hennessy and D. A. Patterson,Computer Architecture: a Quantitative Approach. California. 1990.Google Scholar
  12. 12.
    F. Mueller, “Static cache simulation and its applications”, PhD Dissertation, Florida, State University, Tallahassee, Fl, August, 1994.Google Scholar
  13. 13.
    J. Rawat, “Static analysis of cache performance for real-time programming”, Master's thesis, Iowa State University, 1993.Google Scholar
  14. 14.
    The SPARC Architecture Manual, Version 8. Prentice Hall. 1992.Google Scholar
  15. 15.
    J. Kane and J. Heinrich,MIPS RISC Architecture, Prentice Hall. 1992.Google Scholar
  16. 16.
    Yu. Petrova, “Third-generation RISC processors”,Computer Week, Moscow No. 22, 23 (1995).Google Scholar

Copyright information

© Plenum Publishing Corporation 1998

Authors and Affiliations

  • D. V. Kalinichenko
  • A. P. Kapitonova
  • N. V. Yushchenko

There are no affiliations available

Personalised recommendations