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
Deriving divide-and-conquer dynamic programming algorithms using solver-aided transformations
Shachar Itzhaky,Rohit Singh,Armando Solar-Lezama,Kuat Yessenov,Yongquan Lu,Charles E. Leiserson,Rezaul Chowdhury +6 more
TL;DR: A framework allowing domain experts to manipulate computational terms in the interest of deriving better, more efficient implementations of dynamic programming algorithms that have better locality and are significantly more efficient than traditional loop-based implementations is introduced.
Proceedings ArticleDOI
Cache-oblivious wavefront: improving parallelism of recursive dynamic programming algorithms without losing cache-efficiency
TL;DR: Techniques are applied to a set of widely known dynamic programming problems, such as Floyd-Warshall's All-Pairs Shortest Paths, Stencil, and LCS, to remove the artificial dependency and preserve the cache-optimality by inheriting the DAC strategy.
Proceedings ArticleDOI
The cache-oblivious gaussian elimination paradigm: theoretical framework, parallelization and experimental evaluation
TL;DR: This paper establishes several important properties of this cache-oblivious framework, and extends the framework to solve GEP in its full generality within the same time and I/O bounds, and presents extensive experimental results for both in-core and out-of-core performance of the algorithms.
Proceedings ArticleDOI
AUTOGEN: automatic discovery of cache-oblivious parallel recursive algorithms for solving dynamic programs
Rezaul Chowdhury,Pramod Ganapathi,Jesmin Jahan Tithi,Charles Bachmeier,Bradley C. Kuszmaul,Charles E. Leiserson,Armando Solar-Lezama,Yuan Tang +7 more
TL;DR: The experimental results show that several autodiscovered algorithms significantly outperform parallel looping and tiled loop-based algorithms and are less sensitive to fluctuations of memory and bandwidth compared with their looping counterparts, and their running times and energy profiles remain relatively more stable.
Proceedings ArticleDOI
Cache-oblivious shortest paths in graphs using buffer heap
TL;DR: These results appear to give the first non-trivial cache-oblivious bounds for shortest path problems on general graphs and undirected and directed single-source shortest path (SSSP) problems for graphs with non-negative edge-weights.