JP2005202779A - Synchronous processing method for distributed computer system - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To solve the problems wherein conventional synchronous processing techniques are unsuitable for an application that must not be stopped and are difficult to use in synchronizing nodes of a distributed computer system. <P>SOLUTION: For synchronization of nodes in a distributed computer system, each node starts a synchronous timer ST corresponding to a period of synchronous processing and, upon the end thereof, broadcasts synchronization messages SM on a network. After the start of an authentication window Wq, upon exchange of a plurality of synchronization messages SM, which meets synchronization conditions, the start timing of the synchronous timer ST is autonomously adjusted so as to match common timing obtained from the exchange timing of the synchronization messages SM, and the synchronous timer ST is started at the start timing. <P>COPYRIGHT: (C)2005,JPO&NCIPI

Description

  The present invention relates to a synchronization processing method for a distributed computer system in which a plurality of computers are connected to each other via a network. In particular, the present invention is used to perform synchronization between computer nodes in a distributed computer system that requires real-time performance and fault tolerance. The present invention relates to a synchronous processing method.

  In general, in a computer system such as a personal computer, a workstation, an embedded computer, an on-board computer, and a control computer, instead of using a single computer, a plurality of computers are connected to each other via a network composed of some kind of information transmission medium. A computer system may be used. This distributed computer system requires a computer system when a single computer lacks computing power, when a single computer lacks reliability, or when there is a physically wide range of objects to be controlled by the computer system. It is suitable for use in the case where the change of is frequent.

  By the way, some applications that operate on a distributed computer system operate under some real-time constraints. Such an application is called a real-time application. For example, data is periodically acquired from a sensor that is an input target, necessary calculations are performed, and results are periodically output to an actuator that is an output target. Some output When such a real-time application is operated on a distributed computer system, it is necessary to synchronize each computer node (hereinafter referred to as “node”) constituting the distributed computer system within a predetermined time range. become.

  More specifically, FIG. 1 is a diagram illustrating an example of a distributed computer system. The illustrated distributed computer system includes a plurality of sensor nodes Nsa and Nsb connected to individual sensors Sa and Sb, and a plurality of controls. The operation nodes Nc1, Nc2, Nc3 and a plurality of output nodes Na1, Na2, Na3 connected to the actuator A via the majority circuit Vo are provided, and the nodes Ns, Nc, Na are connected to each other by a network NW.

  In the illustrated distributed computer system, when sensor nodes Nsa and Nsb send request signals to sensors Sa and Sb in order to obtain data, it is necessary to obtain data sensed at the same time from the sensors Sa and Sb. If there is, the sensor nodes Nsa and Nsb must send a request signal to each of the sensors Sa and Sb with a time difference within a predetermined range, and thus need to have a common timing. Considering the case where a control signal is transmitted to the actuator A, in the case shown in the figure, each output signal of the output nodes Na1, Na2, and Na3 forming a redundant system is ensured by the majority circuit Vo to ensure reliability. Make one signal. At this time, each of the output nodes Na1, Na2, and Na3 must have a common timing because each output signal for the majority circuit Vo must be within a predetermined time range.

  As described above, the real-time application is required to synchronize the nodes constituting the distributed computer system within a predetermined time. In general, each node has its own oscillator, and these oscillators drift with time. Therefore, it is necessary to perform timing adjustment, that is, synchronization processing at an appropriate cycle between nodes.

  By the way, even if it is a real-time application, there are various real-time properties and reliability required. In other words, there are cases where the tolerance of timing variation between nodes is large and small, and the period for performing control and the response time from input to output range from several milliseconds to several seconds. Some require high reliability and some do not. Furthermore, there are cases where multiple applications with different real-time requirements and reliability requirements coexist in the system at the same time, and the request level changes over time. There is a case to do.

  For this reason, it is very expensive to build a dedicated synchronization processing method according to the requirements of each application. To achieve low-cost synchronization, versatility that can flexibly support various applications. There must be a high synchronous processing method. Such a synchronous processing method must be applicable to all cases regardless of the reliability requirement level or the real-time requirement level, and for example, needs to satisfy the following requirements (A) to (C): There is.

