Asynchronous Parallel Computing Algorithm implemented in 1D Heat Equation with CUDA
Kooktae Lee, Raktim Bhattacharya

TL;DR
This paper analyzes the stability and performance of an asynchronous parallel computing algorithm implemented with CUDA for the 1D heat equation, demonstrating superior speed over synchronous methods and discussing some drawbacks.
Contribution
It provides CUDA code for asynchronous parallel algorithms and compares their performance and stability against synchronous schemes in solving the 1D heat equation.
Findings
Asynchronous scheme outperforms synchronous in GPU simulations.
The paper discusses stability and performance trade-offs.
Provides practical CUDA implementation for asynchronous algorithms.
Abstract
In this note, we present the stability as well as performance analysis of asynchronous parallel computing algorithm implemented in 1D heat equation with CUDA. The primary objective of this note lies in dissemination of asynchronous parallel computing algorithm by providing CUDA code for fast and easy implementation. We show that the simulations carried out on nVIDIA GPU device with asynchronous scheme outperforms synchronous parallel computing algorithm. In addition, we also discuss some drawbacks of asynchronous parallel computing algorithms.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
