Encyclopedia > Locality of reference

  Article Content

Locality of reference

Locality of reference is a concept in computer science. It deals with the process of accessing a single resource multiple times. There are two basic types of locality of reference: temporal and spatial. Temporal locality of reference is the concept that a resource that is referenced at one point in time will be referenced again sometime in the near future. Spatial locality of reference is the concept that likelihood of referencing a resource is higher if a resource near it was just referenced.

The reason these concepts are true is due to the manner in which computer programs are created. Generally, data that is related is stored in consecutive locations in memory. One common pattern in computing is that processing is performed on a single item and then the next. This means that if a lot of processing is done that the single item will be accessed more than once, thus leading to temporal locality of reference. Furthermore, moving to the next item implies that the next item will be read, hence spatial locality of reference, since memory locations are typically read in batches.

Increasing and exploiting locality of reference are common techniques for optimization. One can increase locality of reference by ensuring that related data is stored together by using arrays or by reducing code size. A cache is a simple example of exploiting locality of reference because it is a specially designed faster but smaller memory area, generally used to keep recently referenced data and data near recently referenced data, which can lead to potential performance increases.

All Wikipedia text is available under the terms of the GNU Free Documentation License

  Search Encyclopedia

Search over one million articles, find something about almost anything!
  Featured Article
Thomas a Kempis

... writings are all of a devotional character and include tracts and meditations, letters, sermons, a life of Saint Lydewigis[?], a Christian woman who remained steadfast ...

This page was created in 23 ms