Zobrazeno 1 - 10
of 18
pro vyhledávání: '"Rathish Das"'
Autor:
Arghya Bhattacharya, Rathish Das
Publikováno v:
Theoretical Computer Science. 938:39-49
In an $\alpha$-way set-associative cache, the cache is partitioned into disjoint sets of size $\alpha$, and each item can only be cached in one set, typically selected via a hash function. Set-associative caches are widely used and have many benefits
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::54cdd5a85d32f03864c35e298cabe159
Publikováno v:
Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures.
Autor:
Daniel DeLayo, Kenny Zhang, Kunal Agrawal, Michael A. Bender, Jonathan W. Berry, Rathish Das, Benjamin Moseley, Cynthia A. Phillips
Publikováno v:
Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures.
Publikováno v:
String Processing and Information Retrieval ISBN: 9783031206429
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::50a72c6f992d5382931890bb0bc23912
https://doi.org/10.1007/978-3-031-20643-6_16
https://doi.org/10.1007/978-3-031-20643-6_16
Autor:
Arghya Bhattacharya, Rathish Das
Publikováno v:
WALCOM: Algorithms and Computation ISBN: 9783030967307
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bef8bdce15bacd75ffd2a3961b9b5251
https://doi.org/10.1007/978-3-030-96731-4_18
https://doi.org/10.1007/978-3-030-96731-4_18
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
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