A retargetable technique for predicting execution time
- 2 January 2003
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
Predicting the execution times of straight-line code sequences is a fundamental problem in the designand evaluation of hard-real-time systems. The reliability of system-level timings and schedulability analysisrests on the accuracy of execution time predictions for the basic schedulable units of work. Obtaining suchpredictions for contemporary microprocessors is difficult.First a summary of some of the hardware and software factors that make predicting execution time difficultis...Keywords
This publication has 10 references indexed in Scilit:
- A design environment for addressing architecture and compiler interactionsMicroprocessors and Microsystems, 1991
- Calculating the maximum execution time of real-time programsReal-Time Systems, 1989
- A portable global optimizer and linkerPublished by Association for Computing Machinery (ACM) ,1988
- Timing Variation in Dual Loop Benchmarks.Published by Defense Technical Information Center (DTIC) ,1987
- Toward real-time performance benchmarks for AdaCommunications of the ACM, 1986
- A retargetable instruction reorganizerPublished by Association for Computing Machinery (ACM) ,1986
- Code selection through object code optimizationACM Transactions on Programming Languages and Systems, 1984
- Automatic generation of peephole optimizationsPublished by Association for Computing Machinery (ACM) ,1984
- A single-pass syntax-directed front end for AdaPublished by Association for Computing Machinery (ACM) ,1982
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJournal of the ACM, 1973