Cache-Oblivious VAT-Algorithms
Tomasz Jurkiewicz, Kurt Mehlhorn, Patrick Nicholson

TL;DR
This paper demonstrates that cache-oblivious algorithms have a VAT-cost comparable to their EM-cost, with only a constant factor increase, under certain cache assumptions, extending the external memory model to include address translation costs.
Contribution
It introduces the VAT-model extending the EM-model and proves that cache-oblivious algorithms are efficient within this model, considering address translation costs.
Findings
VAT-cost of cache-oblivious algorithms is within a constant factor of EM-cost.
Requires a more stringent tall cache assumption.
Addresses the impact of address translation in memory models.
Abstract
The VAT-model (virtual address translation model) extends the EM-model (external memory model) and takes the cost of address translation in virtual memories into account. In this model, the cost of a single memory access may be logarithmic in the largest address used. We show that the VAT-cost of cache-oblivious algorithms is only by a constant factor larger than their EM-cost; this requires a somewhat more stringent tall cache assumption as for the EM-model.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Data Storage Technologies · Parallel Computing and Optimization Techniques · Optimization and Search Problems