(A) Even if one or more nodes in the distributed computer system are temporarily out of synchronization due to a failure, the existing synchronization state must continue to be established without stopping in the remaining nodes. In addition, even if one or more nodes recover from a failure, add one or more nodes to the system, or even if some of the nodes in the system are in the test state, It must continue to be established without stopping. Furthermore, since the number of nodes used varies depending on the type of application and the failure rate of the components used, and they can change with time, it should not be a method in which the number of nodes constituting the synchronous system is fixed. .

(B) When the request for synchronization accuracy between multiple synchronized nodes dynamically changes, when the reliability requirement for the synchronization system (mis-synchronization probability request) changes dynamically, or the synchronization accuracy and reliability Even when a plurality of applications having different request levels coexist in the system, the system must be able to cope without stopping the processing and output of the application.

(C) In order to realize cost reduction, it must be possible to construct using existing general-purpose hardware.

  Here, in the computer system, as a synchronization processing technique for realizing fault tolerance (fault tolerance), for example, when a clock message from a timekeeper station is received when synchronizing the operating system time clocks of a plurality of stations. The time keeper station calculates the reception time of the clock message from its operating system time clock and free running counter, and broadcasts this time keeper reception time to other stations. The other station then calculates its own reception time from its operating system time and the count of its free running counter. It was something to correct the operating system time by the difference between the keeper reception time.

