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
The pochoir stencil compiler
TL;DR: The Pochoir stencil compiler allows a programmer to write a simple specification of a stencil in a domain-specific stencil language embedded in C++ which the Pochir compiler then translates into high-performing Cilk code that employs an efficient parallel cache-oblivious algorithm.
Proceedings Article
Provably good multicore cache performance for divide-and-conquer algorithms
Guy E. Blelloch,Rezaul Chowdhury,Phillip B. Gibbons,Vijaya Ramachandran,Shimin Chen,Michael Kozuch +5 more
TL;DR: It is shown that a separator-based algorithm for sparse-matrix-dense-vector-multiply achieves provably good cache performance in the multicore-cache model, as well as in the well-studied sequential cache-oblivious model.
Journal ArticleDOI
Oracles for Distances Avoiding a Failed Node or Link
TL;DR: A deterministic oracle with constant query time for this problem that uses $O (n^2\log n)$ space, where $n$ is the number of vertices in $G$ and the construction time for the oracle is $O(mn^{2} + n^{3}\ log n)$.
Proceedings ArticleDOI
Cache-efficient dynamic programming algorithms for multicores
TL;DR: This work develops a generic CMP algorithm with an associated tiling sequence and provides a parallel schedule that results in a cache-efficient parallel execution up to the critical path length of the underlying dynamic programming algorithm.
Journal ArticleDOI
Oblivious algorithms for multicores and networks of processors
TL;DR: This work introduces a multicore-oblivious (MO) approach to algorithms and schedulers for HM, and presents efficient MO algorithms for several fundamental problems including matrix transposition, FFT, sorting, the Gaussian Elimination Paradigm, list ranking, and connected components.