A new approach to optimal cache scheduling
From MaRDI portal
Publication:1122358
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.
Recommendations
Cites work
Cited in
(6)- Optimal timer-based caching policies for general arrival processes
- Periodic scheduling for cache-miss minimisation
- A dynamic scheduler for the infinite air-cache
- scientific article; zbMATH DE number 220159 (Why is no real title available?)
- Scheduling to Optimize Cache Utilization for Non-Volatile Main Memories
- Critical sizing of LRU caches with dependent requests
This page was built for publication: A new approach to optimal cache scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1122358)