FOURST: A code generator for FFT-based fast stencil computations

被引:1
|
作者
Ahmad, Zafar [1 ]
Javanmard, Mohammad Mahdi [2 ]
Croisdale, Gregory [3 ]
Gregory, Aaron [1 ]
Ganapathi, Pramod [1 ]
Pouchet, Louis-Noel [4 ]
Chowdhury, Rezaul [1 ]
机构
[1] SUNY Stony Brook, Dept Comp Sci, Stony Brook, NY 11794 USA
[2] Meta Platforms Inc, New York, NY USA
[3] Univ Tennessee, Dept Comp Sci, Knoxville, TN 37996 USA
[4] Colorado State Univ, Dept Comp Sci, Ft Collins, CO 80523 USA
基金
美国国家科学基金会;
关键词
Fast-Fourier Transform; FFT; Stencil; Stencil Computations; Fast Stencil Computation; Grid Simulation; Simulation; FOURST; FINITE-DIFFERENCE; STABILITY ANALYSIS; LOCALITY;
D O I
10.1109/ISPASS55109.2022.00010
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Stencil computations are ubiquitous in modern grid-based physical simulations. In this paper, we present FOURST - a compiler to generate programs computing time iterated linear periodic and aperiodic stencil computations with fast Fourier transform methods. This paper outlines the design and implementation of the code generation approach in Fourst, to automatically generate FFT-based stencil solvers. We present experimental results on the state-of-the-art Ookami supercomputer housing Fujitsu A64FX and Intel Skylake processors, to study the performance of Fourst and a state-of-the-art tiling-based optimized code generator PLuTo on various stencil shapes and varying the number of time iterations. We discuss the performance profiles, and limitations, of both approaches on high-end modern hardware.
引用
收藏
页码:99 / 108
页数:10
相关论文
共 50 条
  • [1] FFT-based fast polynomial rooting
    Hoteit, L
    [J]. ELECTRONICS LETTERS, 1999, 35 (12) : 965 - 966
  • [2] FFT-based fast polynomial rooting
    Hoteit, L
    [J]. 2000 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, PROCEEDINGS, VOLS I-VI, 2000, : 3315 - 3318
  • [3] FFT-based exponentially weighted recursive least squares computations
    Ng, MK
    [J]. LINEAR ALGEBRA AND ITS APPLICATIONS, 1997, 263 : 167 - 191
  • [4] AN FFT-BASED SELF-SIMILAR TRAFFIC GENERATOR
    施建俊
    薛质
    诸鸿文
    [J]. Journal of Shanghai Jiaotong University(Science), 2001, (01) : 48 - 51
  • [5] A fast FFT-based discrete Legendre transform
    Hale, Nicholas
    Townsend, Alex
    [J]. IMA JOURNAL OF NUMERICAL ANALYSIS, 2016, 36 (04) : 1670 - 1684
  • [6] Fast FFT-based bioheat transfer equation computation
    Dillenseger, Jean-Louis
    Esneault, Simon
    [J]. COMPUTERS IN BIOLOGY AND MEDICINE, 2010, 40 (02) : 119 - 123
  • [7] An FFT-based technique for fast fractal image compression
    Ramkumar, M
    Anand, GV
    [J]. SIGNAL PROCESSING, 1997, 63 (03) : 263 - 268
  • [9] FAST FFT-BASED ALGORITHM FOR PHASE ESTIMATION IN SPECKLE IMAGING
    FROST, RL
    RUSHFORTH, CK
    BAXTER, BS
    [J]. APPLIED OPTICS, 1979, 18 (12): : 2056 - 2061
  • [10] A GPU acceleration for FFT-based fast solvers for the Integral Equation
    Francavilla, M. A.
    Attardo, E. A.
    Vipiana, F.
    Vecchi, G.
    [J]. PROCEEDINGS OF THE FOURTH EUROPEAN CONFERENCE ON ANTENNAS AND PROPAGATION, 2010,