JPH02105250A - Data transfer system - Google Patents

Data transfer system

Info

Publication number
JPH02105250A
JPH02105250A JP25774788A JP25774788A JPH02105250A JP H02105250 A JPH02105250 A JP H02105250A JP 25774788 A JP25774788 A JP 25774788A JP 25774788 A JP25774788 A JP 25774788A JP H02105250 A JPH02105250 A JP H02105250A
Authority
JP
Japan
Prior art keywords
shared ram
processor
data
written
read
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.)
Pending
Application number
JP25774788A
Other languages
Japanese (ja)
Inventor
Tomihisa Takasugi
高杉 富久
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.)
Fujitsu Ltd
Original Assignee
Fujitsu 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 Fujitsu Ltd filed Critical Fujitsu Ltd
Priority to JP25774788A priority Critical patent/JPH02105250A/en
Publication of JPH02105250A publication Critical patent/JPH02105250A/en
Pending legal-status Critical Current

Links

Landscapes

  • Multi Processors (AREA)

Abstract

PURPOSE:To improve data transfer efficiency by writing a telegram on a shared RAM by a processor when the quantity of a null area in the shared RAM exceeds that of a telegram to be written next. CONSTITUTION:A leading address (1) which changes at every readout of data from the shared RAM 3 by the processor 2 on a readout side is stored in a readout leading address storage means 5. The processor 1 on a write side stores the final address (2) written previously, and read out the leading address from the means 5 by a null area calculation write request sending means 6, and calculates the quantity of the null area in the RAM 3. When the quantity of the null area exceeds that of the data to be written next, a write request is outputted to a shared RAM arbitration circuit 4. The circuit 4 gives the dedicated right of the shared RAM to the request with high priority, however, when an interval for the delivery of the data to the next stage after changing to serial data is generated, the dedicated right is given to the processor 1, thereby, the next telegram can be written.

Description

【発明の詳細な説明】 〔概 要〕 共有RAMを使用し、該共有RAMの使用権を調停する
共有RAMjJl停手段にての、該共有RAMのバス交
換により複数のプロセッサ間でデータの転送を行うマル
チプロセッサシステムのデータ転送方式に関し、 通常のRAMを使用し、データ転送効率の良いデータ転
送方式の提供を目的とし、 共有RAMの読み出し先頭アドレスを、読み出す毎に更
新記憶する読み出し先頭アドレス記憶手段及び、 先に書き込んだ最終アドレスと、該読み出し先頭アドレ
ス記憶手段より読み出した先頭アドレスから、該共有R
AMの空き領域の量を算出し、次に書き込むデータ量と
比較し、空き領域の量が次に書き込むデータ量よりも多
くなければ書き込み要求を共有RAM調停手段に送出す
る空き領域算出書込み要求送出手段を設けた構成とする
[Detailed Description of the Invention] [Summary] A shared RAM is used, and data is transferred between a plurality of processors by bus exchange of the shared RAM in a shared RAM stop means that arbitrates the right to use the shared RAM. With regard to the data transfer method of a multiprocessor system that uses ordinary RAM, the present invention aims to provide a data transfer method with high data transfer efficiency, and a read start address storage means that updates and stores the read start address of a shared RAM every time it is read. And, from the last address written earlier and the start address read from the read start address storage means, the shared R
Calculate the amount of free space in AM, compare it with the amount of data to be written next, and if the amount of free space is less than the amount of data to be written next, send a write request to the shared RAM arbitration means Free space calculation write request sending The structure has a means.

〔産業上の利用分野〕[Industrial application field]

本発明は、共有RAMを使用し、該共有RAMの使用権
を調停する共有RAM調停手段にての、該共有RAMの
バス交換により複数のプロセ・フサ間でデータの転送を
行うマルチプロセッサシステムのデータ転送方式の改良
に関する。
The present invention provides a multiprocessor system that uses a shared RAM and transfers data between a plurality of processors by exchanging buses of the shared RAM in a shared RAM arbitration means that arbitrates the right to use the shared RAM. Concerning improvements in data transfer methods.

