WO2016067420A1 - Computer, and data processing method and program - Google Patents

Abstract

In the present invention, a management number updating unit (1027) updates a management number for time management, per an established unit time. A management number storage unit (1025) stores a current management number. A management number determination unit (10231) determines, on the basis of the current management number and an allowable error in the management number update timing at a transmission destination computer, a management number to be appended to transmission data that will be transmitted to the transmission destination computer. A data transmission unit (10232) appends the management number determined by the management number determination unit (10231) to the transmission data, and transmits, as a data frame (152), the transmission data with the management number appended thereto.

Description

Computer, data processing method and program

The present invention relates to a computer system in which computers are made redundant.

In preparation for the case where a computer fails, there is a method in which a plurality of redundant computers execute the same process multiple times, and when one of the computers fails, the process is continued by the remaining normal computer.
There is no problem in the case of processing in which the same output is always obtained for the same input. However, in the case of processing in which the result differs depending on the input timing, it is necessary to match the processing timing between the computers performing the multiprocessing.
For example, in Patent Document 1, the processing timing between computers is matched by matching the input data capture timing.

Japanese Examined Patent Publication No. 62-46028

In the case of the conventional method of matching the timing among a plurality of computers at the time of capturing input data, there is a problem that a communication process for matching the timing of capturing input data between computers is required for each input process. .

The main object of the present invention is to solve the above-described problems, and to realize a configuration for matching the processing results between computers without synchronizing between computers.

The computer according to the present invention is:
Each of them updates the management number for time management every predetermined unit time, the error between the management number update timings is less than the tolerance, and each receives the data with the management number added The received data is stored in a plurality of destination computers that process the data with the same management number as the current management number among the stored data.
A computer that sends data in parallel,
A management number update unit that updates a management number with an error equal to or less than the allowable error compared to the update timing in the plurality of destination computers;
A management number storage unit for storing the current management number;
A management number determination unit that determines a management number to be added to transmission data to be transmitted to the plurality of transmission destination computers, based on the current management number stored in the management number storage unit and the allowable error;
A data transmission unit that adds the management number determined by the management number determination unit to the transmission data and transmits the transmission data to which the management number is added in parallel to the plurality of transmission destination computers.

In the present invention, the computer determines the management number to be added to the transmission data in consideration of the allowable error. Therefore, even if there is an error in the update timing of the management number between the transmission destination computers, each transmission destination computer has the same timing. Thus, the same data can be processed, and the processing results between the transmission destination computers can be matched without synchronization between the transmission destination computers.

FIG. 3 is a diagram illustrating a configuration example of a computer system according to the first embodiment. The figure which shows the module structural example of the computer which concerns on embodiment. FIG. 3 is a diagram illustrating an example of a module configuration of a computer according to the first embodiment. The figure which shows the example of the data to which the process cycle number which concerns on Embodiment 1 was added. FIG. 4 is a diagram illustrating a storage example of a reception data storage unit according to the first embodiment. FIG. 3 is a flowchart showing data reception processing of the computer according to the first embodiment. FIG. 3 is a flowchart showing data read processing of the computer according to the first embodiment. FIG. 3 is a flowchart showing data transmission processing of the computer according to the first embodiment. FIG. 3 is a diagram showing data processing timing in a plurality of computers according to the first embodiment. FIG. 4 is a diagram illustrating an example of a module configuration of a computer according to a second embodiment. The figure which shows the example of the data to which the processing time stamp which concerns on Embodiment 2 was added. FIG. 6 is a diagram showing a storage example of a reception data storage unit according to the second embodiment. FIG. 9 is a flowchart showing data reception processing of a computer according to the second embodiment. FIG. 9 is a flowchart showing time stamp update processing of the computer according to the second embodiment. FIG. 9 is a flowchart showing data transmission processing of a computer according to the second embodiment. The figure which shows the hardware structural example of the computer which concerns on embodiment.

In the following first and second embodiments, a configuration that eliminates the need for communication processing between computers for matching the data capture timing will be described.
In the following first and second embodiments, a configuration that does not cause a delay for determining a failure will be described.
In the conventional method, in the configuration in which the computer A and the computer B transmit data to the computer C and the computer D, respectively, when the computer A fails, the computer C and the computer D do not transmit data from the computer A. After confirming the above, it is determined that the computer A has failed, and the processing is continued only with the data from the computer B.
For this reason, the conventional method has a problem that processing is delayed by the time required for failure determination.
In the following first and second embodiments, a configuration corresponding to this problem will be described.

*** Explanation of configuration ***
FIG. 1 shows an example of a computer system 10 targeted by the first and second embodiments.
The computer system 10 includes a computer 101a, a computer 101b, a computer 102a, a computer 102b, a computer 103a, and a computer 103b.

