JPH0255810B2 - - Google Patents

Info

Publication number
JPH0255810B2
JPH0255810B2 JP16627882A JP16627882A JPH0255810B2 JP H0255810 B2 JPH0255810 B2 JP H0255810B2 JP 16627882 A JP16627882 A JP 16627882A JP 16627882 A JP16627882 A JP 16627882A JP H0255810 B2 JPH0255810 B2 JP H0255810B2
Authority
JP
Japan
Prior art keywords
memory
instruction
memory access
memory bus
conflict determination
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
Application number
JP16627882A
Other languages
Japanese (ja)
Other versions
JPS5875260A (en
Inventor
Kazuo Furukawa
Fumio Hirai
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Hitachi Ltd
Original Assignee
Hitachi Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Hitachi Ltd filed Critical Hitachi Ltd
Priority to JP16627882A priority Critical patent/JPS5875260A/en
Publication of JPS5875260A publication Critical patent/JPS5875260A/en
Publication of JPH0255810B2 publication Critical patent/JPH0255810B2/ja
Granted legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F13/00Interconnection of, or transfer of information or other signals between, memories, input/output devices or central processing units
    • G06F13/14Handling requests for interconnection or transfer
    • G06F13/16Handling requests for interconnection or transfer for access to memory bus
    • G06F13/18Handling requests for interconnection or transfer for access to memory bus based on priority control

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Advance Control (AREA)
  • Bus Control (AREA)

Description

【発明の詳細な説明】 〔発明の利用分野〕 本発明は命令の先取りを行う処理装置を含む複
数の装置が、共通のメモリバスを使用する処理装
置系におけるメモリアクセス制御方式に関する。
DETAILED DESCRIPTION OF THE INVENTION [Field of Application of the Invention] The present invention relates to a memory access control system in a processing device system in which a plurality of devices including a processing device that prefetches instructions use a common memory bus.

〔従来技術〕[Prior art]

従来、情報処理装置において命令の先取りを行
う場合、現在実行中の命令の番地の次の番地の命
令を先取りしていた。しかしこの命令の先取りは
ジヤンプ系命令においてジヤンプが成立した場合
は無意味となるばかりでなく、メモリサイクルが
占有されてしまうためにジヤンプ先命令のアクセ
スがすぐ出来ず、メモリ待合せとなる欠点を有し
ている。すなわちジヤンプ成立の確率が高い命令
では命令先取りを行わない場合に比べて、かえつ
て命令実行時間が増加することがある。
Conventionally, when prefetching an instruction in an information processing device, the instruction at the address next to the address of the currently executing instruction is prefetched. However, prefetching this instruction is not only meaningless if a jump occurs in a jump type instruction, but also has the drawback that the instruction to which the jump is to be jumped cannot be accessed immediately because the memory cycle is occupied, resulting in memory waiting. are doing. That is, for an instruction with a high probability of a jump being established, the instruction execution time may actually increase compared to the case where instruction prefetching is not performed.

〔発明の目的〕[Purpose of the invention]

本発明の目的は上記した欠点をなくし、ジヤン
プ命令の実質的な実行時間を向上させるメモリア
クセス制御方式を提供することにある。
SUMMARY OF THE INVENTION An object of the present invention is to provide a memory access control method that eliminates the above-mentioned drawbacks and improves the substantial execution time of a jump instruction.

〔発明の概要〕[Summary of the invention]

一般に、複数の処理装置が一つのメモリバスを
共有する系においてはメモリバス競合回路が必要
である。このような系のメモリアクセスの機構
は、(1)次命令アドレスの決定、(2)アクセス要求信
号を競合判定回路へ送出、(3)メモリバスの競合判
定、(4)アクセス許可の場合はメモリアクセス信号
を送出、アクセス許可でない場合はアクセス許可
になるまで待合せ、アクセス許可になつた時点で
アクセス信号を送出、の4つに分けることができ
る。
Generally, a memory bus contention circuit is required in a system in which a plurality of processing units share one memory bus. The memory access mechanism of such a system consists of (1) determining the next instruction address, (2) sending an access request signal to the conflict determination circuit, (3) determining memory bus conflict, and (4) in case of access permission. It can be divided into four steps: sending a memory access signal, waiting until access is granted if access is not permitted, and sending an access signal when access is permitted.

系の構成が大規模化するのに伴い、メモリバス
の競合判定論理は複雑化し、アクセス要求を入力
としてアクセス許可を出力するまでの論理遅延時
間はますます大きくなり、この競合判定のために
1マシンサイクルを使用し、実際にメモリアクセ
スするのはその次のメモリアクセスサイクルとな
る場合がある。
As system configurations become larger, the memory bus conflict determination logic becomes more complex, and the logic delay time from inputting an access request to outputting an access permission becomes increasingly large. A machine cycle is used, and the actual memory access may occur in the next memory access cycle.

本発明は、このようなメモリバス競合判定回路
での論理遅延時間を利用し、該当装置のメモリ要
求がメモリバス競合判定回路で許可された条件下
で、命令の種別に応じてメモリアクセスサイクル
にアクセス信号の送出を停止することによつて、
命令先取りを禁止することができるようにしたも
のである。
The present invention makes use of the logic delay time in the memory bus conflict determination circuit, and executes memory access cycles according to the type of instruction under the condition that the memory request of the relevant device is permitted by the memory bus conflict determination circuit. By stopping the transmission of access signals,
This allows command preemption to be prohibited.

〔発明の実施例〕[Embodiments of the invention]

第1図は本発明の一実施例のブロツク図であ
る。図において、命令実行制御部1はメモリ要求
信号線2−1を介してメモリバス競合判定回路3
に接続されている。同様に、第1図では省略した
が他の命令実行制御部0,2もそれぞれメモリ要
求信号線2−0,2−2を介してメモリバス競合
判定回路3に接続されている。30−0,30−
1,30−2は各命令実行制御部のメモリ要求を
受付けるフリツプフロツプで、例えば命令実行制
御部1がメモリ要求信号線2−1を“1”とする
と(即ち、メモリ要求を発すると)、フリツプフ
ロツプ30−1がセツトされる。他のフリツプフ
ロツプ30−0,30−2についても同様であ
る。31,32,33はメモリ要求の競合判定を
行う論理ゲート群で、ここではメモリ要求信号線
2−0(フリツプフロツプ30−0)が最も優先
順位が高く、次はメモリ要求信号線2−1(フリ
ツプフロツプ30−1)で、メモリ要求信号線2
−2(フリツプフロツプ30−2は最低の優先順
位とした場合を示す。34はメモリ要求の許可を
示すフリツプフロツプで、フリツプフロツプ30
−0〜30−2のいずれか一つでもセツト状態を
とつてオアゲート33の出力が“1”となるとセ
ツトされるものである。このメモリバス競合判定
回路3におけるメモリ要求受付フリツプフロツプ
30−0〜30−2、競合判定論理ゲート群3
1,32,33、メモリ要求許可フリツプフロツ
プ34などの構成は従来と全く同じである。
FIG. 1 is a block diagram of one embodiment of the present invention. In the figure, an instruction execution control unit 1 is connected to a memory bus conflict determination circuit 3 via a memory request signal line 2-1.
It is connected to the. Similarly, although not shown in FIG. 1, other instruction execution control units 0 and 2 are also connected to the memory bus conflict determination circuit 3 via memory request signal lines 2-0 and 2-2, respectively. 30-0, 30-
1 and 30-2 are flip-flops that accept memory requests from each instruction execution control unit. For example, when the instruction execution control unit 1 sets the memory request signal line 2-1 to “1” (that is, issues a memory request), the flip-flop 30-1 is set. The same applies to the other flip-flops 30-0 and 30-2. Numerals 31, 32, and 33 are logic gate groups that perform memory request conflict determination. Here, the memory request signal line 2-0 (flip-flop 30-0) has the highest priority, followed by the memory request signal line 2-1 ( The flip-flop 30-1) connects the memory request signal line 2
-2 (Flip-flop 30-2 is given the lowest priority. 34 is a flip-flop indicating permission of memory request;
It is set when any one of -0 to 30-2 is set and the output of the OR gate 33 becomes "1". Memory request reception flip-flops 30-0 to 30-2 and conflict judgment logic gate group 3 in this memory bus conflict judgment circuit 3
1, 32, 33, memory request permission flip-flop 34, etc., are completely the same as in the prior art.

第1図の実施例では、このメモリバス競合判定
回路3の出力線(競合判定出力信号線)4をメモ
リアクセス禁止ゲート回路8の一方の入力とし、
該メモリアクセス禁止ゲート回路8の他方の入力
は、後述するメモリアクセス中止信号線7−1の
反転した信号とする。勿論、このメモリアクセス
禁止ゲート回路8はメモリバス競合判定回路3の
一部としてもよい。一方、命令実行制御部1の1
1は命令レジスタであり、12は命令の種類をデ
コードし、特定の命令のときにアンドゲート14
を介してメモリアクセス中止信号線7−1を
“1”とするデコーダである。13はメモリアク
セス許可信号遅延用フリツプフロツプで、当該命
令実行制御部1のメモリ要求が受付けられてメモ
リアクセス許可信号線5−1が“1”になるとセ
ツト状態をとるものであり、該フリツプフロツプ
13のセツト条件下で、上記デコーダ12が特定
の命令をデコードしたとき、アンドゲート14を
介してメモリアクセス中止信号線7−1が“1”
になるのである。ここで特定の命令とは、無条件
ジヤンプ命令、及びジヤンプ成立の確率の高い一
部の条件付ジヤンプ命令(例えばカウント・オ
ブ・ジヤンプ命令のように、或る数をカウンタに
セツトし、それが零になるまでは特定のアドレス
にジヤンプし、零になると次のアドレスへ進む命
令)などで、ジヤンプ成立の確率の高いことが或
る程度予測できる命令を対象とする。
In the embodiment shown in FIG. 1, the output line (conflict determination output signal line) 4 of the memory bus conflict determination circuit 3 is used as one input of the memory access prohibition gate circuit 8,
The other input of the memory access inhibit gate circuit 8 is an inverted signal of a memory access halt signal line 7-1, which will be described later. Of course, this memory access prohibition gate circuit 8 may be part of the memory bus conflict determination circuit 3. On the other hand, 1 of the instruction execution control unit 1
1 is an instruction register, 12 decodes the type of instruction, and when a specific instruction is issued, an AND gate 14 is
This is a decoder that sets the memory access stop signal line 7-1 to "1" through the decoder. Reference numeral 13 denotes a memory access permission signal delay flip-flop which takes a set state when a memory request from the instruction execution control section 1 is accepted and the memory access permission signal line 5-1 becomes "1". When the decoder 12 decodes a specific instruction under the set condition, the memory access stop signal line 7-1 becomes "1" via the AND gate 14.
It becomes. The specific instructions here include unconditional jump instructions and some conditional jump instructions with a high probability of a jump (for example, a count of jump instruction, which sets a certain number in a counter and The targets are instructions that can be predicted to have a high probability of jumping to a certain extent, such as instructions that jump to a specific address until the address reaches zero, and then proceed to the next address when the address reaches zero.

第2図は第1図の実施例の動作を説明するため
の命令実行のタイムチヤートである。図におい
て、Iは命令フエツチ、Xはアドレス修飾、Pは
オペランドフエツチ、Aは演算の各時間域であ
り、各命令は命令フエツチ分の時間差で次々に起
動されることを示している。TIはメモリバス競
合判定サイクルを示す。
FIG. 2 is a time chart of instruction execution for explaining the operation of the embodiment shown in FIG. In the figure, I is an instruction fetch, X is an address modification, P is an operand fetch, and A is an operation time area, indicating that each instruction is activated one after another with a time difference equal to the instruction fetch. T I indicates a memory bus conflict determination cycle.

今、第1図の命令実行制御部1から次命令(自
命令のアドレスの次のアドレスの命令)の命令フ
エツチのためのメモリ要求が信号線2−1を介し
てメモリバス競合判定回路3に出されたとする。
このメモリ要求はメモリバス判定サイクルTI
先頭において出される。命令実行制御部1からの
メモリ要求によりフリツプフロツプ30−1がセ
ツトされ、この時、フリツプフロツプ30−0が
セツトされていないと、該フリツプフロツプ30
−1の出力がゲート群31,32,33で選択さ
れ、メモリバス判定サイクルTIの終りでメモリ
要求許可フリツプフロツプ34がセツトされる。
フリツプフロツプ34のセツトにより競合判定出
力信号線4が“1”となる。この競合判定出力信
号線4はメモリ要求受付フリツプフロツプ30−
0,30−1,30−2の共通リセツト線を兼用
しており、今の場合、該信号線4が“1”となる
とフリツプフロツプ30−1はリセツト状態に復
旧する。又、アンドゲート31の出力線(メモリ
アクセス許可信号線)5−1を介して、メモリ要
求の許可されたことが命令実行制御部1へ返送さ
れ、これによつて命令実行制御部1はメモリ要求
信号線2−1を“0”にする。メモリバス競合判
定回路3の以上の動作は従来と全く同じである。
同時に、該命令実行制御部1のメモリ要求が許可
されたことにより、メモリアクセス許可信号遅延
用フリツプフロツプ13はセツト状態をとる。
Now, a memory request for fetching the next instruction (instruction at the address next to the address of the own instruction) is sent from the instruction execution control unit 1 in FIG. 1 to the memory bus conflict determination circuit 3 via the signal line 2-1. Suppose it is released.
This memory request is issued at the beginning of the memory bus determination cycle T I. The flip-flop 30-1 is set in response to a memory request from the instruction execution control unit 1, and if the flip-flop 30-0 is not set at this time, the flip-flop 30-1 is set.
The output of -1 is selected by the gate group 31, 32, 33, and the memory request grant flip-flop 34 is set at the end of the memory bus determination cycle TI .
By setting the flip-flop 34, the contention determination output signal line 4 becomes "1". This conflict determination output signal line 4 is connected to a memory request reception flip-flop 30-
In this case, when the signal line 4 becomes "1", the flip-flop 30-1 is restored to the reset state. Further, the fact that the memory request has been granted is sent back to the instruction execution control unit 1 via the output line (memory access permission signal line) 5-1 of the AND gate 31, and thereby the instruction execution control unit 1 accesses the memory. Set the request signal line 2-1 to "0". The above operation of the memory bus conflict determination circuit 3 is exactly the same as the conventional one.
At the same time, since the memory request of the instruction execution control section 1 is granted, the flip-flop 13 for delaying the memory access permission signal takes a set state.

上記次命令のメモリ競合判定サイクルTIとそ
の前の命令(自命令)の命令フエツチ時間域Iと
は重複しており、命令実行制御部1においては、
上記メモリバス競合判定回路3の動作と並行し
て、自命令の命令レジスタ11への設定及びその
デコードが行われる。そして、該自命令が無条件
ジヤンプ命令あるいは一部の条件付ジヤンプ命令
(ジヤンプ成立の確率の高い条件付ジヤンプ命令)
である場合は、当該命令実行制御部1のメモリ要
求が許可されているという条件の下でデコーダ1
2によりアンドゲート14を介してメモリアクセ
ス中止信号線7−1が“1”となる。このデコー
ドの確定より少し遅れてメモリバス判定サイクル
TIが終了するように回路設計しておく。従つて、
無条件ジヤンプ命令あるいは一部の条件付ジヤン
プ命令がデコーダ12でデコードされた場合、次
命令をフエツチすべくメモリバス競合判定回路3
が競合判定出力信号線4を“1”としても、すで
にメモリアクセス中止信号線7−1は“1”とな
つているため、メモリアクセス禁止ゲート回路8
の出力はオフとなり、当該命令実行制御部1に対
する次命令フエツチのためのメモリアクセスが禁
止される。又、メモリアクセス中止信号線7−1
はフリツプフロツプ30−1及びフリツプフロツ
プ34のリセツト端子と接続されており、メモリ
アクセス中止信号線7−1が“1”になると、先
のメモリ要求により設定されたメモリバス競合判
定回路3の内部状態がリセツトされる。なお、こ
の時、命令実行制御部1内のメモリアクセス許可
信号遅延用フリツプフロツプ13もリセツトする
ようにする。
The memory conflict determination cycle T I of the above-mentioned next instruction and the instruction fetch time domain I of the previous instruction (self-instruction) overlap, and in the instruction execution control unit 1,
In parallel with the operation of the memory bus conflict determination circuit 3, the own instruction is set in the instruction register 11 and decoded. Then, the self-instruction is an unconditional jump instruction or some conditional jump instruction (a conditional jump instruction with a high probability of a jump being established).
In this case, the decoder 1 executes the instruction execution control unit 1 under the condition that the memory request of the instruction execution control unit 1 is permitted.
2, the memory access stop signal line 7-1 becomes "1" via the AND gate 14. A little later than the confirmation of this decoding, a memory bus judgment cycle is executed.
Design the circuit so that T I ends. Therefore,
When an unconditional jump instruction or some conditional jump instructions are decoded by the decoder 12, the memory bus conflict determination circuit 3 is used to fetch the next instruction.
Even if the conflict determination output signal line 4 is set to "1", the memory access prohibition gate circuit 8 is already set to "1" since the memory access stop signal line 7-1 is
The output of is turned off, and memory access for fetching the next instruction to the instruction execution control unit 1 is prohibited. Also, memory access stop signal line 7-1
is connected to the reset terminals of flip-flop 30-1 and flip-flop 34, and when memory access stop signal line 7-1 becomes "1", the internal state of memory bus conflict determination circuit 3 set by the previous memory request is changed. It will be reset. At this time, the memory access permission signal delay flip-flop 13 in the instruction execution control section 1 is also reset.

一方、自命令の種類が通常の命令に該当すると
きは、メモリアクセス中止信号線7−1は“0”
であり、従つて、競合判定出力線4がアクセス許
可を示すべく“1”になると、メモリアクセス禁
止ゲート回路8の出力線6すなわちメモリアクセ
ス線も“1”となり、次命令フエツチのためのメ
モリアクセスが行われる。そして、メモリ要求許
可フリツプフロツプ34がリセツトする。
On the other hand, when the type of the own instruction corresponds to a normal instruction, the memory access stop signal line 7-1 is “0”.
Therefore, when the conflict determination output line 4 becomes "1" to indicate access permission, the output line 6 of the memory access prohibition gate circuit 8, that is, the memory access line also becomes "1", and the memory for fetching the next instruction is Access is made. The memory request grant flip-flop 34 is then reset.

なお、第1図では省略したが、必要に応じて他
のユニツトからもメモリアクセス中止信号線7−
1と同様の信号線がメモリバス競合判定回路3や
メモリアクセス禁止ゲート回路8に入力されるこ
とは云うまでもない。
Although omitted in FIG. 1, if necessary, the memory access stop signal line 7-- can also be sent from other units.
It goes without saying that the same signal line as 1 is input to the memory bus conflict determination circuit 3 and the memory access prohibition gate circuit 8.

〔発明の効果〕〔Effect of the invention〕

この発明によれば、以上説明したように、メモ
リバス競合判定終了後、命令の先取り制御を行う
情報処理装置が当該装置のメモリ要求が許可され
た条件下で出すアクセス禁止信号によりメモリバ
ス競合回路のリセツトとメモリアクセスの禁止の
機能を付加することによつて命令先取りを中止す
ることができるので、ジヤンプ成立の確率の高い
命令が多いプログラムにおいては大きな性能向上
が可能となる。
According to the present invention, as described above, after the memory bus conflict determination is completed, the information processing device that performs prefetch control of instructions issues an access prohibition signal under the condition that the memory request of the device is permitted, and the memory bus conflict circuit is activated. By adding the functions of resetting and inhibiting memory access, it is possible to stop instruction prefetching, so it is possible to greatly improve the performance of a program that includes many instructions with a high probability of jump establishment.

【図面の簡単な説明】[Brief explanation of the drawing]

第1図は本発明によるメモリアクセス制御方式
の一実施例のブロツク図、第2図は命令先取りの
タイムチヤートである。 1……命令実行制御部、2−0,2−1,2−
2……メモリ要求信号線、3……メモリバス競合
判定回路、4……競合判定出力信号線、6……メ
モリアクセス信号線、7−1……メモリアクセス
中止信号線、8……メモリアクセス禁止ゲート回
路。
FIG. 1 is a block diagram of an embodiment of the memory access control method according to the present invention, and FIG. 2 is a time chart of instruction prefetching. 1...Instruction execution control unit, 2-0, 2-1, 2-
2...Memory request signal line, 3...Memory bus conflict determination circuit, 4...Conflict determination output signal line, 6...Memory access signal line, 7-1...Memory access stop signal line, 8...Memory access Forbidden gate circuit.

Claims (1)

【特許請求の範囲】[Claims] 1 命令の先取り制御を行う情報処理装置を含む
複数の装置が共通のメモリバスを使用する処理装
置系において、前記複数の装置から発せられるメ
モリ要求の競合を判定し、いずれか一つのメモリ
要求を選択して当該装置にメモリアクセス許可信
号を通知するとともに、メモリアクセス信号を出
力するメモリバス競合判定回路を具備し、且つ、
前記命令の先取り制御を行う情報処理装置には、
前記メモリバス競合判定回路から当該装置のメモ
リ要求に対するメモリアクセス許可信号が通知さ
れた条件下で、前にフエツチされた命令が特定の
命令であることを判定してメモリアクセス中止信
号を発する手段を設け、前記メモリバス競合判定
回路側には、前記メモリアクセス中止信号が到来
すると前記メモリアクセス信号の出力を禁止する
手段を設け、前記命令の先取り制御を行う情報処
理装置に前記特定の命令がフエツチされた時、メ
モリバス競合判定の時間域で後続のメモリアクセ
スを禁止することを特徴とするメモリアクセス制
御方式。
1. In a processing device system in which a plurality of devices including an information processing device that performs prefetch control of instructions use a common memory bus, a conflict between memory requests issued by the plurality of devices is determined and one of the memory requests is a memory bus conflict determination circuit that selectively notifies the device of a memory access permission signal and outputs a memory access signal;
The information processing device that performs preemption control of the instructions includes:
means for determining that a previously fetched instruction is a specific instruction and issuing a memory access stop signal under the condition that the memory bus conflict determination circuit notifies the memory access permission signal in response to a memory request of the device; and the memory bus conflict determination circuit side is provided with means for inhibiting the output of the memory access signal when the memory access stop signal arrives, and the specific instruction is fetched by the information processing device that performs prefetch control of the instruction. 1. A memory access control method characterized in that, when a memory bus conflict is determined, subsequent memory access is prohibited in the time range of memory bus conflict determination.
JP16627882A 1982-09-24 1982-09-24 Memory access controlling system Granted JPS5875260A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP16627882A JPS5875260A (en) 1982-09-24 1982-09-24 Memory access controlling system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP16627882A JPS5875260A (en) 1982-09-24 1982-09-24 Memory access controlling system

Publications (2)

Publication Number Publication Date
JPS5875260A JPS5875260A (en) 1983-05-06
JPH0255810B2 true JPH0255810B2 (en) 1990-11-28

Family

ID=15828409

Family Applications (1)

Application Number Title Priority Date Filing Date
JP16627882A Granted JPS5875260A (en) 1982-09-24 1982-09-24 Memory access controlling system

Country Status (1)

Country Link
JP (1) JPS5875260A (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4742451A (en) * 1984-05-21 1988-05-03 Digital Equipment Corporation Instruction prefetch system for conditional branch instruction for central processor unit

Also Published As

Publication number Publication date
JPS5875260A (en) 1983-05-06

Similar Documents

Publication Publication Date Title
JP3242508B2 (en) Microcomputer
KR20020069186A (en) Prioritized bus request scheduling mechanism for processing devices
KR19990044957A (en) Methods and apparatus that affect the processing of subsequent instructions in a data processor
KR930018378A (en) Method and device for performance optimization of cache memory system
US20230185576A1 (en) User mode event handling
WO1996027833A1 (en) Information processor
KR930003444B1 (en) Priority controller with memory reference
US6738837B1 (en) Digital system with split transaction memory access
US5615375A (en) Interrupt control circuit
US5455918A (en) Data transfer accelerating apparatus and method
JPH0255810B2 (en)
US6738867B1 (en) Disk array system reading ahead operand databackground of the invention
CA1208798A (en) Timing control system in data processor
JPH02287828A (en) Prefetch control system
JPH02211534A (en) Parallel processor
KR920001102B1 (en) Data processing unit
JP2000181711A (en) System for canceling instruction fetching
JP3102399B2 (en) Data processing apparatus and method
US7124281B1 (en) Processing system having sequential address indicator signals
KR870000117B1 (en) Access control processing method
JPS61118840A (en) Control system of electronic computer
CN116088942A (en) Instruction execution method, device, chip and computer equipment
JP2636074B2 (en) Microprocessor
KR950004227B1 (en) Information processing system
JP2772982B2 (en) 2-byte instruction injection circuit