Performance expectations on Ada programs

1Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Wall, G., Asplund, L., Björnfot, L., & Lundqvist, K. (1993). Performance expectations on Ada programs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 688 LNCS, pp. 227–239). Springer Verlag. https://doi.org/10.1007/3-540-56802-6_18

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free