(Cat? OR feline) AND NOT dog?
Cat? W/5 behavior
(Cat? OR feline) AND traits
Cat AND charact*

This guide provides a more detailed description of the syntax that is supported along with examples.

This search box also supports the look-up of an IP.com Digital Signature (also referred to as Fingerprint); enter the 72-, 48-, or 32-character code to retrieve details of the associated file or submission.

Concept Search - What can I type?

For a concept search, you can enter phrases, sentences, or full paragraphs in English. For example, copy and paste the abstract of a patent application or paragraphs from an article.

Concept search eliminates the need for complex Boolean syntax to inform retrieval. Our Semantic Gist engine uses advanced cognitive semantic analysis to extract the meaning of data. This reduces the chances of missing valuable information, that may result from traditional keyword searching.

Quickcell Extension to Main Storage Management Algorithms

Publishing Venue

IBM

Related People

Bowen, AJ: AUTHOR

Abstract

Preallocated quickcell is a programming technique for managing requests made upon a main storage subpool, allowing a significant percentage of storage requests to be filtered out of the subpool load and be handled by a low-overhead mechanism.

Country

United States

Language

English (United States)

This text was extracted from a PDF file.

At least one non-text object (such as an image or picture) has been suppressed.

This is the abbreviated version, containing approximately
52% of the total text.

Page 1 of 3

Quickcell Extension to Main Storage Management Algorithms

Preallocated quickcell is a programming technique for managing requests
made upon a main storage subpool, allowing a significant percentage of storage
requests to be filtered out of the subpool load and be handled by a low-overhead
mechanism.

Storage may be arranged into subpools which include logically related blocks
of storage. Certain ones of the subpools may be initialized to contain a quickcell
area and a regular area. Quickcells are small blocks of storage which are quickly
allocated and used for short periods of time, and are managed by an algorithm
which expends a relatively small number of instructions to point at the quickcells.
The regular area is managed by any one of a number of well-known algorithms
which expend a relatively large number of instructions, to manage storage in a
way that minimizes fragmentation. Ideally, a quickcell technique provides a trivial
path through the regular area management logic and minimizes fragmentation,
by accommodating request lengths having short-lived tendencies.

In the present technique, the quickcell area is divided into a number of
preallocated cells at subpool initialization time which, by way of example, may
include one cell for each of the sizes from 8 bytes through 80 bytes in 8-byte
increments. Where a quickcell for a certain size is experiencing many misses
due to many short-lived requests of that size being outstanding concurrently, one
or more additional quickcells for the given size may be provided as shown in the
case of the 24-byte quickcell, with each quickcell of a given size being chained to
a preceding quickcell of the same given size. At subpool initialization time, a
quickcell pointer list is established for the quickcell area. The first part of each
entry in the list defines the size of an associated quickcell, while the second part
of the entry contains either an address pointer which points to the associated
quickcell or con...