Analytical computation of Ehrhart polynomials: Enabling more compiler analyses and optimizations

CASES 2004: International Conference on Compilers, Architecture, and Synthesis for Embedded Systems

Volumn , Issue , 2004, Pages 248-258

  Verdoolaege, Sven ^a   Seghir, Rachid ^b   Beyls, Kristof ^c  

^a UNIVERSITY OF LEUVEN   (Belgium)

^b UNIVERSITÉ DE STRASBOURG   (France)

^c GHENT UNIVERSITY   (Belgium)

Author keywords

Barvinok's decomposition; Compiler analysis; Ehrhart poly nomial; Parametric polytope; Polyhedral model; Quasi poly nomial; Signed unimodular decomposition

Indexed keywords

BARVINOK'S DECOMPOSITION; COMPILER ANALYSIS; EHRHART POLY-NOMIAL; PARAMETRIC POLYTYPE; POLYHEDREL MODEL; QUASI-POLY-NOMIAL; SIGNED UNIMODULAR DECOMPOSITION;

COMPUTATIONAL METHODS; INTEGER PROGRAMMING; INTERPOLATION; OPTIMIZATION; PROBLEM SOLVING; PROGRAM COMPILERS;

POLYNOMIALS;

EID: 24644501875     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (33)

1. A. Barvinok and J. Pommersheim. An algorithmic theory of lattice points in polyhedra. New Perspectives in Algebraic Combinatorics, (38):91-147, 1999.
2. A. I. Barvinok. A polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed. In 34th Annual Symposium on Foundations of Computer Science, pages 566-572. IEEE, Nov. 1993.
3. K. Beyls. Software Methods to Improve Data Locality and Cache Behavior. PhD thesis, Ghent University, 2004.
4. A. J. C. Bik. Compiler Support for Sparse Matrix Computations. PhD thesis, University of Leiden, The Netherlands, 1996.
5. B. Boigelot and L. Latour. Counting the solutions of Presburger equations without enumerating them. Theoretical Computer Science, (313):17-29, 2004.
6. V. Braberman, D. Garbervetsky, and S. Yovine. On synthesizing parametric specifications of dynamic memory utilization. Technical report, Oct. 2003.
7. M. Brion and M. Vergne. Residue formulae, vector partition functions and lattice points in rational polytopes. J. Amer. Math. Soc., 10:797-833, 1997.
8. R. Buck. Partition of space. American Mathematical Monthly, 50(9):541-544, 1943.
9. S. Chatterjee, E. Parker, P. J. Hanlon, and A. R. Lebeck. Exact analysis of the cache behavior of nested loops. In Proceedings of the ACM SIGPLAN 2001 Conference on Programming Language Design and Implementation, pages 286-297. ACM Press, 2001.
10. P. Clauss and V. Loechner. Parametric Analysis of Polyhedral Iteration Spaces. Journal of VLSI Signal Processing, 19(2):179-194, July 1998.
11. P. D'Alberto, A. Veidembaum, A. Nicolau, and R. Gupta. Static analysis of parameterized loop nests for energy efficient use of data caches. In Workshop on Compilers and Operating Systems for Low Power (COLP01), Sept. 2001.
12. J. De Loera, D. Haws, R. Hemmecke, P. Huggins, B. Sturmfels, and R. Yoshida. Short rational functions for toric algebra and applications, July 2003. http://arxiv.org/abs/math.CO/0307350.
13. J. A. De Loera, D. Haws, R. Hemmecke, P. Huggins, J. Tauzer, and R. Yoshida. A user's guide for latte v1.1, Nov. 2003. software package LattE is available at http://www.math.ucdavis.edu/~latte/.
14. J. A. De Loera, R. Hemmecke, J. Tauzer, and R. Yoshida. Effective lattice point counting in rational convex polytopes, Mar. 2003. http://www.math. ucdavis.edu/~latte/theory.html.
15. E. Ehrhart. Polynômes arithmétiques et méthode des polyèdres en combinatoire. International Series of Numerical Mathematics, 35, 1977.
16. J. Ferrante, V. Sarkar, and W. Thrash. On estimating and enhancing cache effectiveness. In U. Banerjee, D. Gelernter, A. Nicolau, and D. Padua, editors, Proceedings of the Fourth International Workshop on Languages and Compilers for Parallel Computing, volume 589 of Lecture Notes in Computer Science, pages 328-343. Springer-Verlag, Aug. 1991.
17. B. Franke and M. O'Boyle. Array recovery and high-level transformations for DSP applications. ACM Transactions on Embedded Computing Systems, 2(2):132-162, May 2003.
18. Free Software Foundation, Inc. GMP. Available from ftp://ftp.gnu.org/gnu/ gmp.
19. S. Ghosh, M. Martonosi, and S. Malik. Cache miss equations: a compiler framework for analyzing and tuning memory behavior. ACM Transactions on Programming Languages and Systems, 21(4):703-746, 1999.
20. N. Halbwachs, D. Merchat, and C. Parent-Vigouroux. Cartesian factoring of polyhedra in linear relation analysis. In Static Analysis Symposium, SAS'03, San Diego, June 2003. LNCS 2694, Springer Verlag.
21. F. Hannig and J. Teich. Design space exploration for massively parallel processor arrays. In Proceedings of the Sixth International Conference on Parallel Computing Technologies, volume 2127 of Lecture Notes in Computer Science, pages 51-65, 2001.
22. W. Kelly, V. Maslov, W. Pugh, E. Rosser, T. Shpeisman, and D. Wonnacott. The Omega calculator and library. Technical report, University of Maryland, Nov. 1996.
23. B. Lisper. Fully automatic, parametric worst-case execution time analysis. In J. Gustafsson, editor, Proc. Third International Workshop on Worst-Case Execution Time (WCET) Analysis, pages 77-80, Porto, July 2003.
24. V. Loechner. Polylib: A library for manipulating parameterized polyhedra. Technical report, ICPS, Université Louis Pasteur de Strasbourg, France, Mar. 1999.
25. V. Loechner, B. Meister, and P. Clauss. Precise data locality optimization of nested loops. J. Supercomput., 21(1):37-76, 2002.
26. V. Loechner and D. K. Wilde. Parameterized polyhedra and their vertices. International Journal of Parallel Programming, 25(6):525-549, Dec. 1997.
27. B. Nootaert. Een verbeterde methode voor de berekening van Ehrhart-polynomen. Master's thesis, Ghent University, 2004.
28. E. Parker and S. Chatterjee. An automata-theoretic algorithm for counting solutions to Presburger formulas. In Compiler Construction 2004, volume 2985 of Lecture Notes in Computer Science, pages 104-119, Apr. 2004.
29. W. Pugh. Counting solutions to Presburger formulas: How and why. In SIGPLAN Conference on Programming Language Design and Implementation (PLDI'94), pages 121-134, 1994.
30. A. Schrijver. Theory of linear and integer programming. John Wiley & Sons, 1986.
31. V. Shoup. NTL. Available from http://www.shoup.net/ntl/.
32. A. Turjan, B. Kienhuis, and E. Deprettere. A compile time based approach for solving out-of-order communication in Kahn Process Networks. In IEEE 13th International Conference on Aplication-specific Systems, Architectures and Processors (ASAP'2008), July 2002.
33. Y. Zhao and S. Malik. Exact memory size estimation for array computations. IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 8(5):517-521, October 2000.