In a fault-tolerant system consisting of multiple redundant systems, each redundant system has an independent clock oscillator and a clock oscillator that is common to all redundant systems. There was something to be used.
JP-A-6-52076 Japanese Patent Laid-Open No. 3-266011

  In the conventional synchronization processing method as described above, when the time keeper station supplies common timing to the entire system, if the time keeper station fails, the synchronization processing is temporarily stopped until the next time keeper is selected. For this reason, it cannot be used for an application where stoppage is not permitted, and the failed station may become a timekeeper illegally and disturb the synchronization system. Further, the method using a clock oscillator common to all redundant systems cannot be used for synchronization between nodes in a general distributed computer system.

  According to a distributed processing method of a distributed computer system of the present invention, as claimed in claim 1, when performing synchronization between computer nodes in a distributed computer system in which a plurality of computers are connected to each other via a network, each node performs a synchronization process. When the synchronization timer is transmitted and received, the synchronization message is transmitted to all the other nodes by broadcasting the synchronization message on the network when the synchronization timer expires. When an authentication window is started and a plurality of predetermined synchronization messages are transmitted and received during the authentication window, the synchronization timer is set so that the synchronization timing is met and the common timing obtained from the transmission / reception timing of the synchronization message is matched. Autonomous adjustment of start time and start time When the synchronization timer is started and the synchronization timer of the own node has not expired when the synchronization condition is satisfied, the synchronization timer is started again without broadcasting the synchronization message on the network. As a means to solve the problem.

  Further, according to the synchronous processing method of the distributed computer system of the present invention, as claimed in claim 2, when adding a node to an existing synchronous system, when the node is after resetting or after power-on, and when a failure occurs in the node When the node becomes asynchronous, the corresponding node starts an asynchronous timer for a predetermined time, and when the asynchronous timer ends, broadcasts a synchronous message on the network and sends the synchronous message to all other nodes. On the other hand, when a synchronization message is transmitted / received, an authentication window for a predetermined time is started, and when a plurality of predetermined synchronization messages are transmitted / received in the authentication window, a synchronization timer is started as a synchronization condition is satisfied. If the synchronization condition is not satisfied in the authentication window even though the synchronization message is sent and received Is characterized in that the asynchronous timer is restarted, and according to claim 3, a time stamp is written in the synchronization message as necessary, and the time of synchronization timer start timing coincides between a plurality of nodes. According to claim 4, each node autonomously sets the time of a synchronous timer, an asynchronous timer, and an authentication window in response to a dynamic change of an application request or a change of environmental conditions. According to a fifth aspect of the present invention, a node that receives a synchronization message is described in the synchronization message as needed, wherein a node identification number of a node that transmits the synchronization message is described in the synchronization message without duplication on the network. In the authentication window, multiple synchronization messages received from the same node within the predetermined time are received in the authentication window. It is characterized in that not count as the synchronization number of messages.

  According to the synchronous processing method of the distributed computer system according to claim 1 of the present invention, since synchronization between a plurality of nodes is possible without requiring a master node that can be a single failure point, fault tolerance (fault tolerance) ), And if the synchronization condition is met before the synchronization timer of the local node expires, the transmission of the synchronization message on the network is autonomously suppressed, so the increase in network load is suppressed. Thus, the limit on the number of nodes that can participate in synchronization can be removed. Furthermore, even if multiple nodes fail at the same time, it is possible to continue synchronization without interruption without affecting the established synchronization system. Since no special hardware is required other than using a network capable of broadcasting, the present invention can be applied to any type of application that requires synchronization, and the cost can be reduced.

  According to the synchronous processing method of the distributed computer system according to claim 2 of the present invention, the same effect as that of claim 1 can be obtained, and a plurality of nodes can participate in or return to a synchronous system that has already been established. It is possible to continue synchronization without stopping the entire system without affecting the established synchronization system, and even when starting the entire system, It is possible to synchronize with only a standard configuration without requiring a special hardware mechanism for distinguishing from the time of recovery and recovery.

  According to the synchronous processing method of the distributed computer system according to claim 3 of the present invention, the same effects as in claims 1 and 2 can be obtained, and not only the synchronization among a plurality of nodes but also the time stamp Since matching is performed, it is also effective for an application having a processing cycle longer than the cycle for performing the synchronization processing.

  According to the synchronous processing method of the distributed computer system according to claim 4 of the present invention, the same effects as in claims 1 to 3 can be obtained, and the real-time requirement and reliability requirement of the application change dynamically. In this case, synchronization can be realized even when a plurality of applications having different levels of real-time requirements and reliability requirements are mixed in the system.

  According to the distributed computer system synchronization processing method of the fifth aspect of the present invention, the same effects as in the first to fourth aspects can be obtained, and a failed node can transmit a plurality of synchronous messages. The failure due to can be eliminated.

  The hardware used for the synchronous processing method of the distributed computer system of the present invention is the following nodes and network. Note that the network generally represents the state of the entire organization, but here shows an information transmission medium for connecting nodes.

  The node 1 shown in FIG. 2 includes a processor 2, a memory 3, a clock 4, a timer 5, a network connection interface 6, and a local I / O interface 7, and as a hardware device for failure countermeasures, a watch is used as necessary. A dog timer (WDT) 8, an overcurrent detection / shut-off circuit 9, and an EDAC circuit 10 for detecting and correcting bit inversion of the memory are provided. The distributed computer system is configured by connecting a plurality of nodes 1 to each other via a network NW.

  The network connection interface 6 is used to connect a plurality of nodes 1 to each other via the network NW, and a double or triple redundant configuration can be adopted as necessary. The hardware device connected to the tip of the local I / O interface 7 differs depending on the application, and in the case of a computer having a man-machine interface such as a personal computer or a workstation, it is a monitor, a keyboard, a mouse, etc. In the case of a computer or an on-board computer, it is a sensor or an actuator.

  Here, in the synchronous processing method, since the synchronous processing is realized even when there is no special node with high reliability, there is no special node (master node) such as a timekeeper node in the distributed computer system, It is assumed that any node 1 can fail. In addition, since the synchronization processing method achieves high non-stop and expandability, each node is an autonomous entity and receives data from the network connection interface 6 or the local I / O interface 7. The content is examined and an appropriate process is started by autonomous judgment, the timer is managed by itself, and a message is transmitted from the network connection interface 6 or the local I / O interface 7 at a timing judged to be appropriate. ing.

  Furthermore, in order to synchronize between nodes, if each node 1 is provided with a plurality of types of dedicated interfaces, the coupling between the nodes becomes dense and the number of nodes that perform synchronization is fixed. Therefore, in order to enable the distributed computer system to adopt a configuration having a flexible number of nodes, only the network NW is connected between the nodes. The network NW may be either one used only for synchronization processing or one used in combination with synchronization processing and application processing. Further, the network NW may have a redundant configuration as shown in FIG. 1 in order to ensure reliability. Furthermore, the network NW may be configured by wire, wireless, or both.

  As described above, the hardware used in the synchronous processing method of the distributed computer system of the present invention is only the node 1 having a standard configuration and the network NW capable of broadcasting, and other special hardware is required. do not do. Accordingly, the synchronization processing method described below can be applied to any application that requires synchronization.

  FIG. 3 is a state transition diagram of the node 1, and FIG. 4 is a state transition diagram of the node 1 when N = 2 as a synchronization establishment condition. 3 and 4, each node 1 that implements the synchronous processing method is in one of a synchronous state (S), a synchronous transition state (T), an asynchronous state (A), and an initial state (I). .

  The synchronization state (S) is a state in which the synchronization timer ST of the own node 1 operates and is synchronized with at least one set of other nodes. The synchronous transition state (T) is an intermediate state in which the synchronous timer ST and the asynchronous timer AT of the node 1 do not operate and the state shifts from the synchronous state to the asynchronous state, or the intermediate state shifts from the asynchronous state to the synchronous state. The asynchronous state (A) is a state in which the own node 1 is not synchronized with any other node, and the asynchronous timer AT is operated for synchronization. The initial state (T) is a state in which the synchronization process has not yet started, such as when the node 1 is initialized after power-on or reset, or immediately after a failure occurs.

  Here, in FIGS. 3 and 4, the synchronization timer ST is a timer whose count value increases with the passage of time with 0 as an initial value, and the time corresponding to the maximum count value is a time Ts (seconds) common to all nodes. ), And is used for each node to recognize the timing at which the synchronization process is performed and the next synchronization process is performed. However, the time Ts corresponding to the maximum count value of the synchronization timer ST is variable as required. The asynchronous timer AT is a timer whose count value increases with the passage of time with 0 as an initial value, and the time corresponding to the maximum count value is set to a common time Ta (seconds) in all nodes. Sometimes used to synchronize with other nodes. However, the time Ta corresponding to the maximum count value of the asynchronous timer AT is variable as required.

  In FIGS. 3 and 4, symbol Wq is an authentication window, and this authentication window Wq is a timer whose count value increases with the passage of time with 0 as an initial value, and the time corresponding to the maximum count value is A common time Twq (seconds) is set in all the nodes, and is used to determine the validity of the synchronization message SM depending on whether the reception timing of the received synchronization message SM is within or outside the authentication window Wq. However, the time Twq corresponding to the maximum count value of the authentication window Wq is variable as required. The code SM is a synchronization message, and this synchronization message SM has a time stamp (sequence number) written in its data part as necessary, and transmits the synchronization message SM inside the data as necessary. A node identification number that is not duplicated on the network NW of the node is described. Further, the symbol N is the number of synchronization messages SM necessary for establishing the synchronization condition, and the symbol nrt is the number of synchronization messages SM transmitted / received during the authentication window Wq. The number nrt of the synchronization messages SM is the number of synchronization messages SM having the same time stamp among the synchronization messages SM transmitted / received in the authentication window Wq when the time stamp match is included when the synchronization condition is satisfied. It should be noted that the number nrt of the synchronization messages may be set from the same node within a predetermined time within the authentication window Wq in order to eliminate the influence of the erroneous transmission of the synchronization message SM by the failed node. This is not counted even if the synchronization message SM is received.

  The synchronization processing method can also be called an autonomous timing synchronization processing method. In the basic processing, each node starts a synchronization timer ST at a time Ts corresponding to a period for performing the synchronization processing, and when the synchronization timer ST ends, the network The synchronization message SM is broadcast on the NW, and the synchronization message SM is transmitted to all other nodes. On the other hand, when the authentication window Wq has not been started, each node authenticates the predetermined time Twq when receiving the synchronization message SM from another node or when transmitting the synchronization message SM itself. When the synchronization window SM is started and a plurality of predetermined synchronization messages SM (N = 2 in FIG. 4) are transmitted / received in the authentication window Wq, the common condition obtained from the transmission / reception timing of the synchronization message SM as the synchronization condition is established. The start time of its own synchronization timer ST is autonomously adjusted so as to coincide with this timing, and the synchronization timer ST is started at that start time.

  On the other hand, if the synchronization timer ST of the own node is not expired when the synchronization condition is satisfied, the synchronization timer ST is started again without broadcasting the synchronization message SM on the network NW. In this way, synchronization is established when all the nodes that want to synchronize perform the same processing. Each node that wishes to synchronize application processing between a plurality of nodes starts the processing when the value of each synchronization timer ST reaches a predetermined value, so that the processing is synchronized between the plurality of nodes. Will be implemented.

  In addition, in the synchronous processing method, when adding a node to an existing synchronous system, when the node is reset or after power is turned on, or when a failure occurs in the node, the node becomes asynchronous. At this time, the corresponding node starts the asynchronous timer AT for a predetermined time Ta, broadcasts the synchronous message SM on the network NW when the asynchronous timer AT ends, and transmits the synchronous message SM to all other nodes. On the other hand, when the authentication window Wq has not been started, each node authenticates the predetermined time Twq when receiving the synchronization message SM from another node or when transmitting the synchronization message SM itself. When the synchronization window ST is started and a plurality of predetermined synchronization messages SM are transmitted / received in the authentication window Wq, the synchronization timer ST is started as the synchronization condition is satisfied. The subsequent operation of the synchronization timer ST is as described above.

  On the other hand, when the synchronization condition is not satisfied in the authentication window Wq despite the transmission / reception of the synchronization message SM, each node starts the asynchronous timer AT again and repeats the above processing. In this way, synchronization is finally established.

  Further, in the synchronization processing method, a time stamp is described in the synchronization message SM as necessary, and the time stamps are matched at the same time as the synchronization timer ST start times are matched between a plurality of nodes. This is also effective for an application having a processing cycle longer than the cycle for performing the synchronization processing.

  Further, according to the synchronous processing method, each node autonomously synchronizes the timer T, the asynchronous timer AT, and the time Ts of the authentication window Wq in accordance with a predetermined logic in accordance with a dynamic change in an application request or a change in environmental conditions. , Ta, and Twq are changed, the application's real-time requirements and reliability requirements change dynamically, or multiple applications with different levels of real-time requirements and reliability requirements are mixed in the system But synchronization can be achieved. When a plurality of applications having different request levels are mixed in the system, an individual synchronous timer ST, asynchronous timer AT, and authentication window Wq may be set for each application.

  Further, in the synchronization processing method, a node identification number having no duplication on the network NW of the node that transmits the synchronization message SM is described in the synchronization message SM as necessary, and the node that receives the synchronization message SM By not counting the synchronization messages SM received from the same node within the predetermined time in the authentication window Wq as the number of synchronization messages nrt received in the authentication window Wq, the failed node can receive a plurality of synchronization messages SM. Can be eliminated.

  As a means for mounting the synchronous timer ST, the asynchronous timer AT, and the authentication window Wq, either a hardware method or a software method may be used. When the timers ST and AT end their operations, they notify the processor that they have ended using an interrupt function or the like. The time Ta of the asynchronous timer AT may be longer, shorter or the same as the time Ts of the synchronous timer ST.

  There are several methods for determining the start time of the synchronization timer ST from the transmission / reception timings of a plurality of synchronization messages SM transmitted / received during the authentication window Wq (the “ST count value setting” portion in FIGS. 3 and 4). . For example, the timing at which the m (1 ≦ m ≦ N) -th synchronization message SM is transmitted / received for the transmission / reception of N synchronization messages SM, which is a condition for establishing synchronization, may be set as the start time of the synchronization timer ST. it can. Further, in order to correct variations in the synchronization processing cycle (Ts) for each synchronization processing, after a predetermined offset time k (seconds) elapses from the timing at which each node transmits and receives the m-th synchronization message SM, the synchronization timer ST May be started. Furthermore, in order to correct the variation between nodes, the offset time k (seconds) may be different for each node or a negative value. As an example of a method of determining the start time of another synchronization timer ST, there is a method of determining by the average of transmission / reception timings of all or a part of the synchronization messages SM transmitted / received during the authentication window Wq.

  As conditions for the time Twq of the authentication window Wq, assuming that the variation in internal processing time between nodes and within a single node is σts, the variation in clock drift time is σcd, and the variation in network access time is σba, these variations are The time Twq of the authentication window Wq needs to be long enough to allow these variations, and at least satisfies σts + σcd + σba <Twq, since it is inevitably generated when using the distributed computer system. It shall be.

  In an application that performs processing in a cycle longer than the synchronization processing cycle (Ts) by describing a time stamp in the synchronization message SM and performing time stamp matching during synchronization between a plurality of nodes, Application processing can be synchronized between nodes using a time stamp. At this time, as an example of the time stamp setting method, there is a method of starting from 0 when the node is activated and adding a constant value for each synchronization process. When it is incorporated into the existing synchronous system from the middle, such as addition or recovery from failure, a time stamp agreed on by the existing synchronous system may be adopted and added from there.

  The maximum drift rate of the clock used for the node is ρ (seconds / second), the synchronization accuracy between the nodes required by the application is Π (seconds), and the maximum synchronization variation between the nodes immediately after the synchronization processing is Πi (seconds). ), The synchronization processing period (set time of the synchronization timer ST) Ts (seconds) satisfies Ts <(Π−Πi) / 2ρ. In the present invention, when the synchronization accuracy required by an application changes with time, or when a plurality of applications having different synchronization accuracy requirements coexist in the system, each node determines a logic (calculation formula) determined in advance. Accordingly, the synchronization processing cycle Ts can be lengthened or shortened.

  Further, the time Twq (second) of the authentication window Wq is related to the number N of synchronization messages SM necessary for establishing the synchronization condition. That is, in order to avoid the phenomenon of false synchronization in which wrong nodes are synchronized and other normal nodes are synchronized at wrong timing, the number N of synchronization messages SM may be increased. If it is increased, the time Twq of the authentication window Wq needs to be set longer accordingly.

  In the synchronization processing method, when a request for avoiding mis-synchronization (synchronous reliability request) changes with time, or when a plurality of applications having different levels of synchronous reliability requirements coexist in the system, it is adjusted accordingly. The time Twq of the authentication window Wq can be changed. Generally, by shortening the time Ts of the synchronization timer ST or shortening the time Twq of the authentication window Wq, the time spent for the synchronization process is relatively shortened, and the time that can be spent for the application process is relatively long. There is an advantage that can be. The notification of the time change of the synchronization accuracy request or the synchronization reliability request to each node can be performed, for example, through a network connection interface or a local I / O interface.

  Next, specific operations when each node performs processing according to the algorithm described above will be described with reference to FIGS. Each figure shows the process of a certain node, and represents the passage of time from left to right. The following example shows a case where N = 2 as a condition for establishing synchronization, and the time when the second synchronization message SM is received in the authentication window Wq is set as the start time of the next synchronization timer ST.

  FIG. 5 is a diagram for explaining synchronization state update and removal of asynchronous elements. Each node starts a synchronization timer ST at a time Ts corresponding to the period for performing the synchronization process, and when this synchronization timer ST ends, broadcasts a synchronization message SM on the network NW as shown in FIG. Then, the synchronization message SM is transmitted to all other nodes. Further, when the synchronization message SM of another node is received from the network NW when the authentication window Wq is not operating, the authentication window Wq is started as shown in FIG. 5 (b). When the second synchronization message SM is transmitted / received during the authentication window Wq, the synchronization timer ST is newly started as the synchronization condition is satisfied, as shown in FIG. 5C.

  When the synchronization message SM is received from another node in the state where the synchronization condition is satisfied, and the second synchronization message SM is not received in the authentication window Wq started by this, FIG. As shown in d), it is determined that the first synchronization message SM is from an asynchronous node due to the occurrence of a failure or the like, and is ignored and the synchronization timer ST is not started. This in many cases eliminates asynchronous synchronous messages SM at each node. If there is a sufficient number of other asynchronous nodes that synchronize with the synchronization message SM at the incorrect timing, the synchronization condition is satisfied at the incorrect timing. However, even in this case, since all the nodes follow this as a positive state, a plurality of different synchronous systems do not continue to converge and converge to one synchronous system. Further, in order to reduce the possibility of synchronization at the incorrect timing as described above, N, which is a condition for establishing synchronization, may be increased.

  FIG. 6 is a diagram for explaining the update of the synchronization state. Here, before receiving the synchronization message SM of the other node, the synchronization timer ST of the own node expires, and as shown in FIG. 6A, the synchronization message SM is transmitted, and in FIG. As shown in FIG. 6C, after starting the authentication window Wq and moving to the synchronous transition state once, at least one synchronization message SM of another node is received in the authentication window Wq. Shows how the synchronization condition is satisfied.

  FIG. 7 is a diagram for explaining suppression of autonomous transmission of the synchronization message SM. Here, each node receives a synchronization message SM from another node before starting its own synchronization timer ST, starts an authentication window Wq, and a synchronization condition is satisfied in this authentication window Wq. In the case where the synchronization timer ST has not expired when the synchronization condition is satisfied, the synchronization message SM is not broadcast to the network NW. By performing such an operation, each node can establish synchronization without increasing the load on the network NW due to an increase in the synchronization message SM even if the number of nodes performing synchronization is large. Therefore, the limitation on the number of nodes performing synchronization can be eliminated.

  FIG. 8 is a diagram for explaining an operation when adding a node to an existing synchronous system / returning a failed node. More specifically, when a plurality of nodes are newly added to the existing synchronous system, or when a failure occurs in a certain node and the node once leaves the synchronous system (offline) to repair it, and then returns. Shows the operation. The failure assumed at the time of recovery includes a transient failure. In this case, the memory contents are corrected by the EDAC circuit, the node is powered off / repowered (power cycle), and the processor Restoration is performed by resetting or the like.

  When a node is added to an existing synchronous system, or after the above repair has been performed on a failed node (after initialization in the case of a power cycle or reset), the node Asynchronous timer AT starts. At this time, since the nodes other than the addition / return node are in a synchronous state and constitute a synchronous system, before the elapsed time of the asynchronous state reaches the time Ts of the synchronous timer ST, the synchronization of the other node is performed in the authentication window Wq. Two or more messages SM are received. That is, the add / return node is incorporated into the synchronous system within the time Ts from the start of the asynchronous timer AT.

  If the time Ta of the asynchronous timer AT is shorter than the time Ts of the synchronous timer ST, the asynchronous timer AT ends if the synchronous message SM of another node is not received within the time Ta of the asynchronous timer AT. At this time, this node broadcasts the synchronization message SM to the network NW. However, since the synchronization message SM is transmitted only at the add / return node at this timing, if the number of nodes to be added / return at the same time does not satisfy the formula N, which is the condition for establishing synchronization, the other nodes already synchronized Is ignored and the existing synchronous system is not disturbed.

  As described above, since the add / return node does not affect the operation of the normal node that is operating, the add / return node can be incorporated into the existing synchronous system without stopping as a computer system. This means that the non-stop property and expandability of the synchronous processing method are high. Note that when the number of synchronized nodes is less than the N formula, which is a condition for establishing synchronization, due to a failure or the like, this corresponds to an operation at the time of system startup described later.

  FIG. 9 is a reference diagram for explaining the operation at the initial stage of the system when the computer system has a set of nodes. After the power is turned on and the initialization process is completed, the node enters an asynchronous state and starts the asynchronous timer AT similarly to the return. When the asynchronous timer AT expires, the synchronous message SM is broadcast to the network NW according to the algorithm described above, and the authentication window Wq is started to enter a synchronous transition state. However, since there is no other node in the system, the synchronization message SM from the other node is not received during the authentication window Wq, so that the synchronization condition is not satisfied and the asynchronous timer AT is started again. Return to the asynchronous state. Thus, when there is only one set of nodes in the system, the above operation is repeated.

  FIG. 10 is a diagram for explaining the operation at the time of starting the system. As an example, there are two nodes: the first node that is powered on (upper side) and the second node that is powered on (lower side). The operation is shown.

  When there are a plurality of nodes that should form a synchronous system in the computer system, it is considered that the power supplies of all the nodes are turned on almost simultaneously when the entire system is started, and the initialization is completed approximately at the same time. After initialization, each node starts an asynchronous timer AT in the same way as when returning, and the first node that first ends the asynchronous timer AT broadcasts the synchronous message SM to the network NW. At this time, the second ON node receives the synchronous message SM from the first ON node before the asynchronous timer AT expires.

  When the synchronous message SM is received in the asynchronous state, the authentication window Wq is started to enter the synchronous transition state. As shown in FIG. 10A, the number of synchronous messages SM transmitted / received in the authentication window Wq. If the synchronization condition is not satisfied because N is less than N, the asynchronous timer AT is started again to return to the asynchronous state. Even in the first turned-on node, the synchronization condition is not satisfied, so the asynchronous timer AT is started again. Since the asynchronous timer AT of the node that is turned on secondly ends when the asynchronous timer AT of the node that is turned on first ends, the synchronous message SM is transmitted from any node at this time. As shown in FIG. 10B, the synchronization condition is satisfied.

  The time until the synchronization condition is satisfied is determined by the start time difference of the first N-type asynchronous timer AT. That is, assuming that the start time difference of the asynchronous timer AT after the initialization of the first N node is Tg (seconds), the time Tsyn (seconds) until the N-type synchronization condition is satisfied is Tsyn = Ta when Tg = 0. (Asynchronous timer length), Tsyn = 2Ta when 0 <Tg <Ta, and Tsyn = 3Ta (hereinafter the same) when Ta <Tg <2Ta.

  Further, all the nodes that have started the asynchronous timer AT before the establishment of the synchronization condition are similarly synchronized at the above time. Further, the synchronization condition establishment time Tsyn of the node that is turned on late and started the asynchronous timer AT after the establishment of the synchronization condition is treated the same as the return, and within the time Ts of the synchronization timer ST after the start of the asynchronous timer AT. The synchronization condition is satisfied.

  As described above, by setting the time Ta of the asynchronous timer AT to be shorter than the time Ts of the synchronous timer ST, the synchronization condition establishment time Tsyn at the time of system startup is shorter than the synchronous incorporation time Trs (maximum Ts) at the time of node addition / return. can do. However, if the time Ta of the asynchronous timer AT is made too short, the number of synchronization messages SM broadcast until resynchronization is established at the time of addition / return increases. In this way, even when the system is started, synchronization can be established without using special hardware, regardless of the number of nodes that need to be synchronized using the same logic as when adding / returning.

