JPS5831457A - Data processor - Google Patents
Data processorInfo
- Publication number
- JPS5831457A JPS5831457A JP56129105A JP12910581A JPS5831457A JP S5831457 A JPS5831457 A JP S5831457A JP 56129105 A JP56129105 A JP 56129105A JP 12910581 A JP12910581 A JP 12910581A JP S5831457 A JPS5831457 A JP S5831457A
- Authority
- JP
- Japan
- Prior art keywords
- shift
- logic
- flop
- flip
- data
- 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.)
- Granted
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
- G06F11/0703—Error or fault processing not based on redundancy, i.e. by taking additional measures to deal with the error or fault not making use of redundancy in operation, in hardware, or in data representation
- G06F11/0751—Error or fault detection not based on redundancy
- G06F11/0754—Error or fault detection not based on redundancy by exceeding limits
- G06F11/076—Error or fault detection not based on redundancy by exceeding limits by exceeding a count or rate limit, e.g. word- or bit count limit
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Quality & Reliability (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Test And Diagnosis Of Digital Computers (AREA)
Abstract
Description
【発明の詳細な説明】
本尭明は、シフトパスを持つデータ処濁装雪に関し、特
に、シフトパスのデエッタに関するものである。DETAILED DESCRIPTION OF THE INVENTION The present invention relates to a data processor having a shift path, and in particular to a shift path data processor.
従来のシフ)パスを持つ装置に於て、シフトパスを利用
してシフトパスに接続畜れているフリップフ璽ツブ(レ
ジスタを含む)の内容な表示威−社摘出して記憶する方
式がよく採られてhた。In devices with a conventional shift path, a method is often adopted in which the contents of the flip-flops (including registers) connected to the shift path are extracted and stored using the shift path. It was.
しかしながら1ジツトパスを利用した鳩舎に、シフトパ
ス中の7リツプ7−ツブ等に故障が参ると、故障の7リ
ツブ7aツブ以降&−接IIR畜れた7リツプフ田ツブ
の内容がすべて論m@o”Cなりた1%論論理1”にな
ったりする虞れがあった。However, if a failure occurs in the 7th lip, 7th knob, etc. in the shift pass in a pigeon house using the 1st path, the contents of the 7th lip, 7a knob, etc. of the failed 7th lip and the 7th lip that were damaged after the failure will be disputed. There was a risk that it would turn out to be ``C, 1% theory, logic 1.''
以鎗紘これに対し、シフトパス&:R知のデータを違し
璽してシアトアウ)されるデータと比較す1事によって
、シフトパスの故障を判断して−た。On the other hand, by comparing the data of the shift pass &: R knowledge with the data generated by the shift pass, it was determined that the shift pass was malfunctioning.
しかしながら、との方式であると、シフトパス中に多量
な79ツブ7117ブが存在する場合h−は、シフト間
数が多くなるために時間がかかる欠点があった。mち、
シフ)パスのループを1巡するだけで韓辿中に故障があ
るか蕾かの判断がa1乗な一矢点があった0、 ・
本*@11従来の上記欠点を除去する為&:な1れたも
のであ9%従って本発明の目的社、ループを廖威するシ
フ)パス内に論理照会用アリツブフロップを挿入し、シ
フ )jxclll畜れたシフトパスチェツタ−路によ
タ論m*合用フリップ7wツブかもシフトアウトされた
データと予めシフト固数C対応した論、ms舎用データ
と比較する事によって、ジアドパス及びシフトパスに會
thiフvップフーツプa欽障を容易&:尭見する事、
及び最初の論mjl舎用7リツブ70ツブのり7トイン
入力にシフトパスチェック[11t−接続することによ
、l 、y y )パスを1巡させる事で故障がな一場
舎&:は各7リツブフロツブの状態が元の内?!c4ど
ろようにした新規なデータ4611装置を提供すること
にある。However, this method has the drawback that when a large number of 79 and 7117 blocks are present in the shift path, the number of shifts between shifts becomes large and it takes a long time. mchi,
Schiff) There was a point where it was possible to judge whether there was a failure or a bud by just going around the loop of the path once. Therefore, the objective of the present invention is to insert a logical query Artub flop in the shift path to change the loop, and to create a shift path in the shift path. * By comparing the shifted out data with the data for MS, which corresponds to the shift fixed number C in advance, it is easy to see if there is a problem with the diad path and shift path. case,
And the shift path check for the first argument mjlsha 7ritsu 70tsubu glue 7toin input [11t- By connecting, l, y y) There is no failure by making the path go around once. Ichibasha &: are each 7 Ritubu Is the condition of the tubing within its original state? ! The purpose of this invention is to provide a new data 4611 device based on C4.
本発明の上記目的は、シフトモード信号を受けると入力
データバスを切1離してクーツタが1I14!!する毎
に鍵段の7リツプフロツプのに力をシフトイン入力とし
てセットするシフト機能付アリツブフロップと、シフト
機能付7リフプフロツプ間のシフトイン入力と7リツプ
アロツプの出力をそれぞれ接続してループを形成するシ
フトパスと、シフト開始時には常に論11@1”(又、
は@0”)になっているシフト機能付の論!111”(
又は“0”)照会用フダフプ70ツブと、シフト開始時
には常に論m@o″(又Fi@1”)となって−るシフ
ト機能付の論m@o”(又轄@1”)jlll会用アリ
ツブフ曹ツブと、前記2つの論理照合用79ツブ70ツ
ブは連続して接続されかつ前記シフトパスのループの内
に會すれて訃り、前記2つの論理照合用7vツブフロフ
プのうち最初の論ma舎用7リフプ7wツブのシフトイ
ン入力への77)パス&−擬続畜れ、シフトパスのデー
タが1巡した時点で前記最初の論1照会用フリツプフ冒
ツブからシフトアウトされたデータの照合を完了するシ
フトパスチェツタ回路とを有する事を轡徽としたデータ
処理装置、によって達成される。The above object of the present invention is to disconnect the input data bus when receiving the shift mode signal so that the output signal 1I14! ! A loop is formed by connecting the shift-in input between the 7-liff flops with the shift function and the output of the 7-rip-flop, respectively, to the shift-in input of the 7-rip-flop in the key stage. Shift path and at the start of shift always ``11@1'' (also,
is @0”) with a shift function! 111” (
Or "0") 70 knobs for inquiry and a logic m@o" (also Fi@1") with a shift function that always becomes logic m@o" (also Fi@1") at the start of a shift. The 79 and 70 knobs for logic verification are connected consecutively and meet within the loop of the shift path, and the first logic of the two logic verification 7V knobs is connected in series. 77) Pass &- pseudo-continuation to the shift-in input of the 7-flip 7w-tub for the master building, and when the data of the shift pass has completed one cycle, collate the data shifted out from the above-mentioned first theory 1 inquiry flip-flop bu. This is achieved by a data processing device having a shift path checker circuit that completes the process.
次に本−明をその良好な−!l!麹例にクーてm藺を参
照して詳細に説明する。Next, let's talk about the good news! l! This will be explained in detail with reference to koji as an example.
*1ma本尭明の一実施例を示すブロック構成間である
。*This is a block configuration showing an example of 1ma Honkomei.
11111cThhr、参jll[I4!1 tlVy
)4−F信号が与えられて−な一時Cは常に論理11
”の状態を保持するシフト機能付の論11@1″照会用
ツリツブアーツプでLjt、 2fll鍵記7響ツブフ
ーツブ1の逆でシフト篭−ドIIJ)が与えられて−な
い時に鉱常に論m”o″の状態を保持するシフト機能付
の論:s”o”照会用アリフプ7−ツプである。11111cThhr, reference jll[I4!1 tlVy
) 4 - Given the F signal - temporary C is always logic 11
``Ljt with a shift function that maintains the state 11 @ 1'' query tree artsp, 2fll key note 7 sound tsubu foot tube 1 reverse, shift basket - IIJ) is not given - when the mine is not given m”o This is a logic with a shift function that maintains the state of ``s''.
壇た、−m @o”照合用フリップ7−ツプ2の出力か
ら順次接続されている1個のシフト機能付フリップ7−
ツプ3社、シフト信号が与えられて−ない時にはデータ
II&理装置の機能を溝足畜せるた・めに、データレジ
スタ、−或いは制御II奇期用7リツプフ11ツブして
使用畜れる。-m@o” Verification flip 7- One flip 7 with shift function connected sequentially from the output of step 2
In order to keep the functions of the data II & control device in check when the shift signal is not given, the data register or the control II odd-period 7-lipf 11 can be used.
4&tシフトパスのループを形成するためのシフトパス
用***である。This is a shift path *** for forming a 4 & t shift path loop.
5はシフ)モード信号の売先、シフ)1m数のカランF
及びシフト回数が蜆走値になると予め用意した論理値と
論理照会用7リツブ7Wフプか60データを照合する機
能を有するシフトパステエツ#−路である。5 is shift) mode signal sales destination, shift) 1m number of callan F
And, when the number of shifts reaches a diagonal value, it is a shift path that has a function of comparing a pre-prepared logical value with 7 ribs, 7 W flops, or 60 data for logical inquiry.
以上の如き構成に於ては、シフトモード信号が尭生して
N+2W4シフ)が行なわれれば1巡するわけで番るが
、論理@0”照合用フリップ7Wツブ2よ1先のシフト
機能付7リフブ7−ツブ暴威、v&はvy>パス4に故
障がめり、データが雷に論理@1”に化ける場合Cは、
#+111■のデータが論理@o’ c t bないた
めに、V7トパスデエフター1Ilsで予め周章された
N+1誉I用の論理10”データと一歇がとれない事が
検幽畜れる。In the above configuration, if the shift mode signal is generated and N+2W4 shift) is performed, it will go through one cycle, but the logic @ 0" verification flip 7W knob 2 has a shift function of 1 ahead. 7 rifbu 7-tsubu violence, v & is vy > If a failure occurs in path 4 and the data turns into lightning logic @ 1'', then C is,
Since the data of #+111■ is not logical @o' c t b, it is unfortunate that it cannot match the logic 10" data for N+1 Homare I that was previously published in V7 Topas Defuter 1Ils.
★た、論理@11′照合用7リツブ70ツブ1より先の
論m @o″照会照会用フリップフジツブ2シフト機能
付7リツプ7aフブ5或いはシフトパス4に故障が6り
、データが常に論理@0″に化ける鳩舎に社、N+2I
IIiのデータが論理@1”にならないために、シフト
バスチェック回路5で予め用意されたN+2番目用0論
11@1”データと一歇がとれ&−事が検出畜れる。★Also, logic @11' 7 ribs for verification 70 logic beyond tube 1 @o'' Inquiry Flip Fuji tube 2 7 lip with shift function 7a If there is a failure in tube 5 or shift path 4, the data is always logical. @0″ pigeonhole, N+2I
Since the data of IIi does not become the logic @1", the shift bus check circuit 5 detects that it is consistent with the (N+2) 0 logic 11@1" data prepared in advance.
かくして、N+2−のシフトでデータが1巡し、故障が
あれば検出される。もし故障がなければ各7リツプ7w
ツブの内容は尤の値にもどる。In this way, the data goes through one cycle with N+2- shifts, and if there is a failure, it is detected. If there is no failure, each 7 lip 7w
The content of the whelk returns to its true value.
もし、1つのシフトパスチェック回路5で被数のシフト
パスループのチェックを行つ鳩舎には、シフトパスへの
接続切替amと対応するシフトバスループの1巡する鴎
数の選択動作が必要であるが、IFJCI!現出来る。If one shift path check circuit 5 is used to check the shift path loop of the augend, it is necessary to switch the connection to the shift path am and select the number of loops that the corresponding shift bus loop goes through. But, IFJCI! It can appear.
本発明には、以上説明したように、シフトバスループ内
の既知の位置に既知の一履値をとる一履鳳舎用79ツブ
7−フブを挿入することにより、シフトパスの故障を容
1に検出できるという効果がある。As explained above, in the present invention, by inserting a 79 hub for Ikkurihosha that takes a known value at a known position in the shift bus loop, failures in the shift path can be prevented. It has the effect of being detectable.
91図は本発明の一実施例を示すプロフタ構成図である
。
1・・・論11@1″照合用アリツブアロツブ、2・・
・論理IlO”照合用アリツブフロップ、3・・・シフ
ト機能付7リツブフロツプ、4・・・シフトパス用接続
線、5・・・シフトパスチェツタ回路
特許崗願入 日本電気株式条社FIG. 91 is a configuration diagram of a profiler showing an embodiment of the present invention. 1... Theory 11 @ 1'' Aritubu Arotsub for verification, 2...
・Archive flop for logic IlO" verification, 3... 7 rib flop with shift function, 4... Connection line for shift path, 5... Patent application for shift path checker circuit filed by NEC Co., Ltd.
Claims (1)
IIIしてタロツタが発生する毎に#、IIの7リツプ
70ツブの出力をシフトイン入力としてセットする複数
個のシフト機能付7リツプ70ツフト、シフト−始時&
:は常に論11@1’(又は1o”)になって−るシフ
ト機能付の論11”l”(又は@0″)照会用フリツブ
ツーツブと、シフトWR#時Cは常に論理@0″(X社
11”)Cなって−る?/7)1!能付e論11@o”
(51@1”)IN合用7’j”/ブ7a−7プと、#
I配各my讐フプ7−ツプの各シフトイン入力C前段の
各フリップフ圏フブの出力をそh−t’h、m貌ル、シ
フト方崗に―記2個の論理照会用yv)ツフ→−ツブ、
シフト機能付アリップア謬ツブの履にttttへて閉ル
ープを形成するシフトパルスト、遭−して接続畜れた鍵
記2個の論通照合用7リツプ7wフプのうち最初に接続
された動態照合用7リップ7vツブのシフトイン入力に
擬IIRtrれ、繍記シフトバスのデータが1巡した時
点で鮪記最初&l:接続された論!IIIA合用7リフ
ブ70ツブからシフドア?)畜れたデータと予めシフト
回数に対応した論理照合用データとを比較してシフトパ
ス及び7リツブフロツプのチェックをするシフトパスチ
ェック回路とを有する仁とを特徴としたデータ魁濡装置
。When the shift mode signal is received, the input data bus is set to 1! II
Every time a taro tsuta occurs in #, set the output of the 7 lip 70 knob of II as the shift-in input.
: is always logic 11@1' (or 1o") - logic 11"l" (or @0") with shift function Company X 11”) Is it C? /7)1! Notsuke e-ron 11@o”
(51@1") IN combination 7'j"/bu 7a-7 and #
I distribute the output of each flip-flop in the previous stage to the shift-in input of each shift-in input of each flip-flop. ) Tsufu → − Tsubu,
A shift pulse that forms a closed loop with tttt in the slipper with a shift function, and the first connected dynamic of the 7 lip 7 w flop for checking the logic of the two keys that were encountered and connected. Pseudo-IIRtr is input to the shift-in input of the 7-lip 7-v knob for verification, and when the data on the shift bus goes through one cycle, the first & l: Connected theory! IIIA combined 7 rifubu 70 tsubu to shift door? ) A data control device characterized by having a shift path check circuit for checking the shift path and seven rive flops by comparing the stored data with logic verification data corresponding to the number of shifts in advance.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| JP56129105A JPS5831457A (en) | 1981-08-17 | 1981-08-17 | Data processor |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| JP56129105A JPS5831457A (en) | 1981-08-17 | 1981-08-17 | Data processor |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| JPS5831457A true JPS5831457A (en) | 1983-02-24 |
| JPS6141426B2 JPS6141426B2 (en) | 1986-09-16 |
Family
ID=15001188
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| JP56129105A Granted JPS5831457A (en) | 1981-08-17 | 1981-08-17 | Data processor |
Country Status (1)
| Country | Link |
|---|---|
| JP (1) | JPS5831457A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPS63123135A (en) * | 1986-11-13 | 1988-05-26 | Nec Corp | Shift pass diagnosing system |
| JPS63280342A (en) * | 1987-05-13 | 1988-11-17 | Nec Corp | Shift path trouble diagnosing system |
-
1981
- 1981-08-17 JP JP56129105A patent/JPS5831457A/en active Granted
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPS63123135A (en) * | 1986-11-13 | 1988-05-26 | Nec Corp | Shift pass diagnosing system |
| JPS63280342A (en) * | 1987-05-13 | 1988-11-17 | Nec Corp | Shift path trouble diagnosing system |
Also Published As
| Publication number | Publication date |
|---|---|
| JPS6141426B2 (en) | 1986-09-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Lomazova | Nested Petri Nets - a Formalism for Specification and Verification of Multi-Agent Distributed Systems | |
| Clark et al. | IC-Prolog language features | |
| Devillers | Maximality preserving bisimulation | |
| Clarke et al. | A unified approach for showing language containment and equivalence between various types of ω-automata | |
| US20090012771A1 (en) | Transaction-based system and method for abstraction of hardware designs | |
| Berger et al. | Fault detection in fanout-free combinational networks | |
| JPS5831457A (en) | Data processor | |
| Groote et al. | Modelling and analysis of communicating systems | |
| JPS58151646A (en) | Overflow detector for adder | |
| Harnik | On the existence of saturated models of stable theories | |
| US6637009B2 (en) | Optimization of a logic circuit having a hierarchical structure | |
| JPS61500990A (en) | Floating-point conditional code generation method | |
| Jarrow | An integrated axiomatic approach to the existence of ordinal and cardinal utility functions | |
| Yelowitz et al. | Data structures and program correctness: Bridging the gap | |
| US9292390B2 (en) | Pulsed-latch based razor with 1-cycle error recovery scheme | |
| US2974309A (en) | Magnetic core logical circuits | |
| Mukund | Finite-state automata on infinite inputs | |
| Lischner | Enumerations | |
| US20230080172A1 (en) | Transmitting node instructions | |
| JPH06314229A (en) | Knowledge expression method using association structure | |
| SU1119023A1 (en) | Device for simulating propabilistic graph | |
| SU357563A1 (en) | ||
| Panangaden | A Proof System for Dataflow | |
| Moitra et al. | A Proof System for Dataflow Networks with Indeterminate Modules | |
| SU1179339A1 (en) | Microprogram control device |