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 条
  • [21] The simplest subdivision scheme for smoothing polyhedra
    Peters, J
    Reif, U
    ACM TRANSACTIONS ON GRAPHICS, 1997, 16 (04): : 420 - 431
  • [22] Recent results around the diameter of polyhedra
    Eisenbrand, Friedrich
    PROCEEDINGS OF THE INTERNATIONAL CONGRESS OF MATHEMATICIANS (ICM 2014), VOL IV, 2014, : 829 - 841
  • [23] PATRICIA TRIES AGAIN REVISITED
    SZPANKOWSKI, W
    JOURNAL OF THE ACM, 1990, 37 (04) : 691 - 711
  • [24] Accumulating householder transformations, revisited
    Joffrain, Thierry
    Low, Tze Meng
    Quintana-Orti, Enrique S.
    van de Geijn, Robert
    Van Zee, Field G.
    ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 2006, 32 (02): : 169 - 179
  • [25] On the Approximation of Unbounded Convex Sets by Polyhedra
    Doerfler, Daniel
    JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2022, 194 (01) : 265 - 287
  • [26] A segment-based filtering method for mobile laser scanning point cloud
    Lin, Xiangguo
    Xie, Wenhan
    INTERNATIONAL JOURNAL OF IMAGE AND DATA FUSION, 2022, 13 (02) : 136 - 154
  • [27] On the Construction of Planar Embedding for a Class of Orthogonal Polyhedra
    Karmakar, Nilanjana
    Biswas, Arindam
    Nandy, Subhas C.
    Bhattacharya, Bhargab B.
    COMBINATORIAL IMAGE ANALYSIS, IWCIA 2022, 2023, 13348 : 84 - 104
  • [28] ENUMERATING PROJECTIONS OF INTEGER POINTS IN UNBOUNDED POLYHEDRA
    Nguyen, Danny
    Pak, Igor
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2018, 32 (02) : 986 - 1002
  • [29] Mostly concurrent garbage collection revisited
    Barabash, K
    Ossia, Y
    Petrank, E
    ACM SIGPLAN NOTICES, 2003, 38 (11) : 255 - 268
  • [30] Enumeration of Integer Points in Projections of Unbounded Polyhedra
    Nguyen, Danny
    Pak, Igor
    INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, IPCO 2017, 2017, 10328 : 417 - 429