Symbolic polynomial maximization over convex sets and its application to memory requirement estimation - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue IEEE Transactions on Very Large Scale Integration (VLSI) Systems Année : 2009

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

Résumé

Memory requirement estimation is an important issue in the development of embedded systems, since memory directly influences performance, cost and power consumption. It is therefore crucial to have tools that automatically compute accurate estimates of the memory requirements of programs to better control the development process and avoid some catastrophic execution exceptions. Many important memory issues can be expressed as the problem of maximizing a parametric polynomial defined over a parametric convex domain. Bernstein expansion is a technique that has been used to compute upper bounds on polynomials defined over intervals and parametric "boxes". In this paper, we propose an extension of this theory to more general parametric convex domains and illustrate its applicability to the resolution of memory issues with several application examples.

Dates et versions

inria-00504617 , version 1 (20-07-2010)

Identifiants

Citer

Philippe Clauss, Federico Javier Fernández, Diego Garbervetsky, Sven Verdoolaege. Symbolic polynomial maximization over convex sets and its application to memory requirement estimation. IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2009, 17 (8), pp.983-996. ⟨10.1109/TVLSI.2008.2002049⟩. ⟨inria-00504617⟩

Collections

CNRS INRIA INRIA2
99 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More