ABSTRACT
Developing high performance Ada applications not only depends on the chosen algorithms, but also on the time required to execute Ada itself. Timing Ada statements provides developers with insight into patterns of Ada program performance across various platforms. The purpose of this paper is to discuss the timing process and findings when timing Ada performance. The concentration will be on determining the timing differences in conditional code branching on Intel Pentium IV processors.
- Gerber, R. 2002. The Software Optimization Cookbook. Intel Press, United States Google Scholar
Digital Library
- Intel. 2009, June 30. Intel® 64 and IA-32 Architectures Optimization Reference Manual. Retrieved June 30, 2009, from Intel® 64 and IA-32 Architectures Software Developer's Manuals= http://www.intel.com/Assets/PDF/manual/248966.pdfGoogle Scholar
Index Terms
Dynamic analysis of branch mispredictions in Ada
Recommendations
Dynamic analysis of branch mispredictions in Ada
SIGAda '09Developing high performance Ada applications not only depends on the chosen algorithms, but also on the time required to execute Ada itself. Timing Ada statements provides developers with insight into patterns of Ada program performance across various ...
A latency-conscious SMT branch prediction architecture
Executing multiple threads has proved to be an effective solution to partially hide latencies that appear in a processor. When a thread is stalled because of a long-latency operation is being processed, such as a memory access or a floating-point ...









Comments