[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

JPS63204353A - Common bus coupling system - Google Patents

Common bus coupling system

Info

Publication number
JPS63204353A
JPS63204353A JP3633587A JP3633587A JPS63204353A JP S63204353 A JPS63204353 A JP S63204353A JP 3633587 A JP3633587 A JP 3633587A JP 3633587 A JP3633587 A JP 3633587A JP S63204353 A JPS63204353 A JP S63204353A
Authority
JP
Japan
Prior art keywords
bus
data
threshold value
buses
data transfer
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
JP3633587A
Other languages
Japanese (ja)
Other versions
JP2538901B2 (en
Inventor
Masakazu Kawamoto
正和 河本
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 JP62036335A priority Critical patent/JP2538901B2/en
Publication of JPS63204353A publication Critical patent/JPS63204353A/en
Application granted granted Critical
Publication of JP2538901B2 publication Critical patent/JP2538901B2/en
Anticipated expiration legal-status Critical
Expired - Lifetime 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/38Information transfer, e.g. on bus
    • G06F13/40Bus structure
    • G06F13/4004Coupling between buses
    • G06F13/4027Coupling between buses using bus bridges

Landscapes

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

Abstract

PURPOSE:To efficiently perform data transfer at the time of coupling buses with a few amount of delay, by changing the priority order of a bus occupancy request corresponding to the activity status of the bus in a coupling device, and accelerating the data transfer within the range of the bus occupancy ratio of the coupling device set in advance. CONSTITUTION:Both buses (a) and (b) are connected with bus couplers 10a and 10b provided with a counter means 15 which counts an arrival data per unit time, a threshold value holding means 16 which holds a threshold value set in advance, and a comparison means 17. And by changing the priority order of the bus occupancy request from a high order to a low order corresponding to the activity status, the data transfer can be accelerated within the range of the bus occupancy ratio of the bus couplers 10a and 10b. In such a way, it is possible to perform the data transfer efficiently at the time of coupling the buses with simple constitution and with a few amount of delay efficiently.

Description

【発明の詳細な説明】 〔概要〕 共通バス結合方式であって、複数の異種の共通バスを結
合装置で結合し、異種の共通バスに接続されたモジュー
ル間でデータの送受をする時、共通バスの占有が長くな
り、そのスループ・ノドが低下することを解決するため
に、結合装置のバス使用状況に応じてバス占有要求の優
先順位を上下させ、予め定められた結合装置のバス占有
率の範囲内でデータ転送を加速するように構成すること
により、簡易な構成でバス結合時のデータ転送を少ない
遅れで効率良く行うことが可能となる。
[Detailed Description of the Invention] [Summary] This is a common bus coupling method in which multiple different types of common buses are coupled by a coupling device, and when data is sent and received between modules connected to the different types of common buses, the common bus In order to solve the problem that bus occupancy becomes longer and its sloop node decreases, the priority of bus occupancy requests is raised or lowered according to the bus usage status of the coupling device, and the bus occupancy rate of the coupling device is determined in advance. By configuring the data transfer to be accelerated within the range of , it becomes possible to efficiently perform data transfer during bus connection with a small delay with a simple configuration.

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

本発明は、結合装置にて複数の異種共通バスを結合する
共通バス結合方式に関する。
The present invention relates to a common bus coupling method for coupling a plurality of different types of common buses using a coupling device.

それぞれ異なる複数の共用バスを結合装置(以下バスカ
プラと称する)を介してデータを転送する場合、より効
率的に行うことが要求される。
When data is transferred between a plurality of different shared buses via a coupling device (hereinafter referred to as a bus coupler), it is required to transfer data more efficiently.

〔従来の技術〕[Conventional technology]

第3図は従来例を説明するブロック図を示す。 FIG. 3 shows a block diagram illustrating a conventional example.

第3図(A)は共通バス結合方式の一例を示し、第3図
(B)は他の例を示す。
FIG. 3(A) shows an example of a common bus coupling method, and FIG. 3(B) shows another example.

又、第3図では異種の共通バス(a)、 (b)間をそ
れぞれバスカプラH1)、1(2)を介して結合してお
り、それぞれの共通バス(a)、 (b)にはそのバス
を使用するための制御を行うバス占有制御部2a、2b
を備えている。
In addition, in Fig. 3, different types of common buses (a) and (b) are connected via bus couplers H1) and 1 (2), respectively, and each common bus (a) and (b) has its own Bus occupancy control units 2a and 2b that perform control for using the bus
It is equipped with

