Browse Prior Art Database

Optimal Allocation of Cache Memory Among Competing Processes

IP.com Disclosure Number: IPCOM000034184D
Original Publication Date: 1989-Jan-01
Included in the Prior Art Database: 2005-Jan-26

Publishing Venue

IBM

Related People

Authors:
Stone, HS [+details]

Abstract

A method describes how to apportion cache memory among competing processes in order to produce the least possible cache-miss rate. An example of the application is to apportion cache memory between instruction streams and data streams. 1. Background A cache-design problem that frequently arises in computers is the problem of allocating a fixed amount of cache memory among competing processes. For example, many systems have separate instruction and data caches.