Browse Prior Art Database

Allocation of Cache Memory Among Competing Processes

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

Publishing Venue

IBM

Related People

Authors:
Stone, HS Wolf, JL [+details]

Abstract

A method is described relative to how to apportion memory in a cache among N competing processes. The optimal allocation can be constructed quickly in real time by one of two methods described in this article. 1. Background A cache-design problem that frequently arises in computers is that of partitioning a fixed amount of cache memory among competing processes. For example, many systems have separate instruction and data caches.