Tight Timing Estimation With the Newton-Gregory Formulae∗

Parametric worst-case execution time (WCET) bounds are critical in removing restrictions, such as known loop bounds, on algorithms for important applications such as scheduling for real-time embedded systems. Current parametric approaches have difficulties with loop nests that include non-rectangular loops, zero-trip loops, and/or loops with non-unit strides. This paper presents a novel approach to parametric WCET estimation based on numeric/symbolic manipulation of polynomial representations for the timing of rectangular and non-rectangular loop nests including those with zero-trip loops, non-unit strides, and multiple critical paths.

[1]  R.A. van Engelen,et al.  Tight non-linear loop timing estimation , 2002, International Workshop on Innovative Architecture for Future Generation High-Performance Processors and Systems.

[2]  William H. Harrison,et al.  Compiler Analysis of the Value Ranges for Variables , 1977, IEEE Transactions on Software Engineering.

[3]  Philippe Clauss,et al.  Counting solutions to linear and nonlinear constraints through Ehrhart polynomials: applications to analyze and transform scientific programs , 1996 .

[4]  David B. Whalley,et al.  Parametric Timing Analysis , 2001, OM '01.

[5]  Rudolf Eigenmann,et al.  Demand-Driven, Symbolic Range Propagation , 1995, LCPC.

[6]  Jon G. Rokne,et al.  Computer Methods for the Range of Functions , 1984 .

[7]  Eugene V. Zima Simplification and optimization transformations of chains of recurrences , 1995, ISSAC '95.

[8]  Rizos Sakellariou Symbolic Evaluation of Sums for Parallelising Compilers , 1997 .

[9]  William Pugh,et al.  Counting solutions to Presburger formulas: how and why , 1994, PLDI '94.

[10]  David B. Whalley,et al.  Supporting Timing Analysis by Automatic Bounding of Loop Iterations , 2000, Real-Time Systems.

[11]  Constantine D. Polychronopoulos,et al.  Symbolic analysis for parallelizing compilers , 1996, TOPL.

[12]  O. Bachmann Chains of recurrences , 1997 .

[13]  Thomas Fahringer,et al.  Efficient Symbolic Analysis for Parallelizing Compilers and Performance Estimators , 1998, The Journal of Supercomputing.