Supporting Timing Analysis by Automatic Bounding of Loop Iterations

  • Christopher Healy
  • Mikael Sjödin
  • Viresh Rustagi
  • David Whalley
  • Robert Van Engelen
ORKG logo Add to ORKG
Publication date
January 2000

Abstract

. Static timing analyzers, which are used to analyze real-time systems, need to know the minimum and maximum number of iterations associated with each loop in a real-time program so accurate timing predictions can be obtained. This paper describes three complementary methods to support timing analysis by bounding the number of loop iterations. First, an algorithm is presented that determines the minimum and maximum number of iterations of loops with multiple exits. Even when the number of iterations cannot be exactly determined, it is desirable to know the lower and upper iteration bounds. Second, when the number of iterations is dependent on unknown values of variables, the user is asked to provide bounds for these variables. These bounds...

Extracted data

Related items

Bounding Loop Iterations for Timing Analysis
  • Christopher Healy
  • Mikael Sjödin
  • Viresh Rustagi
  • David Whalley
January 1998

Static timing analyzers need to know the minimum and maximum number of iterations associated with ea...

AGeneral Approach for Tight Timing Predictions of Non-Rectangular Loops
  • Christopher Healy
  • Robert Van Engelen
  • David Whalley
January 1999

Static timing analyzers need to know the number of iterations associated with each loop in a real-ti...

Analyzing Loop Paths for Execution Time Estimation
  • Abhik Roychoudhury
  • Tulika Mitra
  • Hemendra Singh Negi
January 2015

Abstract. Statically estimating the worst case execution time of a pro-gram is important for real-ti...

We use cookies to provide a better user experience.