In FIG. 1, a computer 101a and a computer 101b, a computer 102a and a computer 102b, and a computer 103a and a computer 103b are computers that perform multiplexing processing.
The computer 101a and the computer 101b, the computer 102a and the computer 102b, and the computer 103a and the computer 103b are connected to each other via the redundant network 100.
A computer system 10 shown in FIG. 1 includes a plurality of hierarchies.
That is, the computer system 10 of FIG. 1 is configured with a hierarchy multiplexed by the computers 101a and 101b, a hierarchy multiplexed by the computers 102a and 102b, and a hierarchy multiplexed by the computers 103a and 103b. The
The computer system 10 may have four or more layers.
Further, the number of computers in each layer may be three or more.

The computer 101a and the computer 101b transmit data in parallel to the computer 102a and the computer 102b, respectively.
The computer 102a and the computer 102b receive data transmitted from the computer 101a and the computer 101b, respectively.
Moreover, the computer 102a and the computer 102b transmit data in parallel to the computer 103a and the computer 103b, respectively.
Moreover, the computer 103a and the computer 103b receive the data transmitted from the computer 102a and the computer 102b, respectively.

In the computer 101a, the computer 101b, the computer 102a, the computer 102b, the computer 103a, and the computer 103b, the management number for time management is updated every predetermined unit time (hereinafter referred to as unit time Tc).
The management number is a serial number for each time width corresponding to the unit time Tc, and the value is updated at a constant step size (for example, 1).
In the following Embodiment 1 and Embodiment 2, the maximum error in the update timing of the management number in the computer 101a, the computer 101b, the computer 102a, the computer 102b, the computer 103a, and the computer 103b is an allowable error (hereinafter referred to as an allowable error). Called Δt).
For example, if the error between the computer 101a and the computer 102b is the maximum, the error between the computer 101a and the computer 102b becomes the allowable error Δt.
In the computer system 10 according to the first embodiment and the second embodiment, the error between the computer 101a, the computer 101b, the computer 102a, the computer 102b, the computer 103a, and the computer 103b is an allowable error Δt or less.

In the following, when it is not necessary to distinguish between the computer 101a and the computer 101b, they are collectively referred to as the computer 101.
Further, when it is not necessary to distinguish between the computer 102a and the computer 102b, the two are collectively referred to as the computer 102.
Similarly, when it is not necessary to distinguish between the computer 103a and the computer 103b, they are collectively referred to as the computer 103.

Next, a module configuration example of each computer will be described with reference to FIG.
Although FIG. 2 shows an example of the module configuration of the computer 102, the computer 101 and the computer 103 have the same configuration.

In FIG. 2, a received data processing unit 1021 receives data frames 151a and 151b transmitted from a plurality of transmission source computers (computer 101a and computer 101b in FIG. 1).
A data frame from the computer 101a is referred to as a data frame 151a, and a data frame from the computer 101b is referred to as a data frame 151b.
The data frame 151a and the data frame 151b have a configuration in which a management number is added to the data.
The data included in the data frame 151a and the data included in the data frame 151b are the same.
Note that the data included in the data frame 151a and the data included in the data frame 151b are referred to as reception data.
The management number included in the data frame 151a is the same as the management number included in the data frame 151b.
Hereinafter, when it is not necessary to distinguish between the data frame 151a and the data frame 151b, the data frame 151 is collectively referred to as the data frame 151.
Also, the reception data processing unit 1021 stores one of the data frames 151 of the plurality of data frames 151 having the same management number in the reception data storage unit 1024 that is a storage area.

The application processing unit 1022 performs data processing (application processing) using data to which the same management number as the current management number is added.

The transmission data processing unit 1023 transmits the data frame 152a and the data frame 152b in parallel to a plurality of transmission destination computers (computer 103a and computer 103b in FIG. 1).
The data frame 152a is a data frame to the computer 103a, and the data frame 152b is a data frame to the computer 103b.
Similarly to the data frame 151a and the data frame 151b, the data frame 152a and the data frame 152b have a configuration in which a management number is added to the data.
The data included in the data frame 152a and the data included in the data frame 152b are the same.
Note that the data included in the data frame 152a and the data included in the data frame 152b are referred to as transmission data.
The management number included in the data frame 152a is the same as the management number included in the data frame 152b.
Hereinafter, when it is not necessary to distinguish between the data frame 152a and the data frame 152b, the data frame 152a and the data frame 152b are collectively referred to as the data frame 152.

The transmission data processing unit 1023 includes a management number determination unit 10231 and a data transmission unit 10232.
The management number determination unit 10231 determines a management number to be added to transmission data.
More specifically, the management number determination unit 10231 stores the integer value obtained by rounding up the fractional value obtained by dividing the allowable error Δt by the unit time Tc, the communication delay value, and the management number storage unit 1025. The management number to be added to the transmission data is determined based on the current management number.
The communication delay value is a value of a communication delay that occurs between the computer 102 and the computer 103.
The data transmission unit 10232 adds the management number determined by the management number determination unit 10231 to the transmission data, generates the data frame 152a and the data frame 152b, and generates the generated data frame 152a and the data frame 152b as a plurality of transmission destinations. The data is transmitted in parallel to the computers (computer 103a and computer 103b in FIG. 1).

