Zobrazeno 1 - 10
of 17
pro vyhledávání: '"Pramod Ganapathi"'
Autor:
Rezaul Chowdhury, Pramod Ganapathi
Publikováno v:
The Computer Journal. 66:603-614
We present two simple, intuitive and general algorithmic frameworks that can be used to design a wide variety of permutation generation algorithms. The frameworks can be used to produce 19 existing permutation algorithms, including the well-known alg
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::45e19d2179948dee792c1485f98e2c5e
https://doi.org/10.1093/comjnl/bxab181
https://doi.org/10.1093/comjnl/bxab181
Publikováno v:
Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::18c3b1f5cdd9410a2050852f5f64d2c5
https://doi.org/10.1145/3490148.3538558
https://doi.org/10.1145/3490148.3538558
Autor:
Rezaul Chowdhury, Pramod Ganapathi
Publikováno v:
The Computer Journal.
We present efficient parallel recursive divide-and-conquer algorithms for bubble sort, selection sort, and insertion sort. Our algorithms have excellent data locality and are highly parallel. The computational complexity of our insertion sort is ${{\
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8c970b434045a9f89c5b8caf8825e93f
https://doi.org/10.1093/comjnl/bxab107
https://doi.org/10.1093/comjnl/bxab107
Autor:
Aaron Gregory, Mohammad Mahdi Javanmard, Rathish Das, Pramod Ganapathi, Rezaul Chowdhury, Zafar Ahmad
Publikováno v:
SPAA
The binary-forking model is a parallel computation model, formally defined by Blelloch et al., in which a thread can fork a concurrent child thread, recursively and asynchronously. The model incurs a cost of Θ(log n) to spawn or synchronize n tasks
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4048933bfbd36fc28c57536e2d952d21
https://doi.org/10.1145/3409964.3461802
https://doi.org/10.1145/3409964.3461802
Publikováno v:
SPAA
Stencil computations are widely used to simulate the change of state of physical systems across a multidimensional grid over multiple timesteps. The state-of-the-art techniques in this area fall into three groups: cache-aware tiled looping algorithms
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4bf697d8367fb9fd49e11719fcc387d4
http://arxiv.org/abs/2105.06676
http://arxiv.org/abs/2105.06676
Publikováno v:
Information Processing Letters. 173:106166
We present a cache-efficient parallel algorithm for the sequence alignment with gap penalty problem for shared-memory machines using multiway divide-and-conquer and not-in-place matrix transposition. Our r−way divide-and-conquer algorithm, for a fi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7d116e75f2022099653ba176f173b865
https://doi.org/10.1016/j.ipl.2021.106166
https://doi.org/10.1016/j.ipl.2021.106166
Publikováno v:
Theoretical Computer Science. 743:130-147
We define the range 1 query (R1Q) problem as follows. Given a d-dimensional (d ≥ 1) input bit matrix A, preprocess A so that for any given region \(\mathcal{R}\) of A, one can efficiently answer queries asking if \(\mathcal{R}\) contains a 1 or not
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::99f28b63578782358255b31b002475be
https://doi.org/10.1016/j.tcs.2015.12.040
https://doi.org/10.1016/j.tcs.2015.12.040
Autor:
Charles E. Leiserson, Stephen Tschudi, Bradley C. Kuszmaul, Pramod Ganapathi, Jesmin Jahan Tithi, Armando Solar-Lezama, Charles Bachmeier, Yuan Tang, Rezaul Chowdhury
Publikováno v:
MIT web domain
We present A utogen —an algorithm that for a wide class of dynamic programming (DP) problems automatically discovers highly efficient cache-oblivious parallel recursive divide-and-conquer algorithms from inefficient iterative descriptions of DP rec
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6aa4a383a6fb417ca8ef46fec3bcf170
https://doi.org/10.1145/3125632
https://doi.org/10.1145/3125632
Autor:
Mohammad Mahdi Javanmard, Stephen Tschudi, Zafar Ahmad, Rezaul Chowdhury, Rathish Das, Pramod Ganapathi
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030206550
We argue that the recursive divide-and-conquer paradigm is highly suited for designing algorithms to run efficiently under both shared-memory (multi- and manycores) and distributed-memory settings. The depth-first recursive decomposition of tasks and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1c7d75cbc214c8a78432a5947c7437cc
https://doi.org/10.1007/978-3-030-20656-7_8
https://doi.org/10.1007/978-3-030-20656-7_8
Publikováno v:
SPAA
Iterative wavefront algorithms for evaluating dynamic programming recurrences exploit optimal parallelism but show poor cache performance. Tiled-iterative wavefront algorithms achieve optimal cache complexity and high parallelism but are cache-aware
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::90bd7d2aebb7e37d2fcca57ea8e503cd
https://doi.org/10.1145/3087556.3087586
https://doi.org/10.1145/3087556.3087586