On the limits of cache-oblivious rational permutations

DOI10.1016/J.TCS.2008.04.036MaRDI QIDQ935473zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• On the limits of cache-obliviousness
• On the Limits of Cache-Oblivious Matrix Transposition
• Cache-oblivious algorithms
• scientific article; zbMATH DE number 2011837
• Asymptotically Tight Bounds for Performing BMMC Permutations on Parallel Disk Systems

Cites work

• scientific article; zbMATH DE number 1756010 (Why is no real title available?)
• Algorithms for parallel memory. II: Hierarchical multilevel memories
• Cache-oblivious algorithms
• Fast permuting on disk arrays
• Introduction to algorithms
• On the limits of cache-obliviousness
• The uniform memory hierarchy model of computation
• Towards a theory of cache-efficient algorithms

Cited in

(3)

• On the limits of cache-obliviousness
• Asymptotically Tight Bounds for Performing BMMC Permutations on Parallel Disk Systems
• Certifying algorithms and relevant properties of reversible primitive permutations with \textsf{Lean}

This page was built for publication: On the limits of cache-oblivious rational permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q935473)