Skip to main navigation Skip to search Skip to main content

Brief Announcement: Faster Stencil Computations using Gaussian Approximations

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Scopus citations

Abstract

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 ?(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.

Original languageEnglish
Title of host publicationSPAA 2022 - Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures
PublisherAssociation for Computing Machinery
Pages291-293
Number of pages3
ISBN (Electronic)9781450391467
DOIs
StatePublished - Jul 11 2022
Event34th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2022 - Philadelphia, United States
Duration: Jul 11 2022Jul 14 2022

Publication series

NameAnnual ACM Symposium on Parallelism in Algorithms and Architectures

Conference

Conference34th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2022
Country/TerritoryUnited States
CityPhiladelphia
Period07/11/2207/14/22

Keywords

  • fast gauss transform
  • gaussian approximation
  • linear stencil

Fingerprint

Dive into the research topics of 'Brief Announcement: Faster Stencil Computations using Gaussian Approximations'. Together they form a unique fingerprint.

Cite this