Patent US4969183A successfully refreshed from Google Patents.
Patent US4594653A successfully refreshed from Google Patents.
← Back to Patent Explorer
US4594653A Expired / Lapsed US ⏱️ 0.0 years remaining

Data processing machine suitable for high-speed processing

Assignee: NEC Corp
•
Filing: 1982-10-22
•
Granted: 1986-06-10
•
Expires: 2002-10-22
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A modular data processing unit includes first through fourth memories and an arithmetic unit all connected in a recirculating pipeline mode. An interface unit couples an external bus to the pipeline bus at a point between the arithmetic unit and first memory, and the fourth memory provides outputs to either the arithmetic unit or the interface unit. Data, instructions and addresses are transferred to the first memory via the interface unit, which addresses the second memory for storing instructions. In accordance with the output of the second memory, data is stored in the third memory. The arithmetic unit operates on the data in accordance with the instructions, and the fourth memory acts as a buffer for temporarily storing data while awaiting transfer to the arithmetic unit or interface unit. The transfer of data to the arithmetic unit from the fourth memory in addition to the transfer of data between modules, is controlled in accordance with the available storage capacity in the fourth memory. Data transfer can also be monitored between any two units to maintain the relative amounts of data transfer within predetermined limits.

Inventors

  • 👤 Masao Iwashita
  • 👤 Tsutomu Tenma

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-26 15:57
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/44; G06F9/448; G06F9/4494

Claims Analysis

Total Claims: 6
Claim 1
Independent Claim 297 words
A data processing machine comprising a first memory for storing destination addresses designating locations of instructions used in a data processing, a second memory accessed with the destination addresses output from said first memory and storing said instructions therein, an arithmetic means for executing an arithmetic operation in accordance with the instructions read out of said second memory, a third memory for temporarily storing first data read out from said second memory which has reached said third memory in advance of a second data which is needed together with said first data for a dyadic operation, until said second data reaches said third memory, a fourth memory for storing data read out from said third memory waiting to be processed in said arithmetic means and data waiting to be transferred to the outside of said data processing machine, interface means for receiving data to be transferred to said first memory from the outside of said data processing machine and for transferring data in said fourth memory to the outside of said data processing machine, and bus means for coupling said first to fourth memories and said arithmetic means into a ring shape, said fourth memory including a data queue memory means for storing data to be used in an operation of an instruction which does not increase the number of data to be stored back in said fourth memory, a generator queue memory means for storing data to be used in an operation of an instruction which increases the number of data to be stored back in said fourth memory, and a means for monitoring the amount of data in said data queue memory means and inhibiting an output of said generator queue memory means to said arithmetic means when said monitored amount exceeds a predetermined amount.
Claim 2
Dependent Claim 297 words
A data processing machine comprising a first memory for storing destination addresses designating locations of instructions used in a data processing, a second memory accessed with the destination addresses output from said first memory and storing said instructions therein, an arithmetic means for executing an arithmetic operation in accordance with the instructions read out of said second memory, a third memory for temporarily storing first data read out from said second memory which has reached said third memory in advance of a second data which is needed together with said first data for a dyadic operation, until said second data reaches said third memory, a fourth memory for storing data read out from said third memory waiting to be processed in said arithmetic means and data waiting to be transferred to the outside of said data processing machine, interface means for receiving data to be transferred to said first memory from the outside of said data processing machine and for transferring data in said fourth memory to the outside of said data processing machine, and bus means for coupling said first to fourth memories and said arithmetic means into a ring shape, said fourth memory including a data queue memory means for storing data to be used in an operation of an instruction which does not increase the number of data to be stored back in said fourth memory, a generator queue memory means for storing data to be used in an operation of an instruction which increases the number of data to be stored back in said fourth memory, and a means for monitoring the amount of data in said data queue memory means and inhibiting an output of said generator queue memory means to said arithmetic means when said monitored amount exceeds a predetermined amount.
Claim 3
Dependent Claim 49 words
A data processing machine according to claim 1, in which said data queue memory means stores data to be transferred to said arithmetic means and data to be transferred to said interface means, and said generator queue memory means stores only data to be transferred to said arithmetic means.
Claim 4
Dependent Claim 56 words
A data processing machine according to claim 1, in which said second memory consists of a random access memory in which an instruction set necessary to execute a program is written, said instruction set being transferred from the outside of said data processing machine through said interface means to said second memory before the program execution.
Claim 5
Dependent Claim 58 words
A data processing machine according to claim 3, in which said arithmetic means repeatedly executes the program defined by said instruction set, and wherein said fourth memory sequentially stores results of the repeated program execution and sequentially transfers said results to the outside of said data processing machine through said interface means after said repeated program executions terminate.
Claim 6
Dependent Claim 30 words
A data processing machine according to claim 1, in which at least said second memory is initialized in a clear condition by a reset signal transferred from said interface means.

References Cited (Backward Citations)

US3875391A Cited
US4025771A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1989-06-09 1989-12-09 1990-06-10 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1993-06-09 1993-12-09 1994-06-10 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1997-06-09 1997-12-09 1998-06-10 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag