Live briefing
Everything about Locality of reference
Tendency of a processor to access nearby memory locations in space or time
In computer science, locality of reference, also known as the principle of locality, is the tendency of a processor to access the same set of memory locations repetitively over a short period of time. There are two basic types of reference locality – temporal and spatial locality. Temporal locality refers to the reuse of specific data and/or resources within a relatively small time duration. Spatial locality refers to the use of data elements within relatively close storage locations. Sequential locality, a special case of spatial locality, occurs when data elements are arranged and accessed linearly, such as traversing the elements in a one-dimensional array. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Locality of referenceA 5-minute orientation
- Skim a recent paper: Theoretical perspective to the juggling sequence rotation performance pattern from system memory locality reference viewpointInfluential work since 2022
- Pick up a classic book: Kokuritsu Kokkai Toshokan shozō Meijiki kankō tosho maikuro-ban shūseiThe most-reprinted book on the subject
- Read the landmark paper: Competitive Paging with Locality of ReferenceCited 105 times
- Go sideways: Cache-oblivious algorithmA closely related topic
- Go sideways: In-place matrix transpositionA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Competitive Paging with Locality of Reference
Locality of Reference in LU Decomposition with Partial Pivoting
Improving locality of reference in a garbage-collecting memory management system
Locality in Page Reference Strings
Strongly Competitive Algorithms for Paging with Locality of Reference
On paging with locality of reference
Large mammals from Rickenbach (Switzerland, reference locality MP29, Late Oligocene): biostratigraphic and palaeoenvironmental implications
Process decomposition through locality of reference
🆕 Influential since 2022
Theoretical perspective to the juggling sequence rotation performance pattern from system memory locality reference viewpoint
Enhancing Big Data Performance Through Graph Coloring-Based Locality of Reference
Attitude of Higher Secondary School Teachers Towards the Implementation of Sex Education with reference to Gender and Locality
📚 Books worth reading
- 📕Kokuritsu Kokkai Toshokan shozō Meijiki kankō tosho maikuro-ban shūseiKokuritsu Kokkai Toshokan (Japan) · 1991
- 📕TelecommunicationsUnited States. General Accounting Office · 1988
Routledge Sourcebook of Religion and the American Civil WarRobert R. Mathisen · 2014- 📕Media across bordersAndrea Esser, Miguel Á. Bernal-Merino · 2016
1890 Genealogical Census ReconstructionSherida K. Eddlemon, Patricia P. Nelson · 2003
Digging and discoveryDiane Young Holliday, Diane Holliday · 1997
On the rimMark Neumann · 1999
LanguageMichael Montgomery, Ellen Johnson · 2007
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Cache-oblivious algorithm In computing, a cache-oblivious algorithm (or cache-transcendent algorithm) is an algorithm designed to take advantage of a processor cache without having…
- In-place matrix transposition In-place matrix transposition, also called in-situ matrix transposition, is the problem of transposing an N×M matrix in-place in computer memory, ideally…
- Loop nest optimization In computer science and particularly in compiler design, loop nest optimization (LNO) is an optimization technique that applies a set of loop transformations…
- Matrix multiplication algorithm Because matrix multiplication is such a central operation in many numerical algorithms, much work has been invested in making matrix multiplication algorithms…
- Cache performance measurement and metric A CPU cache is a piece of hardware that reduces access time to data in memory by keeping some part of the frequently used data of the main memory in a…
- Data parallelism Data parallelism is parallelization across multiple processors in parallel computing environments. It focuses on distributing the data across different…
- Communication-avoiding algorithm Communication-avoiding algorithms minimize movement of data within a memory hierarchy for improving its running-time and energy consumption. These minimize…
- Z-order curve In mathematical analysis and computer science, functions which are Z-order, Lebesgue curve, Morton space-filling curve, Morton order or Morton code map…