Minimization of demand paging for the LRU stack model of program behavior (Q1836297): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(83)90034-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1998270160 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Analysis of the Optimal, Look-Ahead Demand Paging Algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4162450 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4109485 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 16:58, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimization of demand paging for the LRU stack model of program behavior |
scientific article |
Statements
Minimization of demand paging for the LRU stack model of program behavior (English)
0 references
1983
0 references
page replacement algorithms
0 references
demand paging
0 references
LRU stack model
0 references
performance optimization
0 references
virtual memory
0 references
memory management
0 references
