Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Minimization of demand paging for the LRU stack model of program behavior

From MaRDI portal
Publication:1836297
Jump to:navigation, search

DOI10.1016/0020-0190(83)90034-0zbMath0504.68014OpenAlexW1998270160MaRDI QIDQ1836297

Tomas Lang, Eduardo B. Fernandez, Christopher Wood

Publication date: 1983

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(83)90034-0


zbMATH Keywords

memory managementvirtual memoryperformance optimizationdemand pagingLRU stack modelpage replacement algorithms


Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Theory of operating systems (68N25)


Related Items (1)

Optimal eviction policies for stochastic address traces




Cites Work

  • Analysis of the Optimal, Look-Ahead Demand Paging Algorithms
  • Unnamed Item
  • Unnamed Item




This page was built for publication: Minimization of demand paging for the LRU stack model of program behavior

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1836297&oldid=14215444"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 10:33.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki