Search

Your search keyword '"Lavagno, Luciano"' showing total 20 results
Start Over Author "Lavagno, Luciano" Publisher acm
20 results on '"Lavagno, Luciano"'

3. Synetgy

Author

Yang, Yifan, primary, Huang, Qijing, additional, Wu, Bichen, additional, Zhang, Tianjun, additional, Ma, Liang, additional, Gambardella, Giulio, additional, Blott, Michaela, additional, Lavagno, Luciano, additional, Vissers, Kees, additional, Wawrzynek, John, additional, and Keutzer, Kurt, additional

Published
2019
Full Text
View/download PDF

5. Energy-aware parallelization flow and toolset for C code

Author

Lazarescu, Mihai T., primary, Cohen, Albert, additional, Guatto, Adrien, additional, Lê, Nhat Minn, additional, Lavagno, Luciano, additional, Pop, Antoniu, additional, Prieto, Manuel, additional, Terechko, Andrei, additional, and Sutii, Alexandru, additional

Published
2014
Full Text
View/download PDF

18. ECL

Author

Lavagno, Luciano, primary and Sentovich, Ellen, additional

Published
1999
Full Text
View/download PDF

20. Analytical computation of Ehrhart polynomials

Author

Maurice Bruynooghe, Rachid Seghir, Sven Verdoolaege, Vincent Loechner, Kristof Beyls, Irwin, Mary Jane, Zhao, Wei, Lavagno, Luciano, and Mahlke, Scott A

Subjects
Barvinok's decomposition, Discrete mathematics, Mathematical optimization, Polynomial, Mathematics::Combinatorics, signed unimodular decomposition, compiler analysis, Computer science, parametric polytope, Polytope, Quasi-polynomial, polyhedral model, quasi-polynomial, Ehrhart polynomial, Mathematics::Metric Geometry, Polytope model, Time complexity, Interpolation, Integer (computer science)
Abstract

Many optimization techniques, including several targeted specifically at embedded systems, depend on the ability to calculate the number of elements that satisfy certain conditions. If these conditions can be represented by linear constraints, then such problems are equivalent to counting the number of integer points in (possibly) parametric polytopes. It is well known that this parametric count can be represented by a set of Ehrhart polynomials. Previously, interpolation was used to obtain these polynomials, but this technique has several disadvantages. Its worst-case computation time for a single Ehrhart polynomial is exponential in the input size, even for fixed dimensions. The worst-case size of such an Ehrhart polynomial (measured in bits needed to represent the polynomial) is also exponential in the input size. Under certain conditions this technique even fails to produce a solution. Our main contribution is a novel method for calculating Ehrhart polynomials {\em analytically}. It extends an existing method, based on Barvinok's decomposition, for counting the number of integer points in a non-parametric polytope. Our technique always produces a solution and computes polynomially-sized Ehrhart polynomials in polynomial time (for fixed dimensions). ispartof: pages:248-258 ispartof: Proceedings of the 2004 International Conference on Compilers, Architecture, and Synthesis for Embedded Systems (CASES 2004) pages:248-258 ispartof: International Conference on Compilers, Architectures, and Synthesis for Embedded Systems (CASES 2004) location:Washington D.C. date:22 Sep - 25 Sep 2004 status: published

Published
2004

Catalog

Books, media, physical & digital resources
See catalog results