〔従来の技術〕[Conventional technology]

従来のマルチプロセッサシステムのデータ転送方式とし
ては、下記に示す3通りの方法がある。
There are three methods of data transfer in conventional multiprocessor systems as shown below.

■共有RAMに、バイト単位で書込み、書込み終了後、
相手側のプロセッサが読み出し、読み出しが終了すると
次の1ハイドを書込むバイト単位転送方法。
■Write byte by byte to the shared RAM, and after writing is completed,
A byte-by-byte transfer method in which the processor on the other side reads the data, and when the read is completed, writes the next one hide.

■共有RAMに、電文単位で書込み、書込み終了後、相
手側のプロセッサが読み出し、読み出しが終了すると次
の電文を書込む電文単位転送方法。
- A message unit transfer method in which a message is written to the shared RAM in units of messages, and after the writing is completed, the other party's processor reads it, and when the reading is completed, it writes the next message.

■Dual  Port  RAMを使用し、書込み読
み出しを自由に行うデュアルポー)RAM転送方法。
■Dual Port RAM transfer method that uses Dual Port RAM to freely read and write.

〔発明が解決しようとする課題〕 しかしながら、バイト単位転送方法では、バイト単位で
書込み、読み出しを繰り返すので、多量のデータを転送
する場合は時間がかかりデータ転送効率が悪い問題点が
ある。
[Problems to be Solved by the Invention] However, in the byte unit transfer method, since writing and reading are repeated in byte units, there is a problem that it takes time to transfer a large amount of data and data transfer efficiency is poor.

電文単位転送方法では、相手側が書き込んだ電文を全部
読み出さないと、次の電文を書き込むことが出来ず、特
に読み出し完了に時間がかかる時は次の電文を書き込む
のが遅くなり、データ転送効率が悪い問題点がある。
In the message unit transfer method, the next message cannot be written unless all the messages written by the other party are read. Especially when it takes a long time to complete the read, writing the next message becomes slow, reducing data transfer efficiency. There is a bad problem.

デュアルポートRAM転送方法では、2つのプロセッサ
で、自由に書込み、読み出しが可能であるが、使用する
Dual  Port  RAMが高価である問題点が
ある。
The dual port RAM transfer method allows two processors to freely write and read data, but there is a problem in that the dual port RAM used is expensive.

本発明は、通常のRAMを使用し、データ転送効率の良
いデータ転送方式の提供を目的としている。
The present invention aims to provide a data transfer method that uses a normal RAM and has high data transfer efficiency.

〔課題を解決するための手段〕[Means to solve the problem]

第1図は本発明の原理ブロック図である。 FIG. 1 is a block diagram of the principle of the present invention.

第1図に示す如く、共有RAM3を使用し、該共有RA
M3の使用権を調停する共有RAM調停手段4にての、
該共有RAM3のバス交換により複数のプロセッサ1.
2間でデータの転送を行うマルチプロセッサシステムに
おいて、 該共有RAM3の読み出し先頭アドレスを、読み出す毎
に更新記憶する読み出し先頭アドレス記憶手段5及び、 先に書き込んだ最終アドレスと、該読み出し先頭アドレ
ス記憶手段5より読み出した先頭アドレスから、該共有
RAM3の空き領域の量を算出し、次に書き込むデータ
量と比較し、空き領域の量が次に書き込むデータ量より
も多くなければ書き込み要求を該共有RAMI停手段4
に送出する空き領域算出書込み要求送出手段6を設ける
As shown in FIG. 1, the shared RAM 3 is used and the shared RA
In the shared RAM arbitration means 4 that arbitrates the right to use M3,
By exchanging the bus of the shared RAM 3, a plurality of processors 1.
In a multiprocessor system that transfers data between two processors, the read start address storage means 5 updates and stores the read start address of the shared RAM 3 every time it is read, and the read start address storage means stores the previously written last address and the read start address. The amount of free space in the shared RAM 3 is calculated from the first address read from step 5, and compared with the amount of data to be written next. If the amount of free space is greater than the amount of data to be written next, a write request is sent to the shared RAM 3. Stop means 4
Free space calculation write request sending means 6 is provided to send out a free space calculation write request.