The received data storage unit 1024 stores the data frame 151.

Management number storage unit 1025 stores the current management number.

The management number update unit 1027 updates the management number every unit time Tc.
The management number update unit 1027 updates the management number by increment.
The error in the management number update timing by the management number update unit 1027 is equal to or less than the allowable error Δt compared to the update timing in the computer 101.

In the following Embodiment 1, an example in which a cycle number is used as a management number will be described, and in Embodiment 2, an example in which a time stamp is used as a management number will be described.
That is, in the first embodiment, the cycle number is updated every unit time Tc, the data with the cycle number added is received, the cycle number is added to the data, and the data with the cycle number added is transmitted. A computer will be described.
In the second embodiment, a computer that updates a time stamp every unit time Tc, receives data with a time stamp added thereto, adds a time stamp to the data, and transmits the data with the time stamp added thereto. explain.

Embodiment 1 FIG.
*** Explanation of configuration ***
FIG. 3 shows a module configuration example of the computer according to the present embodiment.
The computer according to the present embodiment performs periodic processing.
For this reason, the computer according to the present embodiment updates the cycle number.
FIG. 3 corresponds to FIG. 2 and shows an example of a module configuration of a computer when a cycle number is used as a management number.
The cycle number is a serial number for each time width (cycle) for the unit time Tc, and the value is updated at a constant step size (for example, 1).
FIG. 3 shows a module configuration example of the computer 102, but the computer 101 and the computer 103 have the same configuration.
The module configuration shown in FIG. 3 is also referred to as a multiprocessing synchronization system.

The reception data processing unit 201 corresponds to the reception data processing unit 1021 shown in FIG.
That is, the reception data processing unit 201 receives the data frame 208a and the data frame 208b transmitted from the computer 101a and the computer 101b.
The data frame 208a and the data frame 208b correspond to the data frame 151a and the data frame 151b illustrated in FIG.
A data frame from the computer 101a is referred to as a data frame 208a, and a data frame from the computer 101b is referred to as a data frame 209b.
In the data frame 208a and the data frame 208b, a cycle number is included as a management number.
Hereinafter, when it is not necessary to distinguish between the data frame 208a and the data frame 208b, they are collectively referred to as the data frame 208.
The reception data processing unit 201 stores the reception data of either the data frame 208 a or the data frame 208 b in the reception data storage unit 204.
More specifically, the reception data processing unit 201 compares the cycle number of the received data frame 208 with the current cycle number stored in the management number storage unit 1025.
The received data processing unit 201 discards the data frame 208 if the cycle number of the received data frame 208 is a cycle number before the current cycle number.
If the cycle number of the received data frame 208 is a cycle number after the current cycle number, the received data processing unit 201 first receives another data frame 208 having the same cycle number as the cycle number of the received data frame 208. It is judged whether it was done.
If another data frame 208 has been received first, the received data processing unit 201 discards the received data frame 208.
On the other hand, if another data frame 208 has not been received, the received data processing unit 201 stores the received data frame 208 in the received data storage unit 204.
In addition, the reception data processing unit 201 reads data of the data frame 208 to which the same cycle number as the current cycle number is added from the reception data storage unit 204.

The application processing unit 202 corresponds to the application processing unit 1022 illustrated in FIG.
That is, the application processing unit 202 performs data processing (application processing) using the data read by the reception data processing unit 201.

The transmission data processing unit 203 corresponds to the transmission data processing unit 1023 shown in FIG.
That is, the transmission data processing unit 203 determines the cycle numbers of the data frame 209a and the data frame 209b to be transmitted to the computer 103a and the computer 103b.
The data frame 209a and the data frame 209b correspond to the data frame 152a and the data frame 152b illustrated in FIG.
The data frame 209a is a data frame to the computer 103a, and the data frame 209b is a data frame to the computer 103b.
In the data frame 209a and the data frame 209b, a cycle number is included as a management number.
The transmission data processing unit 203 transmits the data frame 209a and the data frame 209b including the cycle number to the computer 103a and the computer 103b.
Note that when there is no need to distinguish between the data frame 209a and the data frame 209b, the two are collectively referred to as a data frame 209.

The reception data storage unit 204 corresponds to the reception data storage unit 1024 shown in FIG.
That is, the reception data storage unit 204 stores the data frame 208a or the data frame 208b.

The cycle number storage unit 205 corresponds to the management number storage unit 1025 shown in FIG.
That is, the cycle number storage unit 205 stores the current cycle number.

The addition cycle number storage unit 206 stores the number of cycles to be added to the current cycle number stored in the cycle number storage unit 205 as the addition cycle number.
The addition cycle number stored in the addition cycle number storage unit 206 is, for example, an integer value obtained by rounding up the fractional value obtained by dividing the allowable error Δt by the unit time Tc.

