Polyhedra Scanning Revisited

被引:23
|
作者
Chen, Chun [1 ]
机构
[1] Univ Utah, Salt Lake City, UT 84112 USA
基金
美国国家科学基金会;
关键词
Performance; Algorithms; polyhedra scanning; polyhedral transformations; LOOP TRANSFORMATIONS; PARALLELISM; GENERATION; ALGORITHM;
D O I
10.1145/2345156.2254123
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
This paper presents a new polyhedra scanning system called CodeGen+ to address the challenge of generating high-performance code for complex iteration spaces resulting from compiler optimization and autotuning systems. The strength of our approach lies in two new algorithms. First, a loop overhead removal algorithm provides precise control of trade-offs between loop overhead and code size based on actual loop nesting depth. Second, an if-statement simplification algorithm further reduces the number of comparisons in the code. These algorithms combined with the expressive power of Presburger arithmetic enable CodeGen+ to support complex optimization strategies expressed in iteration spaces. We compare with the state-of-the-art polyhedra scanning tool CLooG on five loop nest computations, demonstrating that CodeGen+ generates code that is simpler and up to 1.15x faster.
引用
收藏
页码:499 / 508
页数:10
相关论文
共 50 条
  • [31] Software for exact integration of polynomials over polyhedra
    De Loera, J. A.
    Dutra, B.
    Koeppe, M.
    Moreinis, S.
    Pinto, G.
    Wu, J.
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2013, 46 (03): : 232 - 252
  • [32] SEARCHING POLYHEDRA BY ROTATING HALF-PLANES
    Viglietta, Giovanni
    INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 2012, 22 (03) : 243 - 275
  • [33] Placing search in context: The concept revisited
    Finkelstein, L
    Gabrilovich, E
    Matias, Y
    Rivlin, E
    Solan, Z
    Wolfman, G
    Ruppin, E
    ACM TRANSACTIONS ON INFORMATION SYSTEMS, 2002, 20 (01) : 116 - 131
  • [34] Automatic Vectorization of Interleaved Data Revisited
    Anderson, Andrew
    Malik, Avinash
    Gregg, David
    ACM TRANSACTIONS ON ARCHITECTURE AND CODE OPTIMIZATION, 2016, 12 (04)
  • [35] Speculative Return Address Stack Management Revisited
    Vandierendonck, Hans
    Seznec, Andre
    ACM TRANSACTIONS ON ARCHITECTURE AND CODE OPTIMIZATION, 2008, 5 (03)
  • [36] A hybrid approach of simulation and metaheuristic for the polyhedra packing problem
    Fernando Pantoja-Benavides, German
    Alvarez-Martinez, David
    INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING COMPUTATIONS, 2022, 13 (01) : 81 - 100
  • [37] Optimization over convex polyhedra via Hadamard parametrizations
    Tang, Tianyun
    Toh, Kim-Chuan
    MATHEMATICAL PROGRAMMING, 2024,
  • [38] The Lifting Projection of Convex Polyhedra for Finding Delaunay Triangulations
    Phan Thanh An
    Nam Dung Hoang
    Nguyen Kieu Linh
    JOURNAL OF CONVEX ANALYSIS, 2022, 29 (01) : 143 - 156
  • [39] Smoothed counting of 0-1 points in polyhedra
    Barvinok, Alexander
    RANDOM STRUCTURES & ALGORITHMS, 2023, 63 (01) : 27 - 60