R
Rezaul Chowdhury
Researcher at Stony Brook University
Publications - 89
Citations - 1552
Rezaul Chowdhury is an academic researcher from Stony Brook University. The author has contributed to research in topics: Cache & Cache-oblivious algorithm. The author has an hindex of 17, co-authored 83 publications receiving 1419 citations. Previous affiliations of Rezaul Chowdhury include University of Texas at Austin & Boston University.
Papers
More filters
Proceedings ArticleDOI
POSTER: Provably Efficient Scheduling of Cache-Oblivious Wavefront Algorithms
TL;DR: This work shows how to systematically transform standard cache-oblivious recursive divide-and-conquer algorithms into recursive wavefront algorithms to achieve optimal parallel cache complexity and high parallelism under state-of-the-art schedulers for fork-join programs.
Proceedings ArticleDOI
Brief Announcement: Faster Stencil Computations using Gaussian Approximations
TL;DR: Novel techniques based on random walks and Gaussian approximations are introduced for an asymptotic improvement of the current best algorithm for performing aperiodic linear stencil computations on a d (≥ 1)-dimensional grid of size N for T timesteps.
Journal ArticleDOI
A Unified Framework to Discover Permutation Generation Algorithms
Proceedings ArticleDOI
High-performance recursive dynamic programming for bioinformatics using MM-like flexible kernels
TL;DR: This paper solves four non-trivial DP problems widely used in Bioinformatics, namely the parenthesis problem, Floyd-Warshall's all-pairs shortest paths, gap problem and protein accordion folding using recursive cache-oblivious technique that decompose the original inflexible looping kernel to highly optimizable flexible kernels.
Posted Content
Fast Stencil Computations using Fast Fourier Transforms
TL;DR: In this paper, the authors present two efficient parallel algorithms for performing linear stencil computations using Fast Fourier Transform (FFT) preconditioning on a Krylov subspace method.