The time synchronization mechanism 207 corresponds to the management number update unit 1027 shown in FIG.
That is, the time synchronization mechanism 207 updates the cycle number every unit time Tc.
The time synchronization mechanism 207 updates the cycle number by increment.

FIG. 4 shows the configuration of the data frame 208 and the data frame 209.
The data frame 208 and the data frame 209 are composed of a processing cycle number 300 and data 301.
Data 301 is reception data or transmission data.
The processing cycle number 300 indicates the cycle number of the cycle in which the application processing unit 202 of the computer that is the transmission destination of the data 301 processes the data 301.

FIG. 5 shows the contents stored in the received data storage unit 204.
The reception data storage unit 204 stores a plurality of sets (data frames 208) of the processing cycle number 300 and the data 301 shown in FIG.

*** Explanation of operation ***
Next, the operation of the computer according to the present embodiment will be described.
The application processing unit 202 is activated at regular time intervals, reads out received data, and transmits a result obtained by processing to another computer.
Further, all the computers are assumed to be operating with a time error within a certain range by a time synchronization mechanism 207 such as a Network Time Protocol or a Precision Time Protocol.
Below, operation | movement of the computer 102a is demonstrated.
First, the operation when the computer 102a receives a data frame 208 from another computer 101 will be described with reference to the flowchart of FIG.

When the received data processing unit 201 receives the data frame 208 from the other computer 101, the received data processing unit 201 starts processing.
The received data processing unit 201 compares the processing cycle number 300 of the received data frame 208 with the current cycle number in the cycle number storage unit 205 (S500).
When the processing cycle number 300 is a past cycle number (YES in S500), the received data processing unit 201 determines that the data frame 208 has arrived with a delay due to some failure in the transmission source computer 101. The discarded data frame 208 is discarded (S503).

When the processing cycle number 300 of the received data frame 208 is a cycle number after the current cycle number (NO in S500), the reception data processing unit 201 has the same processing cycle as the processing cycle number 300 of the received data frame 208. It is checked whether the data to which the number is added is already stored in the received data storage unit 204 (S501).

When data having the same processing cycle number as the processing cycle number 300 of the received data frame 208 is already stored in the received data storage unit 204 (YES in S501), the data has already been transmitted from another computer. As a result, the received data processing unit 201 discards the received data frame 208 (S503).
On the other hand, when data having the same processing cycle number as the processing cycle number 300 of the received data frame 208 is not stored in the reception data storage unit 204 (NO in S501), the reception data processing unit 201 receives the data The received data frame 208 is stored in the received data storage unit 204 (S502).

When, for example, the computer 101a and the computer 101b perform the same processing and transmit the same data to the computer 102a according to the procedure shown in FIG. 6, the received data processing unit 201 of the computer 102a first selects the data from the computer 101a and the data from the computer 101b. The data that arrived at is saved, and the data that arrived later is discarded.
The current cycle number is updated by the time synchronization mechanism 207 every time the application processing unit 202 advances the processing cycle, and the cycle number storage unit 205 stores a new cycle number.

Next, an operation when the reception data processing unit 201 reads the data 301 from the reception data storage unit 204 for application processing in the application processing unit 202 will be described with reference to the flowchart of FIG.

The reception data processing unit 201 starts processing when the application processing unit 202 issues a read data read request.
The reception data processing unit 201 searches the reception data storage unit 204 for data 301 having a processing cycle number 300 that matches the current cycle number (S600).
When the corresponding data is found (YES in S601), the received data processing unit 201 reads the corresponding data from the received data storage unit 204, and passes the read data 301 to the application processing unit 202 (S602).
In addition, the reception data processing unit 201 deletes the read data 301 and the processing cycle number 300 from the reception data storage unit 204.
On the other hand, when the corresponding data is not found (NO in S601), the reception data processing unit 201 responds to the application processing unit 202 that the corresponding data does not exist (S603).

Next, the operation when the transmission data processing unit 203 transmits the data frame 209 will be described with reference to the flowchart of FIG.

The transmission data processing unit 203 starts processing when the application processing unit 202 makes a data transmission request.
The transmission data processing unit 203 acquires the transmission data from the application processing unit 202, determines a processing cycle number to be added to the transmission data, and adds the determined processing cycle number to the transmission data to generate a data frame 209 ( S700).
The transmission data processing unit 203 uses a cycle number obtained by adding the addition cycle number in the addition cycle number storage unit 206 to the current cycle number in the cycle number storage unit 205 as a processing cycle number.
The addition period number of the addition period number storage unit 206 is a period number that can absorb the allowable error Δt.
For example, the number of addition cycles is a value obtained by rounding up the fractional value (Δt / Tc) obtained by dividing the allowable error Δt by the cycle processing period (unit time Tc).
Alternatively, a value obtained by rounding up the fractional value (Δ / Tc) and adding a communication delay between the computer 102a and the computer 103 may be used as the number of addition cycles.

