Patent US4456958A successfully refreshed from Google Patents.
US4456958A
Expired / Lapsed
US
⏱️ 0.0 years remaining
System and method of renaming data items for dependency free code
Assignee: Unisys Corp
•
Filing: 1982-06-08
•
Granted: 1984-06-26
•
Expires: 2002-06-08
Abstract
Abstract A mechanism for a data processor that is adapted to receive strings of object code, form them into higher level tasks and to determine sequences of such tasks which are logically independent so that they may be separately executed. The mechanism makes all memory accesses required by the various tasks and stores those tasks along with corresponding pointers or references to local memory in which the various data items have now been stored. The mechanism employs a symbol translation table in which the tasks are stored in forms of queues along with symbols representing the various references or pointers to local memory. In this manner, various data items can be assigned different symbols or symbolic names for use with different tasks thus further limiting dependency between various tasks and controlling data changes.
Inventors
- 👤 Alfred J. DeSantis
- 👤 Joseph S. Schibinger
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-25 20:36
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/46; G06F9/48; G06F9/4806; G06F9/4843; G06F9/4881
Claims Analysis
Total Claims: 12
Claim 1
Independent Claim
83 words
In a data processing system having a processor with a local memory and a main memory, the combination comprising: associative memory means for receiving a main memory address, comparing it to its contents and if that address is not present therein, assigning the code representing a symbolic name to that memory address and transmitting that address to main memory; and table look-up means coupled to said associative memory means to receive said symbolic name code and assign a local memory address to it.
Claim 2
Dependent Claim
83 words
In a data processing system having a processor with a local memory and a main memory, the combination comprising: associative memory means for receiving a main memory address, comparing it to its contents and if that address is not present therein, assigning the code representing a symbolic name to that memory address and transmitting that address to main memory; and table look-up means coupled to said associative memory means to receive said symbolic name code and assign a local memory address to it.
Claim 3
Dependent Claim
40 words
The combination according to claim 1 wherein: said associative memory means includes means for transmitting a preassigned symbolic name code to said table look-up means when a received main memory address has already been stored in said associative memory means.
Claim 4
Dependent Claim
21 words
The combination according to claim 2 wherein: the table look-up means includes means for forming queues of said symbolic name codes.
Claim 5
Dependent Claim
27 words
The combination according to claim 3 further including: means coupled to said table look-up means to store said local memory addresses corresponding to said symbolic name codes.
Claim 6
Dependent Claim
33 words
The combination according to claim 4 further including: job queue means; and means to address said local memory addresses by said queues of symbolic name codes for transfer to said job queue means.
Claim 7
Dependent Claim
65 words
The combination according to claim 5 further including: means for receiving a sequence of operator code, determining when an operator does not require the result of a previous operation thus indicating logical independency and forming strings of subsequent logic free dependent operators into logically independent queues; said table look-up means including means to receive said logically independent queues and attaching corresponding local memory addresses thereto.
Claim 8
Dependent Claim
86 words
In a data processing system having a processor with a local memory, a main memory, associative memory means and table look-up means, the method comprising: receiving a main memory address by said associative memory means, comparing it to the contents thereof and if that address is not present therein, assigning a code representing a symbolic name to that memory address and transmitting that address to main memory; and transmitting said symbolic name code to said table look-up means and assigning a local memory address to it.
Claim 9
Dependent Claim
86 words
In a data processing system having a processor with a local memory, a main memory, associative memory means and table look-up means, the method comprising: receiving a main memory address by said associative memory means, comparing it to the contents thereof and if that address is not present therein, assigning a code representing a symbolic name to that memory address and transmitting that address to main memory; and transmitting said symbolic name code to said table look-up means and assigning a local memory address to it.
Claim 10
Dependent Claim
34 words
The method according to claim 7 further including: transmitting a preassigned symbolic name code to said table look-up means, when a received main memory address has already been stored in said associative memory means.
Claim 11
Dependent Claim
15 words
The method according to claim 8 further including: forming queues of said symbolic name codes.
Claim 12
Dependent Claim
19 words
The method according to claim 9 further including, storing said local memory addresses corresponding to said symbolic name codes.
References Cited (Backward Citations)
US3614745A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1987-06-26 | 1987-12-26 | 1988-06-26 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1991-06-26 | 1991-12-26 | 1992-06-26 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1995-06-26 | 1995-12-26 | 1996-06-26 | $7700.00 | Window Closed / Lapsed |