〔作 用〕[For production]

本発明の動作を第1図及び、第1図の共有RAM3の書
込み開始説明図である第2図を用いて、電文を転送する
場合につき説明する。
The operation of the present invention will be described with reference to FIG. 1 and FIG. 2, which is a diagram illustrating the start of writing to the shared RAM 3 in FIG. 1, for the case where a message is transferred.

第1図では空き領域算出書込み要求送出手段6をプロセ
ッサ1側のみに設けであるので、プロセッサ1が書込み
、プロセッサ2が読み出す場合の例であり、空き領域算
出書込み要求送出手段6をプロセッサlと2側に設けれ
ば、何れかのプロセッサが書込み、他のプロセッサが読
み出す場合に適用出来る。
In FIG. 1, the free space calculation write request sending means 6 is provided only on the processor 1 side, so this is an example where processor 1 writes and processor 2 reads, and the free space calculation write request sending means 6 is provided on the processor 1 side. If it is provided on the second side, it can be applied when one processor writes and another processor reads.

第1図の読み出し側のプロセッサ2が、共有RAM3よ
りデータを読み出す毎に、第2図に示す、先頭アドレス
■は点線で示す如く変化するが、変化する先頭アドレス
を、読み出し先頭アドレス記憶手段5にて記憶している
Every time the processor 2 on the reading side in FIG. 1 reads data from the shared RAM 3, the starting address (2) shown in FIG. I remember it at.

又書込み側のプロセッサ1は、先に書き込んだ最終アド
レス■を記憶しており、空き領域算出書込み要求送出手
段6にて、・・・の如く変化する読み出し先頭アドレス
を、読み出し先頭アドレス記憶手段5より読み出し、共
有RAM3の空き領域の量、第2図ではa+b+cを算
出する。
In addition, the processor 1 on the writing side stores the last address written earlier, and uses the free space calculation write request sending means 6 to store the read start address that changes as follows in the read start address storage means 5. Then, the amount of free space in the shared RAM 3, a+b+c in FIG. 2, is calculated.

この空き領域の量はプロセッサ2が読み出す毎に増加す
るので、この空き領域の量が、次に書き込むデータの量
より多くなると、共有RAMI停手段4に対して書込み
要求を出力する。
The amount of this free space increases every time the processor 2 reads data, so when the amount of this free space becomes larger than the amount of data to be written next, a write request is output to the shared RAMI stop means 4.

共有RAM調停手段4では、優先順位の高いものに共有
RAMの専用権を与えるが、読み出したものを直列にし
て次段に送る等のために合間が生ずると、専用権をプロ
セッサ1に与えるので、ここで、次の電文を書き込むこ
とが出来る。
The shared RAM arbitration means 4 gives exclusive rights to the shared RAM to those with a higher priority, but when there is an interval to serialize the read data and send it to the next stage, the shared RAM arbitration means 4 gives the exclusive rights to the processor 1. , now you can write the following message.

即ち、全部読み出しが終了するのを待たずとも、次の電
文を書き込む空き領域が生ずると、書込みが可能となる
のでデータ転送効率が向上する。
In other words, data transfer efficiency is improved because writing becomes possible when a free area for writing the next message occurs without waiting for all reading to be completed.

〔実施例〕〔Example〕

以下本発明の1実施例に付き図に従って説明する。 An embodiment of the present invention will be described below with reference to the accompanying drawings.

第3図は本発明の実施例の調歩同期通信を行う場合のブ
ロック図であり、プロセッサ1より電文をプロセッサ2
に転送し、調歩同期通信制御部12より、調歩同期方式
で直列になったデータを相手局に送信する場合の例を示
している。
FIG. 3 is a block diagram when performing start-stop synchronization communication according to the embodiment of the present invention, in which a message is sent from processor 1 to processor 2.
An example is shown in which the asynchronous communication control unit 12 transmits serialized data to the partner station in an asynchronous manner.