The transmission data processing unit 203 transmits the data frame 209 to the computers 103a and 103b, which are all transmission destination computers (S701).

The timing of data processing according to this embodiment will be described with reference to FIG.

All the computers in FIG. 1 operate with an error within an allowable error Δt seconds by the time synchronization mechanism 207.
In FIG. 9, the Nth, N + 1th, and N + 2th periodic processes of the computers 101a, 101b, 102a, and 102b in FIG.
The computer 101a and the computer 101b transmit data at the end of each periodic process, and the computers 102a and 102b read out received data from the computer 101a and the computer 101b from the received data storage unit 204 at the beginning of each periodic process.
When the method according to the present embodiment is not used, the transmission data of the cycle N (800) of the computer 101a is read at the head of the cycle N + 1 (801) in the computer 102a, and the cycle N + 2 (802) in the computer 102b. ).
Since the computer 102a processes this data with the cycle N + 1 (801), the processing result data is transmitted from the computer 102a to the computer 103a and the computer 103b with the cycle N + 1 (801).
Since the computer 102b processes this data at the cycle N + 2 (802), the processing result data is transmitted from the computer 102b to the computer 103a and the computer 103b at the cycle N + 2 (802).
Thus, when the method according to the present embodiment is not used, the processing results differ between computers in each cycle.
On the other hand, in the method according to the present embodiment, the number of addition periods (in the example of FIG. 9), which is a value obtained by rounding up the division value (Δt / Tc) obtained by dividing the allowable error Δt by the period Tc of the period processing. 2) is added to the current cycle N (800), the transmission data of cycle N (800) of computer 101a and the transmission data of cycle N (803) of computer 101b are cycle N + 2 (804) in computer 102a. Similarly, it is read out in the cycle N + 2 (802) in the computer 102b as well.
As a result, transmission data from the computer 102a is transmitted to the computer 103a and the computer 103b with a cycle N + 2 (804), and transmission data from the computer 102b is transmitted to the computer 103a and the computer 103b with a cycle N + 2 (802).
In FIG. 1, the duplication is performed by two computers, but the same operation is performed when the duplication is performed by three or more computers.

*** Explanation of effects ***
As described above, a computer that performs multiple processing designates a cycle number for processing data and transmits the data to a destination computer.
The computer that has received the data reads the received data at the timing of the specified cycle number.
According to such a procedure, the processing results can be matched even if the operation timing is not synchronized between the computers performing the multiprocessing.

Embodiment 2. FIG.
In the first embodiment described above, when the application process is a periodic process, the process cycle number is added and data is transmitted. However, in the present embodiment, the application process is a non-periodic process. A method of matching processing results between multiplexed computers will be described.
More specifically, the computer according to the present embodiment updates the time stamp for each unit time Tc as the management number, adds the time stamp to the data, and transmits the data with the time stamp to the destination computer. Send to.
The time stamp is a serial number for each time width corresponding to the unit time Tc, and the value is updated at a constant step size (for example, 1).

*** Explanation of configuration ***
FIG. 10 shows a module configuration example of the computer according to the present embodiment.
FIG. 10 corresponds to FIG. 2 and shows an example of a module configuration of a computer when a time stamp is used as a management number.
FIG. 10 shows an example of the module configuration of the computer 102, but the computer 101 and the computer 103 have the same configuration.
The module configuration shown in FIG. 10 is also called a multiprocessing synchronization system.

The reception data processing unit 901 receives the data frame 908a and the data frame 908b transmitted from the computer 101.
A data frame from the computer 101a is referred to as a data frame 908a, and a data frame from the computer 101b is referred to as a data frame 908b.
The data frame 908a and the data frame 908b include time stamps.
In addition, the reception data processing unit 901 stores any reception data of the data frame 908a and the data frame 908b in the reception data storage unit 904.
The reception data processing unit 901 corresponds to the reception data processing unit 1021 shown in FIG.

The application processing unit 902 performs data processing (application processing) using data to which the same time stamp as the current time stamp is added.
The application processing unit 902 corresponds to the application processing unit 1022 illustrated in FIG.

The transmission data processing unit 903 determines time stamps of the data frame 909a and the data frame 909b to be transmitted to the computer 103a and the computer 103b.
The transmission data processing unit 903 transmits the data frame 909a and the data frame 909b including the time stamp to the computer 103a and the computer 103b.
The data frame 909a is a data frame to the computer 103a, and the data frame 909b is a data frame to the computer 103b.
The transmission data processing unit 903 corresponds to the transmission data processing unit 1023 shown in FIG.

The reception data storage unit 904 stores the data frame 908a or the data frame 908b.
The reception data storage unit 904 corresponds to the reception data storage unit 1024 shown in FIG.

