About: Page replacement algorithm

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Page replacement algorithm Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Thing, within Data Space : el.dbpedia.org associated with source document(s)

In a computer operating system that uses paging for virtual memory management, page replacement algorithms decide which memory pages to page out, sometimes called swap out, or write to disk, when a page of memory needs to be allocated. Page replacement happens when a requested page is not in memory (page fault) and a free page cannot be used to satisfy the allocation, either because there are none, or because the number of free pages is lower than some threshold.

Attributes	Values
rdf:type	Thing
rdfs:label	Page replacement algorithm (en)
rdfs:comment	In a computer operating system that uses paging for virtual memory management, page replacement algorithms decide which memory pages to page out, sometimes called swap out, or write to disk, when a page of memory needs to be allocated. Page replacement happens when a requested page is not in memory (page fault) and a free page cannot be used to satisfy the allocation, either because there are none, or because the number of free pages is lower than some threshold. (en)
rdfs:seeAlso	Virtual memory Memory paging
sameAs	Page replacement algorithm Page replacement algorithm
dbp:wikiPageUsesTemplate	dbt:About dbt:Citation_needed dbt:Cite_book dbt:Cite_conference dbt:Cite_journal dbt:Clarify dbt:Div_col dbt:Div_col_end dbt:Main dbt:Mvar dbt:Reflist dbt:See_also dbt:Short_description dbt:Use_dmy_dates dbt:Val dbt:Confusing
Subject	Articles with example Python (programming language) code Virtual memory Online algorithms Memory management algorithms
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Page_replacement_algorithm?oldid=1060228572&ns=0
Wikipage page ID	727476 (xsd:integer)
page length (characters) of wiki page	49037 (xsd:nonNegativeInteger)
Wikipage revision ID	1060228572 (xsd:integer)
has abstract	In a computer operating system that uses paging for virtual memory management, page replacement algorithms decide which memory pages to page out, sometimes called swap out, or write to disk, when a page of memory needs to be allocated. Page replacement happens when a requested page is not in memory (page fault) and a free page cannot be used to satisfy the allocation, either because there are none, or because the number of free pages is lower than some threshold. When the page that was selected for replacement and paged out is referenced again it has to be paged in (read in from disk), and this involves waiting for I/O completion. This determines the quality of the page replacement algorithm: the less time waiting for page-ins, the better the algorithm. A page replacement algorithm looks at the limited information about accesses to the pages provided by hardware, and tries to guess which pages should be replaced to minimize the total number of page misses, while balancing this with the costs (primary storage and processor time) of the algorithm itself. The page replacing problem is a typical online problem from the competitive analysis perspective in the sense that the optimal deterministic algorithm is known. (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/Page_replacement_algorithm
is Wikipage redirect of	Second-chance algorithm Second-chance replacement strategy Second chance algorithm Second chance replacement strategy Clock with adaptive replacement Local replacement algorithm Clock with Adaptive Replacement Page replacement Page replacement algorithms Not recently used
is Link from a Wikipage to another Wikipage of	NRU OPT Adaptive replacement cache Bélády's anomaly Cache replacement policies Car (disambiguation) Dirty bit Metrical task system Demand paging K-server problem Clock (disambiguation) Clock with adaptive replacement List of algorithms Local replacement algorithm Elizabeth O'Neil Clock with Adaptive Replacement LIRS caching algorithm Memoization Memory management unit Memory paging Least frequently used Not recently used

Faceted Search & Find service v1.17_git151 as of Feb 20 2025

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (72 GB total memory, 1 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software