Parametric timing estimation with Newton–Gregory formulae: Research Articles

Authors:
Robert A. van Engelen;Kyle A. Gallivan;Burt Walsh
Affiliations:
Department of Computer Science and School of Computational Science and Information Technology, Florida State University, Tallahassee, FL 32306-4530, U.S.A.;Department of Computer Science and School of Computational Science and Information Technology, Florida State University, Tallahassee, FL 32306-4530, U.S.A.;Department of Computer Science and School of Computational Science and Information Technology, Florida State University, Tallahassee, FL 32306-4530, U.S.A.
Venue:
Concurrency and Computation: Practice & Experience - 10th International Workshop on Compilers for Parallel Computers (CPC 2003)
Year:
2006

Citing 0
Cited 2

Symbolic polynomial maximization over convex sets and its application to memory requirement estimation

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Combining Futures and Spot Markets: A Hybrid Market Approach to Economic Grid Resource Management

Journal of Grid Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a novel method for parametric worst-case execution time (WCET) estimation of loops. The method determines a parametric bound on the iteration space size of loops with both affine and non-affine loop bounds in an efficient manner using a formulation based on Newton–Gregory interpolating polynomials. Parametric WCET formulae are used to support dynamic scheduling decisions at runtime, where the WCET of a scheduled task might not be known statically. To determine worst-case execution time estimates of scientific and multimedia codes, which spent most of the execution time on executing loop iterations, efficient and accurate symbolic loop WCET estimation methods must be capable of analyzing loops with symbolic bounds, non-rectangular loops, zero-trip loops, loops with multiple critical paths, and loops with non-unit strides. Copyright © 2006 John Wiley & Sons, Ltd.