まず、共有RAM調停部9の動作について説明すると、
プロセッサ1,2から共有RAM3に対する書込み、読
み出し要求(RE Q)があると、優先順位の高いもの
に肯定応答(ACK)を出力し、ゲート回路10又は1
1を開き、肯定応答を受信した側のプロセッサが専用し
て使用出来るようにする。
First, the operation of the shared RAM arbitration unit 9 will be explained.
When there is a write/read request (REQ) from the processors 1 and 2 to the shared RAM 3, an acknowledgment (ACK) is output to the one with a higher priority, and the gate circuit 10 or 1
1 so that it can be used exclusively by the processor on the side that received the acknowledgment.

調歩同期通信制御部12について説明すると、プロセッ
サ2が共有RAM3より読み出した例えば1バイトのデ
ータを、直列にし、スタートビットとかストップビット
等を付加して調歩同期方式の形態にして送出するもので
、プロセッサ2が1バイトのデータを読み出すのに例え
ば1μsとすれば、これを送出する時間は数μsである
To explain the asynchronous communication control unit 12, it serializes, for example, 1 byte of data read from the shared RAM 3 by the processor 2, adds a start bit, a stop bit, etc., and sends it out in an asynchronous format. If it takes, for example, 1 μs for the processor 2 to read one byte of data, the time it takes to send it is several μs.

次に、第3図のプロセッサ1より、プロセッサ2側にデ
ータを転送し、調歩同期通信制御部12よりデータを送
出するシーケンスにつき説明する。
Next, a sequence in which data is transferred from the processor 1 to the processor 2 side in FIG. 3 and the data is sent out from the asynchronous communication control section 12 will be described.

まず最初に、プロセッサlが共有RAM3への書込み要
求を出すと、共有RAM調停部9は、プロセッサ1に対
し肯定応答を出力し、ゲート回路lOを開く。
First, when the processor 1 issues a write request to the shared RAM 3, the shared RAM arbitration unit 9 outputs an affirmative response to the processor 1 and opens the gate circuit 10.

この肯定応答により、プロセッサ1は書込み可を知り、
共有RAM3に電文を書き込む。
With this positive response, processor 1 knows that writing is possible, and
Write the message to shared RAM3.

この時、プロセッサ1は書き込んだ最終アドレスを記憶
している。
At this time, the processor 1 stores the last written address.

プロセッサ2より読み出し要求があると、共有RAMm
停部9は、プロセッサ1の書込み完了を待ち、プロセッ
サ2に対し肯定応答を出力し、ゲート回路10を閉じ、
ゲート回路11を開く。
When there is a read request from processor 2, shared RAMm
The stop unit 9 waits for the processor 1 to complete writing, outputs an affirmative response to the processor 2, closes the gate circuit 10,
Open the gate circuit 11.

すると、プロセッサ2は共有RAM3より例えば1バイ
トづつ電文を読み込み調歩同期通信制御部12に渡し送
信する。
Then, the processor 2 reads the message, for example one byte at a time, from the shared RAM 3 and passes it to the asynchronous communication control unit 12 for transmission.

この1バイト読み込む毎に変化する、読み出し先頭アド
レスは、読み出し先頭アドレス記憶部5に記憶される。
This read start address, which changes every time one byte is read, is stored in the read start address storage section 5.

一方、プロセッサlでは、メモリ7に格納している、空
き領域算出書込み要求送出プログラム6にて、読み出し
先頭アドレス記憶部5より変化する読み出し先頭アドレ
スを読み出し、先に電文を書き込んだ場合の最終アドレ
スとで、共有RAM3の空き領域の量を算出しており、
次に書き込む電文の量より多くなれば、書込み要求を共
有RAM調停部9に出力する。
On the other hand, in the processor l, the free space calculation write request sending program 6 stored in the memory 7 reads out the changing read start address from the read start address storage unit 5, and reads out the changing read start address from the read start address storage unit 5, and reads out the final address when the message is written first. The amount of free space in shared RAM3 is calculated by
If the amount exceeds the amount of the message to be written next, a write request is output to the shared RAM arbitration unit 9.