The time stamp storage unit 905 stores the current time stamp.
The time stamp storage unit 905 corresponds to the management number storage unit 1025 shown in FIG.

The addition time stamp storage unit 906 stores a time stamp value to be added to the current time stamp stored in the time stamp storage unit 905 as an addition time stamp.
The added time stamp stored in the added time stamp storage unit 906 is, for example, an integer value obtained by rounding up the fractional value obtained by dividing the allowable error Δt by the unit time Tc.

The time stamp update processing unit 910 updates the time stamp every unit time Tc.
The time stamp update processing unit 910 updates the time stamp by increment.
The time stamp update processing unit 910 corresponds to the management number update unit 1027 shown in FIG.
The time synchronization mechanism 207 is the same as that shown in FIG.

Also in this embodiment, the configuration of the computer system 10 is the same as that shown in FIG.
Hereinafter, differences from the first embodiment will be mainly described.
Matters not described below are the same as those in the first embodiment.
In the following description, when it is not necessary to distinguish between the data frame 908a and the data frame 908b, they are collectively referred to as a data frame 908.
Similarly, when it is not necessary to distinguish between the data frame 909a and the data frame 909b, they are collectively referred to as a data frame 909.

FIG. 11 shows the configuration of the data frame 908 and the data frame 909.
The data frame 908 and the data frame 909 are composed of a processing time stamp 1000 and data 301.
Data 301 is reception data or transmission data.
The processing time stamp 1000 indicates a time stamp corresponding to the timing at which the application processing unit 902 of the computer that is the transmission destination of the data 301 processes the data 301.

FIG. 12 shows the contents stored in the received data storage unit 904.
The reception data storage unit 904 stores a plurality of sets (data frames 908) of the processing time stamp 1000 and the data 301 shown in FIG.

*** Explanation of operation ***
Next, the operation of the computer according to the present embodiment will be described.
It is assumed that the application processing unit 902 issues a data read request to the reception data processing unit 901 in advance and waits for a data frame from another computer.
Then, when the received data processing unit 901 receives a data frame, the computer starts processing.
One process is completed within the unit time Tc.
The time stamp update processing unit 910 assigns a time stamp to the time width for each unit time Tc.
Below, operation | movement of the computer 102a is demonstrated.
First, the operation when the computer 102a receives a data frame 908 from another computer 101 will be described with reference to the flowchart of FIG.

In FIG. 13 which is the operation flow of the computer for non-periodic processing, S500 and S501 are replaced with S1200 and S1201, respectively, as compared with FIG. 6 in the case of periodic processing. It has been replaced with a stamp.

The reception data processing unit 901 starts processing when it receives a data frame 908 from another computer 101.
The received data processing unit 901 compares the processing time stamp 1000 of the received data frame 908 with the current time stamp in the time stamp storage unit 905 (S1200).
If the processing time stamp 1000 is a past time stamp (YES in S1200), the reception data processing unit 901 determines that the data frame 908 has arrived late because of some failure in the transmission source computer 101, and the reception data processing unit 901 receives The discarded data frame 908 is discarded (S503).

When the processing time stamp 1000 of the received data frame 908 is a time stamp after the current time stamp (NO in S1200), the received data processing unit 901 has the same processing time as the processing time stamp 1000 of the received data frame 908. It is checked whether or not the data to which the stamp is added is already stored in the received data storage unit 904 (S1201).

If data with the same processing time stamp as the processing time stamp 1000 of the received data frame 908 is already stored in the received data storage unit 904 (YES in S1201), the data has already been transmitted from another computer. As a result, the received data processing unit 901 discards the received data frame 908 (S503).
On the other hand, when data having the same processing time stamp as the processing time stamp 1000 of the received data frame 908 is not stored in the reception data storage unit 904 (NO in S1201), the reception data processing unit 901 receives the data The received data frame 908 is stored in the received data storage unit 904 (S502).

Next, the operation when the transmission data processing unit 903 transmits the data frame 909 will be described with reference to the flowchart of FIG.

In FIG. 15 which is the operation flow of the computer for non-periodic processing, S700 is changed to S1400 with respect to FIG. 8 in the case of periodic processing, and the processing cycle number is replaced with a time stamp.

The transmission data processing unit 903 starts processing when the application processing unit 902 makes a data transmission request.
The transmission data processing unit 903 acquires the transmission data from the application processing unit 902, determines a processing time stamp to be added to the transmission data, and adds the determined processing time stamp to the transmission data to generate a data frame 909 ( S1400).
The transmission data processing unit 203 uses a time stamp obtained by adding the addition value in the addition time stamp storage unit 906 to the current time stamp in the time stamp storage unit 905 as a processing time stamp.
The added time stamp of the added time stamp storage unit 906 is the number of cycles that can absorb the allowable error Δt.
For example, the addition time stamp is a value obtained by rounding up the fractional value (Δt / Tc) obtained by dividing the allowable error Δt by the unit time Tc.
Further, a value obtained by rounding up the fractional value (Δ / Tc) to the communication delay between the computer 102a, the computer 103a, and the computer 103b may be used as the addition time stamp.

