Geben Sie ein Wort oder eine Phrase in einer beliebigen Sprache ein 👆
Sprache:
Übersetzung und Analyse von Wörtern durch künstliche Intelligenz ChatGPT
Auf dieser Seite erhalten Sie eine detaillierte Analyse eines Wortes oder einer Phrase mithilfe der besten heute verfügbaren Technologie der künstlichen Intelligenz:
- wie das Wort verwendet wird
- Häufigkeit der Nutzung
- es wird häufiger in mündlicher oder schriftlicher Rede verwendet
- Wortübersetzungsoptionen
- Anwendungsbeispiele (mehrere Phrasen mit Übersetzung)
- Etymologie
Was (wer) ist Least Recently Used - definition
ALGORITHM FOR CACHING DATA
Least Recently Used; Belady's Min; Least recently used; Cache algorithm; Caching algorithm; LRU cache; MRU cache; LRU algorithm; Bélády's Min; Least-recently used; Cache replacement policy; Cache replacement algorithm; Cache algorithms; Cache Replacement Policies
least recently used
(operating systems) (LRU) A rule used in a paging system
which selects a page to be paged out if it has been used
(read or written) less recently than any other page. The same
rule may also be used in a cache to select which cache entry
to flush.
This rule is based on temporal locality - the observation
that, in general, the page (or cache entry) which has not been
accessed for longest is least likely to be accessed in the
near future.
(1995-02-15)
Pseudo-LRU
Tree-LRU; PLRU; Pseudo Least Recently Used
Pseudo-LRU or PLRU is a family of cache algorithms which improve on the performance of the Least Recently Used (LRU) algorithm by replacing values using approximate measures of age rather than maintaining the exact age of every value in the cache.
Cache replacement policies
In computing, cache algorithms (also frequently called cache replacement algorithms or cache replacement policies) are optimizing instructions, or algorithms, that a computer program or a hardware-maintained structure can utilize in order to manage a cache of information stored on the computer. Caching improves performance by keeping recent or often-used data items in memory locations that are faster or computationally cheaper to access than normal memory stores.
Wikipedia
Cache replacement policies
In computing, cache algorithms (also frequently called cache replacement algorithms or cache replacement policies) are optimizing instructions, or algorithms, that a computer program or a hardware-maintained structure can utilize in order to manage a cache of information stored on the computer. Caching improves performance by keeping recent or often-used data items in memory locations that are faster or computationally cheaper to access than normal memory stores. When the cache is full, the algorithm must choose which items to discard to make room for the new ones.
