This HTML5 document contains 33 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dcthttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
n10http://en.wikipedia.org/wiki/
dbphttp://dbpedia.org/property/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Page_replacement_algorithm
rdf:type
owl:Thing
rdfs:label
Page replacement algorithm
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.
rdfs:seeAlso
dbr:Virtual_memory dbr:Memory_paging
owl:sameAs
freebase:m.0362yx yago-res:Page_replacement_algorithm
dbp:wikiPageUsesTemplate
dbt:Cite_conference dbt:Reflist dbt:About dbt:Short_description dbt:Clarify dbt:Use_dmy_dates dbt:Confusing dbt:Main dbt:Mvar dbt:Div_col dbt:Div_col_end dbt:See_also dbt:Citation_needed dbt:Cite_journal dbt:Val dbt:Cite_book
dct:subject
dbc:Online_algorithms dbc:Virtual_memory dbc:Memory_management_algorithms dbc:Articles_with_example_Python_(programming_language)_code
prov:wasDerivedFrom
n10:Page_replacement_algorithm?oldid=1060228572&ns=0
dbo:wikiPageID
727476
dbo:wikiPageLength
49037
dbo:wikiPageRevisionID
1060228572
dbo: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.
foaf:isPrimaryTopicOf
n10:Page_replacement_algorithm