Least frequently used, the Glossary

Table of Contents

1. 5 relations: Cache (computing), Cache replacement policies, Memory paging, Page (computer memory), Reference (computer science).

2. Memory management algorithms
3. Online algorithms
4. Virtual memory

Cache (computing)

In computing, a cache is a hardware or software component that stores data so that future requests for that data can be served faster; the data stored in a cache might be the result of an earlier computation or a copy of data stored elsewhere.

See Least frequently used and Cache (computing)

Cache replacement policies

In computing, cache replacement policies (also known as cache replacement algorithms or cache algorithms) are optimizing instructions or algorithms which a computer program or hardware-maintained structure can utilize to manage a cache of information. Least frequently used and cache replacement policies are memory management algorithms.

See Least frequently used and Cache replacement policies

Memory paging

In computer operating systems, memory paging (or swapping on some Unix-like systems) is a memory management scheme by which a computer stores and retrieves data from secondary storage for use in main memory. Least frequently used and memory paging are virtual memory.

See Least frequently used and Memory paging

Page (computer memory)

A page, memory page, or virtual page is a fixed-length contiguous block of virtual memory, described by a single entry in a page table. Least frequently used and page (computer memory) are virtual memory.

See Least frequently used and Page (computer memory)

Reference (computer science)

In computer programming, a reference is a value that enables a program to indirectly access a particular datum, such as a variable's value or a record, in the computer's memory or in some other storage device.

See Least frequently used and Reference (computer science)

See also

Memory management algorithms

• Adaptive replacement cache
• Automatic memory management
• Buddy memory allocation
• Cache replacement policies
• Concurrent mark sweep collector
• Five-minute rule
• Garbage-first collector
• LIRS caching algorithm
• Least frequently used
• Mark–compact algorithm
• Page replacement algorithm
• Pseudo-LRU
• SLOB
• SLUB (software)
• Slab allocation

Online algorithms

• Adversary model
• Competitive analysis (online algorithm)
• Internet bots
• K-server problem
• LIRS caching algorithm
• Least frequently used
• List update problem
• LiveVideo
• Metrical task system
• Online algorithm
• Online machine learning
• Online optimization
• Page replacement algorithm
• Prophet inequality
• Ski rental problem
• The Library of Babel (website)

Virtual memory

• Adaptive replacement cache
• B5000 instruction set
• Base and bounds
• Copy-on-write
• Demand paging
• Intel 5-level paging
• Kernel page-table isolation
• LIRS caching algorithm
• Least frequently used
• Logical address
• Memory management unit
• Memory paging
• Memory-mapped file
• Motorola 68851
• Overlay (programming)
• PCI hole
• PSE-36
• Page (computer memory)
• Page Size Extension
• Page address register
• Page attribute table
• Page fault
• Page replacement algorithm
• Page table
• Physical Address Extension
• Physical address
• Thrashing (computer science)
• Translation lookaside buffer
• Virtual address space
• Virtual memory
• Virtual memory compression
• Working set
• Zram
• Zswap

References

[1] https://en.wikipedia.org/wiki/Least_frequently_used

Also known as Least-Frequently Used.