On the limits of cache-oblivious rational permutations

DOI10.1016/j.tcs.2008.04.036zbMath1146.68054OpenAlexW1991111959MaRDI QIDQ935473

Francesco Silvestri

Publication date: 6 August 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.04.036

zbMATH Keywords

lower boundmemory hierarchyimpossibility resultcache-oblivious algorithmrational permutationtall cache

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Mathematical problems of computer architecture (68M07)

Cites Work

• The uniform memory hierarchy model of computation
• Algorithms for parallel memory. II: Hierarchical multilevel memories
• Fast permuting on disk arrays
• Cache-Oblivious Algorithms
• Towards a theory of cache-efficient algorithms
• On the limits of cache-obliviousness
• Unnamed Item
• Unnamed Item