EP0032515B1 - A method of pipeline control for a computer - Google Patents
A method of pipeline control for a computer Download PDFInfo
- Publication number
- EP0032515B1 EP0032515B1 EP80901417A EP80901417A EP0032515B1 EP 0032515 B1 EP0032515 B1 EP 0032515B1 EP 80901417 A EP80901417 A EP 80901417A EP 80901417 A EP80901417 A EP 80901417A EP 0032515 B1 EP0032515 B1 EP 0032515B1
- Authority
- EP
- European Patent Office
- Prior art keywords
- tag
- phase
- microprocessing
- cycle
- flow
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired
Links
- 238000000034 method Methods 0.000 title claims abstract description 11
- 238000009482 thermal adhesion granulation Methods 0.000 description 37
- 238000010586 diagram Methods 0.000 description 5
- 230000003247 decreasing effect Effects 0.000 description 2
- 239000003550 marker Substances 0.000 description 2
- 230000003252 repetitive effect Effects 0.000 description 2
- 230000005540 biological transmission Effects 0.000 description 1
- 230000005055 memory storage Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/30—Arrangements for executing machine instructions, e.g. instruction decode
- G06F9/38—Concurrent instruction execution, e.g. pipeline or look ahead
- G06F9/3802—Instruction prefetching
- G06F9/3808—Instruction prefetching for instruction reuse, e.g. trace cache, branch target cache
- G06F9/381—Loop buffering
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/22—Microcontrol or microprogram arrangements
- G06F9/28—Enhancement of operational speed, e.g. by using several microcontrol devices operating in parallel
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/30—Arrangements for executing machine instructions, e.g. instruction decode
- G06F9/38—Concurrent instruction execution, e.g. pipeline or look ahead
- G06F9/3867—Concurrent instruction execution, e.g. pipeline or look ahead using instruction pipelines
- G06F9/3869—Implementation aspects, e.g. pipeline latches; pipeline synchronisation and clocking
Definitions
- the present invention relates to a method of pipeline control for a computer.
- an instruction is executed incrementally on a stream of data as each operand passes a station in the pipeline. At any moment, different elemental portions of instructions are being effected on different operands.
- a tag is used for instructing each of the steps of one instruction on one operand.
- An example of the use of such tag data in a pipeline system is described in IBM Technical Disclosure Bulletin, Vol. 14, No. 9, February 1972, pages 2739-2740; this discloses a pipeline system in which microinstructions are executed simultaneously from the control storage of four logical microprocessors, the micro-instructions being tagged according to stream and migrating through four platforms, one for each of four phases of the execution, each platform containing those decodes and controls necessary during that particular phase of execution.
- instruction 1 through instruction 13 successively pass through processing stages I through VI according to a time as determined by reference clock cycles t0, t1, t2, ... t13, as illustrated in Figure 1.
- an instruction is taken out by processing cycles la, Ib1 and Ib2.
- an instruction is decoded by processing cycles D and R.
- an operand is read-out by processing cycles A, B1 and B2.
- an operation is executed by processing cycles E1, E2 and E2D.
- a result of operation is checked by a processing cycle CK.
- the result of operation is stored by a processing cycle W.
- a processing flow is formed by a series of processing cycles consisting of a cycle D for decoding, a cycle R for reading, cycle A for address calculation, cycles B1 and B2 for operand read-out, cycles E1 and E2 for operation execution, a cycle CK for operation result checking, and a cycle W for operation result writing.
- These processing cycles are divided into phases. Namely, the cycles D and R are included in a phase-1, the cycles A and B1 are included in a phase 2, the cycles B2 and E1 are included in a phase-3, the cycle E2 is included in a phase-4, the cycle CK is included in a phase-5, and the cycle W is included in a phase 6.
- the processing flow is controlled by an instruction register INS REG, a control storage CS, a tag register of phase-1 PH ⁇ 1 TAG, a tag register of phase-2 PH . 2 TAG, a tag register of phase-3 PH ⁇ 3 TAG, a tag register of phase-4 PH - 4 TAG, and a tag register of phase-5 PH - 5 TAG.
- Tag data necessary for executing instructions are stored in the control storage CS.
- the tag data are successively read out from the control storage CS depending upon the data of the instruction register INS REG, and are supplied to a group of tag registers PH . 1 TAG, PH . 2 TAG, PH - 3 TAG, PH . 4 TAG and PH - 5 TAG.
- the present invention has been proposed to solve the above-mentioned problems inherent in the conventional systems.
- the principal object of the present invention is to increase the operation speed of a pipeline computer system by eliminating the additional operation flow which has hitherto been employed when one instruction was to be repeated with different data.
- the present invention consists in a method of pipeline control for a computer in which flows of microprocessing operations proceed successively through a plurality of microprocessing stages and in which predetermined tag data are allocated to each of the microprocessing stages to allow successively initiated flows of microprocessing operations to proceed through the microprocessing stages one after another in a time-overlapped manner, characterized in that a plurality of tag registers is associated with the stage performing at least an address calculation cycle and in that predetermined tag data are stored during a stage in the execution of a first sequence of micro-operation flows in order to repetitively execute a flow of microprocessing operations which is based upon the same tag data, and required tags are selected from the tags stored in the tag registers one after another for executing second and subsequent sequences of micro-operation flows in which the same micro-operation flows are repeated, so that execution of a later one of the said operation flows is initiated at the stage performing at least an address calculation cycle without executing anew a decoding and reading cycle associated with a previous stage.
- a data processing pipeline control system having: a control memory for storing microinstructions corresponding to the TAGs used in the method of the present invention, the processing being carried out in accordance with the micro-instructions read out from the control memory; a holding register constituted by shift register stages holds the content of the read-out micro-instructions or the content of partial fields of the micro-instructions during plural processing cycles, and a circuit portion to be controlled during plural processing cycles or a portion of the plural processing cycles on the basis of the content of the shift register stages.
- a micro-instruction includes five fields controlling different blocks in a circuit to be controlled.
- This circuit is constituted by a four-stage pipeline and a holding register is provided for each field for each stage after stage 0.
- a counter is provided in the holding register of each of the stages so that the cycle number for holding each micro-instruction in each holding register, or the cycle number required for transmitting each micro-instruction to the next stage, can be selected optionally, the intention being that the manner of transmission of one micro-instruction, i.e. the cycle number of each phase of one flow, is made variable.
- the cycle number in one flow is fixed, and a number of candidates are prepared at the outlet portion of a control storage unit so that switching to a flow related to another TAG can be carried out immediately i.e. without needing time for reading out the control storage unit.
- US-A-4040033 is concerned with the repetitive execution of microprogram loops without repetitive reading of microprograms from a microprogram memory, but is not concerned with a pipeline control system. It employs a buffer memory having a number of word storage positions for storing micro-command words, all the micro-commands required for a loop being stored in the buffer memory. For each buffer memory storage position there is assigned a marker flip-flop. This flip-flop is however only a flag indicating the validity or invalidity of the entry in the corresponding position of the buffer memory; the contents of the marker flip-flops differ from tag data in that they are not information read from the control memory, nor do these contents constitute information which is transmitted through a sequence of stages in a pipeline.
- the selection controller receives an input from a first field of the phase-1 TAG register, and also an input from a first field of the output of the selector.
- the second field in the output of the PH - 1 TAG register is applied to the two registers PH . 2 TAG No. 1 and PH - 2 TAG No. 2.
- FIG. 5 illustrates an example of an operation of the system shown in Figure 4.
- the operation consists of two operation flows f11 1 and f21.
- a tag for phase 1 is written into the register PH ⁇ 1 TAG.
- a tag for phase 2 is written into the register PH . 2 TAG No. 1, in phase 2 of the first operation flow f11.
- the tag for phase 2 is written into the register PH - 2 TAG No. 2, for the second operational flow f21, the PH - 2 TAG No. 1 and PH ⁇ 2 TAG No. 2 registers being selected in succession by the selector SEL for the two operation flows.
- These operation flows proceed from phase 1 to phase 5 and are repeated until a finish of operation is detected.
- the next sequence of the operation flows f12 and f22 is a repetition of the earlier operation flows, with the exception that the cycle D for decoding and the cycle R for reading in the first phase, are omitted.
- the selector SEL selects first the register PH ⁇ 2 TAG No. 1 for the phase 2 tag in the flow f12 and next the register PH - 2 TAG No. 2 as a tag for the second phase, in flow f22, both of the flow f12 and f22 being initiated from the cycle A for address calculation.
- the next tag for the next different instruction (flow f3) is taken out and stored, using the PH - 1 TAG register of phase 1 which is in a vacant state once phase 2 of the flow f21 has commenced.
- the cycle D and the cycle R are repeated in the flow 3 until the last operation flow of the previous operation is detected.
- the operation is immediately switched to another operation flow, and the cycle A and subsequent cycles are carried out following the cycle D and the cycle R. If the end of the repetition is detected in the phase-2 (A, B1) of the flow f22, for example, the phase-2 of the next flow f3 is immediately started following the phase-2 of the flow f22. That is to say, the additional operation flow f2' required in the conventional operation of Figure 3, is eliminated. Consequently, the operation speed of the pipeline-type computer system can be prevented from being decreased.
- the tags of phase-2 are selected by the selector SEL which is controlled by the selection controller SEL CONT.
- the above-mentioned selection can be effected by employing either a selection bit in the tags of phase-2 or a selection modification signal SS which is applied to the selection controller SEL CONT.
- the number of tags in the phase-2 need not be limited to two, i.e., tag No. 1 and tag No. 2, but may be three or more.
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Advance Control (AREA)
Abstract
Description
- The present invention relates to a method of pipeline control for a computer.
- In a pipeline system, an instruction is executed incrementally on a stream of data as each operand passes a station in the pipeline. At any moment, different elemental portions of instructions are being effected on different operands. A tag is used for instructing each of the steps of one instruction on one operand. An example of the use of such tag data in a pipeline system is described in IBM Technical Disclosure Bulletin, Vol. 14, No. 9, February 1972, pages 2739-2740; this discloses a pipeline system in which microinstructions are executed simultaneously from the control storage of four logical microprocessors, the micro-instructions being tagged according to stream and migrating through four platforms, one for each of four phases of the execution, each platform containing those decodes and controls necessary during that particular phase of execution.
- In general, when an electronic computer is to be controlled relying upon a pipeline control method,
instruction 1 throughinstruction 13 successively pass through processing stages I through VI according to a time as determined by reference clock cycles t0, t1, t2, ... t13, as illustrated in Figure 1. For example, in the processing stage I, an instruction is taken out by processing cycles la, Ib1 and Ib2. In the processing stage II, an instruction is decoded by processing cycles D and R. In the processing stage III, an operand is read-out by processing cycles A, B1 and B2. In the processing stage IV, an operation is executed by processing cycles E1, E2 and E2D. In the processing stage V, a result of operation is checked by a processing cycle CK. In the processing stage VI, the result of operation is stored by a processing cycle W. - In a pipeline control system as illustrated in Figure 2, a processing flow is formed by a series of processing cycles consisting of a cycle D for decoding, a cycle R for reading, cycle A for address calculation, cycles B1 and B2 for operand read-out, cycles E1 and E2 for operation execution, a cycle CK for operation result checking, and a cycle W for operation result writing. These processing cycles are divided into phases. Namely, the cycles D and R are included in a phase-1, the cycles A and B1 are included in a
phase 2, the cycles B2 and E1 are included in a phase-3, the cycle E2 is included in a phase-4, the cycle CK is included in a phase-5, and the cycle W is included in aphase 6. The processing flow is controlled by an instruction register INS REG, a control storage CS, a tag register of phase-1 PH · 1 TAG, a tag register of phase-2 PH . 2 TAG, a tag register of phase-3 PH · 3 TAG, a tag register of phase-4 PH - 4 TAG, and a tag register of phase-5 PH - 5 TAG. - Tag data necessary for executing instructions are stored in the control storage CS. When instructions are to be executed, the tag data are successively read out from the control storage CS depending upon the data of the instruction register INS REG, and are supplied to a group of tag registers PH . 1 TAG, PH . 2 TAG, PH - 3 TAG, PH . 4 TAG and PH - 5 TAG.
- The operation of the conventional pipeline control system of Figure 2 is illustrated in Figure 3. Let it be assumed that an operation consisting of two operation flows (f1 and f2) is carried out for one instruction. In this case, even if the same operation flow such as a move character MVW is repetitively executed, the phase-1 PH - 1 generates a predetermined tag PH · 1 TAG every time for each operation flow. However, when one instruction is finished and then another operation of another instruction is to be carried out, a tag data for another operation must be taken out from the control storage CS and must be fed to the tag registers PH - 1 TAG, PH · 2 TAG, PH . 3 TAG, PH . 4 TAG and PH . 5 TAG. When one instruction is to be switched to another instruction, therefore, a procedure is required to withdraw the previously employed tag and to introduce a new tag. The above procedure, however, requires an additional operation flow f2' as well as additional time for effecting the additional operation flow f2'. This is because the decision of switching to the next instruction cannot be established before phase-2 of the last operation flow of the present instruction. For example the repetition of the preceding flow may depend on whether the value of the operand data has reached a predetermined value and this is obtained at the earliest only after cycle B1 in phase-2. In phase-2, however, the phase-1 of the next operation flow f2' has already started. With the system of Figure 2, therefore, the operation speed of the whole apparatus tends to be decreased.
- The present invention has been proposed to solve the above-mentioned problems inherent in the conventional systems.
- The principal object of the present invention is to increase the operation speed of a pipeline computer system by eliminating the additional operation flow which has hitherto been employed when one instruction was to be repeated with different data.
- The present invention consists in a method of pipeline control for a computer in which flows of microprocessing operations proceed successively through a plurality of microprocessing stages and in which predetermined tag data are allocated to each of the microprocessing stages to allow successively initiated flows of microprocessing operations to proceed through the microprocessing stages one after another in a time-overlapped manner, characterized in that a plurality of tag registers is associated with the stage performing at least an address calculation cycle and in that predetermined tag data are stored during a stage in the execution of a first sequence of micro-operation flows in order to repetitively execute a flow of microprocessing operations which is based upon the same tag data, and required tags are selected from the tags stored in the tag registers one after another for executing second and subsequent sequences of micro-operation flows in which the same micro-operation flows are repeated, so that execution of a later one of the said operation flows is initiated at the stage performing at least an address calculation cycle without executing anew a decoding and reading cycle associated with a previous stage.
- With such a pipeline control system, when a first flow of processing operations is being repeated without the decode and read cycle, the subsequent different operation flow can be decoded and read and its tag data entered into the PH - 1 TAG register in readiness, so that this next operational flow can be started with the address calculation stage immediately if it is established that the latest repetition of the preceding flow of operations is the last.
- Our Japanese specification JP-A-53-81032 describes and claims a data processing pipeline control system having: a control memory for storing microinstructions corresponding to the TAGs used in the method of the present invention, the processing being carried out in accordance with the micro-instructions read out from the control memory; a holding register constituted by shift register stages holds the content of the read-out micro-instructions or the content of partial fields of the micro-instructions during plural processing cycles, and a circuit portion to be controlled during plural processing cycles or a portion of the plural processing cycles on the basis of the content of the shift register stages.
- As illustrated in JP-A-53-81032 a micro-instruction includes five fields controlling different blocks in a circuit to be controlled.
- This circuit is constituted by a four-stage pipeline and a holding register is provided for each field for each stage after stage 0.
- In one embodiment a counter is provided in the holding register of each of the stages so that the cycle number for holding each micro-instruction in each holding register, or the cycle number required for transmitting each micro-instruction to the next stage, can be selected optionally, the intention being that the manner of transmission of one micro-instruction, i.e. the cycle number of each phase of one flow, is made variable.
- Contrary to this, in the system of the present invention, the cycle number in one flow is fixed, and a number of candidates are prepared at the outlet portion of a control storage unit so that switching to a flow related to another TAG can be carried out immediately i.e. without needing time for reading out the control storage unit.
- US-A-4040033 is concerned with the repetitive execution of microprogram loops without repetitive reading of microprograms from a microprogram memory, but is not concerned with a pipeline control system. It employs a buffer memory having a number of word storage positions for storing micro-command words, all the micro-commands required for a loop being stored in the buffer memory. For each buffer memory storage position there is assigned a marker flip-flop. This flip-flop is however only a flag indicating the validity or invalidity of the entry in the corresponding position of the buffer memory; the contents of the marker flip-flops differ from tag data in that they are not information read from the control memory, nor do these contents constitute information which is transmitted through a sequence of stages in a pipeline.
- In order that the invention may better understood, an example of a pipeline control system embodying the invention will now be described with reference to Figures 4 and 5 of the accompanying drawings. In the drawings:-
- Figure 1 is a diagram schematically illustrating, in series, an operation for pipeline-controlling an electronic computer;
- Figure 2 is a diagram of tag registers which are arranged in series to illustrate an operation of a conventional pipeline control system,
- Figure 3 is a diagram illustrating, in series, an operation of a series of tag registers of Figure 2,
- Figure 4 is a diagram of a series of tag registers which are used for a pipeline control system according to an embodiment of the present invention, and;
- Figure 5 is a diagram illustrating, in series, an operation of the series of tag registers of Figure 4.
- Figure 4 illustrates a series of processing cycles in an operation of a pipeline control system. The series of processing cycles consists of a cycle D for decoding, a cycle R for reading, a cycle A for address calculation, cycles B1 and B2 for operand read-out, cycles E1 and E2 for operation execution, a cycle CK for operation result checking, and a cycle W for operation result writing. These processing cycles are divided into phases. The cycles D and R are included in a phase-1 (PH · 1), the cycles A and B1 are included in a phase-2 (PH · 2), the cycles B2 and E1 are included in a phase-3 (PH - 3), the cycle E2 is included in a phase-4 (PH. 4), the cycle CK is included in a phase-5 (PH. 5), and the cycle W is included in a phase-6 (PH - 6). The operation is performed by an instruction register INS REG, a control storage CS, a tag register PH - 1 TAG of the phase-1, tag registers PH - 2 TAG No. 1 and PH . 2 TAG No. 2 of the phase-2, a selection controller SEL CONT, a selector SEL, a tag register PH . 3 TAG of the phase-3, a tag register PH - 4 TAG of the phase-4, and a tag register PH · 5 TAG of the phase-5. The phase-2 (PH - 2) contains a plurality of tag registers as denoted by No. 1 and No. 2 which will be selected by the selector SEL that is controlled by output signals of the selection controller SEL CONT.
- The selection controller receives an input from a first field of the phase-1 TAG register, and also an input from a first field of the output of the selector. The second field in the output of the PH - 1 TAG register is applied to the two registers PH . 2 TAG No. 1 and PH - 2 TAG No. 2.
- Figure 5 illustrates an example of an operation of the system shown in Figure 4. In this case, the operation consists of two operation flows f11 1 and f21. Initially, a tag for
phase 1 is written into the register PH · 1 TAG. Next, a tag forphase 2 is written into the register PH . 2 TAG No. 1, inphase 2 of the first operation flow f11. Thereafter, the tag forphase 2 is written into the register PH - 2 TAG No. 2, for the second operational flow f21, the PH - 2 TAG No. 1 and PH · 2 TAG No. 2 registers being selected in succession by the selector SEL for the two operation flows. These operation flows proceed fromphase 1 tophase 5 and are repeated until a finish of operation is detected. As in this case there is no change in the operation command and repetition is required, the next sequence of the operation flows f12 and f22 is a repetition of the earlier operation flows, with the exception that the cycle D for decoding and the cycle R for reading in the first phase, are omitted. Under the control of the selection controller SEL CONT, the selector SEL selects first the register PH · 2 TAG No. 1 for thephase 2 tag in the flow f12 and next the register PH - 2 TAG No. 2 as a tag for the second phase, in flow f22, both of the flow f12 and f22 being initiated from the cycle A for address calculation. - in the meantime, that is to say while the repetition of the previous operation flow is taking place, the next tag for the next different instruction (flow f3) is taken out and stored, using the PH - 1 TAG register of
phase 1 which is in a vacant state oncephase 2 of the flow f21 has commenced. The cycle D and the cycle R are repeated in theflow 3 until the last operation flow of the previous operation is detected. After the last operation flow of the previous operation has been detected, the operation is immediately switched to another operation flow, and the cycle A and subsequent cycles are carried out following the cycle D and the cycle R. If the end of the repetition is detected in the phase-2 (A, B1) of the flow f22, for example, the phase-2 of the next flow f3 is immediately started following the phase-2 of the flow f22. That is to say, the additional operation flow f2' required in the conventional operation of Figure 3, is eliminated. Consequently, the operation speed of the pipeline-type computer system can be prevented from being decreased. - The tags of phase-2 are selected by the selector SEL which is controlled by the selection controller SEL CONT. The above-mentioned selection can be effected by employing either a selection bit in the tags of phase-2 or a selection modification signal SS which is applied to the selection controller SEL CONT. Further, the number of tags in the phase-2 need not be limited to two, i.e., tag No. 1 and tag No. 2, but may be three or more.
Claims (3)
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP9623179A JPS5621242A (en) | 1979-07-28 | 1979-07-28 | Pipeline control method for computer operation |
JP96231/79 | 1979-07-28 |
Publications (3)
Publication Number | Publication Date |
---|---|
EP0032515A1 EP0032515A1 (en) | 1981-07-29 |
EP0032515A4 EP0032515A4 (en) | 1982-02-05 |
EP0032515B1 true EP0032515B1 (en) | 1984-05-09 |
Family
ID=14159446
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
EP80901417A Expired EP0032515B1 (en) | 1979-07-28 | 1980-07-25 | A method of pipeline control for a computer |
Country Status (7)
Country | Link |
---|---|
US (1) | US4794518A (en) |
EP (1) | EP0032515B1 (en) |
JP (1) | JPS5621242A (en) |
AU (1) | AU525682B2 (en) |
CA (1) | CA1166756A (en) |
DE (1) | DE3067752D1 (en) |
WO (1) | WO1981000474A1 (en) |
Families Citing this family (15)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4903196A (en) * | 1986-05-02 | 1990-02-20 | International Business Machines Corporation | Method and apparatus for guaranteeing the logical integrity of data in the general purpose registers of a complex multi-execution unit uniprocessor |
JPS6314275A (en) * | 1986-07-04 | 1988-01-21 | Nec Corp | Scalar data operating system of vector operating processor |
JP2902402B2 (en) * | 1987-09-30 | 1999-06-07 | 三菱電機株式会社 | Data processing device |
JPH0766324B2 (en) * | 1988-03-18 | 1995-07-19 | 三菱電機株式会社 | Data processing device |
US4875160A (en) * | 1988-07-20 | 1989-10-17 | Digital Equipment Corporation | Method for implementing synchronous pipeline exception recovery |
US5019967A (en) * | 1988-07-20 | 1991-05-28 | Digital Equipment Corporation | Pipeline bubble compression in a computer system |
JPH0719222B2 (en) * | 1989-03-30 | 1995-03-06 | 日本電気株式会社 | Store buffer |
US5226131A (en) * | 1989-12-27 | 1993-07-06 | The United States Of America As Represented By The United States Department Of Energy | Sequencing and fan-out mechanism for causing a set of at least two sequential instructions to be performed in a dataflow processing computer |
WO1991010954A1 (en) * | 1990-01-19 | 1991-07-25 | Alliant Computer Systems Corporation | A risc vectorization system |
US5197132A (en) * | 1990-06-29 | 1993-03-23 | Digital Equipment Corporation | Register mapping system having a log containing sequential listing of registers that were changed in preceding cycles for precise post-branch recovery |
JP2943464B2 (en) * | 1991-12-09 | 1999-08-30 | 松下電器産業株式会社 | Program control method and program control device |
US5694564A (en) * | 1993-01-04 | 1997-12-02 | Motorola, Inc. | Data processing system a method for performing register renaming having back-up capability |
DE10034869A1 (en) * | 2000-07-18 | 2002-02-07 | Siemens Ag | Method for automatically obtaining a functional sequence of processes and tools for this |
US20060090015A1 (en) * | 2004-10-26 | 2006-04-27 | Bradfield Travis A | Pipelined circuit for tag availability with multi-threaded direct memory access (DMA) activity |
US7454598B2 (en) * | 2005-05-16 | 2008-11-18 | Infineon Technologies Ag | Controlling out of order execution pipelines issue tagging |
Citations (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JPS5381032A (en) * | 1976-12-27 | 1978-07-18 | Fujitsu Ltd | Data process system |
Family Cites Families (19)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JPS5247976B2 (en) * | 1973-03-16 | 1977-12-06 | ||
GB1443777A (en) * | 1973-07-19 | 1976-07-28 | Int Computers Ltd | Data processing apparatus |
US3875391A (en) * | 1973-11-02 | 1975-04-01 | Raytheon Co | Pipeline signal processor |
US3978452A (en) * | 1974-02-28 | 1976-08-31 | Burroughs Corporation | System and method for concurrent and pipeline processing employing a data driven network |
US4025771A (en) * | 1974-03-25 | 1977-05-24 | Hughes Aircraft Company | Pipe line high speed signal processor |
DE2512270A1 (en) * | 1975-03-20 | 1976-09-23 | Siemens Ag | CONTROL UNIT OF A PROCESSOR OF A DATA PROCESSING SYSTEM CONTROLLED BY MICRO PROGRAMS AND PROCEDURE FOR ITS OPERATION |
US4118776A (en) * | 1975-07-17 | 1978-10-03 | Nippon Electric Company, Ltd. | Numerically controlled machine comprising a microprogrammable computer operable with microprograms for macroinstructions and for inherent functions of the machine |
GB1506972A (en) * | 1976-02-06 | 1978-04-12 | Int Computers Ltd | Data processing systems |
US4075704A (en) * | 1976-07-02 | 1978-02-21 | Floating Point Systems, Inc. | Floating point data processor for high speech operation |
GB1527289A (en) * | 1976-08-17 | 1978-10-04 | Int Computers Ltd | Data processing systems |
JPS6019017B2 (en) * | 1976-12-15 | 1985-05-14 | 富士通株式会社 | data processing system |
SE435429B (en) * | 1977-04-26 | 1984-09-24 | Ericsson Telefon Ab L M | DEVICE FOR OUTLINE INFORMATION FLOW BRANCHES TO BRANCH AN INCOMING "PIPELINE" FLOW OF INFORMATION |
JPS5466048A (en) * | 1977-11-07 | 1979-05-28 | Hitachi Ltd | Information processor |
US4228497A (en) * | 1977-11-17 | 1980-10-14 | Burroughs Corporation | Template micromemory structure for a pipelined microprogrammable data processing system |
JPS6024985B2 (en) * | 1978-08-31 | 1985-06-15 | 富士通株式会社 | Data processing method |
US4253147A (en) * | 1979-04-09 | 1981-02-24 | Rockwell International Corporation | Memory unit with pipelined cycle of operations |
US4310880A (en) * | 1979-09-10 | 1982-01-12 | Nixdorf Computer Corporation | High-speed synchronous computer using pipelined registers and a two-level fixed priority circuit |
JPS58129550A (en) * | 1982-01-27 | 1983-08-02 | Toshiba Corp | Arithmetic sequence device |
US4594655A (en) * | 1983-03-14 | 1986-06-10 | International Business Machines Corporation | (k)-Instructions-at-a-time pipelined processor for parallel execution of inherently sequential instructions |
-
1979
- 1979-07-28 JP JP9623179A patent/JPS5621242A/en active Granted
-
1980
- 1980-07-22 CA CA000356690A patent/CA1166756A/en not_active Expired
- 1980-07-25 AU AU61250/80A patent/AU525682B2/en not_active Expired
- 1980-07-25 DE DE8080901417T patent/DE3067752D1/en not_active Expired
- 1980-07-25 EP EP80901417A patent/EP0032515B1/en not_active Expired
- 1980-07-25 WO PCT/JP1980/000171 patent/WO1981000474A1/en active IP Right Grant
-
1985
- 1985-09-26 US US06/780,645 patent/US4794518A/en not_active Expired - Lifetime
Patent Citations (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JPS5381032A (en) * | 1976-12-27 | 1978-07-18 | Fujitsu Ltd | Data process system |
Non-Patent Citations (2)
Title |
---|
IBM TECHNICAL DISCLOSURE BULLETIN, vol. 14, no. 9, February 1972 New York US P.N. DUGGAN: "Multiple instruction stream microprocessor organisation" pages 2739-2740 * |
IEEE CONFERENCE PROCEEDINGS "The 14th annual symposium on Computer Architecture" March 1977 New York, US KOGGE: "The microprogramming of pipelined processors", pages 63-69 * |
Also Published As
Publication number | Publication date |
---|---|
AU525682B2 (en) | 1982-11-18 |
EP0032515A1 (en) | 1981-07-29 |
JPS5757740B2 (en) | 1982-12-06 |
AU6125080A (en) | 1981-03-03 |
US4794518A (en) | 1988-12-27 |
DE3067752D1 (en) | 1984-06-14 |
WO1981000474A1 (en) | 1981-02-19 |
CA1166756A (en) | 1984-05-01 |
JPS5621242A (en) | 1981-02-27 |
EP0032515A4 (en) | 1982-02-05 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
EP0032515B1 (en) | A method of pipeline control for a computer | |
US4740893A (en) | Method for reducing the time for switching between programs | |
US3983539A (en) | Polymorphic programmable units employing plural levels of sub-instruction sets | |
EP0155211B1 (en) | System for by-pass control in pipeline operation of computer | |
EP0205809B1 (en) | Vector processing | |
US4079451A (en) | Word, byte and bit indexed addressing in a data processing system | |
EP0045634B1 (en) | Programmable digital data processing apparatus arranged for the execution of instructions in overlap | |
US4118773A (en) | Microprogram memory bank addressing system | |
EP0124597B1 (en) | Multiple control stores in a pipelined microcontroller for handling jump and return subroutines | |
US4045782A (en) | Microprogrammed processor system having external memory | |
USRE32493E (en) | Data processing unit with pipelined operands | |
US5497496A (en) | Superscalar processor controlling fetching of instructions based upon number of empty instructions registers detected for each cycle | |
US4047247A (en) | Address formation in a microprogrammed data processing system | |
EP0094535B1 (en) | Pipe-line data processing system | |
EP0126125B1 (en) | Multiple control stores for a pipelined microcontroller | |
EP0093430A2 (en) | Pipeline data processing system | |
EP0126124B1 (en) | Multiple control stores in a pipelined microcontroller for handling nested subroutines | |
US4685058A (en) | Two-stage pipelined execution unit and control stores | |
EP0010196B1 (en) | Control circuit and process for digital storage devices | |
EP0164418B1 (en) | Microprogram control system | |
KR100374401B1 (en) | Hardware device for executing programmable instructions based upon micro-instructions | |
US3360779A (en) | Combined-order instructions for a data processor | |
US3226691A (en) | Data processing apparatus | |
EP0292188B1 (en) | Cache system | |
US4396981A (en) | Control store apparatus having dual mode operation handling mechanism |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PUAI | Public reference made under article 153(3) epc to a published international application that has entered the european phase |
Free format text: ORIGINAL CODE: 0009012 |
|
17P | Request for examination filed |
Effective date: 19810403 |
|
AK | Designated contracting states |
Designated state(s): DE FR GB |
|
GRAA | (expected) grant |
Free format text: ORIGINAL CODE: 0009210 |
|
AK | Designated contracting states |
Designated state(s): DE FR GB |
|
REF | Corresponds to: |
Ref document number: 3067752 Country of ref document: DE Date of ref document: 19840614 |
|
ET | Fr: translation filed | ||
PLBE | No opposition filed within time limit |
Free format text: ORIGINAL CODE: 0009261 |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT |
|
26N | No opposition filed | ||
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: FR Payment date: 19990709 Year of fee payment: 20 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: GB Payment date: 19990721 Year of fee payment: 20 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: DE Payment date: 19990723 Year of fee payment: 20 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: GB Free format text: LAPSE BECAUSE OF EXPIRATION OF PROTECTION Effective date: 20000724 |
|
REG | Reference to a national code |
Ref country code: GB Ref legal event code: PE20 Effective date: 20000724 |