JPH07282020A - Communication load reduction method in highly reliable computer system, - Google Patents

Abstract

PURPOSE:To maintain the reliability and to reduce a communication load in a system by selecting output data by means of the comparison of execution results on the execution main body-side. CONSTITUTION:Only when the number (n) of the execution main bodies is larger than the matched number (h) of requests, the execution main body 20j transmits the execution result 30j to the execution main bodies 20j+1 to 20n-h+1 in an execution result output means 22j to the integer of 1<=j<=(n-h). In the case of n>=h hereafter, the execution main body 20n-h+1 does not transmit the execution result 30n-h+1 to any execution main bodies to an integer n-h+1. The execution main body 20k corresponding to the integer (k) of n-h+1<k<=n transmits the execution result 30k to the execution main bodies 201 to 20n-h+1 in an execution result output means 22k. The execution main body 20i compares the execution results 30i, 301-30i-1, 30n-h+2 and 30n in an output data selection means 25i, selects the matched execution results as output data only when the matched execution results include the respective execution results and the requested matched number (h) of the results exactly exist and transmits them to succeeding execution main bodies 101-10m.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a communication load reducing method in a highly reliable computer system, in which a plurality of executing entities having the same function independently execute processing based on the same input data and By comparison, the present invention relates to a communication load reduction method in a high-reliability computer system that attempts to improve reliability.

More specifically, in an online system or the like, when the execution result of a high-order computer is used for a subsequent computer, the execution results of a plurality of high-order computers having the same function are compared to obtain a correct result as a succeeding computer. The present invention relates to a highly reliable computer system for sending to a computer.

[0003]

2. Description of the Related Art A high-reliability computer system compares the execution results of a plurality of execution subjects having the same function, and the matching execution results are equal to or more than a predetermined required number (a majority of the execution results in the case of a simple majority decision). In some cases, the matching execution result is selected as output data, and a plurality of succeeding execution subjects are made to perform continuous processing based on the selected output data, so as to improve the reliability of the processing. In the conventional system, output data is selected on the side of the succeeding executing party.

FIG. 4 shows an example of a conventional highly reliable computer system.
Indicates. The system shown in FIG.
Machine) 20₁~ 20_n, Network 100, and multiple
Successor execution subject (successor computer) 10₁-10_mMade up of
Be done. Execution subject 20₁~ 20 _nInput the same input 50
When executed, it executes independent processing and succeeds execution result
The data is transmitted to the main body 10.

Referring to FIG.₁, 20₂,
…, 20_nIs the function execution unit 21 having the same function.₁Two
1₂, ... 21_nAnd execution result output unit 22₁, 22₂, ... 2
Two_nAnd have respectively. Execution subject 20₁, 20₂,
…, 20_nReceive the same input data 50 respectively
Function execution unit 21₁, 21₂, ..., 21_nInput by
A process based on the data 50 is executed, and the execution result output unit 22
₁, 22₂, ..., 22_nEach execution result by 30
₁, 30₂, ..., 30_nEach succeeding execution subject 10
₁10,₂, ... 10_nSend to. For example, the execution result
Output unit 22₁Execution result 30 output from₁Is the successor
Line subject 10₁10,₂, ... 10_mSent to each of
Be done. Successor execution subject 10₁10,₂, ... 10_mIs the machine
Noh execution unit 11₁, 11₂, ..., 11_mAnd output data selection
Selector 14₁, ..., 14_mHave. Subsequent execution subject 1
0₁10,₂, ... 10_mOutput data selection for each
Part 14₁, ..., 14_mIs the execution subject 20₁, 20₂,
…, 20_nExecution result from 30₁, 30 ₂, ..., 30_n
, And the matching execution result is the requested match count h (simple
In case of a majority vote
The subsequent execution subject 10₁10,₂, ...
10_mFunction execution unit 11₁, 11₂, ..., 11_mTo
Select as output data.

[0006]

[Problems to be Solved by the Invention]
Conventional high-reliability computer systems are all the successors 10
₁10,₂, ... 10_mEach output correct output data
In order to be selectable, the execution subject 20₁, 20₂, ... 2
0_nHowever, each execution result output unit 22₁, 22 ₂,
…, 22_nExecution result by 30₁, 30₂, ..., 30_n
Subsequent execution subject 10 ₁10,₂, ... 10_meach
Must be sent out, and as a result the executing entity 20₁Two
0₂, ..., 20_nAnd the successor body 10₁10,₂,
... 10_mThe product of the number of times, that is, communication of n × m times is required.
The problem is that it is increasing the communication load in the system.
There is a problem.

The present invention has been made in view of the above points, and solves the above-mentioned conventional problems and reduces the number of communications between the main constituents while maintaining the same reliability as the conventional high-reliability computer system. It is an object of the present invention to provide a communication load reducing method in a high-reliability computer system.

[0008]

The present invention is a system in which output data is selected by the execution subject side by comparison of execution results of the execution subject and is sent to the successor execution subject.

The present invention has the same function,
Central processing unit, data input unit, execution result output
Multiple actors including a device and an output data selection device
X₁, X ₂, ..., X_nExecution result of (n ≧ 2 integer)
X_r1, X_r2, ..., X_rnAnd the matching execution results are
At least a certain required number (the number of matching requests h (n ≧ h ≧ 2 integer))
If it is, select the matching execution result as output data
Then, based on the output data, a plurality of succeeding execution subjects Y₁, Y
₂, ..., Y_m(M ≧ 2 integer) should be used for subsequent processing.
A highly reliable computer system that tries to improve the reliability of processing by
If the number of executing subjects is greater than the number of matching requests in the system (n
> H) only, for an integer j of 1 ≦ j ≦ (n−h),
Execution subject X_jIs the execution result X_rjExecuting subject X_{j + 1}, X
_{j + 2}, ..., X_{n-h + 1}The number of execution subjects and requests thereafter
The number of executing subjects is required, including the case where the number of subjects is equal (n = h)
If the number of matches is greater than or equal to (n ≧ h), for integer n−h + 1
Execution subject X_{n-h + 1}Is the execution result X_{rn-h + 1}Which run
For an integer k of n−h + 1 <k ≦ n without sending it to the subject,
Execution subject X_kIs the execution result X_rkExecuting subject X₁, X
₂, ..., X_{n-h + 1}To n, an integer of n−h + 1 <i ≦ n
Execution subject X for i_iIs the execution result X_ri, X_r1, X
_r2, X_ri-1, X_{rn-h + 2}, ..., X_rnCompare and match real
The line result is the number of request matches h including the execution result of each person.
Outputs the execution result with a match only when there is a Udo
And select the output data as the successor agent Y₁, Y₂，
... Y_mSend to.

The present invention also has a sufficiently long communication time.
After the execution subject sends the execution result, it sends the output data.
Before it goes out, it breaks down and sends the output data to the subsequent execution subject.
If there is a possibility that it cannot be performed, 1 ≦ j ≦ (n−
Execution subject X for integer j in h) _jSends output data
Execution subject X_{j + 1}, X_{j + 2}, ..., X_{n-h + 1}Out
A message to inform the fact that the force data has been sent.
Send together.

[0011]

FIG. 1 is a diagram for explaining the principle of the present invention. The present invention
Is 1 if and only if the number of executing agents n> the number of matching requests h
Execution subject 20 for integer j of ≦ j ≦ (n−h)_jIs
Execution result output means 22_jExecution result by 30_jExecutor
Body 20_{j + 1}, 20_{j + 2}, ..., 20_{n-h + 1}Send this to
After that, when n ≧ h, the execution principal is applied to the integer n−h + 1.
Body 20_{n-h + 1}Is the execution result 30_{n-h + 1}To any actor
Execution corresponding to an integer k of n−h + 1 <k ≦ n without sending
Subject 20_kIs the execution result output means 22_kExecution result
Fruit 30_kExecuting subject 20₁, 20₂, ..., 20_{n-h + 1}What
Send out and execute subject for integer i of 1 ≦ i ≦ n−h + 1
20_iIs output data selection means 25_iExecution result
Thirty_i, 30₁, 30 ₂, ..., 30_i-1, 30_{n-h + 2},
…, 30_nAnd the matching execution results are
Only if there is exactly the requested number of matches h including the fruit,
Select the executed result as output data and output data
The successor body 10₁10,₂, ... 10_mSend to
It

As a result, regardless of whether or not there is a failure in the execution subject (computer), only the execution result of one execution subject (computer) that is performing a normal operation is used as output data for the subsequent execution subject. By sending the data to the (subsequent computer), the number of times of communication can be deleted as a whole.

Further, according to the present invention, when the execution subject X _{j sends the} execution result X _rj to the execution subjects X _{j + 1} , X _{j + 2} , ..., X _{n-h + 1} , the execution result is output to the succeeding execution subject. By adding a message for notifying the fact of data transmission to the execution result X _rj and transmitting it, if the execution subject X _j fails in the middle of transmission, another execution subject X _{j + 1} , X _{j + 2} , ..., X
Any of _{n-h + 1} can send the output data to the subsequent execution subject.

[0014]

Embodiments of the present invention will be described below with reference to the drawings.

FIG. 2 shows the system configuration of an embodiment of the present invention. The computers 20a, 20b, 20c shown in FIG.
Central processing units 21a, 21b, 21c, execution result output devices 22a, 22b, 22c, output data selection device 25
a, 25b, 25c, input data 50 is input, and execution results 30a, 30b, 30c are output. Further, the successor computers 10a, 1 are connected via the network 100.
0b and 10c are connected.

In the following description of the operation, the number of execution subjects is n = 3 of 20a, 20b, 20c as described above, and the number of requested matches is a majority of the number of execution subjects, that is, h in this example. = 2. Further, the failure is an error failure of the central processing unit in which an error occurs only in the execution result of the processing in the central processing unit 21, and the entire computer 20, that is, the central processing unit 21,
The execution result output device 22 and the output data selection device 25 are completely stopped, and the computers 20a, 20b, 2 are no longer available.
Considering the stop failure of 0c, the maximum number of failures that occur at the same time is considered to be 1 which is less than the majority. Furthermore, it is assumed that the communication is normally performed via the network 100 and the message is not lost or rewritten.

The execution subject 20a has the execution result 30a.
To the execution subject 20b, the execution subject 20c sends the execution result 30c to the execution subjects 20a and 20b, and the execution subject 20b does not output the execution result to any part.

FIG. 3 is a flow chart showing the operation of each computer according to the embodiment of the present invention. Computer 20a, 20
b, 20c receive the input data 50 from the input data waiting state (step 0), and the central processing units 21a, 21c
b and 21c independently execute the processing based on the input data 50 (step 1).

The computer 20a has an execution result output device 22a.
Thus, the execution result 30a is sent to the computer 20b (step 2-1), and the computer 20b does not send the execution result anywhere (step 2-2). The computer 20c sends the execution result 30c to the computer 20b by the execution result output device 22c (step 2-3).

The computer 20a has an output data selection device 25.
a, the execution result output device 22a of the computer 20a itself
The execution result 30a input from the computer 20c is compared with the execution result 30c received from the computer 20c (step 3-1), and only when there is a match, the execution result with a match is selected as output data, and the successor computers 10a and 10b are selected. The output data is sent to 10c (step 4-1). The state again stands by for the next input data reception. If they do not match, step 0
, The output data cannot be sent, and the next input data 5
Waiting for 0.

Output data selection device 25b of computer 20b
Compares the execution result 30a input from the computer 20a with the execution result 30c input from the computer 20c (step 3-2), and the number of matching execution results is 30.
Only in two cases including b, the execution result that has obtained a match is selected as output data, and the successor computers 10a, 10b, 1
0c (step 4-2), and the next input data 50 waits again. In other cases, output data cannot be sent and the next input data reception wait state is entered.

The computer 20c is in a waiting state for receiving the next input data.

Next, an example for each state of each execution computer will be shown.

<Normal time> When there is no failure, the computer 20a
Is the execution result 30a by the output data selection device 25a.
And the execution result 30c are confirmed and selected as output data, and the output data is sent to the successor computers 10a, 10b, 10c (solid line 40).

The computer 20b has an output data selection device 25.
execution result 30a, execution result 30b, and execution result 3 depending on b
The output data cannot be sent because the three matches with 0c are confirmed. This includes the result 30b of its own execution,
Only the computer that has confirmed the number of matches of the execution result of the requested number of matches h (= 2) can send the output data to the subsequent computers 10a, 10b, 10c, and thus the computer 20b that has confirmed the match of the three data. Cannot send output data.

<When the computer 20a has a stop failure> When the computer 20a has a stop failure, the computer 20a cannot send output data due to the stop failure.

The computer 20b is an output data selection device 25.
b, the execution result 30a, the execution result 30b, and the execution result 30c are compared, and the result in which only two matches of the execution result 30b and the execution result 30c can be confirmed are selected as output data, and the successor computers 10a, 10b, Output data is sent to 10c (dotted line 60).

<When the central processing unit 21a of the computer 20a has an error failure> When the central processing unit 21a of the computer 20a has an error failure, the computer 20a outputs the execution result 30a and the execution result 30c by the output data selection device 25a. The output data cannot be sent because the mismatch of is confirmed.

The computer 20b has an output data selection device 25.
b) confirms that only two of the execution result 30b and the execution result 30c match, and selects them as output data.
Output data to 0a, 10b, 10c (dotted line 6
0).

<When the computer 20b has a stop failure> When the computer 20b has a stop failure, the output data selection device 25a of the computer 20a confirms that the execution result 30a and the execution result 30c match and selects them as output data. Successor computer 1
Output data to 0a, 10b, 10c (solid line 4
0). At this time, the computer 20b cannot send output data due to a stop failure.

<When the central processing unit 21b of the computer 20b has an error failure> When the central processing unit 21b of the computer 20b has an error failure, the computer 20a uses the output data selection device 2
5a confirms the match between the execution result 30a and the execution result 30c from the computer 20c, and selects it as output data,
The output data is sent to the successor computers 10a, 10b, 10c (solid line 40). The computer 20b compares the three execution results of the execution result 30a of the computer 20a, the execution result 30b of the computer 20b, and the execution result 30c of the computer 20c by the output data selection device 25b, and compares the two execution results 30a and 30c. Make sure only the match, but Calculator 2
Since the central processing unit 21b of 0b has a failure, the execution result is not output. Therefore, the output data cannot be sent because the execution result 30b is not included.

<When the computer 20c has a stop failure> The computer 20a uses the output data selection device 25a to execute the execution result 3
The output data cannot be sent because the mismatch between 0a and the execution result 30c is confirmed.

The computer 20b has an output data selection device 25.
b, the execution result 30a, the execution result 30b, and the execution result 30c are compared, and the execution result 30a and the execution result 30b are compared.
Check only the two matches and select it as the output data,
The output data is sent to the successor computers 10a, 10b, 10c (dotted line 60).

<When the central processing unit 21c of the computer 20c has an error failure> The computer 20a is the output data selection device 2
5a confirms the mismatch between the execution result 30a and the execution result 30c, and cannot output the output data.

The computer 20b has an output data selection device 25.
b, the execution result 30a, the execution result 30b, and the execution result 30c are compared, and the execution result 30a and the execution result 30b are compared.
Check only the two matches and select it as the output data,
The output data is sent to the successor computers 10a, 10b, 10c (dotted line 60).

As a result, in such a system configuration, the number of communications can be reduced to 6 as compared with the conventional method which requires 9 communications.

The communication load reducing method in the highly reliable computer system according to the present invention uses a computer or a computer whose execution subject is an LSI or WSI, a CPU, a package, a board or the like which is an execution subject of a functional terminal or the like. It is applicable to various scale systems such as network wide and distributed systems.

When the communication time is sufficiently long, that is, when the computer that sent the execution result is transferring the execution result,
When there is a possibility of failure, the present invention has a problem that output data is not sent from any computer. For example, in the above-described embodiment, the computer 20a is being transferred while the execution result is being transferred from the computer 20a to the computer 20b.
Output failure from the computer 20a, the computer 20b obtains the execution result from the computer 20a and judges that the computer 20a has transmitted the output data. Therefore, the output from the computer 20b No data is sent.

The problem as described above is that, for an integer j of 1≤j≤ {(number of executing subjects n)-(request matching number h)}, the executing subject X _j that has sent the output data outputs At the same time as the transmission, a message that informs the fact of the transmission is issued by the executing entity X
It is solved by sending to _{j + 1} , X _{j + 2} , ..., X _{n-h + 1} . That is, the computer 20a is replaced by the subsequent computers 10a, 10
b, when sending output data to 10c, another computer 2
The already sent message is sent to 0b. This allows
When the message of which output data has been sent is not sent to the computer 20b, the computer 20b is
Assuming that some kind of failure has occurred, the output data is sent to the subsequent computers 10a, 10b, 10c instead of the computer 20a. The maximum increase in the number of communications due to this is n-
It will be done h times.

In the above embodiment, the number of communications is increased once,
The total number of times of communication is 7, but it is reduced by 2 compared to 9 times in the past.

[0041]

As described above, according to the communication load reducing method of the present invention, the output data is not selected by comparing the execution results on the side of the succeeding execution body, but on the side of the execution body. As a result, the communication load in the system can be reduced while maintaining reliability.

[Brief description of drawings]

FIG. 1 is a diagram for explaining the principle of the present invention.

FIG. 2 is a system configuration diagram of an embodiment of the present invention.

FIG. 3 is a flowchart showing the operation of the computer according to the embodiment of this invention.

FIG. 4 is a block diagram showing an example of a conventional highly reliable computer system.

[Explanation of symbols]

 10 Subsequent Execution Subject, Subsequent Computer 20 Execution Subject, Computer 21 Function Execution Unit, Central Processing Unit 22 Execution Result Output Unit, Execution Result Output Unit 25 Output Data Selection Unit, Output Data Selection Device 30 Execution Result 40 Output from Computer 20a Output data 60 Output data sent from the computer 20b 100 Network

Claims (2)

[Claims] 1. Having the same function, each at least
Central processing unit, data input device, execution result output device and
Multiple execution entities X including output data selection device ₁, X₂，
…, X_nExecution result X of (integer of n ≧ 2)_r1, X_r2，… ，
X_rnAnd the matching execution results are the required number (request
Match if the number of matches is greater than or equal to h (n ≧ h ≧ 2)
Select the executed result as the output data,
Based on multiple successor actors Y₁, Y₂, ..., Y
_mBy making (m ≧ 2 integer) perform subsequent processing,
A highly reliable computer system that seeks to improve reliability
Only when the number of executing subjects is greater than the number of matching requests (n> h)
, The execution subject X for an integer j of 1 ≦ j ≦ (n−h)
_jIs the execution result X_rjExecuting subject X_{j + 1}, X_{j + 2}, ..., X
_{n-h + 1}When the number of executing subjects is equal to the number of requesting subjects (n = h)
Including the case where the number of execution subjects is equal to or greater than the number of requested matches (n ≧
h), for the integer n-h + 1, the execution subject X_{n-h + 1}Is
Execution result X_{rn-h + 1}Is not sent to any execution subject, and nh
Execution subject X for integer k of +1 <k ≦ n_kRun
Result X_rkExecuting subject X₁, X₂, ..., X_{n-h + 1}Send to
Then, for the integer i of n−h + 1 <i ≦ n, the execution subject X
_iIs the execution result X_ri, X_r1, X_r2, X_ri-1, X_{rn-h + 2}，
…, X_rnThe number of matching requests including the execution results of each
Only if there is exactly h
Select as output data and use the output data as the successor agent Y
₁, Y₂, ... Y_mHighly reliable meter characterized by sending to
Communication load reduction method in computer system. 2. When the communication time is sufficiently long and there is a possibility that the execution subject may fail after sending the execution result and before sending the output data, and cannot output the output data to the subsequent execution subject. to, 1 ≦ j ≦ when (n-h) execution entity X _j for integer j of sending the output data, the execution subject X _{j + 1,} X j _{+ 2,}
The communication load reducing method in the high reliability computer system according to claim 1, wherein a message for making the fact of the output data transmission known to X _{n-h + 1} is transmitted together.