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

A new approach to optimal cache scheduling

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

DOI10.1016/0020-0190(89)90231-7zbMath0675.68024OpenAlexW1973935291MaRDI QIDQ1122358

Carsten Vogt

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1016/0020-0190(89)90231-7


zbMATH Keywords

cacheschedulingLRU-modelstorage hierarchy


Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25) Algorithms in computer science (68W99)





Cites Work

  • Unnamed Item
  • DMIN: An Algorithm for Computing the Optimal Dynamic Allocation in a Virtual Memory Computer
  • MIN—an optimal variable-space page replacement algorithm
  • Optimal prepaging and font caching
  • Principles of Optimal Page Replacement




This page was built for publication: A new approach to optimal cache scheduling

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