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 条
  • [41] 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
  • [42] Generating Vertices of Polyhedra and Related Problems of Monotone Generation
    Boros, Endre
    Elbassioni, Khaled
    Gurvich, Vladimir
    Makino, Kazuhisa
    POLYHEDRAL COMPUTATION, 2009, 48 : 15 - +
  • [43] Finding a best approximation pair of points for two polyhedra
    Aharoni, Ron
    Censor, Yair
    Jiang, Zilin
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2018, 71 (02) : 509 - 523
  • [44] Derivatives of Probability Functions: Unions of Polyhedra and Elliptical Distributions
    van Ackooij, Wim
    Javal, Paul
    Perez-Aros, Pedro
    SET-VALUED AND VARIATIONAL ANALYSIS, 2022, 30 (02) : 487 - 519
  • [45] Minimizing Piecewise-Concave Functions Over Polyhedra
    Gaudioso, Manlio
    Giallombardo, Giovanni
    Miglionico, Giovanna
    MATHEMATICS OF OPERATIONS RESEARCH, 2018, 43 (02) : 580 - 597
  • [46] A Comprehensive Evaluation of Object Scanning Techniques
    Garner, Robin
    Blackburn, Stephen M.
    Frampton, Daniel
    ACM SIGPLAN NOTICES, 2011, 46 (11) : 33 - 42
  • [47] RAISTTP Revisited to Solve Relaxed Travel Tournament Problem
    Montero, Elizabeth
    Riff, Maria-Cristina
    GECCO'15: PROCEEDINGS OF THE 2015 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 2015, : 121 - 128
  • [48] CUTEr and SifDec: a constrained and unconstrained testing environment, revisited
    Gould, NIM
    Orban, D
    Toint, PL
    ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 2003, 29 (04): : 373 - 394
  • [49] Fast multivariate multi-point evaluation revisited
    van der Hoeven, Joris
    Lecerf, Gregoire
    JOURNAL OF COMPLEXITY, 2020, 56
  • [50] Multistage Approach to Solving the Optimization Problem of Packing Nonconvex Polyhedra
    Stoyan, Y. G.
    Chugay, A. M.
    CYBERNETICS AND SYSTEMS ANALYSIS, 2020, 56 (02) : 259 - 268