Browse Prior Art Database

Implementation in S/360 Assembler Language of Certain Aspects of Functional and Associative Memory

IP.com Disclosure Number: IPCOM000083457D
Original Publication Date: 1975-May-01
Included in the Prior Art Database: 2005-Mar-01
Document File: 2 page(s) / 14K

Publishing Venue

IBM

Related People

Cork, RM: AUTHOR [+2]

Abstract

Table Entry Elements. Each table entry element is a relational-operator/number pair, arranged in such a way that it represents a relationship of the form, for example: (see orig. pg. 3749) or "don't care what the number is". In the implementation described below, the relational-operator part of the pair is a number equal to the sum of the IBM S/360 BC mask bit positions, the number part being in the range of o-15. Thus ">8" translates to '28', (See orig pg. 3749)

This text was extracted from a PDF file.
This is the abbreviated version, containing approximately 54% of the total text.

Page 1 of 2

Implementation in S/360 Assembler Language of Certain Aspects of Functional and Associative Memory

Table Entry Elements. Each table entry element is a relational- operator/number pair, arranged in such a way that it represents a relationship of the form, for example: (see orig. pg. 3749) or "don't care what the number is". In the implementation described below, the relational-operator part of the pair is a number equal to the sum of the IBM S/360 BC mask bit positions, the number part being in the range of o-15. Thus ">8" translates to '28', (See orig pg. 3749)

Implementation: Having separated the relational-operator part and number part of the table entry element into the lower order bytes of two registers RX and RY, respectively, register RL is pointed at the corresponding element in the search argument, and the following two instructions are performed. EX RY, COMP

EX RX, COMPBR where

COMP is CLI Phi (RZ), Phi and COMPBR is BC Phi MATCH.

The first instruction sets the condition code according to the numerical relationship between the number in the search argument and that in the corresponding element in the table entry.

The second instruction branches to MATCH, if and only if the condition code so set has a mask bit in the same position as one of those in the relational- operator in the table entry element.

This routine is repeated for each relational-operator element in the entry until either (1) it falls through the branch, in which case the start is on the next table entry, or (2) the end of the table entry is reached without falling through the branch, in which case a match has been found, and the output parameter is passed to the requestor.

It should be noted that the implementation does not limit the numbers compared to the range Phi-15. It only means that more than one element may be needed to represent numbers outside that range.

Simulation of Functional and associative Memory type instructions on conventional hardware is relatively well known. Implementation of "fuzzy match" techniques by pro...