Browse Prior Art Database

Storage Loading Mechanism

IP.com Disclosure Number: IPCOM000090213D
Original Publication Date: 1969-Mar-01
Included in the Prior Art Database: 2005-Mar-05
Document File: 3 page(s) / 31K

Publishing Venue

IBM

Related People

Zeheb, D: AUTHOR [+2]

Abstract

The system uses associative storage 14 to provide rapid and automatic location of words in a computer storage system when the amount of high-speed storage 10 is adequate to store only part of the information accessible by the program being executed. The system utilizes a technique for using high-speed storage space in any fragmented size available while allowing the programmer to assume contiguity. The information sequences being accessed are addressed by segment name, a unique bit pattern, and the sequential location within the segment, is called the segment address. Some segments are located in storage 10, many being broken into two or more nonadjacent, unequal-length blocks, each block consisting of contiguous locations. A word in storage 14 is assigned to each such block.

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

Storage Loading Mechanism

The system uses associative storage 14 to provide rapid and automatic location of words in a computer storage system when the amount of high-speed storage 10 is adequate to store only part of the information accessible by the program being executed. The system utilizes a technique for using high-speed storage space in any fragmented size available while allowing the programmer to assume contiguity. The information sequences being accessed are addressed by segment name, a unique bit pattern, and the sequential location within the segment, is called the segment address. Some segments are located in storage 10, many being broken into two or more nonadjacent, unequal-length blocks, each block consisting of contiguous locations. A word in storage 14 is assigned to each such block. In this word are the segment name, the segment address of the first word of the block F, the segment address of the last word of the block L, a number which when added to the segment address yields the physical address in storage 10 of the addressed word delta and any other information desirable for characterizing the information in the block.

When a word is addressed by a program, the segment name and segment address are sent to storage 14 which determines which, if any, block in storage 10 contains the desired word. This requires storage 14 to compare on the segment name and recognize when the segment address lies between F and L for any word. Storage 14 recognizes for each word of such storage, whether one field of the word is equal to the first field of the key and the second field of the word is less, in binary value, than the second field of the key.

The strict equality comparison is conventional. The compari...