Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Jayapaul, Varunkumar"'
Publikováno v:
In Theoretical Computer Science 29 June 2024 1002
The program performance on modern hardware is characterized by \emph{locality of reference}, that is, it is faster to access data that is close in address space to data that has been accessed recently than data in a random location. This is due to ma
Externí odkaz:
http://arxiv.org/abs/1902.07928
Publikováno v:
In Discrete Applied Mathematics 15 December 2022 322:240-252
Publikováno v:
In Discrete Applied Mathematics 15 November 2020 286:128-139
Publikováno v:
Afshani, P, Iacono, J, Jayapaul, V, Karsin, B & Sitchinava, N 2022, Locality-of-Reference Optimality of Cache-Oblivious Algorithms . in 3rd Symposium on Algorithmic Principles of Computer Systems, (APOCS) . Society for Industrial and Applied Mathematics, pp. 31-45, Symposium on Algorithmic Principles of Computer Systems (APOCS22), 12/01/2022 . https://doi.org/10.1137/1.9781611977059.3
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=pure_au_____::2193cd0019da038d88f6c0a5bbcd4f56
https://pure.au.dk/portal/da/publications/localityofreference-optimality-of-cacheoblivious-algorithms(fa37199d-6b60-433f-b806-c986e9270a96).html
https://pure.au.dk/portal/da/publications/localityofreference-optimality-of-cacheoblivious-algorithms(fa37199d-6b60-433f-b806-c986e9270a96).html
Publikováno v:
WALCOM: Algorithms & Computation (9783319301389); 2016, p351-360, 10p
Publikováno v:
Algorithms & Data Structures (9783319218397); 2015, p434-445, 12p
Publikováno v:
Combinatorial Algorithms: 25th International Workshop, IWOCA 2014, Duluth, MN, USA, October 15-17, 2014, Revised Selected Papers; 2015, p176-187, 12p
Publikováno v:
Journal of Discrete Algorithms; Jan2016, Vol. 36, p63-75, 13p