1 is a diagram illustrating an example of a distributed computer system. It is a figure explaining the structure of a computer node. It is a state transition diagram of a node. It is a state transition diagram of a node when N = 2 as a synchronization establishment condition. It is a figure explaining the update of a synchronous state, and exclusion of an asynchronous element. It is a figure explaining the update of a synchronous state. It is a figure explaining suppression of the autonomous transmission of a synchronous message. It is a figure explaining the operation | movement at the time of the addition of the node to the existing synchronous system / return of a failure node. It is a reference figure explaining operation | movement at the time of the system initial stage in case a node is a set in a computer system. It is a figure explaining operation | movement at the time of system starting.

Explanation of symbols

1 node AT asynchronous timer NW network SM synchronous message ST synchronous timer Wq Authentication window

Claims (5)

  When synchronizing computer nodes in a distributed computer system in which a plurality of computers are connected to each other via a network, each node starts a synchronization timer for a time corresponding to the period for performing the synchronization processing, and the network is terminated with the end of the synchronization timer. While broadcasting a synchronization message and sending a synchronization message to all other nodes, when a synchronization message is transmitted / received, an authentication window for a predetermined time is started, and a plurality of predetermined synchronizations are performed in the authentication window. When a message is sent / received, the start time of its own synchronization timer is autonomously adjusted so that it matches the common timing obtained from the transmission / reception timing of the synchronization message as the synchronization condition is satisfied, and the synchronization timer is started at that start time. And the synchronization timer of the local node expires when the synchronization condition is met If not, the synchronization processing method of distributed computer system, characterized in that to start again a synchronization timer without broadcast synchronization messages over the network.   When adding a node to an existing synchronous system, when the node is reset or after power is turned on, or when a failure occurs in the node, the corresponding node becomes Asynchronous timer is started for a predetermined time, and when the asynchronous timer ends, a synchronous message is broadcast on the network and sent to all other nodes. When the window is started and a plurality of predetermined synchronization messages are sent and received during the authentication window, the synchronization timer is started as the synchronization condition is established, and the synchronization condition is not found in the authentication window even though the synchronization message is sent and received. 2. The distributed controller according to claim 1, wherein if it does not hold, the asynchronous timer is restarted. Synchronization processing method of Yutashisutemu.   The time stamp is described inside the synchronization message as necessary, and the time stamps are matched simultaneously with the synchronization timer start timings among a plurality of nodes. Method for synchronous processing of distributed computer systems.   The node according to any one of claims 1 to 3, wherein each node autonomously changes the time of the synchronous timer, the asynchronous timer, and the authentication window in response to a dynamic change in an application request or a change in environmental conditions. The synchronous processing method of the distributed computer system of description.   If necessary, describe the node identification number of the node that sends the synchronization message in the synchronization message so that there is no duplication on the network, and the node that receives the synchronization message is the same within the authentication window within the predetermined time. 5. The synchronization processing method for a distributed computer system according to claim 1, wherein a plurality of synchronization messages received from the node are not counted as the number of synchronization messages received in the authentication window.

Images