Locality of reference

Known as: Application locality, Temporal locality, Sequential locality 
In computer science, locality of reference, also known as the principle of locality, is a term for the phenomenon in which the same values, or… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1935-2018
0500100019352017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2004
Highly Cited
2004
We present a novel Locality-Sensitive Hashing scheme for the Approximate Nearest Neighbor Problem under lp norm, based on p… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Many problems in information processing involve some form of dimensionality reduction. In this paper, we introduce Locality… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Scalable overlay networks such as Chord, CAN, Pastry, and Tapestry have recently emerged as flexible infrastructure for building… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 7
Is this relevant?
Highly Cited
1997
Highly Cited
1997
  • SIVAN TOLEDOy
  • 1997
This paper presents a new partitioned algorithm for LU decomposition with partial pivoting. The new algorithm, called the… (More)
Is this relevant?
Highly Cited
1996
Highly Cited
1996
  • Azer Bestavrosy, Mark Crovellay, Adriana de Oliveiraz
  • 1996
In this paper we propose models for both temporal and spatial locality of reference in streams of requests arriving at Web… (More)
  • figure 8
  • figure 5
  • figure 7
Is this relevant?
Highly Cited
1996
Highly Cited
1996
In the past decade, processor speed has become significantly faster than memory speed. Small, fast cache memories are designed to… (More)
  • figure 12
  • figure 14
  • figure 15
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Since the introduction of virtual memory demand-paging and cache memories, computer systems have been exploiting spatial and… (More)
  • table 1
  • figure 1
  • figure 2
  • table 2
  • table 3
Is this relevant?
Highly Cited
1992
Highly Cited
1992
What is the best paging algorithm if one has partial information about the possible sequences of page requests? We give a partial… (More)
Is this relevant?
Highly Cited
1991
Highly Cited
1991
This paper proposes an algorithm that improves the locality of a loop nest by transforming the code via interchange, reversal… (More)
  • figure 1
  • figure 2
  • figure 4
  • table 1
  • figure 5
Is this relevant?
Highly Cited
1989
Highly Cited
1989
In the context of sequential computers, it is common practice to exploit temporal locality of reference through devices such as… (More)
  • figure 3
  • figure 5
Is this relevant?