A Retargetable Technique for Predicting Execution Time

  title={A Retargetable Technique for Predicting Execution Time},
  author={Marion G. Harmon and Theodore P. Baker and David B. Whalley},
Predicting the execution times of straight-line code sequences is a fundamental problem in the design and evaluation of hard-real-time systems. The reliability of system-level timings and schedulability analysis rests on the accuracy of execution time predictions for the basic schedulable units of work. Obtaining such predictions for contemporary microprocessors is diicult. First a summary of some of the hardware and software factors that make predicting execution time diicult is presented… CONTINUE READING
Highly Cited
This paper has 99 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 64 extracted citations

An Accurate Worst Case Timing Analysis for RISC Processors

IEEE Trans. Software Eng. • 1995
View 6 Excerpts
Highly Influenced

A Real-Time Instruction Cache with High Average-Case Performance

2014 IEEE 17th International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing • 2014

99 Citations

Citations per Year
Semantic Scholar estimates that this publication has 99 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 19 references

A Table Driven Retargetable Disassembler Generator", Master's Project

D. I. Oh

Evaluating Tight Execution Time Bounds of Programs by Annotations

A. K. Mok
Sixth IEEE Workshop on Real-Time Operating Systems and Software, • 1989

Source-Level Tool for Predicting Deterministic Execution Times of Programs

C.Y.C.Y. Park, A. C. Shaw
(Sep • 1989

Using the ETA System Multiprocessing Simulator To Prepare for The ETA10 I/O

C. N. Arnold

Variation in Dual Loop Benchmarks

N. Altman, N. Weiderman, Timing
Technical Report CMU/SEI- 87-TR-22, • 1987

Similar Papers

Loading similar papers…