第3図(A)、(B)共に中央処理装置(以下cpuと
称する)3と、大容量記憶装置(以下MSと称する)4
間のデータ転送を行う場合を例にしている。
3 (A) and (B) both show a central processing unit (hereinafter referred to as CPU) 3 and a mass storage device (hereinafter referred to as MS) 4
This example uses the case where data is transferred between

第3図(A)に示すバスカプラ1(1)は、CPU3か
らMS4にデータを転送する場合には、ドライバ11を
介して転送し、MS4からCPU3にデータを転送する
場合には、ドライバ12を介して転送する。
The bus coupler 1 (1) shown in FIG. 3(A) transfers data via the driver 11 when transferring data from the CPU 3 to the MS 4, and via the driver 12 when transferring data from the MS 4 to the CPU 3. Transfer via.

例えば、CPU3からのアクセスにてデータの送受を行
う場合、まずCPU3はバス(a)の占有をバス占有制
御部2aに対して要求し受は付けられると、次はバス(
b)の占有をバス占有制御部2bに対して要求する。
For example, when transmitting and receiving data through access from the CPU 3, the CPU 3 first requests the bus occupancy control unit 2a to occupy the bus (a), and once the request is granted, the CPU 3 requests the bus occupancy control unit 2a to occupy the bus (a).
b) The bus occupancy control unit 2b is requested to occupy the bus occupancy control unit 2b.

この要求も承認されると、MS4のアドレスを送出し、
引き続きデータの転送を開始する。この方法は、バスの
信号線をバスカプラ1(1)を介して直接結合し、デー
タを直接送受する方式(尚、これを(11方式と称する
)である。
If this request is also approved, the MS4 address will be sent,
Continue to start data transfer. This method is a method in which bus signal lines are directly coupled via a bus coupler 1 (1) and data is directly transmitted and received (hereinafter, this is referred to as the (11 method)).

一方、バスカプラにバッファを設け、アドレスやデータ
を一時的に蓄えて送受する方法が第3図(B)に示す方
式(尚、これを(2)方式と称する)である。
On the other hand, the method shown in FIG. 3(B) (hereinafter referred to as method (2)) is a method in which a buffer is provided in the bus coupler to temporarily store addresses and data for transmission and reception.

即ち、例えばバッファ13をMS4からCPU3にデー
タを転送する場合、バッファ14をCPU3からMS4
にデータを転送する場合に使用し、相互に相手側のバス
占有制御部2a、2bへのバス(a)、 (blの占有
要求及びアドレス、データの転送もバッファ13.14
を介して行われることになる。
That is, for example, when data is transferred from the buffer 13 from the MS 4 to the CPU 3, the buffer 14 is transferred from the CPU 3 to the MS 4.
The buffers 13 and 14 are used to transfer data to the bus occupancy control units 2a and 2b on the other side, and also transfer requests for occupancy of buses (a) and (bl), addresses, and data.
It will be done through.

尚、第3図(B)に示すの、■、■はバス占有要求/受
付、■は他バスアクセス(メモリアドレスセット)、■
、■はアドレス及びデータの転送をそれぞれ示す。
In addition, as shown in FIG. 3 (B), ■ and ■ are bus occupancy request/acceptance, ■ are other bus accesses (memory address set), and ■
, ■ indicate address and data transfer, respectively.

〔発明が解決しようとする問題点〕[Problem that the invention seeks to solve]

第3図(A)に示す(1)方式の場合、データ転送を行
う時には、両バス(a)、 (b)を同時に占有する必
要があり、バス占有を同期するためにその占有時間が長
くなり、スループットが低下する。
In the case of method (1) shown in Figure 3 (A), when performing data transfer, it is necessary to occupy both buses (a) and (b) at the same time, and the occupation time is long in order to synchronize bus occupation. and throughput decreases.

一方、第3図(B)に示す(2)方式の場合は、両バス
(a)、 (b)を同時に占有する必要はないが、デー
タ受付側のバスta)、 (b)が遅れた時のために、
大きなバッファ13.14が必要となり、その分コスト
アップや伝播時間が増大することになる。
On the other hand, in the case of method (2) shown in Figure 3 (B), it is not necessary to occupy both buses (a) and (b) at the same time, but buses ta) and (b) on the data receiving side are delayed. For the sake of time
A large buffer 13, 14 is required, which increases cost and propagation time accordingly.