共有RAM調停部9では、プロセッサ2が1バイト読み
出し、次に1バイト読み出す迄の、調歩同期通信制御部
12が使用する数μsの間に肯定応答をプロセッサ1に
出力し、ゲート回路11を閉じ、ゲート回路10を開く
The shared RAM arbitration unit 9 outputs an affirmative response to the processor 1 during the several μs used by the asynchronous communication control unit 12 between when the processor 2 reads one byte and when the next byte is read, and closes the gate circuit 11. , the gate circuit 10 is opened.

この肯定応答によりプロセッサlは、直接メモリアクセ
ス部8を用い、共有RAM3に次の電文を書き込む(こ
の場合の書込み時間は約1μs程度である)。
In response to this affirmative response, the processor 1 uses the direct memory access unit 8 to write the next message to the shared RAM 3 (the writing time in this case is about 1 μs).

即ち、プロセッサ2が、共有RAM3より電文を全部読
み出し終わる迄待たずとも、共有RAM3の空き領域の
量が、次に書き込む電文の量より多くなれば、共有RA
M3に書き込むことが出来るので、データ転送効率が向
上する。
That is, even if the processor 2 does not have to wait until the entire message is read from the shared RAM 3, if the amount of free space in the shared RAM 3 becomes larger than the amount of the message to be written next, the shared RAM
Since data can be written to M3, data transfer efficiency is improved.

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

以上詳細に説明せる如く本発明によれば、共有RAMと
して通常のRAMを使用した場合、プロセッサ2が、共
有RAM3より電文を全部読み出し終わる迄待たずとも
、共有RAM3の空き領域の量が、次に書き込む電文の
量より多くなれば、プロセッサ1は共有RAM3に書き
込むことが出来るので、データ転送効率が向上する効果
がある。
As explained in detail above, according to the present invention, when a normal RAM is used as the shared RAM, the amount of free space in the shared RAM 3 can be increased by If the amount of the message is larger than the amount written in the data, the processor 1 can write it to the shared RAM 3, which has the effect of improving data transfer efficiency.

頭アドレス記憶部、 6は空き領域算出書込み要求送出手段。head address memory section, Reference numeral 6 denotes free space calculation write request sending means.

算出書込み要求送出部、 7はメモリ、 8は直接メモリアクセス部、 9は共有RAM調停部、 10.11はゲート回路、 12は調歩同期通信制御部を示す。calculation write request sending unit; 7 is memory, 8 is a direct memory access section; 9 is a shared RAM arbitration unit; 10.11 is a gate circuit, Reference numeral 12 indicates an asynchronous communication control section.

空き領域Free space

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

