Browse Prior Art Database

Grouping Cached Data Blocks for Replacement Purposes

IP.com Disclosure Number: IPCOM000060507D
Original Publication Date: 1986-Apr-01
Included in the Prior Art Database: 2005-Mar-08

Publishing Venue

IBM

Related People

Authors:
Christian, JH Hartung, MH Kukula, DA Robinson, HD Wendell, JS [+details]

Abstract

A replacement list, often referred to as MRU-LRU (most recently used- least recently used), is employed for controlling the data resident in a caching, or front, store where data is normally stored in a backing, or lower level, store. Generally, a directory has a replacement control list with one entry for each allocation unit or data block in the caching store. When sequential data is being processed, it is advantageous to group the entries to be treated as an entity. This article teaches how to provide a variable-length group of such entries in an inexpensive facile control. A caching store stores selected data from the backing store for enhanced access and storage by a connected host processor. A directory for the caching store has an entry for each allocation unit in the caching store.