Computer system and cluster management method

JP2026103339APending Publication Date: 2026-06-24HITACHI LTD

Patent Information

Authority / Receiving Office
JP · JP
Patent Type
Applications
Current Assignee / Owner
HITACHI LTD
Filing Date
2024-12-12
Publication Date
2026-06-24

AI Technical Summary

Benefits of technology

【0008】 本発明によれば、低コストで、高い可用性を確保し、かつ、スプリットブレインを回避できるクラスタを実現できる。上記した以外の課題、構成及び効果は、以下の実施例の説明により明らかにされる。

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure 2026103339000001_ABST
    Figure 2026103339000001_ABST
Patent Text Reader

Abstract

To create a cluster that is low-cost, highly available, and avoids the split-brain problem. [Solution] The computer system includes a server system in which multiple server nodes are running, and a client system in which multiple nodes are running, and includes a cluster consisting of two server nodes and one node. In the cluster, one server node is a leader node that functions as the leader of a leader-follower cluster management algorithm, the other server nodes are follower nodes that function as followers of the leader-follower cluster management algorithm, and the node is a monitor node that functions as a monitor that votes for the election of the leader.
Need to check novelty before this filing date? Find Prior Art

Claims

1. A computer system, It includes a server system consisting of multiple computers and running multiple server nodes that provide services, and a client system consisting of multiple computers and running multiple nodes, The plurality of nodes of the client system include a plurality of gateway nodes and a plurality of client nodes that utilize the services provided by the server node. The computer system includes a first cluster consisting of two server nodes and one node, In the first cluster, One of the server nodes is a leader node that functions as the leader of a leader-follower type cluster management algorithm. The other server nodes are follower nodes that function as followers of a leader-follower type cluster management algorithm. A computing system characterized in that one of the nodes is a monitor node that functions as a monitor for voting in the election of a leader.

2. A computer system according to claim 1, The first cluster is a node of the client system and includes a spare node which is a spare for the monitor node. Each of the leader node, follower node, monitor node, and spare node monitors the health status of the communication path connecting each of the leader node, follower node, monitor node, and spare node. The computer system is characterized in that the leader node changes the configuration of the first cluster so that a new leader node can be selected when a failure is detected in one of the communication paths.

3. A computer system according to claim 2, A computer system characterized in that, when the leader node detects a failure in the communication path connecting the follower node and the monitor node, it changes the monitor node to the spare node and changes the spare node to the monitor node.

4. A computer system according to claim 2, A computer system characterized in that, when the leader node detects a failure in the communication path connecting the leader node and the follower node, it removes the follower from the first cluster and changes the spare node to the monitor node.

5. A computer system according to claim 2, The server system includes a plurality of upper-level server nodes that provide services to the leader node and the follower node. The computer system includes a second cluster comprising two upper-level server nodes, the leader node of the first cluster, and the follower nodes of the first cluster. In the second cluster, One of the aforementioned upper-level server nodes is the leader node of the second cluster, The other upper-level server nodes are the follower nodes of the second cluster, The leader node of the first cluster is the monitor node of the second cluster, A computer system characterized in that the follower node of the first cluster is the spare node of the second cluster.

6. A computer system according to claim 1, The R Monitor node is If there is a possibility that the leader node is failing, the requests to be sent to the leader node are stored in a queue. A computer system characterized by transmitting the requests accumulated in the queue to the leader node when the failure of the leader node has been resolved.

7. A cluster management method performed by a computer system, A computer system comprising a server system consisting of multiple computers and operating multiple server nodes that provide services, and a client system consisting of multiple computers and operating multiple nodes, The plurality of nodes of the client system include a plurality of gateway nodes and a plurality of client nodes that utilize the services provided by the server node. The computer system includes a cluster consisting of two server nodes and two nodes, In the aforementioned cluster, One of the server nodes is a leader node that functions as the leader of a leader-follower type cluster management algorithm. The other server nodes are follower nodes that function as followers of a leader-follower type cluster management algorithm. One of the aforementioned nodes is a monitor node that functions as a monitor for voting in the election of a leader. The other nodes are spare nodes that function as spares for the monitor nodes. The aforementioned cluster management method is The steps include: each of the leader node, follower node, monitor node, and spare node monitors the health status of the communication path connecting each of the leader node, follower node, monitor node, and spare node; A cluster management method characterized by comprising the step of changing the cluster configuration so that a new leader node can be elected when a failure is detected in one of the communication paths of the leader node.