US4644464A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Graph manager for a reduction processor evaluating programs stored as binary directed graphs employing variable-free applicative language codes
Assignee: Unisys Corp
•
Filing: 1984-06-05
•
Granted: 1987-02-17
•
Expires: 2004-06-05
Abstract
Abstract A parallel register-transfer mechanism and control section have been disclosed above for use in a reduction process for the evaluation of expressions of a variable-free applicative language stored as binary directed graphs. The expressions are reduced through a series of transformations until a result is obtained.
Inventors
- 👤 Gary L. Logsdon
- 👤 Mark R. Scheevel
- 👤 Frank A. Williams, Jr.
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-24 18:33
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/44; G06F9/448; G06F9/4494
Claims Analysis
Total Claims: 13
Claim 1
Independent Claim
184 words
In a reduction processing system having storage means for receiving two-cell nodes representing binary directed graphs employing a variable-free applicative language code, one of such cells in some of each nodes containing a storage address of another node, another of said cells in some of each nodes containing a code representing a functional argument and another of said cells in some of each nodes containing a variable-free operator code specifying a function substitution, a graph manager comprising: a plurality of registers coupled to said storage means for receiving a plurality of said nodes for reduction by a function substitution; interconnection means coupling said registers together for parallel transfer of fields of information from some of said registers to other of said registers; condition testing means coupled to various fields of said registers containing said nodes to detect what function substitution is to be performed and to generate a displacement address therefrom; and control store means coupled to said condition testing means for receiving said displacement address to retrieve a set of control signals to activate transfer between said registers to accomplish said function substitution.
Claim 2
Dependent Claim
184 words
In a reduction processing system having storage means for receiving two-cell nodes representing binary directed graphs employing a variable-free applicative language code, one of such cells in some of each nodes containing a storage address of another node, another of said cells in some of each nodes containing a code representing a functional argument and another of said cells in some of each nodes containing a variable-free operator code specifying a function substitution, a graph manager comprising: a plurality of registers coupled to said storage means for receiving a plurality of said nodes for reduction by a function substitution; interconnection means coupling said registers together for parallel transfer of fields of information from some of said registers to other of said registers; condition testing means coupled to various fields of said registers containing said nodes to detect what function substitution is to be performed and to generate a displacement address therefrom; and control store means coupled to said condition testing means for receiving said displacement address to retrieve a set of control signals to activate transfer between said registers to accomplish said function substitution.
Claim 3
Dependent Claim
57 words
A graph manager according to claim 1 wherein: said condition testing means includes a set of boolean logic circuits each coupled to selected ones of said registers to receive different ones of a plurality of information signals and to generate different boolean combinations of said information signals in response to control signals received from said control store.
Claim 4
Dependent Claim
51 words
A graph manager according to claim 2 wherein: said condition testing means includes a set of signal lines arranged in an order from a highest priority signal line to a lowest priority signal line, each of said signal lines being coupled to selected ones of said set of boolean logic circuits.
Claim 5
Dependent Claim
71 words
A graph manager according to claim 3 wherein: said condition testing means includes priority encoding means coupled to said signal lines to detect the highest priority signal line receiving a set of signals from one or more of said boolean logic circuits and to generate a displacement address in the form of the rank of the highest priority signal line being activated by one or more of said boolean logic circuits.
Claim 6
Dependent Claim
32 words
A graph manager according to claim 4 wherein: said interconnection means includes a crossbar network for connecting each of the said registers to other of said registers for said parallel information transfer.
Claim 7
Dependent Claim
38 words
A graph manager according to claim 5 wherein: said plurality of registers includes registers containing information specifying a type of node, registers containing the left cell of a node and registers containing the right cell of a node.
Claim 8
Dependent Claim
47 words
A graph manager according to claim 6 wherein: said crossbar network is a composite of a plurality of crossbar networks for coupling different fields of said registers to other fields of other of said registers for parallel transfer of certain of each fields to said other registers.
Claim 9
Dependent Claim
181 words
In a reduction processing system having storage means for receiving two-cell nodes representing binary directed graphs employing a variable-free applicative language code, one of such cells in some of each nodes containing a storage address of another node, another of said cells in some of each nodes containing a code representing a functional argument and another of said cells in some of each nodes containing a variable-free operator code specifying a function substitution, a graph manager comprising: a plurality of registers coupled to said storage means for receiving a plurality of said nodes for reduction by a function substitution; including a crossbar network for connecting each of said registers to other of said registers for said parallel information transfer; condition testing means coupled to various fields of said registers containing said nodes to detect what function substitution is to be performed and to generate a displacement address therefrom; and control store means coupled to said condition testing means for receiving said displacement address to retrieve a set of control signals to activate transfer between said registers to accomplish said function substitution.
Claim 10
Dependent Claim
181 words
In a reduction processing system having storage means for receiving two-cell nodes representing binary directed graphs employing a variable-free applicative language code, one of such cells in some of each nodes containing a storage address of another node, another of said cells in some of each nodes containing a code representing a functional argument and another of said cells in some of each nodes containing a variable-free operator code specifying a function substitution, a graph manager comprising: a plurality of registers coupled to said storage means for receiving a plurality of said nodes for reduction by a function substitution; including a crossbar network for connecting each of said registers to other of said registers for said parallel information transfer; condition testing means coupled to various fields of said registers containing said nodes to detect what function substitution is to be performed and to generate a displacement address therefrom; and control store means coupled to said condition testing means for receiving said displacement address to retrieve a set of control signals to activate transfer between said registers to accomplish said function substitution.
Claim 11
Dependent Claim
58 words
A graph manager according to claim 8 wherein: said condition testing means includes a set of boolean logic circuits each coupled to selected ones of said registers to receive different ones of a plurality of information signals and to generate different boolean combinations of said information detection signals in response to control signals received from said control store.
Claim 12
Dependent Claim
51 words
A graph manager according to claim 9 wherein: said condition testing means includes a set of signal lines arranged in an order from a highest priority signal line to a lowest priority signal line, each of said signal lines being coupled to selected ones of said sets of boolean logic circuits.
Claim 13
Dependent Claim
71 words
A graph manager according to claim 10 wherein: said condition testing means includes priority encoding means coupled to said signal lines to detect the highest priority signal line receiving a set of signals from one or more of said boolean logic circuits and to generate a displacement address in the form of the rank of the highest priority signal line being activated by one or more of said boolean logic circuits.
References Cited (Backward Citations)
US4463421A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1990-02-16 | 1990-08-18 | 1991-02-17 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1994-02-16 | 1994-08-18 | 1995-02-17 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1998-02-16 | 1998-08-18 | 1999-02-17 | $7700.00 | Window Closed / Lapsed |