The transmission data processing unit 903 transmits the data frame 209 to the computers 103a and 103b, which are all transmission destination computers (S701).

In the computer for non-periodic processing, a time stamp update processing unit 910 is added as compared with the configuration of FIG.
An operation example of the reception data processing unit 901 will be described with reference to the flowchart of FIG.
The time stamp update processing unit 910 is activated at time intervals of the unit time Tc.
When activated, the time stamp update processing unit 910 increments the current time stamp by 1 (S1300).
Then, the time stamp update processing unit 910 searches the received data storage unit 904 for data having the processing time stamp 1000 that matches the current time stamp (S1301).
If the corresponding data is found (YES in S1302), the received data processing unit 901 reads the corresponding data from the received data storage unit 904, passes the read data 301 to the application processing unit 902, and then receives the application processing unit 902. The waiting state for reading is canceled (S1303).
In addition, the reception data processing unit 901 deletes the read data 301 and the processing time stamp 1000 from the reception data storage unit 904.
The application processing unit 902 that has been released from the reading waiting state starts processing using the data 301.

*** Explanation of effects ***
As described above, in the present embodiment, a computer that performs non-periodic processing can control the timing at which received data is given to an application by using a time stamp instead of the periodic number in periodic processing.

While the embodiments of the present invention have been described above, one of these two embodiments may be partially implemented.
Alternatively, these two embodiments may be partially combined.
In addition, this invention is not limited to these embodiment, A various change is possible as needed.

Finally, a hardware configuration example of the computer 101, the computer 102, and the computer 103 (hereinafter referred to as the computer 101) described in the above embodiment will be described with reference to FIG.
Each element such as the computer 101 can be realized by a program.
As a hardware configuration of the computer 101 or the like, an arithmetic device 1901, an external storage device 1902, a main storage device 1903, a communication device 1904, and an input / output device 1905 are connected to the bus.

The arithmetic device 1901 is a CPU (Central Processing Unit) that executes a program.
The external storage device 1902 is, for example, a ROM (Read Only Memory), a flash memory, or a hard disk device.
The main storage device 1903 is a RAM (Random Access Memory).
The communication device 1904 corresponds to the physical layer such as the reception data processing unit 1021 and the transmission data processing unit 1023.
The input / output device 1905 is, for example, a mouse, a keyboard, a display device, or the like.

The program is normally stored in the external storage device 1902, and is sequentially read into the arithmetic device 1901 and executed while being loaded in the main storage device 1903.
The program is a program that realizes a function described as “˜unit” (however, excluding “˜storage unit”, the same applies to the following) shown in FIG. 2, FIG. 3, and FIG.
Further, an operating system (OS) is also stored in the external storage device 1902. At least a part of the OS is loaded into the main storage device 1903, and the arithmetic device 1901 executes the OS while FIG. 2, FIG. 3, FIG. A program that realizes the function of “˜unit” shown in FIG.
In the description of the above embodiment, “determine”, “determine”, “extract”, “update”, “compare”, “decide”, “set”, “select” , Information, data, signal values, and variable values indicating the results of the processing described as “generate”, “receive”, and the like are stored in the main storage device 1903 as files.

Note that the configuration of FIG. 16 is merely an example of the hardware configuration of the computer 101 and the like, and the hardware configuration of the computer 101 and the like is not limited to the configuration illustrated in FIG. .

Further, the data processing method according to the present invention can be realized by the procedure shown in the above embodiment.

10 computer system, 100 redundant network, 101 computer, 102 computer, 103 computer, 151 data frame, 152 data frame, 201 reception data processing unit, 202 application processing unit, 203 transmission data processing unit, 204 reception data storage unit, 205 cycle number storage unit, 206 addition cycle number storage unit, 207 time synchronization mechanism, 208 data frame, 209 data frame, 901 reception data processing unit, 902 application processing unit, 903 transmission data processing unit, 904 reception data storage unit, 905 Time stamp storage unit, 906 addition time stamp storage unit, 908 data frame, 909 data frame, 910 time stamp update processing unit, 1021 received data processing unit, 1022 application processing unit, 10 3 the transmission data processing unit 1024 received data storage unit 1025 managing number storage unit, 1027 management number updating unit, 10231 management number determining unit, 10232 data transmission unit.

Claims (10)

1. Each of them updates the management number for time management every predetermined unit time, the error between the management number update timings is less than the tolerance, and each receives the data with the management number added The received data is stored in a plurality of destination computers that process the data with the same management number as the current management number among the stored data.
   A computer that sends data in parallel,
   A management number update unit that updates a management number with an error equal to or less than the allowable error compared to the update timing in the plurality of destination computers;
   A management number storage unit for storing the current management number;
   A management number determination unit that determines a management number to be added to transmission data to be transmitted to the plurality of transmission destination computers, based on the current management number stored in the management number storage unit and the allowable error;
   A computer having a data transmission unit that adds the management number determined by the management number determination unit to the transmission data and transmits the transmission data to which the management number is added to the plurality of transmission destination computers in parallel.
2. The management number determination unit
   The management number to be added to the transmission data is determined based on an integer value obtained by rounding up a fraction of a division value obtained by dividing the allowable error by the unit time and the current management number. calculator.
3. The management number determination unit
   A communication delay value that is a value of a communication delay that occurs with the destination computer, an integer value obtained by rounding up the fractional value obtained by dividing the allowable error by the unit time, and the current management number, The computer according to claim 1, wherein a management number to be added to the transmission data is determined based on the information.
4. The calculator is
   Each of them updates the cycle number for each unit time as the management number, and the error between the update timings of the cycle numbers is less than or equal to an allowable error, and each has a cycle number added as the management number Receive data, store the received data, among the stored data to a plurality of destination computers that process the data with the same cycle number as the current cycle number,
   A computer that sends data in parallel,
   The management number update unit
   Update the cycle number with an error equal to or less than the allowable error compared to the update timing in the plurality of destination computers,
   The management number storage unit
   Storing the current cycle number as the current management number;
   The management number determination unit
   Based on the current cycle number stored in the management number storage unit and the allowable error, determine a cycle number to be added to the transmission data,
   The data transmitter is
   The computer according to claim 1, wherein a cycle number determined by the management number determination unit is added to the transmission data, and the transmission data to which the cycle number is added is transmitted in parallel to the plurality of transmission destination computers.
5. The calculator further includes:
   Receiving a plurality of data transmitted from a plurality of transmission source computers, each of which has a cycle number added thereto, and any one of a plurality of data having a cycle number added after the current cycle number 5. The computer according to claim 4, further comprising: a received data processing unit that stores data in a storage area and reads data to which the same cycle number as the current cycle number is added from the storage area.
6. The calculator is
   Each updates the time stamp for each unit time as the management number, and the error between the time stamp update timings is less than or equal to an allowable error. Each time stamp is added as the management number. Receiving data, storing the received data, among a plurality of transmission destination computers that process the data with the same time stamp as the current time stamp among the stored data,
   A computer that sends data in parallel,
   The management number update unit
   Update the time stamp with an error equal to or less than the allowable error compared to the update timing in the plurality of destination computers,
   The management number storage unit
   Store the current time stamp as the current management number,
   The management number determination unit
   Based on the current time stamp stored in the management number storage unit and the allowable error, determine a time stamp to be added to the transmission data,
   The data transmitter is
   The computer according to claim 1, wherein the time stamp determined by the management number determination unit is added to the transmission data, and the transmission data to which the time stamp is added is transmitted in parallel to the plurality of transmission destination computers.
7. The calculator further includes:
   Receive multiple data sent from multiple source computers, each with a time stamp, and select one of multiple data with a time stamp after the current time stamp. A received data processing unit for storing in the storage area;
   The computer according to claim 6, further comprising: a time stamp update processing unit that reads data to which the same time stamp as the current time stamp is added from the storage area.
8. The calculator is
   It is composed of a plurality of layers, each layer is multiplexed by two or more computers, and each computer is included in a computer system that updates the management number every unit time,
   The computer according to claim 1, wherein a maximum error in the update timing of the management number among computers included in the computer system is the allowable error.
9. Each of them updates the management number for time management every predetermined unit time, the error between the management number update timings is less than the tolerance, and each receives the data with the management number added The received data is stored in a plurality of destination computers that process the data with the same management number as the current management number among the stored data.
   A data processing method performed by a computer that transmits data in parallel,
   The computer updates the management number with an error equal to or less than the allowable error compared to the update timing in the plurality of destination computers.
   The computer stores the current management number,
   The computer determines a management number to be added to transmission data to be transmitted to the plurality of transmission destination computers based on the current management number and the tolerance.
   A data processing method in which the computer adds the determined management number to the transmission data, and transmits the transmission data to which the management number is added to the plurality of destination computers in parallel.
10. Each of them updates the management number for time management every predetermined unit time, the error between the management number update timings is less than the tolerance, and each receives the data with the management number added The received data is stored in a plurality of destination computers that process the data with the same management number as the current management number among the stored data.
    To computers that send data in parallel,
    A management number update process for updating a management number with an error equal to or less than the allowable error compared to the update timing in the plurality of destination computers;
    A management number storage process for storing the current management number;
    A management number determination process for determining a management number to be added to transmission data to be transmitted to the plurality of destination computers based on the current management number stored in the management number storage process and the allowable error;
    A program for adding a management number determined by the management number determination process to the transmission data, and executing a data transmission process for transmitting the transmission data to which the management number is added to the plurality of destination computers in parallel .
    

Images