A new approach to optimal cache scheduling (Q1122358): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Principles of Optimal Page Replacement / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: DMIN: An Algorithm for Computing the Optimal Dynamic Allocation in a Virtual Memory Computer / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal prepaging and font caching / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4057587 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: MIN—an optimal variable-space page replacement algorithm / rank | |||
Normal rank | |||
Latest revision as of 14:49, 19 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new approach to optimal cache scheduling |
scientific article |
Statements
A new approach to optimal cache scheduling (English)
0 references
1989
0 references
An algorithm is presented to optimal cache scheduling in the field of register management for RISC machines or in the development of globally optimal strategies for multiple-stage storage hierarchies. This algorithm answers the following question: is there a sequence of loads and stores such that all blocks lie in the cache at their reference times? Although presented algorithm does not guarantee to yield a solution in all cases, experiments showed that it is powerful to solve problems occurring in practice.
0 references
storage hierarchy
0 references
LRU-model
0 references
cache
0 references
scheduling
0 references
0 references
