A new approach to optimal cache scheduling
type: Item
instance of: scholarly article
title: A new approach to optimal cache scheduling
zbMATH Open document ID: 0675.68024
DOI: 10.1016/0020-0190(89)90231-7
author: Carsten Vogt
published in: Information Processing Letters
publication date: 1989-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 68N25
Mathematics Subject Classification ID: 68W99
zbMATH DE Number: 4106268
zbMATH Keywords: storage hierarchy
zbMATH Keywords: LRU-model
zbMATH Keywords: cache
zbMATH Keywords: scheduling
reviewed by: Jerzy Martyna
MaRDI profile type: Publication
full work available at URL: 0020-0190(89)90231-7
OpenAlex ID: W1973935291
cites work: Principles of Optimal Page Replacement
cites work: DMIN: An Algorithm for Computing the Optimal Dynamic Allocation in a Virtual Memory Computer
cites work: Optimal prepaging and font caching
cites work: Q4057587
cites work: MIN—an optimal variable-space page replacement algorithm
description: scientific article; zbMATH DE number 4106268