〔問題点を解決するための手段〕[Means for solving problems]

第1図は本発明の詳細な説明するブロック図を示す。 FIG. 1 shows a block diagram illustrating the invention in detail.

第1図に示す本発明の原理ブロック図は、単位時間当た
りの到着データを計数する計数手段(カウンタ)15と
、 予め設定した閾値を保持する閾値保持手段(閾値レジス
タ)16と、 計数手段(カウンタ)15の計数値と閾値保持手段(閾
値レジスタ)16の値とを比較する比較手段(比較回路
)17とを具備するバスカプラ10a、10bで両バス
(a)、 (b)を結合するように構成される。
The principle block diagram of the present invention shown in FIG. 1 includes a counting means (counter) 15 for counting arriving data per unit time, a threshold holding means (threshold value register) 16 for holding a preset threshold value, and a counting means ( Both buses (a) and (b) are coupled by bus couplers 10a and 10b, which are equipped with comparison means (comparison circuit) 17 for comparing the counted value of counter) 15 and the value of threshold value holding means (threshold value register) 16. It is composed of

〔作用〕[Effect]

バスカプラ10a、10bのバス使用状況に応じてバス
占有要求の優先順位を高位から下位に変え、予め定めら
れたバスカプラ10a、 10bのバス占有率の範囲(
例えば、最大10MB/S)内でデータ転送を加速する
ように構成することにより、簡易な構成でバス結合時の
データ転送を少ない遅れで効率良く行うことが可能とな
る。
The priority of the bus occupancy request is changed from high to low according to the bus usage status of the bus couplers 10a and 10b, and the bus occupancy rate range of the bus couplers 10a and 10b (
For example, by configuring the device to accelerate data transfer within a maximum speed of 10 MB/S, it becomes possible to efficiently perform data transfer during bus connection with a small delay with a simple configuration.

〔実施例〕〔Example〕

以下本発明の要旨を第2図に示す実施例により具体的に
説明する。
The gist of the present invention will be specifically explained below with reference to an embodiment shown in FIG.

第2図は本発明の詳細な説明するブロック図を示す。尚
、全図を通じて同一符号は同一対象物を示す。
FIG. 2 shows a block diagram illustrating the invention in detail. Note that the same reference numerals indicate the same objects throughout the figures.

本実施例を、第3図で説明したCPU3とMS4間のデ
ータ送受をバスカプラ10a、10bを介して行う場合
を例に取り説明する。
This embodiment will be explained by taking as an example a case where data transmission and reception between the CPU 3 and the MS 4 described in FIG. 3 are performed via the bus couplers 10a and 10b.

尚、バスカブラ10aはCPU3からMS4ヘデータを
転送する場合、バスカブラ10bはMS4からCPU3
ヘデータを転送する場合に使用され、その構成は同一の
構成とする。
Note that when the bus coverr 10a transfers data from the CPU3 to the MS4, the bus coverr 10b transfers data from the MS4 to the CPU3.
The configuration is the same.

又、バスカブラ10a、 10bは、第1図で説明した
カウンタ15.閾値レジスタ16.比較回路17と、単
位時間当たりの到着データを所定信号に変換するデコー
ダ18と、 バス(a)、 (b)からのデータを受は付けるバスバ
ッファ19と、 バスバッファ19からのデータをFIFO方式で格納す
る6段のFIFOデータバフファ20と、所定クロック
信号を発生するクロック発生部21と、 比較回路17でカウンタ15の値を比較した時、閾値を
越えている場合オーバ(OVER)信号を発生するバス
占有要求信号発生部22とを具備して構成されている。
Further, the bus coverrs 10a and 10b have counters 15. Threshold register 16. A comparison circuit 17, a decoder 18 that converts arriving data per unit time into a predetermined signal, a bus buffer 19 that accepts data from buses (a) and (b), and a FIFO method for storing data from the bus buffer 19. When the value of the counter 15 is compared between the six-stage FIFO data buffer 20 that stores the data, the clock generator 21 that generates a predetermined clock signal, and the comparator circuit 17, an over (OVER) signal is generated if the value exceeds the threshold value. The bus occupancy request signal generator 22 generates a bus occupancy request signal.

次に、本実施例の動作をバス(a)からバス(b)へデ
ータを転送する場合を例に取り説明する。
Next, the operation of this embodiment will be explained using an example in which data is transferred from bus (a) to bus (b).

バス(a)からのデータをバスカプラ10a内パスバツ
フア19で受付け、6段構成のFIFOデータバッファ
20に順次大れる。この時、受は付けたデータの単位時
間当たりの到着データ数をデコーダ18を介してカウン
タ15で計数する。
Data from the bus (a) is accepted by the pass buffer 19 in the bus coupler 10a, and is sequentially transferred to the FIFO data buffer 20 having a six-stage configuration. At this time, the counter 15 counts the number of received data arriving per unit time via the decoder 18.

この計数値は、バス(′b)の転送能力を割当てる資源
管理モジュール(図示してない)から閾値レジスタ16
にプリセットした閾値と比較され、計数値が閾値より越
えた時には比較回路17からオーバ(OVER)信号を
バス占有要求信号発生部22へ送出させるようにする。
This count value is received from a threshold register 16 from a resource management module (not shown) that allocates the transfer capacity of the bus ('b).
The count value is compared with a preset threshold value, and when the counted value exceeds the threshold value, the comparison circuit 17 sends an over (OVER) signal to the bus occupancy request signal generation section 22.

バス占有要求信号発生部22はこれにより、バス占有制
御部2bに対してバス(b)の占有要求の優先順位を低
位に変えて要求する。尚、通常バスの占有要求の優先順
位レベルは複数あるものとする。
The bus occupancy request signal generating section 22 thereby changes the priority of the bus (b) occupancy request to a lower level and makes a request to the bus occupancy control section 2b. It is assumed that there are a plurality of priority levels for normal bus occupancy requests.

尚、カウンタ15の値は、バス(b)からのアクセスで
発生するクロック発生部21のクロックにより一定時間
でリセットされる。
Note that the value of the counter 15 is reset at fixed intervals by the clock of the clock generator 21 generated by access from the bus (b).

例えば、閾値レジスタ16にブリセントされた閾値が“
3”の時、バス(a)からのデータが単位時間内に3つ
到着している時は、オーバ(0VER)信号は送出され
ず、高い優先順位でバスを占有してもバス山)側の割り
当てられた転送能力内で遅延の少ない転送が可能となる
For example, if the threshold value recently stored in the threshold value register 16 is “
3", when three data from bus (a) arrive within a unit time, the over (0VER) signal is not sent, and even if the bus is occupied with a high priority, the bus (a) side Transfer with less delay is possible within the allocated transfer capacity.

一方、バス(a)からのデータが単位時間内に4つ到着
している時は、そのまま転送すればバス(bl側の割り
当てられた転送能力以上を使用してしまうので、オーバ
(0VER)信号によりバス(blの占有要求を低い優
先度に変えて処理する。
On the other hand, when four pieces of data arrive from bus (a) within a unit time, if they are transferred as is, they will use more than the allocated transfer capacity of the bus (bl side), so an over (0VER) signal is sent. The request for occupying the bus (bl) is changed to a lower priority and processed.

この時、FIFOデータバッファ20が一杯になった時
には、バス(a)側の転送がBUSY応答により抑止さ
れる。
At this time, when the FIFO data buffer 20 becomes full, transfer on the bus (a) side is inhibited by a BUSY response.

尚、閾値の設定はバス(a)とバス伽)の資源管理モジ
ュール(図示してない)が、お互いに通信しあうことで
各データの方向毎に転送能力の調整をする。
Note that the threshold value is set by the resource management modules (not shown) of the buses (a) and (bus 2) communicating with each other to adjust the transfer capacity for each direction of data.

このように、閾値をバスの転送能力を割当てる資源管理
モジュール(図示してない)により設定することにより
、動的に変化させることが出来、バスシステムの能力を
損なうことはない。
In this manner, by setting the threshold value by a resource management module (not shown) that allocates the transfer capacity of the bus, it is possible to dynamically change the threshold value without impairing the capacity of the bus system.

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

以上のような本発明によれば、簡易な構成でバス結合時
のデータ転送を少ない遅れで、効率良く行うことが出来
る。
According to the present invention as described above, data transfer during bus connection can be efficiently performed with a small delay using a simple configuration.

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

第1図は本発明の詳細な説明するブロック図、第2図は
本発明の詳細な説明するブロック図、第3図は従来例を
説′明するブロック図、をそれぞれ示す。 図において、 1 (1) 、 1 (2) 、 10a、 10bは
バスカブラ、2a、2bはバス占有制御部、 3はCPU 、          4はMS。 11.12はドライバ、   13.14はバッファ、
15はカウンタ、      16は閾値レジスタ、1
7は比較回路、     18はデコーダ、19はパス
バッファ、 20はFIFOデータバッファ、21はクロック発生部
、22はバス占を要求信号発生部、 をそれぞれ示す。 オ(有声8の房3髪Σ言弛明するブロックプロ 150
FIG. 1 is a block diagram explaining the present invention in detail, FIG. 2 is a block diagram explaining the present invention in detail, and FIG. 3 is a block diagram explaining a conventional example. In the figure, 1 (1), 1 (2), 10a and 10b are bus coverrs, 2a and 2b are bus occupancy control units, 3 is a CPU, and 4 is an MS. 11.12 is the driver, 13.14 is the buffer,
15 is a counter, 16 is a threshold register, 1
7 is a comparison circuit, 18 is a decoder, 19 is a pass buffer, 20 is a FIFO data buffer, 21 is a clock generator, and 22 is a bus occupancy request signal generator. O (Voiced 8 tufts 3 hairs Σ word relaxing block pro 150

Claims (1)

【特許請求の範囲】 少なくとも2つのバス占有優先制御機能を備えている複
数の共通バス((a)、(b))の結合装置(10a、
10b)において、 単位時間当たりの到着データを計数する計数手段(15
)と、 予め設定した閾値を保持する閾値保持手段(16)と、 前記計数手段(15)の計数値と前記閾値保持手段(1
6)の値とを比較する比較手段(17)とを設け、前記
計数手段(15)の計数値と前記閾値保持手段(16)
に設定されている閾値とを比較し、該計数値が閾値を越
えた時、データ転送のためのバス占有要求を高位の優先
度から低位へ変えることを特徴とする共通バス結合方式
[Claims] A coupling device (10a,
10b), a counting means (15) for counting arriving data per unit time;
), a threshold value holding means (16) for holding a preset threshold value, and a count value of the counting means (15) and the threshold value holding means (1).
a comparison means (17) for comparing the count value of the counting means (15) with the value of the threshold value holding means (16);
A common bus coupling method characterized in that when the counted value exceeds the threshold, a bus occupation request for data transfer is changed from a high priority to a low priority.
JP62036335A 1987-02-19 1987-02-19 Bus coupling device Expired - Lifetime JP2538901B2 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP62036335A JP2538901B2 (en) 1987-02-19 1987-02-19 Bus coupling device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP62036335A JP2538901B2 (en) 1987-02-19 1987-02-19 Bus coupling device

Publications (2)

Publication Number Publication Date
JPS63204353A true JPS63204353A (en) 1988-08-24
JP2538901B2 JP2538901B2 (en) 1996-10-02

Family

ID=12466958

Family Applications (1)

Application Number Title Priority Date Filing Date
JP62036335A Expired - Lifetime JP2538901B2 (en) 1987-02-19 1987-02-19 Bus coupling device

Country Status (1)

Country Link
JP (1) JP2538901B2 (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7474838B2 (en) 1998-07-17 2009-01-06 Sony Corporation Signal processing apparatus, control method for signal processing apparatus, imaging apparatus and recording/reproducing apparatus

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS575138A (en) * 1980-06-11 1982-01-11 Hitachi Ltd Data transfer controlling system
JPS57111623A (en) * 1980-12-27 1982-07-12 Fujitsu Ltd Channel service equalizing system

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS575138A (en) * 1980-06-11 1982-01-11 Hitachi Ltd Data transfer controlling system
JPS57111623A (en) * 1980-12-27 1982-07-12 Fujitsu Ltd Channel service equalizing system

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7474838B2 (en) 1998-07-17 2009-01-06 Sony Corporation Signal processing apparatus, control method for signal processing apparatus, imaging apparatus and recording/reproducing apparatus

Also Published As

Publication number Publication date
JP2538901B2 (en) 1996-10-02

Similar Documents

Publication Publication Date Title
US4458314A (en) Circuitry for allocating access to a demand shared bus
US4744023A (en) Processor access control arrangement in a multiprocessor system
US4719621A (en) Packet fastbus
US5546543A (en) Method for assigning priority to receive and transmit requests in response to occupancy of receive and transmit buffers when transmission and reception are in progress
US4488218A (en) Dynamic priority queue occupancy scheme for access to a demand-shared bus
US5546385A (en) Flexible switching hub for a communication network
EP0082683B1 (en) Computer memory system
US4470114A (en) High speed interconnection network for a cluster of processors
JPH11513158A (en) Parallel packetized inter-module arbitration high-speed control and data bus
US5793994A (en) Synchronous event posting by a high throughput bus
US7506081B2 (en) System and method of maintaining high bandwidth requirement of a data pipe from low bandwidth memories
US6131114A (en) System for interchanging data between data processor units having processors interconnected by a common bus
US6415367B1 (en) Apparatus for reducing asynchronous service latency in a time slot-based memory arbitration scheme
US4796022A (en) Double transit bus system
US6061748A (en) Method and apparatus for moving data packets between networks while minimizing CPU intervention using a multi-bus architecture having DMA bus
US6363461B1 (en) Apparatus for memory resource arbitration based on dedicated time slot allocation
US5930261A (en) Bus protocol
US5999969A (en) Interrupt handling system for message transfers in network having mixed hardware and software emulated modules
US6412049B1 (en) Method for minimizing CPU memory latency while transferring streaming data
JPS63204353A (en) Common bus coupling system
JP2000276437A (en) Dma controller
KR100215572B1 (en) Method and apparatus for controlling interface buffer
JP3240863B2 (en) Arbitration circuit
CA1235229A (en) Double transit bus system
US7177997B2 (en) Communication bus system