Cache-Oblivious VAT-Algorithms
Data Structures and Algorithms
2014-04-15 v1
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.
Cite
@article{arxiv.1404.3577,
title = {Cache-Oblivious VAT-Algorithms},
author = {Tomasz Jurkiewicz and Kurt Mehlhorn and Patrick Nicholson},
journal= {arXiv preprint arXiv:1404.3577},
year = {2014}
}