第1図は本発明の原理ブロック図、 第2図は第1図の共有RAMの書込み開始説明図、第3
図は本発明の実施例の調歩同期通信を行う場合のブロッ
ク図である。 図において、 1.2はプロセッサ、 3は共有RAM。 4は共有RAM調停手段、 5は読み出し先頭アドレス記憶手段、読み出し先竿1図
の共7禍[2Al−’lの書き込み1判女巳言兇、ヨ月
図予  2 θ
Figure 1 is a block diagram of the principle of the present invention, Figure 2 is an explanatory diagram of the start of writing to the shared RAM in Figure 1, and Figure 3 is a diagram explaining the start of writing to the shared RAM in Figure 1.
The figure is a block diagram when performing start-stop synchronization communication according to an embodiment of the present invention. In the figure, 1.2 is a processor, and 3 is a shared RAM. 4 is a shared RAM arbitration means, 5 is a reading start address storage means, and the reading destination rod 1 is the same as the 7 disasters [2Al-'l's writing 1st woman's words, Yozuki diagram 2 θ

Claims (1)

【特許請求の範囲】 共有RAM(3)を使用し、該共有RAM(3)の使用
権を調停する共有RAM調停手段(4)にての、該共有
RAM(3)のバス交換により複数のプロセッサ(1、
2)間でデータの転送を行うマルチプロセッサシステム
において、該共有RAM(3)の読み出し先頭アドレス
を、読み出す毎に更新記憶する読み出し先頭アドレス記
憶手段(5)及び、 先に書き込んだ最終アドレスと、該読み出し先頭アドレ
ス記憶手段(5)より読み出した先頭アドレスから、該
共有RAM(3)の空き領域の量を算出し、次に書き込
むデータ量と比較し、空き領域の量が次に書き込むデー
タ量よりも多くなければ書き込み要求を該共有RAM調
停手段(4)に送出する空き領域算出書込み要求送出手
段(6)を設けたことを特徴とするデータ転送方式。
[Claims] A shared RAM (3) is used, and a shared RAM arbitration means (4) arbitrates the right to use the shared RAM (3) by bus exchange of the shared RAM (3). Processor (1,
2) in a multiprocessor system that transfers data between: a read start address storage means (5) that updates and stores the read start address of the shared RAM (3) each time it is read; and a previously written final address; The amount of free space in the shared RAM (3) is calculated from the start address read from the read start address storage means (5), and compared with the amount of data to be written next, and the amount of free space is determined as the amount of data to be written next. 1. A data transfer system characterized in that a free space calculation write request sending means (6) is provided which sends a write request to the shared RAM arbitration means (4) if the amount is not larger than .
JP25774788A 1988-10-13 1988-10-13 Data transfer system Pending JPH02105250A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP25774788A JPH02105250A (en) 1988-10-13 1988-10-13 Data transfer system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP25774788A JPH02105250A (en) 1988-10-13 1988-10-13 Data transfer system

Publications (1)

Publication Number Publication Date
JPH02105250A true JPH02105250A (en) 1990-04-17

Family

ID=17310537

Family Applications (1)

Application Number Title Priority Date Filing Date
JP25774788A Pending JPH02105250A (en) 1988-10-13 1988-10-13 Data transfer system

Country Status (1)

Country Link
JP (1) JPH02105250A (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH03204691A (en) * 1990-01-05 1991-09-06 Yamaha Corp Automatic player of electronic musical instrument
JPH0486943A (en) * 1990-07-31 1992-03-19 Nec Corp Exclusive control system for shared memory
EP0563985A1 (en) 1992-04-03 1993-10-06 Fuji Photo Film Co., Ltd. Silver halide color photographic material

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH03204691A (en) * 1990-01-05 1991-09-06 Yamaha Corp Automatic player of electronic musical instrument
JPH0486943A (en) * 1990-07-31 1992-03-19 Nec Corp Exclusive control system for shared memory
EP0563985A1 (en) 1992-04-03 1993-10-06 Fuji Photo Film Co., Ltd. Silver halide color photographic material

Similar Documents

Publication Publication Date Title
JPH02109153A (en) Inter-processor data transmission system
JPH02105250A (en) Data transfer system
JP2002123420A (en) Memory access device
JPH02144652A (en) Bus arbitration system
JPS6217879Y2 (en)
JPH036763A (en) High speed data transfer method between dram type memory devices
JPS626361A (en) Data transfer method between multiple processors
JPS6198469A (en) Inter-microprocessor communications system
WO2020182135A1 (en) Communication method and communication system
JPS60181959A (en) Multi-processor system
JPH01175056A (en) Program transfer system
JPH039453A (en) Data transfer controller
JPS6379161A (en) semiconductor storage device
JPS61256458A (en) Information transfer system
JPH0232432A (en) Control system for dual port memory
JPH05282239A (en) Dma transfer system
JPH04104355A (en) Multi-processing system
JPH0410050A (en) Computer system
JPH01154272A (en) multiprocessor equipment
JPH06177938A (en) Hdlc frame transmission control system
JPS5979336A (en) Data transfer system
JP2002189704A (en) Shared memory with block transfer function
JPS62179664U (en)
JPH03204752A (en) Dma transfer device
JPH0830503A (en) Plant monitoring equipment