Patent US3477858A successfully refreshed from Google Patents.
Patent US1948925A successfully refreshed from Google Patents.
Patent US4757466A successfully refreshed from Google Patents.
US4757466A
Expired / Lapsed
US
⏱️ 0.0 years remaining
High speed data processing system and method
Assignee: Hitachi Ltd
•
Filing: 1985-08-26
•
Granted: 1988-07-12
•
Expires: 2005-08-26
Abstract
Abstract A processing method and apparatus for providing high speed computations including an exchange network for discriminating a first processing node which can execute a predetermined arithmetic operation. The processing node being capable of executing the arithmetic operation and determining a second processing node to which the output of the executed node is to be applied. The invention may include a plurality of first and second processing nodes in parallel to enable high speed computations.
Inventors
- 👤 Shinichiro Miyaoka
- 👤 Akira Muramatsu
- 👤 Motohisa Funabashi
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-05 09:21
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/44; G06F9/448; G06F9/4494
Claims Analysis
Total Claims: 7
Claim 1
Independent Claim
199 words
A high speed data processing system for processing data in accordance with a data flow graph including nodes corresponding to instructions to be executed, said system comprising: at least one first means for discriminating a node which includes all available data to be executed, based on an indication code stored in a first memory, and for outputting an instruction corresponding to said node, said instruction including an operation code to indicate the kind of said instruction, said available data and a pointer code; at least one second means for executing said instruction, and for outputting a result of said execution and said pointer code; at least one third means for receiving said result of said execution and said pointer code, and for addressing a second memory based on said pointer code, said second memory storing a number of at least one receiving node with is to receive output data from said node at an address indicated by said pointer code, and for outputting the number of said at least one received node and said result of said execution; and fourth means for relaying the output of said at least one third means to said at least one first means.
Claim 2
Dependent Claim
199 words
A high speed data processing system for processing data in accordance with a data flow graph including nodes corresponding to instructions to be executed, said system comprising: at least one first means for discriminating a node which includes all available data to be executed, based on an indication code stored in a first memory, and for outputting an instruction corresponding to said node, said instruction including an operation code to indicate the kind of said instruction, said available data and a pointer code; at least one second means for executing said instruction, and for outputting a result of said execution and said pointer code; at least one third means for receiving said result of said execution and said pointer code, and for addressing a second memory based on said pointer code, said second memory storing a number of at least one receiving node with is to receive output data from said node at an address indicated by said pointer code, and for outputting the number of said at least one received node and said result of said execution; and fourth means for relaying the output of said at least one third means to said at least one first means.
Claim 3
Dependent Claim
53 words
A high speed data processing system according to claim 1, wherein said indication code indicates the availability of said data to be processed, said first memory further storing said operation code, the value of one data to be executed, and said pointer code at an address which is indicated by said third means.
Claim 4
Dependent Claim
30 words
A high speed data processing system according to claim 1, wherein at least two sets of said first, second and third means are connected in parallel to said fourth means.
Claim 5
Dependent Claim
40 words
A high speed data processing system according to claim 3, wherein said fourth means comprises an exchange network for relaying said output of said at least one third means to a predetermined one of said at least one first means.
Claim 6
Dependent Claim
120 words
A high speed data processing method for processing data in accordance with a data flow graph including nodes corresponding to instructions to be executed, said method comprising the steps of: discriminating a node which includes all available data to be executed based on an indication code indicating the availability of said data; outputting an instruction corresponding to said node including an operation code to indicate the kind of said instruction, said available data and a pointer code; executing said instruction; outputting a result of said executing step and said pointer code; generating at least one receiving node for receiving said result based on said pointer code; and outputting said result to said at least one receiving node for further processing.
Claim 7
Dependent Claim
120 words
A high speed data processing method for processing data in accordance with a data flow graph including nodes corresponding to instructions to be executed, said method comprising the steps of: discriminating a node which includes all available data to be executed based on an indication code indicating the availability of said data; outputting an instruction corresponding to said node including an operation code to indicate the kind of said instruction, said available data and a pointer code; executing said instruction; outputting a result of said executing step and said pointer code; generating at least one receiving node for receiving said result based on said pointer code; and outputting said result to said at least one receiving node for further processing.
References Cited (Backward Citations)
US3343135A
Cited
US3936806A
Cited
US3962706A
Cited
US4149240A
Cited
US4153932A
Cited
US4486850A
Cited
US4065808A
Cited
US4310879A
Cited
US4306286A
Cited
US4587626A
Cited
US4656580A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1991-07-12 | 1992-01-11 | 1992-07-12 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1995-07-12 | 1996-01-11 | 1996-07-12 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1999-07-12 | 2000-01-11 | 2000-07-12 | $7700.00 | Window Closed / Lapsed |