Skip to main content
SpringerLink
Log in

Performance expectations on Ada programs

  • Conference paper
  • First Online:
Ada - Europe '93 (Ada-Europe 1993)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 688))

Included in the following conference series:

Abstract

A method for performance estimation of Ada programs by analyzing their syntactical structure is presented. The use of algorithmic knowledge by means of code annotations to improve the analysis is discussed. Dual loop benchmarks are used to estimate the execution time for basic Ada features from which all other estimations are derived. An example program is analyzed and compared to its actual time showing an initial overestimation of 40%. It is suggested that the method is integrated with the Ada-environment to ensure that estimations are consistent with the current version of the code.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H.J. Curnow and B.A. Wichman A Synthetic Benchmark. Computer Journal 19(l):43–49, January 1976

    Article  Google Scholar 

  2. R.P. Weicker Dhrystone: A Synthetic Systems Programming Benchmark. Communications of the ACM, 27(10): 1013–1030, October 1984.

    Article  Google Scholar 

  3. R.M. Clapp, L. Duchesnea, R.A. Voltz, T.N. Mudge and T. Schultze Toward Real-Time Performance Benchmarks For Ada Communications of the ACM, 29(8):760–778, August 1986.

    Article  Google Scholar 

  4. Ada Letters Special Edition from the SIGAda Performance Issues Working Group on Ada Performance Issues, X(3) Winter 1990.

    Google Scholar 

  5. C.M. Woodside, E.M. Hagos, E. Neron and R.J.A. Buhr The CAEDE Performance Analysis Tool. Proceedings of the First Symposium on environments and Tools for Ada, XI(3) Spring 1991.

    Google Scholar 

  6. J.G.P. Barnes Programming in Ada, 3rd edition. Addison-Wesley, 1989.

    Google Scholar 

  7. N. Altman and N. Weiderman Timing Variations in Dual Loop Benchmarks. Technical Report CMU/SEI-87-TR-21, SEI, CMU.

    Google Scholar 

  8. Caculating the Maximum Execution Time of Real-Time Programs, P. Puschner and Ch. Koza. Real-Time Systems, 1(2):159–176, Sep. 1989.

    Article  Google Scholar 

  9. Experiments with a Program Timing Tool Based on Source-Level Timing Schema, Chang Yun Park and Alan C. Shaw. IEEE Computer Magazine May 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Systems, Uppsala University, P.O. Box 325, S-751 05, Uppsala, Sweden

    Göran Wall, Lars Asplund, Lars Björnfot & Kristina Lundqvist

Authors
  1. Göran Wall
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lars Asplund
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Lars Björnfot
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Kristina Lundqvist
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Michel Gauthier

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wall, G., Asplund, L., Björnfot, L., Lundqvist, K. (1993). Performance expectations on Ada programs. In: Gauthier, M. (eds) Ada - Europe '93. Ada-Europe 1993. Lecture Notes in Computer Science, vol 688. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56802-6_18

Download citation

  • DOI: https://doi.org/10.1007/3-540-56802-6_18

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56802-5

  • Online ISBN: 978-3-540-47748-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation