JPH05108585A - Load distribution control system for distributed processing system - Google Patents

Load distribution control system for distributed processing system

Info

Publication number
JPH05108585A
JPH05108585A JP3271596A JP27159691A JPH05108585A JP H05108585 A JPH05108585 A JP H05108585A JP 3271596 A JP3271596 A JP 3271596A JP 27159691 A JP27159691 A JP 27159691A JP H05108585 A JPH05108585 A JP H05108585A
Authority
JP
Japan
Prior art keywords
processing
processing unit
transmission
load
request
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
JP3271596A
Other languages
Japanese (ja)
Other versions
JP2618135B2 (en
Inventor
Hiroyuki Omura
弘之 大村
Taiichiro Hayashi
大一郎 林
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.)
Nippon Telegraph and Telephone Corp
Original Assignee
Nippon Telegraph and Telephone Corp
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 Nippon Telegraph and Telephone Corp filed Critical Nippon Telegraph and Telephone Corp
Priority to JP3271596A priority Critical patent/JP2618135B2/en
Publication of JPH05108585A publication Critical patent/JPH05108585A/en
Application granted granted Critical
Publication of JP2618135B2 publication Critical patent/JP2618135B2/en
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Landscapes

  • Computer And Data Communications (AREA)

Abstract

PURPOSE:To improve the throughput of the entire system by executing load distribution while considering the load amount of a received processing request. CONSTITUTION:A transmission processing unit 101 transmits a processing request 105 to reception processing unit groups 102 and 103. The processing unit 102 in the upstream of a token rotating direction 109 receives a processing request 106 and calculates a processing load coefficient. When the transmission processing unit 101 successively transmits the five processing requests 105 of the processing load coefficient '1', those requests are received by the reception processing unit 103. When this accumulated value reaches a rated value, a data reception restart processing signal 108 is transmitted to each processing unit on the upstream side. By repeating this processing, the processing request can be distributed to the respective processing units.

Description

【発明の詳細な説明】Detailed Description of the Invention

【0001】[0001]

【産業上の利用分野】本発明は,データが一方向に伝送
されるループ状通信路に送信処理ユニットおよび複数の
受信処理ユニットが接続され,前記送信処理ユニットか
ら送信されるデータを前記複数の受信処理ユニットの中
の1つが受信する分散形処理システムにおいて,送信処
理ユニットからの送信データを複数の受信処理ユニット
で分散処理するようにした分散形処理システムにおける
負荷分散制御方式に関するものである。
BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention has a transmission processing unit and a plurality of reception processing units connected to a loop-shaped communication path through which data is transmitted in one direction. The present invention relates to a load distribution control method in a distributed processing system in which one of the reception processing units receives the transmission data from the transmission processing unit by a plurality of reception processing units in a distributed processing system.

【0002】[0002]

【従来の技術】図6は従来方式を表わしており,ループ
状通信路104に送信処理ユニット101および受信処
理ユニット102,103が接続されている分散形処理
システムを示している。
2. Description of the Related Art FIG. 6 shows a conventional system and shows a distributed processing system in which a transmission processing unit 101 and reception processing units 102 and 103 are connected to a loop communication path 104.

【0003】この様な分散形処理システムにおける従来
の負荷分散制御方式を以下に示す。 トークンの回転方向109の上流の受信処理ユニット
102は所定数の処理要求を受信すると(図の例では3
コ)それ以上は受信せず,処理要求を下流に渡す。 最下流の受信処理ユニット103は,所定数の処理要
求を受信すると,上流側の各受信処理ユニットにデータ
受信処理の再開を指示する。
A conventional load balancing control method in such a distributed processing system is shown below. When the reception processing unit 102 upstream of the token rotation direction 109 receives a predetermined number of processing requests (3 in the example in the figure).
(C) It does not receive any more and passes the processing request downstream. Upon receiving a predetermined number of processing requests, the most downstream receiving processing unit 103 instructs each upstream receiving processing unit to restart the data receiving processing.

【0004】上記を繰り返すことにより各処理ユニ
ットへの処理要求数の負荷分散を図る。
By repeating the above, the load of the number of processing requests to each processing unit is distributed.

【0005】[0005]

【発明が解決しようとする課題】しかし,従来の負荷分
散制御方式では処理要求の負荷を考慮していないため,
処理要求の内容に応じて負荷が大きく異なる場合には各
ユニットの負荷のアンバランスが生じる欠点がある。
However, since the load of the processing request is not taken into consideration in the conventional load balancing control method,
When the load greatly differs depending on the content of the processing request, there is a drawback that the load of each unit is unbalanced.

【0006】図6にて説明する。2種類の処理要求を考
える。105は送信宛先数が「1」の電文送信要求,1
06は送信宛先数が複数(宛先数=「5」とする)の電
文同報送信要求とする。要求105を受信した処理ユニ
ットは電文送信後に送信完了報告107を1コ受信す
る。これに対して要求106を受信した処理ユニットは
送信完了報告を同報宛先数分受信する。図6において処
理ユニット102は送信完了報告107を7コ,処理ユ
ニット103は送信完了報告107を3コ受信すること
となり,受信処理ユニット102と103との負荷が異
なる。負荷の高い処理ユニットにおいて処理時間の遅延
が生じる。
This will be described with reference to FIG. Consider two types of processing requirements. 105 is a message transmission request with the number of transmission destinations being “1”, 1
06 is a message broadcast transmission request having a plurality of transmission destinations (the number of destinations = “5”). The processing unit that has received the request 105 receives one transmission completion report 107 after transmitting the message. On the other hand, the processing unit which has received the request 106 receives the transmission completion reports for the number of broadcast destinations. In FIG. 6, the processing unit 102 receives seven transmission completion reports 107 and the processing unit 103 receives three transmission completion reports 107, and the load on the reception processing units 102 and 103 is different. A processing time delay occurs in a processing unit with a high load.

【0007】本発明は,各処理要求の負荷が異なる場合
にも各受信処理ユニットに対する負荷分散を適正に行う
ことを目的としている。
It is an object of the present invention to properly distribute the load to each reception processing unit even when the load of each processing request is different.

【0008】[0008]

【課題を解決するための手段】図1は本発明の原理構成
図を示す。図中の符号101は送信処理ユニット,10
2,103は受信処理ユニット,104はループ状通信
路,200は処理負荷係数保持手段を表わす。
FIG. 1 is a block diagram showing the principle of the present invention. Reference numeral 101 in the figure denotes a transmission processing unit, 10
2, 103 is a reception processing unit, 104 is a loop communication path, and 200 is a processing load coefficient holding means.

【0009】本発明は従来の負荷分散制御方式とは受け
付けた処理要求の負荷を考慮して負荷分散を行う点で大
きく異なる。即ち,受信処理ユニット内に,処理負荷の
係数を積算する処理負荷係数保持手段をもうけ,その結
果によって負荷分散を適正に行わせるよう構成してい
る。
The present invention is significantly different from the conventional load balancing control method in that the load of the received processing request is taken into consideration to perform the load balancing. That is, processing load coefficient holding means for accumulating processing load coefficients is provided in the reception processing unit, and load distribution is appropriately performed according to the result.

【0010】[0010]

【作用】従来方式では受け付けた処理要求数に着目して
負荷分散を行っているが,本発明の場合には受け付けた
処理要求の負荷量を考慮して負荷分散を行っている点で
従来の方式と異なっている。
In the conventional method, the load distribution is performed by paying attention to the number of received processing requests, but in the case of the present invention, the load distribution is performed in consideration of the load amount of the received processing requests. Different from the scheme.

【0011】[0011]

【実施例】図2ないし図4は実施例を説明する図であ
る。図2ないし図4において,101は送信処理ユニッ
ト,102,103は受信処理ユニット,104はルー
プ状通信路,105は送信宛先数が「1」の電文送信要
求,106は送信宛先数が複数(宛先数=「5」とす
る)の電文同報送信要求,107は送信完了報告,10
8はデータ受信再開信号,109はトークンの回転方
向,とする。
Embodiments FIGS. 2 to 4 are views for explaining an embodiment. 2 to 4, 101 is a transmission processing unit, 102 and 103 are reception processing units, 104 is a loop communication path, 105 is a message transmission request with the number of transmission destinations being "1", and 106 is a plurality of transmission destinations ( Number of destinations = “5”) telegram broadcast transmission request, 107 is transmission completion report, 10
8 is a data reception restart signal, and 109 is the rotation direction of the token.

【0012】図2においては次のように動作する。即
ち, 送信処理ユニット101は処理要求106を受信処理
ユニット群(102,103)に送信する。 トークンの回転方向109の上流の処理ユニット10
2は処理要求106を受信し処理負荷係数を算出する。
この例では処理負荷係数は送信完了報告107の受信予
定個数とする。処理要求106の処理負荷係数は「5」
である。 各処理ユニットは処理負荷係数の積算値が規定値に到
達するまで処理要求を受け付ける。ここでは規定値を
「5」,各処理ユニットの処理負荷係数の積算値を
「0」とする。処理要求106の処理負荷係数は「5」
であるため,処理ユニット102は処理要求106を受
信すると積算値が規定値に達し,新たな処理要求を受信
しない。
In FIG. 2, it operates as follows. That is, the transmission processing unit 101 transmits the processing request 106 to the reception processing unit group (102, 103). The processing unit 10 upstream of the token rotation direction 109
2 receives the processing request 106 and calculates the processing load coefficient.
In this example, the processing load coefficient is the expected number of receptions of the transmission completion report 107. The processing load coefficient of the processing request 106 is “5”
Is. Each processing unit accepts a processing request until the integrated value of processing load coefficients reaches a specified value. Here, the specified value is "5" and the integrated value of the processing load coefficient of each processing unit is "0". The processing load coefficient of the processing request 106 is “5”
Therefore, when the processing unit 102 receives the processing request 106, the integrated value reaches the specified value and does not receive a new processing request.

【0013】図3においては次のように動作する。即
ち, 次に送信処理ユニット101が処理負荷係数が「1」
の処理要求105を5個順次送信すると,受信処理ユニ
ット103が受信する。この時,受信処理ユニット10
3の処理負荷係数の積算値は「5」となる。
In FIG. 3, it operates as follows. That is, next, the transmission processing unit 101 sets the processing load coefficient to “1”.
When five processing requests 105 are sequentially transmitted, the reception processing unit 103 receives them. At this time, the reception processing unit 10
The integrated value of the processing load coefficient of 3 is "5".

【0014】図4において次のように動作する。即ち, 最下流の受信処理ユニット103は積算値が規定値に
到達したため上流側の各処理ユニットにデータ受信再開
処理信号108を送出する。 受信処理ユニット102は処理要求の受信処理を再開
する。
In FIG. 4, it operates as follows. That is, since the integrated value has reached the specified value, the most downstream reception processing unit 103 sends the data reception restart processing signal 108 to each upstream processing unit. The reception processing unit 102 restarts the reception processing of the processing request.

【0015】上記〜を繰り返すことにより各処理ユ
ニットへの処理要求の負荷分散を図る。以上のように本
発明では受け付けた処理要求の負荷量を考慮して負荷分
散を行っているため,従来方式のような各処理ユニット
への負荷のアンバランスは発生しない。
By repeating the above steps, the load of processing requests to each processing unit is distributed. As described above, according to the present invention, the load is distributed in consideration of the load amount of the received processing request, so that the load imbalance to each processing unit unlike the conventional method does not occur.

【0016】図5は本発明に用いる処理負荷係数保持手
段の構成を示す。図5に示される処理フローで表わされ
る構成をもつ処理負荷係数保持手段が,図1に示す処理
負荷係数保持手段200に対応すると考えてよい。以下
図5を参照しつつ処理負荷係数保持手段200における
動作を述べる。
FIG. 5 shows the structure of the processing load coefficient holding means used in the present invention. It can be considered that the processing load coefficient holding means having the configuration represented by the processing flow shown in FIG. 5 corresponds to the processing load coefficient holding means 200 shown in FIG. The operation of the processing load coefficient holding means 200 will be described below with reference to FIG.

【0017】 処理(1):新しい処理要求を受け付ける。 処理(2):処理負荷係数を算出する。(Lnew) 処理(3):実行中の処理要求の処理負荷係数Lを(L
+Lnew)にする。
Process (1): Receive a new process request. Process (2): A process load coefficient is calculated. (Lnew) Process (3): The process load coefficient L of the process request being executed is set to (L
+ Lnew).

【0018】処理(4):Lが規定値より大であるか否
か調べる。NOの場合には処理(10)へ進む。 処理(5):YESの場合には,受信拒否にする。
Process (4): Check whether L is larger than a specified value. In the case of NO, the process proceeds to the process (10). Process (5): If YES, the reception is rejected.

【0019】処理(6):処理要求を完了したものが存
在しているか否かを調べる。『なし』の場合には処理
(8)へ進む。 処理(7):有りの場合,完了した処理要求の分の処理
負荷係数を減算する。
Process (6): It is checked whether there is any process request that has been completed. In the case of "none", the process proceeds to the process (8). Process (7): If yes, the process load coefficient for the completed process request is subtracted.

【0020】処理(8):受信再開信号ありか否かを調
べる。『なし』の場合には処理(6)へ戻る。 処理(9):有りの場合,新しい処理要求があるか否か
調べる。『なし』の場合には処理(9)をループする。
『あり』の場合には処理(1)に戻る。
Process (8): It is checked whether or not there is a reception restart signal. In the case of "none", the process returns to the process (6). Process (9): If yes, check whether there is a new process request. In the case of "none", the process (9) is looped.
In the case of "Yes", the process returns to the process (1).

【0021】処理(10):処理(4)においてNOの場
合には,処理要求を完了したものが存在しているか否か
を調べる。『なし』の場合には処理(12)へ進む。
Process (10): In the case of NO in process (4), it is checked whether or not there is a process request completed. In the case of "none", proceed to processing (12).

【0022】処理(11):有りの場合,完了した処理要
求の分の処理負荷係数を減算する。 処理(12):新しい処理要求ありか否かを調べる。『な
し』の場合には,処理(10)へ戻る。『あり』の場合に
は処理(1)へ戻る。
Process (11): If yes, the process load coefficient for the completed process request is subtracted. Process (12): Check whether there is a new process request. In the case of "none", the process returns to the process (10). In the case of "Yes", the process returns to the process (1).

【0023】[0023]

【発明の効果】以上説明したように,本発明によれば,
受け付けた処理要求の負荷量を考慮して負荷分散を行っ
ているため,各処理ユニットでの負荷のアンバランスが
発生しない。従って,特定の処理ユニットに負荷が集中
することによって生ずる処理の遅延,各処理ユニットの
使用効率の低下が発生せず,システム全体の処理能力の
向上を図ることができる。
As described above, according to the present invention,
Since the load is distributed taking into account the load of the received processing requests, there is no load imbalance in each processing unit. Therefore, it is possible to improve the processing capacity of the entire system without delaying the processing caused by the concentration of the load on a specific processing unit and reducing the usage efficiency of each processing unit.

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

【図1】本発明の原理構成図である。FIG. 1 is a principle configuration diagram of the present invention.

【図2】実施例説明図である。FIG. 2 is an explanatory diagram of an example.

【図3】実施例説明図である。FIG. 3 is an explanatory diagram of an example.

【図4】実施例説明図である。FIG. 4 is an explanatory diagram of an example.

【図5】処理負荷係数保持手段の構成を示す。FIG. 5 shows a configuration of processing load coefficient holding means.

【図6】従来方式を示す。FIG. 6 shows a conventional method.

【符号の説明】[Explanation of symbols]

101 送信処理ユニット 102,103 受信処理ユニット 104 ループ状通信路 105 送信宛先数が「1」の電文送信要求 106 送信宛先数が複数(宛先数=「5」とする)の
電文同報送信要求 107 送信完了報告 108 データ受信再開信号 109 トークンの回転方向 200 処理負荷係数保持手段
101 Transmission Processing Unit 102, 103 Reception Processing Unit 104 Looped Communication Channel 105 Telegram Transmission Request with Number of Transmission Destinations “1” 106 Telegram Broadcast Transmission Request with Multiple Number of Transmission Destinations (Number of Destinations = “5”) 107 Transmission completion report 108 Data reception restart signal 109 Token rotation direction 200 Processing load coefficient holding means

Claims (1)

【特許請求の範囲】[Claims] 【請求項1】 データが一方向に伝送されるループ状通
信路に送信処理ユニットおよび複数の受信処理ユニット
が接続され,前記送信処理ユニットから送信されるデー
タを前記複数の受信処理ユニットの中の1つが受信する
分散形処理システムにおいて,データが伝送される方向
において,前記送信処理ユニットから最も遠い位置に接
続されている最下流の受信処理ユニットに設けられ,前
記送信データを受信すると内容を分析して処理負荷係数
を算出し累積値に積算する手段と,累積値が規定値を越
える毎に他の全ての受信処理ユニットに制御信号を送信
する手段とをもうけると共に,前記他の全ての受信処理
ユニットに設けられ,前記制御信号を受信すると送信デ
ータを受信可能な状態とし,送信データを受信するとデ
ータの内容を分析して処理負荷係数を算出し累積値に積
算する手段と,累積値が規定値を越えると新たな送信デ
ータを受信せずに通過させる受信制御手段とをもうけた
ことを特徴とする分散形処理システムにおける負荷分散
制御方式。
1. A transmission processing unit and a plurality of reception processing units are connected to a loop-shaped communication path through which data is transmitted in one direction, and data transmitted from the transmission processing unit is stored in the plurality of reception processing units. In a distributed processing system in which one is received, the contents are analyzed when the transmission data is received by being provided in the most downstream reception processing unit connected to the farthest position from the transmission processing unit in the data transmission direction. Means for calculating the processing load coefficient and adding it to the accumulated value, and means for transmitting a control signal to all the other reception processing units each time the accumulated value exceeds the specified value, and for receiving all the other received signals. Provided in the processing unit, when the control signal is received, the transmission data can be received, and when the transmission data is received, the content of the data is analyzed. The distributed processing system is characterized in that it has means for calculating a processing load coefficient and adding it to an accumulated value, and reception control means for passing new transmission data without receiving it when the accumulated value exceeds a specified value. Load balancing control method.
JP3271596A 1991-10-21 1991-10-21 Load Balancing Control Method for Distributed Processing System Expired - Lifetime JP2618135B2 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP3271596A JP2618135B2 (en) 1991-10-21 1991-10-21 Load Balancing Control Method for Distributed Processing System

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP3271596A JP2618135B2 (en) 1991-10-21 1991-10-21 Load Balancing Control Method for Distributed Processing System

Publications (2)

Publication Number Publication Date
JPH05108585A true JPH05108585A (en) 1993-04-30
JP2618135B2 JP2618135B2 (en) 1997-06-11

Family

ID=17502283

Family Applications (1)

Application Number Title Priority Date Filing Date
JP3271596A Expired - Lifetime JP2618135B2 (en) 1991-10-21 1991-10-21 Load Balancing Control Method for Distributed Processing System

Country Status (1)

