JPS58146947A - Logical simulator - Google Patents

Logical simulator

Info

Publication number
JPS58146947A
JPS58146947A JP57030321A JP3032182A JPS58146947A JP S58146947 A JPS58146947 A JP S58146947A JP 57030321 A JP57030321 A JP 57030321A JP 3032182 A JP3032182 A JP 3032182A JP S58146947 A JPS58146947 A JP S58146947A
Authority
JP
Japan
Prior art keywords
integrated circuit
logic
memory
logical
output
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
Application number
JP57030321A
Other languages
Japanese (ja)
Other versions
JPS6248864B2 (en
Inventor
Masahiko Koike
小池 誠彦
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.)
NEC Corp
Original Assignee
NEC Corp
Nippon Electric Co 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 NEC Corp, Nippon Electric Co Ltd filed Critical NEC Corp
Priority to JP57030321A priority Critical patent/JPS58146947A/en
Publication of JPS58146947A publication Critical patent/JPS58146947A/en
Publication of JPS6248864B2 publication Critical patent/JPS6248864B2/ja
Granted legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00Error detection; Error correction; Monitoring
    • G06F11/22Detection or location of defective computer hardware by testing during standby operation or during idle time, e.g. start-up testing
    • G06F11/26Functional testing
    • G06F11/261Functional testing by simulating additional hardware, e.g. fault simulation

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Hardware Design (AREA)
  • General Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Quality & Reliability (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Test And Diagnosis Of Digital Computers (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

PURPOSE:To execute the logical simulation of a large scale logical operation device at a high speed, by finding out a processor connected through a wiring from a connection memory in accordance with the change of an output pin and processing the information of change while transmitting the change information simultaneously to the processor through a coupled network. CONSTITUTION:Each processor PJ takes out the logical status of an I/O pin corresponding to an integrated circuit to be simulated from a status memory SJ. The logical operation of the integrated circuit is executed by an integrated circuit logical operator IJ, the status memory SJ is updated and the integrated circuit connected through the wiring is found from a connection memory CJ. The processor PJ is connected to any one of processors P1-PN divided through a coupling network 1. Said operation is executed in parallel in respective processors P1-PN. The status memories I1-IN and connection memories C1-CN are accessed independently. The integrated circuit logical operators I1-IN also execute the opration of integrated circuits independently.

Description

【発明の詳細な説明】 本発明は、論理シミュレータに関する。[Detailed description of the invention] The present invention relates to a logic simulator.

多くの柚類の集積回路が多数用いられている論理装置を
開発する際には、実際に装置が配豚されて動作試験を行
なってから誤りを晃つけたのでは回路修正が大へんで開
発日数、コストが大きくなってしまう。さらに近年のL
8I、カスタムICがさかんに用いられる様になると集
積回路の修正が必要となる事態も発生するので論理上の
設計誤りは早急に見つける必要がある。装置の試験をも
つと前の段階から行なうために論理シミュレータがよく
用いられている。論理シミ、レータは、対象とする論理
装置と同等の動作をシミュレーシ、ンによって行なうも
ので、ソフトウェアによって行なわれているものが多い
When developing a logic device that uses a large number of integrated circuits, it is difficult to correct the circuit if an error is discovered after the device is actually distributed and tested. The number of days and costs will increase. Furthermore, in recent years L
8I. As custom ICs come into widespread use, it is necessary to find logical design errors as soon as possible, as it may become necessary to modify the integrated circuit. Logic simulators are often used to test devices from the previous stage. A logic simulator uses a simulation to perform the same operation as the target logic device, and is often performed by software.

論理シ!ユレーシ、ンがソフトウェアによって逐次処理
されるので対象とする装置の論理規模が大きくなると処
理時間が1大なものとなり一つのOPUをシミ、レート
するのに数頁年もかかるととKなり実用性の無−いもの
になってしまう欠点がある。
Logic! Since the data processing is sequentially processed by software, as the logical scale of the target device increases, the processing time increases, and it may take several years to process one OPU, making it impractical. There is a drawback that it becomes something that does not exist.

本発明の目的はこの様な従来の欠点を除去せしめ大規模
な論理装置の論理シξユレーシ、ンを高速に行なう論理
シミュレータを提供することにある。
It is an object of the present invention to provide a logic simulator that eliminates such conventional drawbacks and performs logic simulators of large-scale logic devices at high speed.

本発明の論理シミ、レータによれば、シlユレーシ、ン
対象の論理装置を構成する集積回路t一種類と1数で分
は集積回路ごとのシミ、レージ、ンを複数のブロモ、す
で分担し、去れそれのプレセ、tに分担した集積回路の
個数分の入出力ビンに対応する論理状−を記憶する状態
メモリと、分担し丸集積回路の極類分の論理演算を行な
う集積回路論理演算器と、分担した集積回路の個数分の
出力ピンの布線表を記憶する接続メモリと、複数のプp
セ、すを結合し相互に交信を行なう結合不ットワータと
を有し、複数のプpセ、すがそれぞれの状態メモリから
シミュレータ、ン対象の集積回路に対応した入出力ビン
の論理状態をとり出し。
According to the logic stain controller of the present invention, if one type and one number of integrated circuits constitute a logic device to be simulated, the stains, radiation, and n of each integrated circuit can be removed by multiple blocks. A state memory that stores logical states corresponding to the input/output bins for the number of integrated circuits divided into t, and an integrated circuit that performs logical operations for the pole classes of the divided round integrated circuits. A logic operation unit, a connection memory that stores a wiring table of output pins for the number of integrated circuits assigned to it, and a plurality of
The simulator has a plurality of processors and a connected controller for mutual communication, and the logic state of the input/output bin corresponding to the target integrated circuit is retrieved from the state memory of each of the multiple processors. broth.

集積回路論理演算器で演算を行ない状態メモリをして変
化情報を伝達しなから同W#に処理を行なうので、並列
処理が行なわれる、又状態メモリと集シミ、レージ、ン
が行なえることを特徴とする。
Since the integrated circuit logic arithmetic unit performs calculations, the state memory transmits the change information, and then the process is performed on the same W#, parallel processing is performed, and the state memory and the collection, storage, and processing can be performed. It is characterized by

次に本発明の実施例について図面を参蕉して説明する。Next, embodiments of the present invention will be described with reference to the drawings.

第1図は本発明の一実施例を示す論理シミ、レータのブ
ロック図である。Pi、P2.・、、PJ・・・PNは
複数のプーセ、すであり、81,82.・・・8J・・
・8NFiそれぞれの状態メモリ、II、I2.−・I
J−・INはそれぞれの集積回路論理演算器、CI、C
2,、=CJ−。
FIG. 1 is a block diagram of a logical stainer and a controller showing one embodiment of the present invention. Pi, P2.・,,PJ...PN is a plurality of pouse, 81, 82. ...8J...
・8NFi respective state memory, II, I2. -・I
J-・IN are respective integrated circuit logic operation units, CI, C
2,,=CJ-.

CNはそれぞれの1ikI!icメそりであり、1は結
合ネ、トワークである。
CN is 1ikI of each! ic system, and 1 is the connection network.

各プーセ、すPJは、状態メモリ8Jよりシ!ル−シ、
ン対象の集積回路に対応した入出力ビン0ili1jI
i状態をとり出し、集積回路論理演算器IJより集積回
路の論理演算を行ない状態メモ98Jを更新し出力ビン
の変化に応じて接続メモリCJより布lII先の集積回
路を求め、結合序、トワークのいずれかに連絡する。こ
の動締がそれぞれのブロモ、すPI 、P2.・PJ−
PNで並行して行なわれ、又収電メモリ11.I2.−
IJ−・INと接続メモリCI、C2,−・・CJ・・
・CNへのメモリアクセスかそれぞれ独立している、さ
らに集積回路論理演算器11゜■2.・、、IJ・・、
INもそれぞれ独立に集積回路の演算を行なうので高速
な論理シミ、レージ、ンが行なわれる。
Each Pouse, PJ is stored in the state memory 8J! Lucy,
Input/output bin 0ili1jI corresponding to the integrated circuit to be scanned
The i state is taken out, the integrated circuit logical operation unit IJ performs a logical operation on the integrated circuit, the state memo 98J is updated, and according to the change in the output bin, the integrated circuit ahead of the cloth lII is determined from the connection memory CJ, and the connection order and network are calculated. Contact any of the below. This movement tightens each Bromo, SuPI, P2.・PJ-
This is done in parallel in the PN, and also in the power collection memory 11. I2. −
IJ-・IN and connected memory CI, C2, --・CJ・・
・Memory access to CN is independent, and integrated circuit logic operation unit 11゜■2.・、、IJ・、
Since IN also performs integrated circuit calculations independently, high-speed logic stains, storage, and input are performed.

第2図は第1図に示す複数のブロモ、すPl。FIG. 2 shows a plurality of bromides shown in FIG.

PI、−PJ−PNO内の1つのブロモ、すPJ o構
威列を示すプロ、り図である。
It is a professional diagram showing one Bromo, PJ o structure sequence in PI, -PJ-PNO.

101は結合ネットワークlとの接続線群、102は状
態メモ98Jのアクセス線群、103は集積回路論理演
算器IJ とのアクセス線群、104は接続メモリCJ
 とのアクセス線群である。 110,118はそれぞ
れ結合ネットワークの接続線群の中のメツセージ入力線
群、メツセージ出力線群である。
101 is a group of connection lines with the connection network l, 102 is a group of access lines for the status memo 98J, 103 is a group of access lines with the integrated circuit logical operation unit IJ, and 104 is a group of connection lines with the connection memory CJ.
This is the access line group. 110 and 118 are a message input line group and a message output line group, respectively, of the connection line group of the connection network.

10はメツセージ入力制御部であり、メツセージ入力線
群11Gより相当する集積回路に対する状態変化のメツ
セージを受入れ、入カメ、セージ111を出す、11は
状態メモリのアクセス制御部であり人カメッセーン11
1 K対応した集積回路の入出力ビン情報をアクセス線
11102よりとり出し、ビン状態113を出す、12
は演算制御部であり、ビン状態113を用いてアクセス
線群103より集積回路論理演算器IJにアクセスを行
ない、新しい状11115を出力する。アクセス制御装
置11は新しい状態115を入力しアクセス線群112
を介し状態メモリ8Jを更新する。13は比較部であり
新しい状@ 115とビン状[111mを入力し出力変
化を−べ変化出力116を・出す、14は接続メモリの
アクセス制御部であり変化出力116により接続メモリ
CJヘアクセス線群104を介してアクセス119を行
ない布線光の集積回路を求め変化メツセージ117を出
力する。15は結合ネットワークの出力制御部であり変
化メツセージ117を入力し結合ネ、トワーク1ヘメ、
セーン出力線群118を介し変化メ、七−ジを分担する
ブーセッサ(PK)K伝える。
Reference numeral 10 denotes a message input control unit, which accepts a message indicating a status change to the corresponding integrated circuit from the message input line group 11G, and outputs an input message 111. Reference numeral 11 denotes a status memory access control unit, which outputs a message 111 indicating a status change to the corresponding integrated circuit.
1 Take out the input/output bin information of the integrated circuit corresponding to K from the access line 11102 and output the bin status 113, 12
is an arithmetic control unit which uses the bin state 113 to access the integrated circuit logic operator IJ from the access line group 103 and outputs a new state 11115. Access control device 11 inputs new state 115 and access line group 112
The state memory 8J is updated via the state memory 8J. 13 is a comparison section which inputs the new state @ 115 and the bottle shape [111m and outputs a change output 116 to output a change in the output. 14 is an access control section for the connected memory, which connects the access line to the connection memory CJ by the change output 116. Access 119 is performed via group 104 to find the integrated circuit of the wiring light and output change message 117. Reference numeral 15 denotes an output control section of the coupling network, which inputs the change message 117 and controls the coupling network, network 1,
Via the Sene output line group 118, a Boussesser (PK) K, which is responsible for the change mode and the seventh mode, is transmitted.

第3脂は第1図に示すそれぞれの状態メモリ81.82
.、−82−.8NO内1つの状態メーt−リ8Jノ構
成例を示すプロ、り因で゛ある。
The third fat is each state memory 81 and 82 shown in Figure 1.
.. , -82-. This is an example of the configuration of one state meter 8J in 8NO.

プpセ、すFJからのアクセス線群102より分担する
集積回路の番号アドレスアクセス301が与えられる、
31はアクセス制御部で番号7ドレスアタセス301を
入力しアドレスアクセス302を出す、32は状態メモ
リセルで分担する集積回路分O入出力ビンの状態を記憶
して郭りアドレスアクセス302が読み出しアクセスで
あれに入出力ピン状態値303を函す、もしアドレスア
クセス302が更新アクセスであれば新しい状St−状
態メモリセル32に書込む。
The number address access 301 of the integrated circuit to be shared is given from the access line group 102 from the FJ,
31 is an access control unit which inputs the number 7 address access 301 and issues an address access 302; 32 stores the state of the O input/output bin for the integrated circuit shared by the state memory cell; the address access 302 is a read access; The input/output pin state value 303 is stored in it, and if the address access 302 is an update access, it is written to a new state St-state memory cell 32.

理演算器IJの構成例を示すプロ、り図である。FIG. 2 is a professional diagram showing an example of the configuration of a scientific arithmetic unit IJ.

401が来ると演算を行なう集積回路の種類を判別し選
択出力群40201つを選択する。 42に、42B。
When 401 is received, the type of integrated circuit on which the operation is to be performed is determined, and one of the selected output groups 4020 is selected. 42, 42B.

・−42Mは集積回路群であり分担する。集積回路弁の
種類の論理演算を行なうために実際に用いられる集積回
路、もしくは、実際に用いられる集積回路を同一機能を
もlPLムを用いている0選択器41により種類に応じ
て集積回路群42ム、42B。
-42M is an integrated circuit group and is shared. An integrated circuit that is actually used to perform the logic operation of the type of integrated circuit valve, or a group of integrated circuits that are actually used and have the same function is selected according to the type by the 0 selector 41 using an lPL system. 42mu, 42B.

−42MC11つが選択され論理演算が行なわれ状態値
403が得られる。43は状態出力器であり、得られた
状態値403より新しい状g@404tアクセス線群1
03に出す; wcs図は第1図で示すそれぞれの接続メモリCI 、
 C2、−CJ−CNの中の1つの接続メモリCJの構
成例を示すプロ、り図である。51はポインタチーグル
であり、アクセス線群104よりプpセ、すPJから成
る状態変化501 を入力し、出力ピンに対する布線光
の集積回路名が入っているテーブルのポインタ502を
出力する。53は接続テーブルであり出力ピンに対応す
る布線光の集積回路名と分担するプpセ、す名を記憶す
るテーブルである。52はアクセス制御部でありポイン
タ502を入力するとテーブルアクセス503を出し、
接続テーブル53へアクセスし布線光の集積回路名と分
担するブロモ、す名をとり出し布線党名504をアクセ
ス線群104へ出力する。
-42MC11 is selected and a logical operation is performed to obtain a state value 403. 43 is a status output device, which outputs a newer status g@404t access line group 1 from the obtained status value 403.
03; The wcs diagram shows each connection memory CI shown in Figure 1,
2 is a diagram showing an example of the configuration of one connection memory CJ in C2, -CJ-CN; FIG. Reference numeral 51 denotes a pointer cheagle, which inputs a state change 501 consisting of PSET and PJ from the access line group 104, and outputs a pointer 502 of a table containing the integrated circuit name of the wiring light for the output pin. Reference numeral 53 is a connection table that stores the integrated circuit name of the wiring light corresponding to the output pin, and the name of the shared program. Reference numeral 52 denotes an access control unit which issues table access 503 when the pointer 502 is input;
The connection table 53 is accessed, the name of the integrated circuit of the wiring light and the name of the bromo and name that are shared are taken out, and the wiring party name 504 is outputted to the access line group 104.

第6図は第1図で示した結合ネットワークlの構成例を
示すためのプロ、り図である。X11゜x、、−x、1
1.x、1. x、、 、 、−xtuはそれぞれりρ
スバースイ、チであり小入力数のりpスバースイ。
FIG. 6 is a diagram showing an example of the configuration of the connection network l shown in FIG. 1. X11゜x, , -x, 1
1. x, 1. x, , , -xtu are each ρ
It's super quick and easy, and it's a small number of inputs.

′チを多段に接続して、入力数N、出力数Nの任意の間
のデータ転送を行なうことができる様に接続されている
。Jl数のプーセ、すPI、P2.・−PJ−PNはそ
れぞれ入出力線群が対となったアクセス線群601,6
02.−・6ONにそれぞれ接続され、任意のブロモ、
すPJが任意のブロモ、すPKK出力変化のメツセージ
を伝達することができる。第6図では結合ネットワーク
IC)構成をクジスハースイ、チの多段構成による構成
例を示したが、他の方式例えは共通バス方式や一段の大
きなりロスバースイヤ千等で構成することもできる。
'' are connected in multiple stages so that data can be transferred between any number of inputs (N) and outputs (N). Jl number Pouse, SuPI, P2.・-PJ-PN are access line groups 601 and 6, each of which is a pair of input/output line groups.
02. -・6ON each connected to any bromo,
PJ can transmit any message of bromo or PKK output change. Although FIG. 6 shows an example of a multi-stage configuration of the coupled network IC (IC), other systems may also be constructed using a common bus system, a single large stage loss bar system, etc.

本発明によれはシミュレーション対象のシステムを構成
する。集積回路を種類とmaで分は各集積回路のシミュ
レーションを複数のブロモ、すで分担し、それぞれのプ
pセ、すが分担するシミ。
According to the present invention, a system to be simulated is configured. The simulation of each integrated circuit is divided into multiple models depending on the type and size of the integrated circuit.

レージ、ン対象の集積回路の入出力ピンに対応する論理
状mt記−するそれぞれの論理状態メモリからとり出し
、集積回路の分担する楓類分の論理演算を行なうそれぞ
れの集積回路論理演算器に対象とする集積回路の論理状
態を与え論理演算を竹なわせ、状態、メモリを更新する
とともに出力ピン変化に応じて、分担するtm数分の出
力ピンに対応する布線衣を記憶するそれぞれの接続メモ
リから布線光の集積回路を見つけ、ブロモ、すrJJを
結合する。結合ネットワークを介して分担する。ブpセ
、+に状m変化を伝えながら対象とするシステムの論理
シミ、レージ、/がシステムを構成する集積回路ど゛ど
に複数のブロモ、すで並列してシミ為レージ、ンを行な
うので、^速に行なうことができるという効果が生じる
The logic state memory corresponding to the input/output pin of the target integrated circuit is taken out from each logic state memory and sent to each integrated circuit logic arithmetic unit that performs the mapped class logic operations assigned to the integrated circuit. It gives the logic state of the target integrated circuit, performs logical operations, updates the state and memory, and stores the wiring corresponding to the output pins for the number of tm to be shared according to changes in the output pins. Find the wiring light integrated circuit from the connection memory and combine Bromo and SurJJ. Sharing through a connective network. While transmitting changes in the state to the logic circuits of the target system, the integrated circuits that make up the system are subjected to multiple circuits in parallel. Therefore, there is an effect that the process can be performed quickly.

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

第1図は本発明の一実施例を示す論理シミ、レータのブ
p、り例、第2図乃至第6因は第1図におけるブロモ、
す、状態メモリ、集積回路論理演算器、接続メモリ、結
合ネットワークのそれぞれの′#IIIN、例を示すプ
ロ、り図である。 1−・結合手、トワーク、Pl、P2.・・・PJ−P
N・−プロセッサ、81,82.−・8J・・・SN・
・・状態メモリ、II、I2.・−IJ・−・IN・−
集積回路論理演算器、CI。 C2,−CJ・・・CN−・縁続メモリ、io・・・メ
ツセージ入力制@部、11,14,31.52−アクセ
ス制御部、12・・・演算制御部、13・・・比較部、
15−・出力制御部、32・−状態メモリセル、41−
選択器、42ム、42B−42M、−・集積回路群、4
3・−状態出力器、51・・・ポインタテーブル、53
−接続テーブル、Xll、X12−XIU、X21.X
22.、、、X2U・・・クロスバ−スイッチ。 第11¥] プ 51 If (:/ 5272 C2sJ IJ CJ
   SPJ IA/ CN第2図 第5 回 猶4図 03 第5図 第 乙 図
FIG. 1 shows an example of a logic stain and a rotor showing an embodiment of the present invention, and FIGS.
FIG. 2 is a diagram illustrating examples of a state memory, an integrated circuit logic unit, a connection memory, and a connection network. 1--bond, twerk, Pl, P2. ...PJ-P
N.-Processor, 81, 82. -・8J...SN・
...state memory, II, I2.・-IJ・-・IN・-
Integrated circuit logic operator, CI. C2, -CJ...CN--connection memory, io...message input system@ section, 11, 14, 31.52-access control section, 12...arithmetic control section, 13...comparison section ,
15--output control unit, 32--state memory cell, 41-
Selector, 42M, 42B-42M, - Integrated circuit group, 4
3.-Status output device, 51... Pointer table, 53
- Connection table, Xll, X12-XIU, X21. X
22. ,,,X2U...Crossbar switch. 11th ¥] Pu51 If (:/ 5272 C2sJ IJ CJ
SPJ IA/CN Figure 2 Figure 5 4 Figure 03 Figure 5 Figure B

Claims (1)

【特許請求の範囲】[Claims] 論jI装置のシiユレーシ、ンを行なう論理シミ鼻レー
タにおいて、論理装置を構成する集積回路を橋拳とsi
I!にごとに分けて分担してシミュレーシ■ンを行なう
複数のブロモ、すと、前記複数のブロモ、tのそれぞれ
K、分担する集積回路のIll数分の入出力ビンの論理
状mを記憶するそれぞれの状態メモリと、分担する集積
回路の櫨類分の論理演算を行なうそれぞれの集積回路論
理演算器と、分担する集積回路の鯛数分の出力ピンの布
線表を記憶するそれぞれの接続メモリと、前記複数のプ
ーセ、すを結合し相互に交信を行なう結合ネ、トワータ
とを有し、前記複数のプpセ、すは前記それぞれの状−
メモリからシミ、レージ、ン対象の集積回路の論理状態
をとり出し、前記それぞれの集積回路論理演算器で演算
を行ない、前記状態メそりを更新し出力状態変化に応じ
て前記それぞれの接続メモリから布纏先の集積回路を見
つけ前記結合ネットワークを介し担当する前記ブロモ、
すに出力変化を伝達し前記複数のブロモ、すが並列して
論理シミュレーションを行なうことを特徴とする論理シ
ミ、レータ。
In a logic simulator that performs cycling of logic devices, the integrated circuits that make up the logic device are
I! A plurality of bromos, each of which is divided and distributed to perform a simulation, are stored, respectively K of the plurality of bromos, t, and logical states m of input/output bins for the number of integrated circuits to be shared. Each state memory, each integrated circuit logic operation unit that performs the logical operations of the assigned integrated circuits, and each connection memory that stores the wiring table of the output pins for the number of output pins of the assigned integrated circuits. and a connecting wire and a tweeter for connecting the plurality of posers and communicating with each other, and each of the plurality of poseurs has a configuration of each of the above.
The logic states of the integrated circuits to be stained, ranged, and scanned are taken out from the memory, and the respective integrated circuit logic arithmetic units perform calculations, the state mesori is updated, and the logic states of the integrated circuits to be detected are extracted from the respective connected memories according to the change in the output state. the Bromo, which is responsible for finding the integrated circuit to be wrapped and connecting it to the connection network;
A logic simulator, characterized in that a logic simulation is performed in parallel with the plurality of blocks by transmitting an output change to the block.
JP57030321A 1982-02-26 1982-02-26 Logical simulator Granted JPS58146947A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP57030321A JPS58146947A (en) 1982-02-26 1982-02-26 Logical simulator

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP57030321A JPS58146947A (en) 1982-02-26 1982-02-26 Logical simulator

Publications (2)

Publication Number Publication Date
JPS58146947A true JPS58146947A (en) 1983-09-01
JPS6248864B2 JPS6248864B2 (en) 1987-10-15

Family

ID=12300529

Family Applications (1)

Application Number Title Priority Date Filing Date
JP57030321A Granted JPS58146947A (en) 1982-02-26 1982-02-26 Logical simulator

Country Status (1)

Country Link
JP (1) JPS58146947A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4866663A (en) * 1987-02-13 1989-09-12 Sanders Associates, Inc. Simulation system

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS567167A (en) * 1979-06-29 1981-01-24 Ibm Parallel calculation system

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS567167A (en) * 1979-06-29 1981-01-24 Ibm Parallel calculation system

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4866663A (en) * 1987-02-13 1989-09-12 Sanders Associates, Inc. Simulation system

Also Published As

Publication number Publication date
JPS6248864B2 (en) 1987-10-15

Similar Documents

Publication Publication Date Title
US5404562A (en) Massively parallel processor including queue-based message delivery system
JPH0764853A (en) Variable-accuracy indirect addressing method for simd multiprocessor and apparatus for execution of it
CN114580606A (en) Data processing method, data processing device, computer equipment and storage medium
WO2018203754A1 (en) Cache coherent node controller for scale-up shared memory systems
US5297255A (en) Parallel computer comprised of processor elements having a local memory and an enhanced data transfer mechanism
CN111427838A (en) Classification system and method for dynamically updating convolutional neural network based on ZYNQ
JPH06162228A (en) Data flow processor device
JPS58146947A (en) Logical simulator
CN116455612A (en) Privacy calculation intermediate data stream zero-copy device and method
US20230244380A1 (en) Device and method for implementing live migration
CN111178373B (en) Operation method, device and related product
CN111260046B (en) Operation method, device and related product
JPS62274451A (en) Parallel computer
JPS6165336A (en) High-speed arithmetic system
US20220172325A1 (en) Computational object storage for offload of data augmentation and preprocessing
JPH0769893B2 (en) Neural network simulator
JPH0646413B2 (en) Data processing processor
JP2961754B2 (en) Parallel processing unit of information processing device
JPS6041102A (en) Sequence control device
JPS60134937A (en) Address extension device
JP3704367B2 (en) Switch circuit
CN115470174A (en) Route generation method and device, many-core system and computer readable medium
JPH07191955A (en) Data-driven information processor
CN111400341A (en) Operation method, device and related product
CN112394986A (en) Device and method for processing half-precision floating point to floating point instruction and related products