A Measurement Theory of Locality

02/05/2018
by   Liang Yuan, et al.
0

Locality is a fundamental principle used extensively in program and system optimization. It can be measured in many ways. This paper formalizes the metrics of locality into a measurement theory. The new theory includes the precise definition of locality metrics based on access frequency, reuse time, reuse distance, working set, footprint, and the cache miss ratio. It gives the formal relation between these definitions and the proofs of equivalence or non-equivalence. It provides the theoretical justification for four successful locality models in operating systems, programming languages, and computer architectures which were developed empirically.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/25/2019

Locality-Promoting Representation Learning

This work investigates fundamental questions related to locating and def...
research
11/20/2020

A Comparison of Big-step Semantics Definition Styles

Formal semantics provides rigorous, mathematically precise definitions o...
research
02/11/2018

Improving Locality of Unstructured Mesh Algorithms on GPUs

To most efficiently utilize modern parallel architectures, the memory ac...
research
01/09/2020

Guidelines for enhancing data locality in selected machine learning algorithms

To deal with the complexity of the new bigger and more complex generatio...
research
02/21/2019

Locality

The performance of modern computation is characterized by locality of re...
research
12/19/2011

What is an OS?

While the engineering of operating systems is well understood, their for...
research
11/18/2022

ACIC: Admission-Controlled Instruction Cache

The front end bottleneck in datacenter workloads has come under increase...

Please sign up or login with your details

Forgot password? Click here to reset