PreprintLocality 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
The data layout of a program is critical to performance because it determines the spatial localit...
Numerical software for sequential or parallel machines with memory hierarchies can benefit from loca...
Cache is one of the most widely used components in today's computing systems. Its performance is hea...
The locality of a program may be quantified by the data footprint over a time period or by the miss ...
The locality metrics are many, for example, miss ratio to test perfor-mance, data footprint to manag...
Abstract: Locality is a universal behavior of all computational processes: They tend to refer repeat...
The evolution of computing technology towards the ultimate physical limits makes communication the d...
Thesis (Ph. D.)--University of Rochester. Dept. of Computer Science, 2014.As multi-core processors b...
Locality, characterized by data reuses, determines caching performance. Reuse distance (i.e. LRU st...
Data locality is central to modern computer designs. The widening gap between processor speed and me...
This paper presents two economical tools to measure the average working set size of a program. Among...
Emerging computer architectures will feature drastically decreased flops/byte (ratio of peak process...
We propose in this paper a new approach to study the temporal and spatial locality of codes using a ...
We propose in this paper a new approach to study the temporal and spatial locality of codes using a ...
The widening gap between processor speed and main memory speed has generated interest in compiletime...
The data layout of a program is critical to performance because it determines the spatial localit...
Numerical software for sequential or parallel machines with memory hierarchies can benefit from loca...
Cache is one of the most widely used components in today's computing systems. Its performance is hea...
The locality of a program may be quantified by the data footprint over a time period or by the miss ...
The locality metrics are many, for example, miss ratio to test perfor-mance, data footprint to manag...
Abstract: Locality is a universal behavior of all computational processes: They tend to refer repeat...
The evolution of computing technology towards the ultimate physical limits makes communication the d...
Thesis (Ph. D.)--University of Rochester. Dept. of Computer Science, 2014.As multi-core processors b...
Locality, characterized by data reuses, determines caching performance. Reuse distance (i.e. LRU st...
Data locality is central to modern computer designs. The widening gap between processor speed and me...
This paper presents two economical tools to measure the average working set size of a program. Among...
Emerging computer architectures will feature drastically decreased flops/byte (ratio of peak process...
We propose in this paper a new approach to study the temporal and spatial locality of codes using a ...
We propose in this paper a new approach to study the temporal and spatial locality of codes using a ...
The widening gap between processor speed and main memory speed has generated interest in compiletime...
The data layout of a program is critical to performance because it determines the spatial localit...
Numerical software for sequential or parallel machines with memory hierarchies can benefit from loca...
Cache is one of the most widely used components in today's computing systems. Its performance is hea...