Brief Announcement: Faster Stencil Computations using Gaussian Approximations

被引：3
|
作者：
Ahmad, Zafar [1 ]
Chowdhury, Rezaul [1 ]
Das, Rathish [2 ]
Ganapathi, Pramod [1 ]
Gregory, Aaron [1 ]
Zhu, Yimin [1 ]
机构：
[1] SUNY Stony Brook, Stony Brook, NY 11794 USA
[2] Univ Waterloo, Waterloo, ON N2L 3G1, Canada
来源：
PROCEEDINGS OF THE 34TH ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES, SPAA 2022 | 2022年
基金：
加拿大自然科学与工程研究理事会;
关键词：
Linear Stencil; Gaussian Approximation; Fast Gauss Transform; FINITE-DIFFERENCE;
D O I：
10.1145/3490148.3538558
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
Stencil computations are widely used to simulate the change of state of physical systems. The current best algorithm for performing aperiodic linear stencil computations on a d(>= 1)-dimensional grid of size N for T timesteps does (Theta) over tilde (TN1-1/d + N log N) work. We introduce novel techniques based on random walks and Gaussian approximations for an asymptotic improvement of this work bound for a class of linear stencils. We also improve the span (i.e., parallel running time on an unbounded number of processors) asymptotically from the current state of the art.
引用
收藏
页码：291 / 293
页数：3
相关论文
共 50 条
  • [1] Brief announcement monitoring of linear distributed computations
    Esin, Anton
    Yavorskiy, Rostislav
    Zemtsov, Nikolay
    DISTRIBUTED COMPUTING, PROCEEDINGS, 2006, 4167 : 566 - 568
  • [2] Brief Announcement: Faster Data Structures in Transactional Memory Using Three Paths
    Brown, Trevor
    DISTRIBUTED COMPUTING (DISC 2015), 2015, 9363 : 671 - 672
  • [3] Brief Announcement: Tree Decomposition for Faster Concurrent Data Structures
    Schneider, Johannes
    Wattenhofer, Roger
    PODC 2010: PROCEEDINGS OF THE 2010 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, 2010, : 287 - 288
  • [4] Brief Announcement: Faster 3-Periodic Merging Networks
    Piotrow, Marek
    PROCEEDINGS OF THE 26TH ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES (SPAA'14), 2014, : 223 - 225
  • [5] An Abstraction for Distributed Stencil Computations Using Charm plus
    Bhosale, Aditya
    Fink, Zane
    Kale, Laxmikant
    ASYNCHRONOUS MANY-TASK SYSTEMS AND APPLICATIONS, WAMTA 2024, 2024, 14626 : 123 - 134
  • [6] Brief Announcement: Distributed Approximations for the Semi-matching Problem
    Czygrinow, Andrzej
    Hanckowiak, Michal
    Krzywdzinski, Krzysztof
    Szymanska, Edyta
    Wawrzyniak, Wojciech
    DISTRIBUTED COMPUTING, 2011, 6950 : 200 - +
  • [7] Brief Announcement: Faster Gossiping in Bidirectional Radio Networks with Large Labels
    Vaya, Shailesh
    STABILIZATION, SAFETY, AND SECURITY OF DISTRIBUTED SYSTEMS, 2011, 6976 : 449 - 450
  • [8] Tiling Optimizations for Stencil Computations Using Rewrite Rules in LIFT
    Stoltzfus, Larisa
    Hagedorn, Bastian
    Steuwer, Michel
    Gorlatch, Sergei
    Dubach, Christophe
    ACM TRANSACTIONS ON ARCHITECTURE AND CODE OPTIMIZATION, 2019, 16 (04)
  • [9] Efficient synchronization for stencil computations using dynamic task graphs
    Bhatti, Zubair Wadood
    Wuyts, Roel
    Costanza, Pascal
    Preuveneers, Davy
    Berbers, Yolande
    2013 INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE, 2013, 18 : 2428 - 2431
  • [10] Efficient 3D stencil computations using CUDA
    Krotkiewski, Marcin
    Dabrowski, Marcin
    PARALLEL COMPUTING, 2013, 39 (10) : 533 - 548
12345