GB2247758A - Controlling indivisible operation in parallel processing system - Google Patents
Controlling indivisible operation in parallel processing system Download PDFInfo
- Publication number
- GB2247758A GB2247758A GB9118335A GB9118335A GB2247758A GB 2247758 A GB2247758 A GB 2247758A GB 9118335 A GB9118335 A GB 9118335A GB 9118335 A GB9118335 A GB 9118335A GB 2247758 A GB2247758 A GB 2247758A
- Authority
- GB
- United Kingdom
- Prior art keywords
- indivisible operation
- indivisible
- processor
- instruction
- control information
- 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.)
- Withdrawn
Links
- 238000000034 method Methods 0.000 claims description 8
- 238000010586 diagram Methods 0.000 description 4
- 238000007796 conventional method Methods 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
- 230000002401 inhibitory effect Effects 0.000 description 1
- 230000002035 prolonged effect Effects 0.000 description 1
- 230000004044 response Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F15/00—Digital computers in general; Data processing equipment in general
- G06F15/16—Combinations of two or more digital computers each having at least an arithmetic unit, a program unit and a register, e.g. for a simultaneous processing of several programs
- G06F15/163—Interprocessor communication
- G06F15/167—Interprocessor communication using a common memory, e.g. mailbox
-
- 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/30003—Arrangements for executing specific machine instructions
- G06F9/3004—Arrangements for executing specific machine instructions to perform operations on memory
-
- 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/30003—Arrangements for executing specific machine instructions
- G06F9/30076—Arrangements for executing specific machine instructions to perform miscellaneous control operations, e.g. NOP
- G06F9/30087—Synchronisation or serialisation instructions
-
- 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/3824—Operand accessing
- G06F9/3834—Maintaining memory consistency
-
- 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/3877—Concurrent instruction execution, e.g. pipeline or look ahead using a slave processor, e.g. coprocessor
- G06F9/3879—Concurrent instruction execution, e.g. pipeline or look ahead using a slave processor, e.g. coprocessor for non-native instruction execution, e.g. executing a command; for Java instruction set
-
- 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/46—Multiprogramming arrangements
- G06F9/52—Program synchronisation; Mutual exclusion, e.g. by means of semaphores
- G06F9/526—Mutual exclusion algorithms
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2209/00—Indexing scheme relating to G06F9/00
- G06F2209/52—Indexing scheme relating to G06F9/52
- G06F2209/521—Atomic
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computer Hardware Design (AREA)
- Executing Machine-Instructions (AREA)
- Multi Processors (AREA)
- Advance Control (AREA)
Abstract
In a parallel processing system having a plurality of processors 1 (2, Fig 1), when an instruction word read out from a shared memory 3 and having control bits a, b associated with an indivisible operation is received by an instruction decoder 11, the control bits are supplied to an 3 indivisible-operation control circuit 7. If the control bits have values representing execution of the indivisible operation, the circuit 7 controls the indivisible operation via a sequencer 12 in accordance with the set/reset state of a flip-flop 13, which represents whether execution of the indivisible operation is assured. and with the level state of an indivisible-operation control line 9 to which all the processors are coupled. The indivisible operation is used to inhibit execution of asynchronous processing caused by an interrupt while a program is running. <IMAGE>
Description
"METHOD AND APPARATUS FOR CONTROLLING
INDIVISIBLE OPERATION IN PARALLEL PROCESSING
SYSTEM"
The present invention relates to a method and apparatus for controlling an indivisible operation in a parallel processing system.
In a parallel processing system, for example, a shared resource such as an input/output unit or a memory is often subjected to simultaneous access in a plurality of tasks. In order to prevent confusion caused by this simultaneous access, an indivisible operation for inhibiting execution of asynchronous processing caused by an interruption while a predetermined program is running, is used.
In order to realize the above indivisible operation, the following conventional methods are used.
1) An indivisible operation instruction required in a program to be executed is installed in each processor. A processor subjected to the indivisible operation must have a WCS (Writable Control Storage) or the like.
2) The processor occupies a shared memory bus prior to execution of the indivisible operation and frees the shared memory bus after the indivisible operation is completed. A program for executing this indivisible operation generally runs in a privileged mode.
3) A monitor loop using a semaphore operation instruction or the like is formed by software, and exclusive control is performed. As compared with a time required to perform desired processing, a time for executing software processing for an indivisible operation is often prolonged dependent on an indivisible operation.
Strong demand has arisen.for providing a parallel processing system for executing parallel processing including an indivisible operation which is free from limitations in an operation mode and a processor subjected to an indivisible operation and which can reduce the overhead.
It is an object of the present invention to provide a method and apparatus for controlling an indivisible operation in a parallel processing system.
According to one aspect of the present invention, there is provided a parallel processing system comprising: a plurality of processors; memory means for storing a plurality of instruction words, each having control information for an indivisible operation; and a bus for connecting the memory means to the plurality of processors, and wherein each of the processors includes: means for reading out the instruction word from the memory means though the bus, and obtaining the control information from the read out instruction word; first determination means for determining whether or not the indivisible operation is being performed in the processor itself; second determination means for determining whether or not the indivisible operation is being performed in another processor without the processor; and means for controlling the indivisible operation in accordance with the obtained control information and results determined by the first and second determination means.
According to another aspect of the present invention, there is provided a method for controlling an indivisible operation in a parallel processing system having a plurality of processors, the method comprising the steps of: receiving an instruction word having at least one of control information for designating execution of instruction in an indivisible operation and control information for designating an end of the execution of the instruction in the indivisible operation; obtaining control information from the received instruction word: determining whether or not a desired processor executes the indivisible operation when the obtained control information is control information for designating the execution of the instruction in the indivisible operation; determining whether or not the indivisible operation is being performed in another processor without the desired processor when the desired processor does not execute the indivisible operation; and executing the indivisible operation in the desired processor when the indivisible operation is not performed in another processor.
This invention can be more fully understood from the following detailed description when taken in conjunction with the accompanying drawings, in which:
Fig. 1 is a block diagram showing a schematic arrangement of a parallel processing system according to an embodiment of the present invention;
Fig. 2 shows a format of the content of an instruction word used in parallel processing including an indivisible operation;
Fig. 3 is a block diagram showing the main part of a processor in the parallel processing system shown in
Fig. 1; and
Fig. 4 is a flow chart for explaining operations of an indivisible operation control circuit in the processor in the parallel processing system shown in Fig. 1.
A preferred embodiment of the present invention will be described with reference to the accompanying drawings.
Fig. 1 is a block diagram showing an arrangement of a parallel processing system according to an embodiment of the present invention. Referring to Fig. 1, the parallel processing system comprises processors 1 and 2, a shared memory 3, a shared memory bus 6, and an indivisible operation control line 9.
The shared memory 3 stores an instruction word (to be described later) as a parallel processing program or the like shared by the processors 1 and 2.
The processors 1 and 2 comprise shared memory bus control circuits 4 and 5 and indivisible operation control circuits 7 and 8, respectively. The shared memory bus control circuits 4 and 5 perform occupying/release control of the shared memory bus 6 to access the shared memory 3. The indivisible operation control circuits 7 and 8 control indivisible operations in the processors 1 and 2.
The shared memory bus 6 is used to connect the shared memory 3 to the shared memory bus control circuits 4 and 5.
The indivisible operation control line 9 is set at high level when at least one of the processors 1 and 2 performs an indivisible operation. Otherwise, i.e., when the indivisible operation is not executed, the indivisible operation control line 9 is set at low level.
Fig. 2 shows a format of the content of the instruction word used in parallel processing including an indivisible operation. Referring to Fig. 2, the instruction word is constituted by a first control bit field A, a second control bit field B, an instruction code field C, and an operand field D. A first control bit a for designating instruction execution in the indivisible operation is included in the first bit field A.
A second control bit b for designating the end of the indivisible operation upon execution of the instruction is included in the second control bit field B. An instruction code c representing an arithmetic operation to be executed is included in the instruction code field
C. An operand d representing an object subjected to the arithmetic operation is included in the operand field D.
In this embodiment, information bits associated with an indivisible operation, i.e., the first and second control bits are included in each instruction word. The indivisible operation is performed in accordance with these control bits. Each control bit is set at "0" or "1". When the first control bit is set at logic "1", it indicates that an indivisible operation is performed. When the second control bit is set at logic "1", it indicates that the indivisible operation is completed.
Fig. 3 is a block diagram showing the main part of the processor 1 in the parallel processing system shown in Fig. 1. Referring to Fig. 3, the processor 1 comprises a shared memory bus control circuit 4, an indivisible operation control circuit 7, an instruction decoder 11, a sequencer 12, and a flip-flop (FF) 13.
The shared memory bus control circuit 4 outputs an instruction word read out from the share memory 3 to the instruction decoder 11.
The instruction decoder 11 selects the content of the first control bit field A and the content of the second control bit field B, i.e., the first and second control bits a and b from the instruction word output from the shared memory bus control circuit 4 and outputs the first and second control bits a and b to the indivisible operation control circuit 7. The instruction decoder 11 also selects the content of the instruction code field C and the content of the operand field D, i.e., the instruction code c and the operand d from the instruction word output from the shared memory bus control circuit 4 and outputs the instruction code c and the operand d to the sequencer 12.
The flip-flop (FF) 13 indicates the state of the current indivisible operation in the processor 1. That is, when an instruction in the indivisible operation is executed by the processor 1, the flip-flop 13 is in a set state. Otherwise, the flip-flop 13 is in a reset state.
The indivisible operation control circuit 7 controls the indivisible operation of the processor 1 on the basis of the values of the first and second control bits a and b from the instruction decoder 11, the set/reset state of the flip-flop 13, and the level status (low level/high level) of the indivisible operation control line 9.
The processor 2 shown in Fig. 1 has the same arrangement as that of the processor 1 and is not illustrated in Fig. 3.
An operation of the parallel processing system having the processor with the arrangement described above will be described below.
When a predetermined instruction word is read out from the shared memory 3 and is input to the instruction decoder 11 in the processor 1, the instruction decoder 11 outputs the first and second control bits a and b included in the input instruction word to the indivisible operation control circuit 7. At the same time, the instruction decoder 11 outputs the instruction code c and the operand d included in this input instruction word to the sequencer 12. The sequencer 12 generates a control signal g on the basis of the instruction code c and the operand d in accordance with an operation stop signal e from the indivisible operation control circuit 7. A predetermined instruction is executed by this control signal g. Note that the operation stop signal e is used to stop the operation of the sequencer 12.
The indivisible operation control circuit 7 controls the indivisible operation of the processor 1 in accordance with a flow chart of Fig. 4 on the basis of the value of the first control bit a, the value of the second control bit b, the set/reset state of the flipflop 13, and the level state of the indivisible operation control line 9.
It is determined in step S1 whether the first control bit a and the second control bit b are received from the instruction decoder 11. If YES in step Sl, i.e., if the first and second control bits a and b are received, it is determined in step S2 whether the first control bit a is set at logic "1". That is, it is determined in step S2 whether an indivisible operation is performed.
If it is determined in step S2 that the first control bit a is not logic "1", that is, if the first control bit a is logic "0", an instruction is executed while the corresponding indivisible operation is not performed. It is then determined in step S1 whether the next instruction word is received.
If it is determined in step S2 that, however, the first control bit a is logic "1", it is determined that the indivisible operation is performed. It is then determined in step S3 whether the second control bit b is set at logic "1". That is, it is determined in step S3 whether the indivisible operation is ended.
If it is determined in step S3 that the second control bit b is not logic la, that is, if the second control bit b is set at logic "0", it is determined that the indivisible operation is not ended. It is then determined in step S4 whether the flip-flop 13 is reset.
If it is determined in step S4 that the flip-flop 13 is reset, it is determined that execution of the indivisible operation must be assured. It is determined in step S5 whether the indivisible operation control line 9 is set at low level.
If it is determined in step S5 that the indivisible operation control line 9 is set at low level, it is determined that an indivisible operation is not performed in other processors, e.g., the processor 2. The indivisible operation control line 9 is set at high level (step S6), and the flip-flop 13 is set (step S7).
Thus, instruction execution in an indivisible operation is enabled in the processor 1. On the other hand, instruction execution in indivisible operations is inhibited in other processors.
In step S8, an input of the operation stop signal e to the sequencer 12 is stopped. The control signal g is generated by the sequencer 12, and instruction execution in the indivisible operation is started.
On the other hand, if it is determined in step S4 that the flip-flop 13 is not reset, i.e., the flip-flop 13 is set, execution of the indivisible operation in the processor 1 is determined to be already assured. The operations in steps S6 and S7 are not performed, and the input of the operation stop signal e to the sequencer 12 is stopped (step S8). Therefore, as described above, the control signal g is generated by the sequencer 12, thereby starting instruction execution in the indivisible operation.
If it is determined in step S5 that the indivisible operation control line 9 is not set at low level, i.e., if the indivisible operation control line 9 is set at high level, it is determined that indivisible operation is performed in another processor. In this case, the operation stop signal e is input to the sequencer 12 (step S9). Therefore, the control signal g is not generated by the sequencer 12, and instruction execution in the indivisible operation is inhibited in the processor 1.
More specifically, since the value of the received first control bit a indicates that an indivisible operation is performed, the indivisible operation must be performed in the processor 1. However, since the indivisible operation control line 9 is set at high level, it is determined that instructions in the indivisible operation are executed in an other processor.
Therefore, until instruction execution in the indivisible operation in the other processor is completed, instruction execution in the indivisible operation is inhibited in the processor 1.
It is determined in step S10 whether an external interruption signal h is input to the indivisible operation control circuit 7 while instruction execution in the indivisible operation is kept inhibited in the processor 1. If it is determined in step S10 that the external interruption signal h is input, the input of the operation stop signal e to the sequencer 12 is stopped (step Sill). Therefore, the instruction execution inhibit state of the processor 1 is released.
In addition, an interruption enable signal f is input to the sequencer 12 (step S12). At this time, the instruction is executed by the control signal g generated on the basis of the instruction code c and the operand d in the sequencer 12, and then interruption processing is performed.
When this interruption processing is completed, it is determined again in step S5 whether the indivisible operation control line 9 is set at a low level. More specifically, the level state of the indivisible operation control line 9 is monitored. The processor 1 is set in a wait state of instruction execution in the indivisible operation until the indivisible operation control line 9 is set at the low level.
If it is determined in step S3 that the second control bit b is set at logic "1", it is determined that the indivisible operation is ended after instruction execution by the instruction word including this second control bit b is performed. After the instruction is executed, the indivisible operation control line 9 is set at the low level (step S13), and the flip-flop 13 is reset (step S14). It is defined by a software that the first control bit a is set to be at logic "1" when the second control bit b is set at logic "l".
It is determined in step 515 whether the external interruption signal h is input to the indivisible operation control circuit 7. If YES in step Sol5, the interruption enable signal f is input to the sequencer 12 to perform interruption processing (step Sol6).
When the external interruption signal h is input while the instruction in the indivisible operation is being executed in the processor 1, the interruption enable signal f for performing interruption processing is not input to the sequencer 12 until the instruction of the instruction word having the second control bit b of logic "1" is executed, the indivisible.operation control line 9 is set at a low level (step S13), and the flipflop 13 is reset (step S14).
In this manner, control of the indivisible operation in the processor 1 is performed. Note that control of an indivisible operation in the processor 2 can be performed as in the processor 1.
As has been described above, according to the parallel processing system of this embodiment, the indivisible operation control circuit independent from the shared memory bus control circuit for controlling the shared memory bus is arranged in each processor. The information bits associated with an indivisible operation, i.e., the first and second control bits are included in each instruction word. As is apparent from the flow chart (Fig. 4), every time each instruction word is read out from the shared memory, the values of the first and second control bits are determined The indivisible operation is controlled on the basis of these values. When an instruction which does not require an indivisible operation is to be executed, the shared memory is not occupied, and an indivisible operation can be performed by another processor. Therefore, parallel processing including an indivisible operation, which is free from limitations in an operation mode and a processor subjected to an indivisible operation can be performed with a reduced overhead.
The above embodiment exemplifies control of indivisible operations in two processors. However, the present invention is not limited to operations in two processors. The number of processors can be three or more in control of an indivisible operation.
The number of shared resources is not limited to one. An indivisible operation can be performed in a plurality of resources. In this case, the number of indivisible operation control lines is set in accordance with the number of resources, and in response to this, a plurality of indivisible operation control circuits must be arranged in each processor.
Claims (13)
1. A parallel processing system comprising:
a plurality of processors;
memory means for storing a plurality of instruction words, each having control information for an indivisible operation; and
a bus for connecting the memory means to the plurality of processors, and
wherein each of the processors includes:
means for reading out the instruction word from the memory means though the bus, and obtaining the control information from the read out instruction word;
first determination means for determining whether or not the indivisible operation is being performed in the processor itself;
second determination means for determining whether or not the indivisible operation is being performed in an another processor without the processor; and
means for controlling the indivisible operation in accordance with the obtained control information and results determined by the first and second determination means.
2. The system according to claim 1, wherein the control information includes at least one control bit for designating execution of an instruction in an indivisible operation and a control bit for designating an end of the execution of the instruction in the indivisible operation.
3. The system according to claim 1, wherein the first determination means has a flip-flop, and determines whether or not the indivisible operation is being performed in the processor itself in accordance with a set/reset state of the flip-flop.
4. The system according to claim 1, wherein the second determination means has an indivisible operation control line, and determines whether or not the indivisible operation is being performed in the another processor in accordance with a level state of the indivisible operation control line.
5. The system according to claim 1, wherein when the indivisible operation is not performed in the processor, it is determined that whether or not the indivisible operation is being performed in another processor without the processor.
6. The system according to claim 5, wherein when the indivisible operation is not performed in another processor, the processor executes the indivisible operation.
7. The system according to claim 1, wherein the processor further comprises means for freeing and reserving the memory means.
8. A parallel processing system comprising:
a plurality of processors;
memory means for storing a plurality of instruction words, each having at least one of control information for designating execution of an instruction in an indivisible operation and control information for designating an end of the execution of an instruction in an indivisible operation;
a bus for connecting the memory means to the plurality of processors, and
wherein each of the processors includes:
means for reading out the instruction word from the memory means though the bus, and obtaining the control information from the read out instruction word;
means for determining whether or not the indivisible operation is being performed in the processor itself;
means for determining whether or not the indivisible operation is being performed in another processor without the processor; and
means for controlling the indivisible operation in accordance with the obtained control information and determination results.
9. The system according to claim 8, wherein when the indivisible operation is not performed in the processor, it is determined that whether or not the indivisible operation is being performed in another processor without the processor.
10. The system according to claim 9, wherein when the indivisible operation is not performed in another operation, the processor executes the indivisible operation.
11. A method for controlling an indivisible operation in a parallel processing system having a plurality of processors, the method comprising the steps of:
receiving an instruction word having at least one of control information for designating execution of instruction in an indivisible operation and control information for designating an end of the execution of the instruction in the indivisible operation;
obtaining control information from the received instruction word:
determining whether or not a desired processor executes the indivisible operation when the obtained control information is control information for designating the execution of the instruction in the indivisible operation;
determining whether or not the indivisible operation is being performed in another processor without the desired processor when the desired processor does not execute the indivisible operation; and
executing the indivisible operation in the desired processor when the indivisible operation is not performed in another processor.
12. A method for controlling an indivisible operation in a parallel processing system, substantially as hereinbefore described with reference to the accompanying drawings.
13. An apparatus for controlling an indivisible operation in a parallel processing system, substantially as hereinbefore described with reference to the accompanying drawings.
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP22566590A JPH04106653A (en) | 1990-08-28 | 1990-08-28 | Parallel processing system |
Publications (2)
Publication Number | Publication Date |
---|---|
GB9118335D0 GB9118335D0 (en) | 1991-10-09 |
GB2247758A true GB2247758A (en) | 1992-03-11 |
Family
ID=16832863
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
GB9118335A Withdrawn GB2247758A (en) | 1990-08-28 | 1991-08-27 | Controlling indivisible operation in parallel processing system |
Country Status (2)
Country | Link |
---|---|
JP (1) | JPH04106653A (en) |
GB (1) | GB2247758A (en) |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6029222A (en) * | 1996-01-17 | 2000-02-22 | Yamaha Corporation | Method and processor for selectively marking instructions as interruptible or uninterruptible and judging interrupt requests based on the marked instruction |
WO2001069378A2 (en) * | 2000-03-10 | 2001-09-20 | Arc International Plc | Method and apparatus for enhancing the performance of a pipelined data processor |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP0086601A2 (en) * | 1982-02-16 | 1983-08-24 | Kabushiki Kaisha Toshiba | Multiprocessor system having mutual exclusion control function |
GB2216306A (en) * | 1988-02-29 | 1989-10-04 | Ardent Computer Corp | Load and synchronize computer architecture and process |
-
1990
- 1990-08-28 JP JP22566590A patent/JPH04106653A/en active Pending
-
1991
- 1991-08-27 GB GB9118335A patent/GB2247758A/en not_active Withdrawn
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP0086601A2 (en) * | 1982-02-16 | 1983-08-24 | Kabushiki Kaisha Toshiba | Multiprocessor system having mutual exclusion control function |
GB2216306A (en) * | 1988-02-29 | 1989-10-04 | Ardent Computer Corp | Load and synchronize computer architecture and process |
Cited By (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6029222A (en) * | 1996-01-17 | 2000-02-22 | Yamaha Corporation | Method and processor for selectively marking instructions as interruptible or uninterruptible and judging interrupt requests based on the marked instruction |
WO2001069378A2 (en) * | 2000-03-10 | 2001-09-20 | Arc International Plc | Method and apparatus for enhancing the performance of a pipelined data processor |
WO2001069378A3 (en) * | 2000-03-10 | 2002-07-25 | Arc Internat Plc | Method and apparatus for enhancing the performance of a pipelined data processor |
Also Published As
Publication number | Publication date |
---|---|
JPH04106653A (en) | 1992-04-08 |
GB9118335D0 (en) | 1991-10-09 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
EP0086601B1 (en) | Multiprocessor system having mutual exclusion control function | |
US4654785A (en) | Information processing system | |
US4274138A (en) | Stored program control system with switching between instruction word systems | |
EP0172522B1 (en) | Data processing machine suitable for high-speed processing | |
US5459682A (en) | Microcomputer with plural registers and function for selecting them | |
US4961161A (en) | Arithmetic processor performing mask and trap operations for exceptions | |
US4517643A (en) | Interrupt control apparatus for a data processing system | |
US5684728A (en) | Data processing system having a saturation arithmetic operation function | |
AU603876B2 (en) | Multiple i/o bus virtual broadcast of programmed i/o instructions | |
US4807185A (en) | Stack pointer control circuit | |
US4298933A (en) | Data-processing device including means to suppress the execution of unnecessary instructions | |
US4550369A (en) | Apparatus and method for processing macroinstructions and microinstructions | |
EP0257655B1 (en) | Multitask processing apparatus | |
EP0140299B1 (en) | Vector mask control system | |
EP0107952A2 (en) | Information processing apparatus and its instruction control system | |
GB2247758A (en) | Controlling indivisible operation in parallel processing system | |
US5872961A (en) | Microcomputer allowing external monitoring of internal resources | |
JP2003058381A (en) | Processor realizing exception processing setting by program | |
US4816992A (en) | Method of operating a data processing system in response to an interrupt | |
JPH0414376B2 (en) | ||
KR19980058221A (en) | Processor with pipeline stop circuit | |
JPH044630B2 (en) | ||
US4285036A (en) | Data processing device using a subroutine call instruction | |
JPH0233173B2 (en) | ||
JPS623345A (en) | Interruption system |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
WAP | Application withdrawn, taken to be withdrawn or refused ** after publication under section 16(1) |