The cost of address translation

@inproceedings{Jurkiewicz2013TheCO,
  title={The cost of address translation},
  author={Tomasz Jurkiewicz and Kurt Mehlhorn},
  booktitle={ALENEX},
  year={2013}
}
Modern computers are not random access machines (RAMs). They have a memory hierarchy, multiple cores, and virtual memory. In this paper, we address the computational cost of address translation in virtual memory. Starting point for our work is the observation that the analysis of some simple algorithms (random scan of an array, binary search, heapsort) in either the RAM model or the EM model (external memory model) does not correctly predict growth rates of actual running times. We propose the… Expand
Toward better computation models for modern machines
TLDR
This paper addresses the computational cost of the address translation in the virtual memory and difficulties in design of parallel algorithms on modern many-core machines, and presents a case study of the design of an efficient 2D convex hull algorithm for GPUs. Expand
Cache-Oblivious VAT-Algorithms
TLDR
The VAT-model (virtual address translation model) extends the EM-model and takes the cost of address translation in virtual memories into account, and shows that the VAT-cost of cache-oblivious algorithms is only a constant factor larger than their EM-cost. Expand
Scalable String and Suffix Sorting: Algorithms, Techniques, and Tools
TLDR
This dissertation focuses on two fundamental sorting problems: string sorting and suffix sorting, and proposes both multiway distribution-based with string sample sort and multiway merge-based string sorting with LCP-aware merge and mergesort, and engineer and parallelize both approaches. Expand
Compressed Bit vectors Based on Variable-to-Fixed Encodings
TLDR
Practical implementations of compressed bit vectors, which support rank and select operations on a given bit-string, while storing thebit-string in compressed form, are considered, which is a flexible and promising solution to the problem of supportingRank and select on moderately compressible bit-strings, such as those frequently found in real-world applications. Expand
Compressed bit vectors based on variable-to-fixed encodings
We consider practical implementations of compressed bitvectors, which support rank and select operations on a given bit-string, while storing the bit-string in compressed form. Our approach relies onExpand
On the Scalability of Computing Triplet and Quartet Distances
TLDR
An experimental evaluation of the algorithms by Brodal et al. Expand
On the Analysis of Two Fundamental Randomized Algorithms - Multi-Pivot Quicksort and Efficient Hash Functions
TLDR
Theoretische Analyse von Kostenmasen, die esermoglichen, Multi-Pivot-Quicksort-Algorithmen hinsichtlich ihres Speicher- undCacheverhaltens zu vergleichen, wird dabeieine unrealistische Annahme getatigt: Die Hashwerte seien voll zufallig. Expand
Succinct Representations of Ordinal Trees
  • R. Raman, S. S. Rao
  • Computer Science
  • Space-Efficient Data Structures, Streams, and Algorithms
  • 2013
TLDR
This work survey succinct representations of ordinal, or rooted, ordered trees using space that is close to the appropriate information-theoretic minimum, but support operations on the tree rapidly, usually in O(1) time. Expand

References

SHOWING 1-10 OF 19 REFERENCES
Cache-Oblivious VAT-Algorithms
TLDR
The VAT-model (virtual address translation model) extends the EM-model and takes the cost of address translation in virtual memories into account, and shows that the VAT-cost of cache-oblivious algorithms is only a constant factor larger than their EM-cost. Expand
On a Model of Virtual Address Translation
TLDR
This work addresses the computational cost of the address translation in the virtuoso mode with respect to memory hierarchy, multiple cores, and a virtual memory. Expand
Algorithms for Hardware Caches and TLB
  • Naila Rahman
  • Computer Science
  • Algorithms for Memory Hierarchies
  • 2002
TLDR
The driving force behind CPU technology is speed and that behind memory technology is storage capacity, and this trend is likely to continue. Expand
What Every Programmer Should Know About Memory
TLDR
The structure of memory subsystems in use on modern commodity hardware is explained, illustrating why CPU caches were developed, how they work, and what programs should do to achieve optimal performance by utilizing them. Expand
Cache-Oblivious Algorithms
TLDR
It is proved that an optimal cache-oblivious algorithm designed for two levels of memory is also optimal for multiple levels and that the assumption of optimal replacement in the ideal-cache model can be simulated efficiently by LRU replacement. Expand
The input/output complexity of sorting and related problems
TLDR
Tight upper and lower bounds are provided for the number of inputs and outputs (I/OS) between internal memory and secondary storage required for five sorting-related problems: sorting, the fast Fourier transform (FFT), permutation networks, permuting, and matrix transposition. Expand
Amortized efficiency of list update and paging rules
TLDR
This article shows that move-to-front is within a constant factor of optimum among a wide class of list maintenance rules, and analyzes the amortized complexity of LRU, showing that its efficiency differs from that of the off-line paging rule by a factor that depends on the size of fast memory. Expand
Computability of Recursive Functions
TLDR
One half of this equivalence, that all functions computable by any finite, discrete, deterministic device supplied with unlimited storage are partial recursive, is relatively straightforward 3 once the elements of recursive function theory have been established. Expand
ACM Queue
TLDR
The Editor of Queue, ACM's recently launched magazine geared towards practicing software developers and architects, is looking for people who might be interested in writing for this issue. Expand
Computer Architecture: A Quantitative Approach
This best-selling title, considered for over a decade to be essential reading for every serious student and practitioner of computer design, has been updated throughout to address the most importantExpand
...
1
2
...