Patent EP0096575A2 successfully refreshed from Google Patents.
EP0096575A2
Expired / Lapsed
EP
⏱️ 0.0 years remaining
Concurrent processing elements for using dependency free code
Assignee: Unisys Corp
•
Filing: 1983-06-07
•
Granted: —
•
Expires: 2003-06-07
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 concurrently executed by a plurality of processing elements.
Inventors
- 👤 Alfred John Desantis
- 👤 Joseph Siegfried Schibinger
Bibliographic Details
Application Number
—
Jurisdiction
EP
Data Source
google_patents
Last Synchronized
2026-11-07 18:59
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
63 words
In a data processing system for executing imperative code including operators and memory addresses, the combination comprising: means for forming strings of logically independent and subsequently logically dependent operators into logically independent queues; storage means for storing said logically independent queues; and a plurality of processing means coupled to said storage means for individually receiving different ones of said queues for concurrent execution.
Claim 2
Dependent Claim
63 words
In a data processing system for executing imperative code including operators and memory addresses, the combination comprising: means for forming strings of logically independent and subsequently logically dependent operators into logically independent queues; storage means for storing said logically independent queues; and a plurality of processing means coupled to said storage means for individually receiving different ones of said queues for concurrent execution.
Claim 3
Dependent Claim
54 words
The combination according to Claim 1 wherein said forming means includes means for receiving said imperative code in sequential form, determining when an operator does not require a result of a previous operation thus indicating a logical independency and forming strings of said logically independent and subsequently logically dependent operators into logically independent queues.
Claim 4
Dependent Claim
35 words
The combination according to Claim 2 wherein said data processing system includes a main memory, said combination further comprising: main memory addressing means to receive said memory addresses and fetch data from said main memory.
Claim 5
Dependent Claim
52 words
The combination according to Claim 3 wherein each of said processing means includes a local storage, the combination further comprising: local storage addressing means coupled to said main memory to transmit local memory addresses to said main memory so that said main memory can transmit said fetched data to said local memory.
Claim 6
Dependent Claim
31 words
The combination according to Claim 4 wherein said receiving means is adapted to attach said local memory address to a corresponding string of operators making up a particular logically independent queue.
Claim 7
Dependent Claim
80 words
k, 6. In a data processing system for receiving and executing sequential code including operators and memory addresses, said system including a plurality of processing means, the method comprising: receiving said sequential code; determining when an operator does not require the result o f a previous operation indicating a logical independency; forming strings of logically independent and subsequent logically dependent operators into logically independent queues; and transmitting different ones of said queues to different individual processing means for concurrent execution.
Claim 8
Dependent Claim
80 words
k, 6. In a data processing system for receiving and executing sequential code including operators and memory addresses, said system including a plurality of processing means, the method comprising: receiving said sequential code; determining when an operator does not require the result o f a previous operation indicating a logical independency; forming strings of logically independent and subsequent logically dependent operators into logically independent queues; and transmitting different ones of said queues to different individual processing means for concurrent execution.
Claim 9
Dependent Claim
31 words
The method according to Claim 6 wherein said data processing system includes a main memory, said method further comprising: receiving a main memory address and fetching data from said main memory.
Claim 10
Dependent Claim
42 words
The method according to Claim 7 wherein each of said processing means includes a local storage, the method further comprising: transmitting local memory addresses to said main memory so that said main memory can transmit said fetched data to said local memories.
Claim 11
Dependent Claim
26 words
The method according to Claim 8 further including: attaching said local memory addresses to a corresponding string of operators making up a particular logically independent queu
Claim 12
Dependent Claim
42 words
The method according to Claim 9 wherein said data processing system includes a job queue, the method further including: transmitting said independent queues of operators and corresponding local memory addresses to said job queue for subsequent distribution to said individual processing means.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
Maintenance schedule is calculated for granted US utility patents.