- page-replacement algorithm
- алгоритм замещения страниц
Большой англо-русский и русско-английский словарь. 2001.
page-replacement algorithm
Смотреть что такое "page-replacement algorithm" в других словарях:
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
Local replacement algorithm — With multiple processes competing for frames, we can classify page replacement algorithms into two broad categories:global replacement and local replacement.Global replacement allows a process to select a replacement frame from the set of all… … Wikipedia
Page table — A page table is the data structure used by a virtual memory system in a computer operating system to store the mapping between virtual addresses and physical addresses. Virtual addresses are those unique to the accessing process. Physical… … Wikipedia
Page fault — In computer storage technology, a page is a fixed length block of memory that is used as a unit of transfer between physical memory and external storage like a disk, and a page fault is an interrupt (or exception) to the software raised by the… … Wikipedia
Adaptive Replacement Cache — (ARC) is a page replacement algorithm with better performance [One Up on LRU, [http://www.usenix.org/publications/login/2003 08/index.html Usenix :login; August 2003] ] than LRU (Least Recently Used) developed [Megiddo and Modha,… … Wikipedia
Clock with Adaptive Replacement — (CAR) is a page replacement algorithm, which combines Adaptive Replacement Cache (ARC) and CLOCK, and it has performance comparable to ARC, and substantially outperforms both LRU and CLOCK[1]. The algorithm CAR is self tuning and requires no user … Wikipedia
Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… … Wikipedia
Boyer–Moore string search algorithm — The Boyer–Moore string search algorithm is a particularly efficient string searching algorithm, and it has been the standard benchmark for the practical string search literature. [Hume and Sunday (1991) [Fast String Searching] SOFTWARE PRACTICE… … Wikipedia
LZX (algorithm) — LZX is also the name of the programming language used in the OpenLaszlo platformLZX is the name of an LZ77 family compression algorithm. It is also the name of a file archiver with the same name. Both were invented by Jonathan Forbes and Tomi… … 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
Paging — This article is about computer virtual memory. For the wireless communication devices, see Pager . Bank switching is also called paging. Page flipping is also called paging. For calling people in a public place see Public address. In computer… … Wikipedia
