LRU algorithm
Смотреть что такое "LRU algorithm" в других словарях:
LRU — can refer to: * Line replaceable unit, any complex component of a vehicle that can be replaced quickly at the flightline or airport ramp area * Least Recently Used, a cache algorithm that always keeps the most recently accessed items in memory *… … Wikipedia
Page replacement algorithm — This article is about algorithms specific to paging. For outline of general cache algorithms (e.g. processor, disk, database, web), see Cache algorithms. In a computer operating system that uses paging for virtual memory management, page… … Wikipedia
Pseudo-LRU — (also known as Tree LRU, LRU meaning least recently used ) is an efficient algorithm to find an item that most likely has not been accessed very recently, given a set of items and a sequence of access events to the items. This technique is used… … Wikipedia
THE multiprogramming system — Infobox OS name = THE multiprogramming system caption = developer = Technische Hogeschool Eindhoven / Edsger Dijkstra (et al.) source model = kernel type = supported platforms = Electrologica X8 ui = family = released = 1968 latest release… … Wikipedia
HTTP persistent connection — HTTP persistent connections, also called HTTP keep alive, or HTTP connection reuse, is the idea of using the same TCP connection to send and receive multiple HTTP requests/responses, as opposed to opening a new connection for every single… … Wikipedia
Dictionary cache — The Oracle data dictionary is a collection of database tables, owned by the SYS and SYSTEM schemas, that contain the metadata about the database, its structures, the privileges and roles of database users. The data dictionary cache holds cached… … Wikipedia
Cache algorithms — This article is about general cache algorithms. For detailed algorithms specific to paging, see page replacement algorithm. For detailed algorithms specific to the cache between a CPU and RAM, see CPU cache. In computing, cache algorithms (also… … Wikipedia
Алгоритмы кэширования — В информатике под алгоритмами кэширования (часто называемыми алгоритмами вытеснения или политиками вытеснения, а также «алгоритмами/политиками замещения») понимают оптимизацию инструкций алгоритмы особая компьютерная программа или… … Википедия
Algorithmes De Remplacement Des Lignes De Cache — Il existe différents types de mémoire cache, dont l organisation amène des situations où une ligne de la mémoire principale est mappé sur un ensemble de lignes de mémoire cache remplie. Il faut donc choisir la ligne de mémoire cache qui sera… … Wikipédia en Français
Algorithmes de remplacement des lignes de cache — Il existe différents types de mémoire cache, dont l organisation amène des situations où une ligne de la mémoire principale est mappée sur un ensemble de lignes de mémoire cache remplie. Il faut donc choisir la ligne de mémoire cache qui sera… … Wikipédia en Français
LRR — Algorithmes de remplacement des lignes de cache Il existe différents types de mémoire cache, dont l organisation amène des situations où une ligne de la mémoire principale est mappé sur un ensemble de lignes de mémoire cache remplie. Il faut donc … Wikipédia en Français
