Patent US4251859A successfully refreshed from Google Patents.
US4251859A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Data processing system with an enhanced pipeline control
Assignee: Hitachi Ltd
•
Filing: 1978-11-06
•
Granted: 1981-02-17
•
Expires: 1998-11-06
Abstract
Abstract A data processing system, for executing each instruction, by carrying out a plurality of successive partial processing operations, begins to process the first partial processing operation of an instruction succeeding a defeat overlap instruction before execution of the defeat overlap instruction is finished in response to the detection that a predetermined number of machine cycles is further required for the complete execution of the defeat overlap instruction.
Inventors
- 👤 Tsugio Momose
- 👤 Akira Fujita
- 👤 Kanji Kubo
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-02 17:40
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/30; G06F9/38; G06F9/3836
Claims Analysis
Total Claims: 9
Claim 1
Independent Claim
185 words
A data processing system for executing instructions comprising: storage means for storing instructions and operands; processing means, connected to said storage means, for executing each instruction by carrying out a plurality of successive partial processing operations and for processing the respective operations of each instruction with relative overlap between different operations of succeeding instructions; decode means, connected to said storage means, for detecting whether an operation code of an instruction to be executed is for a defeat overlap instruction; control means, connected to said processing means, for prohibiting all partial processings of a succeeding instruction from being executed by said processing means, in response to the detection of a defeat overlap instruction by said decode means; and detection means, connected to said processing means, for detecting that a predetermined number of machine cycles is further required for the complete execution of said defeat overlap instruction by detecting that said processing of said defeat overlap instruction has reached a predetermined stage; said control means further including means for cancelling the prohibition of execution of said succeeding instruction in response to the detection by said detection means.
Claim 2
Dependent Claim
185 words
A data processing system for executing instructions comprising: storage means for storing instructions and operands; processing means, connected to said storage means, for executing each instruction by carrying out a plurality of successive partial processing operations and for processing the respective operations of each instruction with relative overlap between different operations of succeeding instructions; decode means, connected to said storage means, for detecting whether an operation code of an instruction to be executed is for a defeat overlap instruction; control means, connected to said processing means, for prohibiting all partial processings of a succeeding instruction from being executed by said processing means, in response to the detection of a defeat overlap instruction by said decode means; and detection means, connected to said processing means, for detecting that a predetermined number of machine cycles is further required for the complete execution of said defeat overlap instruction by detecting that said processing of said defeat overlap instruction has reached a predetermined stage; said control means further including means for cancelling the prohibition of execution of said succeeding instruction in response to the detection by said detection means.
Claim 3
Dependent Claim
32 words
A data processing system according to claim 1, wherein said defeat overlap instruction is an instruction which requires the reading out of at least an operand for the last partial processing operation.
Claim 4
Dependent Claim
24 words
A data processing system according to claim 2, wherein said predetermined number is equal to one less than the number of partial processing operations.
Claim 5
Dependent Claim
102 words
A data processing system according to claim 2, wherein said processing means comprises: control storage means for storing a plurality of micro-instruction sequences for executing the last partial processing operations for respective instructions, the micro-instruction sequences thereof, which correspond to said defeat overlap instruction, having a release defeat overlap bit in those micro-instructions that precede the final micro-instructions of said respective sequences by said predetermined number of micro-instructions; and control register means, connected to said control storage means, for storing a micro-instruction read out from said control storage means; said detection means being responsive to said release-defeat-overlap-bit in said control register means.
Claim 6
Dependent Claim
51 words
A data processing system according to claim 4, further comprising flip-flop means, which is set in response to the detection of a defeat overlap instruction by said decode means, and which is reset in response to the detection by said detection means, said control means being responsive to said flip-flop means.
Claim 7
Dependent Claim
43 words
A data processing system according to claim 5, wherein: each final micro-instruction of each micro-instruction sequence includes an end-of-operation bit; and said flip-flop means is reset by said end-of-operation bit when said each final micro-instruction is read out into said control register means.
Claim 8
Dependent Claim
145 words
A data processing system according to claim 4, wherein said processing means comprises: a plurality of instruction registers for respectively storing instructions for respective partial processing operations; a plurality of flip-flops, each of which is respectively provided in correspondence with one of said instruction registers, for storing an indication that an instruction stored in said corresponding one of instruction registers is a defeat overlap instruction; means for transferring an instruction read out from said storage means every machine cycle from a respective one of said instruction registers to a further one of said instruction registers which corresponds to a succeeding partial processing operation; and means for setting sequentially a respective one of said plurality of flip-flops every machine cycle after said defeat overlap instruction is detected by said decode means; wherein said control means is responsive to any one of the outputs of said flip-flops.
Claim 9
Dependent Claim
44 words
A data processing system according to claim 7, wherein said control means includes means responsive to one of said plurality of flip-flops being reset by said release-defeat-overlap-bit in said control register means for overriding the prohibition of the partial processings of the succeeding instruction.
References Cited (Backward Citations)
US3346851A
Cited
US3717850A
Cited
US4014006A
Cited
US3875391A
Cited
US4075688A
Cited
US4110830A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1984-02-17 | 1984-08-18 | 1985-02-17 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1988-02-17 | 1988-08-18 | 1989-02-17 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1992-02-17 | 1992-08-18 | 1993-02-17 | $7700.00 | Window Closed / Lapsed |