Country Link
JP (1) JP2618135B2 (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH07152700A (en) * 1993-11-30 1995-06-16 Nippon Telegr & Teleph Corp <Ntt> Load balancing system for computer system

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH01214961A (en) * 1988-02-23 1989-08-29 Fujitsu Ltd Load distribution method
JPH0289437A (en) * 1988-07-04 1990-03-29 Matsushita Electric Ind Co Ltd Loop network system
JPH02178755A (en) * 1988-10-27 1990-07-11 American Teleph & Telegr Co <Att> Multiple processor load sharing apparatus

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH01214961A (en) * 1988-02-23 1989-08-29 Fujitsu Ltd Load distribution method
JPH0289437A (en) * 1988-07-04 1990-03-29 Matsushita Electric Ind Co Ltd Loop network system
JPH02178755A (en) * 1988-10-27 1990-07-11 American Teleph & Telegr Co <Att> Multiple processor load sharing apparatus

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH07152700A (en) * 1993-11-30 1995-06-16 Nippon Telegr & Teleph Corp <Ntt> Load balancing system for computer system

Also Published As

Publication number Publication date
JP2618135B2 (en) 1997-06-11

Similar Documents

Publication Publication Date Title
US6876669B2 (en) Packet fragmentation with nested interruptions
CN101027862B (en) Hierarchical flow-level multi-channel communication
CN106850188A (en) A kind of data transmission system based on multichannel isomery one-way transmission path
CN104023408A (en) Dispatcher and data dispatching method based on network multi-path parallel transmission
CN101682572A (en) Communication system, communication node, and packet scheduling method
US5682480A (en) Parallel computer system for performing barrier synchronization by transferring the synchronization packet through a path which bypasses the packet buffer in response to an interrupt
US4912703A (en) Apparatus and method for data flow control in broadcast data transmission system
JPH05108585A (en) Load distribution control system for distributed processing system
JP2002027024A (en) Method and device for controlling shared flow of data
US6813734B1 (en) Method and apparatus for data alignment
JPS5821459B2 (en) Audio packet transmission method
US20030221082A1 (en) Method and apparatus for byte rotation
JPS61240738A (en) Learning converting system for logical ring in token bus system
JPH08181715A (en) Transmitter-receiver
JPH0612535B2 (en) Load balancing control method for distributed processing system
CN115086296B (en) Log transmission system, log transmission method and related device
JPH04127738A (en) Network system and multiple address communication response control method
JPH01225259A (en) Traffic supervising system
JP3859553B2 (en) Stream packet shaping method, stream packet transfer apparatus, stream packet shaping program, and recording medium
JPS59212050A (en) Data collection system
JPH0654487B2 (en) Load balancing method for distributed processing system
CN116148887A (en) GNSS reference station satellite receiver data return method and system
JP2003218938A (en) Packet communication system
JPH0581213A (en) Distributed processing system
CN107544788A (en) A kind of DFD congestion detection method with time-stamp

Legal Events

Date Code Title Description
R250 Receipt of annual fees

Free format text: JAPANESE INTERMEDIATE CODE: R250

R250 Receipt of annual fees

Free format text: JAPANESE INTERMEDIATE CODE: R250

R250 Receipt of annual fees

Free format text: JAPANESE INTERMEDIATE CODE: R250

FPAY Renewal fee payment (event date is renewal date of database)

Free format text: PAYMENT UNTIL: 20090311

Year of fee payment: 12

FPAY Renewal fee payment (event date is renewal date of database)

Free format text: PAYMENT UNTIL: 20100311

Year of fee payment: 13

FPAY Renewal fee payment (event date is renewal date of database)

Free format text: PAYMENT UNTIL: 20100311

Year of fee payment: 13

FPAY Renewal fee payment (event date is renewal date of database)

Free format text: PAYMENT UNTIL: 20110311

Year of fee payment: 14

FPAY Renewal fee payment (event date is renewal date of database)

Free format text: PAYMENT UNTIL: 20120311

Year of fee payment: 15

EXPY Cancellation because of completion of term
FPAY Renewal fee payment (event date is renewal date of database)

Free format text: PAYMENT UNTIL: 20120311

Year of fee payment: 15