Year: 2005
Type: report
Abstract: This paper studies the theory of caching and temporal and spatial locality. We show the following results: (1) hashing can be used to guarantee that caches with limited associativity behave as well as fully associative cache; (2) temporal locality cannot be characterized using one, or few parameters; (3) temporal locality and spatial locality cannot be studied separately; and (4) unlike temporal locality, spatial locality cannot be managed efficiently online. 1
Authors: Marc Snir, Jing Yu
Institution: University of Illinois Urbana-Champaign
Language: English
Subfield: Hardware and Architecture
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Awards: G222768804, G2427813900
OpenAlex ID: W1186123259
