Patent ID: 6842826
Filing Date: 2005-01-11
Classification: G06F

Abstract:
1. A method of dynamic cache memory allocation comprising: maintaining a list of entries in a cache directory list corresponding to data blocks in a queue having a tail and a head end, the list having a top position and a bottom position, wherein each entry includes fields for storing information including a designation of one of a plurality of data sets to which the corresponding data block belongs; periodically adding an insertion point at the top position of the list and at the tail of the queue, and deleting an aged insertion point from the bottom position of the list and from the head of the queue; aging the entries and the insertion points in the queue and the list according to a standard process for aging data blocks out of the queue; loading a data block into the queue at a predetermined insertion point; and in response to the loading of the data block into the queue, inserting an entry corresponding to the data block in the list of entries at the insertion point corresponding to the queue insertion point.