Browse Prior Art Database

Table Search Procedure for High Performance Program Residence Unit

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

Publishing Venue

IBM

Related People

Groer, H: AUTHOR

Abstract

The table search procedure in A and B is used with a large capacity, high speed read-only storage unit, for example, one utilizing a holographic store. A portion of the storage unit is reserved for the index table in A. Each entry in the table includes a symbolic name, a high address, a low address and the actual physical address of a block or module in the storage unit corresponding to the symbolic name. When access to a selected module is required, the search argument name is compared with the name of one of the table entries. The result of the comparison can be high, low or equal. An equal indicates the successful selection of the table entry which includes the actual physical address of the required module.

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

Table Search Procedure for High Performance Program Residence Unit

The table search procedure in A and B is used with a large capacity, high speed read-only storage unit, for example, one utilizing a holographic store. A portion of the storage unit is reserved for the index table in A. Each entry in the table includes a symbolic name, a high address, a low address and the actual physical address of a block or module in the storage unit corresponding to the symbolic name. When access to a selected module is required, the search argument name is compared with the name of one of the table entries. The result of the comparison can be high, low or equal. An equal indicates the successful selection of the table entry which includes the actual physical address of the required module. High or low results cause the high or low addresses in the table to be used to select the next entry for comparison with the search argument name.

The only entry that must be located in a fixed location in storage, relative address 000, is the entry which the program uses to start each search. All other table entries are connected to this initial entry and its succeeding entries by the high and low addresses. To access the module having the symbolic name 004 as in drawing A, the latter is first compared with the name 123 at relative address
000. The result of the compare is high. The high address field at relative address 000 points to relative address 192 which includes in its symbolic name field the name 024.

Search argument 004 is compared with the name 024 resulting again in a high indication. The high address field points to relative address 112 which has in its symbolic name field the name 015. Search argument 004 is compared with the name 015 again resulting in a high indication. The high address field of the relative address 112 points to relative address 080 which includes in its symbolic name field the name 005. Search argument 004 is compared with the name 005 again resulting in a high indication. The high address portion of the relative address 080 points to the relative addre...