메뉴 건너뛰기




Volumn 3443, Issue , 2005, Pages 91-105

Experiences with enumeration of integer projections of parametric polytopes

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; CONSTRAINT THEORY; INFORMATION TECHNOLOGY; NUMBER THEORY; OPTIMIZATION; PROBLEM SOLVING; PROGRAM COMPILERS;

EID: 24644448365     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31985-6_7     Document Type: Conference Paper
Times cited : (24)

References (42)
  • 1
    • 0032305438 scopus 로고    scopus 로고
    • Compiler optimizations for real time execution of loops on limited memory embedded systems
    • S. Anantharaman and S. Pande. Compiler optimizations for real time execution of loops on limited memory embedded systems. In RTSS, 1998.
    • (1998) RTSS
    • Anantharaman, S.1    Pande, S.2
  • 2
    • 0001151864 scopus 로고
    • Background memory area estimation for multidimensional signal processing systems
    • F. Balasa, F. Catthoor, and H. De Man. Background memory area estimation for multidimensional signal processing systems. IEEE Transactions on VLSI, 3(2):157-172, 1995.
    • (1995) IEEE Transactions on VLSI , vol.3 , Issue.2 , pp. 157-172
    • Balasa, F.1    Catthoor, F.2    De Man, H.3
  • 4
    • 0141680581 scopus 로고    scopus 로고
    • Short rational generating functions for lattice point problems
    • Apr.
    • A. Barvinok and K. Woods. Short rational generating functions for lattice point problems. J. Amer. Math. Soc., 16:957-979, Apr. 2003.
    • (2003) J. Amer. Math. Soc. , vol.16 , pp. 957-979
    • Barvinok, A.1    Woods, K.2
  • 5
    • 24644443395 scopus 로고    scopus 로고
    • Generation of distributed loop control
    • SAMOS
    • M. Bednara, F. Hannig, and J. Teich. Generation of distributed loop control. In SAMOS, volume 2268 of LNCS, pages 154-170, 2002.
    • (2002) LNCS , vol.2268 , pp. 154-170
    • Bednara, M.1    Hannig, F.2    Teich, J.3
  • 8
    • 0742267112 scopus 로고    scopus 로고
    • Counting the solutions of Presburger equations without enumerating them
    • Feb.
    • B. Boigelot and L. Latour. Counting the solutions of Presburger equations without enumerating them. Theoretical Computer Science, 313(1):17-29, Feb. 2004.
    • (2004) Theoretical Computer Science , vol.313 , Issue.1 , pp. 17-29
    • Boigelot, B.1    Latour, L.2
  • 9
    • 24644437502 scopus 로고    scopus 로고
    • Communication pre-evaluation in HPF
    • EUROPAR'98, Springer Verlag
    • P. Boulet and X. Redon. Communication pre-evaluation in HPF. In EUROPAR'98, volume 1470 of LNCS, pages 263-272. Springer Verlag, 1998.
    • (1998) LNCS , vol.1470 , pp. 263-272
    • Boulet, P.1    Redon, X.2
  • 10
    • 84861248751 scopus 로고    scopus 로고
    • Communication pre-evaluation in HPF
    • Université des Sciences et Technologies de Lille
    • P. Boulet and X. Redon. Communication pre-evaluation in HPF. Technical report, Université des Sciences et Technologies de Lille, 1998. AS-182.
    • (1998) Technical Report
    • Boulet, P.1    Redon, X.2
  • 11
    • 24644501876 scopus 로고    scopus 로고
    • On synthesizing parametric specifications of dynamic memory utilization
    • VERIMAG, Oct.
    • V. Braberman, D. Garbervetsky, and S. Yovine. On synthesizing parametric specifications of dynamic memory utilization. Technical Report TR-2004-03, VERIMAG, Oct. 2003.
    • (2003) Technical Report , vol.TR-2004-03
    • Braberman, V.1    Garbervetsky, D.2    Yovine, S.3
  • 12
    • 18844387390 scopus 로고    scopus 로고
    • Exact analysis of the cache behavior of nested loops
    • S. Chatterjee, E. Parker, P. J. Hanlon, and A. R. Lebeck. Exact analysis of the cache behavior of nested loops. In PLDI, pages 286-297, 2001.
    • (2001) PLDI , pp. 286-297
    • Chatterjee, S.1    Parker, E.2    Hanlon, P.J.3    Lebeck, A.R.4
  • 13
    • 0029717349 scopus 로고    scopus 로고
    • Counting solutions to linear and nonlinear constraints through Ehrhart polynomials: Applications to analyze and transform scientific programs
    • P. Clauss. Counting solutions to linear and nonlinear constraints through Ehrhart polynomials: Applications to analyze and transform scientific programs. In International Conference on Supercomputing, pages 278-285, 1996.
    • (1996) International Conference on Supercomputing , pp. 278-285
    • Clauss, P.1
  • 14
    • 84882729664 scopus 로고    scopus 로고
    • Handling memory cache policy with integer points counting
    • P. Clauss. Handling memory cache policy with integer points counting. In European Conference on Parallel Processing, pages 285-293, 1997.
    • (1997) European Conference on Parallel Processing , pp. 285-293
    • Clauss, P.1
  • 15
    • 0032117761 scopus 로고    scopus 로고
    • Parametric analysis of polyhedral iteration spaces
    • July
    • P. Clauss and V. Loechner. Parametric analysis of polyhedral iteration spaces. Journal of VLSI Signal Processing, 19(2): 179-194, July 1998.
    • (1998) Journal of VLSI Signal Processing , vol.19 , Issue.2 , pp. 179-194
    • Clauss, P.1    Loechner, V.2
  • 16
    • 29144484206 scopus 로고    scopus 로고
    • Static analysis of parameterized loop nests for energy efficient use of data caches
    • P. D'Alberto, A. Veidembaum, A. Nicolau, and R. Gupta. Static analysis of parameterized loop nests for energy efficient use of data caches. In COLP, 2001.
    • (2001) COLP
    • D'Alberto, P.1    Veidembaum, A.2    Nicolau, A.3    Gupta, R.4
  • 19
    • 4344650688 scopus 로고
    • Polynômes arithmétiques et méthode des polyèdres en combinatoire
    • E. Ehrhart. Polynômes arithmétiques et méthode des polyèdres en combinatoire. International Series of Numerical Mathematics, 35, 1977.
    • (1977) International Series of Numerical Mathematics , vol.35
    • Ehrhart, E.1
  • 21
    • 85015240805 scopus 로고
    • On estimating and enhancing cache effectiveness
    • LCPC
    • J. Ferrante, V. Sarkar, and W. Thrash. On estimating and enhancing cache effectiveness. In LCPC, volume 589 of LNCS, pages 328-343, 1991.
    • (1991) LNCS , vol.589 , pp. 328-343
    • Ferrante, J.1    Sarkar, V.2    Thrash, W.3
  • 22
    • 24644514550 scopus 로고    scopus 로고
    • Design of processor arrays for real-time applications
    • LNCS
    • D. Fimmel and R. Merker. Design of processor arrays for real-time applications. In Euro-Par '98, LNCS, pages 1018-1028, 1998.
    • (1998) Euro-Par '98 , pp. 1018-1028
    • Fimmel, D.1    Merker, R.2
  • 23
    • 1142271338 scopus 로고    scopus 로고
    • Array recovery and high-level transformations for DSP applications
    • May
    • B. Franke and M. O'Boyle. Array recovery and high-level transformations for DSP applications. ACM TECS, 2(2): 132-162, May 2003.
    • (2003) ACM TECS , vol.2 , Issue.2 , pp. 132-162
    • Franke, B.1    O'Boyle, M.2
  • 24
  • 25
    • 84937567590 scopus 로고    scopus 로고
    • Design space exploration for massively parallel processor arrays
    • PaCT
    • F. Hannig and J. Teich. Design space exploration for massively parallel processor arrays. In PaCT, volume 2127 of LNCS, pages 51-65, 2001.
    • (2001) LNCS , vol.2127 , pp. 51-65
    • Hannig, F.1    Teich, J.2
  • 26
    • 24644495356 scopus 로고    scopus 로고
    • Volume driven data distribution for NUMA-machines
    • LNCS
    • F. Heine and A. Slowik. Volume driven data distribution for NUMA-machines. In Euro-Par, LNCS, pages 415-424, 2000.
    • (2000) Euro-Par , pp. 415-424
    • Heine, F.1    Slowik, A.2
  • 29
    • 0036171073 scopus 로고    scopus 로고
    • Precise data locality optimization of nested loops
    • V. Loechner, B. Meister, and P. Clauss. Precise data locality optimization of nested loops. J. Supercomput., 21(1):37-76, 2002.
    • (2002) J. Supercomput. , vol.21 , Issue.1 , pp. 37-76
    • Loechner, V.1    Meister, B.2    Clauss, P.3
  • 30
    • 34547207940 scopus 로고    scopus 로고
    • Projecting periodic polyhedra for loop nest analysis
    • B. Meister. Projecting periodic polyhedra for loop nest analysis. In CPC, pages 13-24, 2004.
    • (2004) CPC , pp. 13-24
    • Meister, B.1
  • 31
    • 24644524767 scopus 로고    scopus 로고
    • An automata-theoretic algorithm for counting solutions to Presburger formulas
    • Compiler Construction
    • E. Parker and S. Chatterjee. An automata-theoretic algorithm for counting solutions to Presburger formulas. In Compiler Construction, volume 2985 of LNCS, pages 104-119, 2004.
    • (2004) LNCS , vol.2985 , pp. 104-119
    • Parker, E.1    Chatterjee, S.2
  • 32
    • 0026278958 scopus 로고
    • The Omega test: A fast and practical integer programming algorithm for dependence analysis
    • W. Pugh. The Omega test: a fast and practical integer programming algorithm for dependence analysis. In Conference on Supercomputing, pages 4-13, 1991.
    • (1991) Conference on Supercomputing , pp. 4-13
    • Pugh, W.1
  • 33
    • 0028132512 scopus 로고
    • Counting solutions to Presburger formulas: How and why
    • W. Pugh. Counting solutions to Presburger formulas: How and why. In PLDI, pages 121-134, 1994.
    • (1994) PLDI , pp. 121-134
    • Pugh, W.1
  • 36
    • 0037609023 scopus 로고
    • On vector partition functions
    • B. Sturmfels. On vector partition functions. J. Comb. Theory Ser. A, 72(2):302-309, 1995.
    • (1995) J. Comb. Theory Ser. A , vol.72 , Issue.2 , pp. 302-309
    • Sturmfels, B.1
  • 37
    • 0029190371 scopus 로고
    • Advanced compilation techniques in the PARADIGM compiler for distributed-memory multicomputer
    • E. Su and A. L. et al. Advanced compilation techniques in the PARADIGM compiler for distributed-memory multicomputer. In ICS, pages 424-433, 1995.
    • (1995) ICS , pp. 424-433
    • Su, E.1    L., A.2
  • 38
    • 34547336824 scopus 로고    scopus 로고
    • A compile time based approach for solving out-of-order communication in Kahn process networks
    • A. Turjan, B. Kienhuis, and E. Deprettere. A compile time based approach for solving out-of-order communication in Kahn process networks. In ASAP, 2002.
    • (2002) ASAP
    • Turjan, A.1    Kienhuis, B.2    Deprettere, E.3
  • 40
    • 24644501875 scopus 로고    scopus 로고
    • Analytical computation of Ehrhart polynomials: Enabling more compiler analyses and optimizations
    • S. Verdoolaege, R. Seghir, K. Beyls, V. Loechner, and M. Bruynooghe. Analytical computation of Ehrhart polynomials: Enabling more compiler analyses and optimizations. In CASES, pages 248-258, 2004.
    • (2004) CASES , pp. 248-258
    • Verdoolaege, S.1    Seghir, R.2    Beyls, K.3    Loechner, V.4    Bruynooghe, M.5
  • 42
    • 0034289947 scopus 로고    scopus 로고
    • Exact memory size estimation for array computations
    • October
    • Y. Zhao and S. Malik. Exact memory size estimation for array computations. IEEE Transactions on VLSI Systems, 8(5):517-521, October 2000.
    • (2000) IEEE Transactions on VLSI Systems , vol.8 , Issue.5 , pp. 517-521
    • Zhao, Y.1    Malik, S.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.