A new approach to optimal cache scheduling (Q1122358)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4106268
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new approach to optimal cache scheduling |
scientific article; zbMATH DE number 4106268 |
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
0.7583437561988831
0 references
0.7247975468635559
0 references
