Method and apparatus for maintaining order in a queue by combining entry weights and queue weights

Abstract

A sectioned ordered queue in an information handling system comprises a plurality of queue sections arranged in order from a first queue section to a last queue section. Each queue section contains one or more queue entries that correspond to available ranges of real storage locations and are arranged in order from a first queue entry to a last queue entry. Each queue section and each queue entry in the queue sections having a weight factor defined for it. Each queue entry has an effective weight factor formed by combining the weight factor defined for the queue section with the weight factor defined for the queue entry. A new entry is added to the last queue section to indicate a newly available corresponding storage location, and one or more queue entries are deleted from the first section of the queue to indicate that the corresponding storage locations are no longer available. Various processes associated with a real storage manager are responsible for keeping the queue sections in balance, updating the queue sections, and removing entries from the queue to “steal” real storage frames.

Dependencies are inferred from the claim text.