Updating a list of quorum disks
First Claim
Patent Images
1. A non-transitory computer-readable storage medium having computer-executable instructions for causing a computer system to perform a method comprising:
- identifying a first number of nodes that constitute a server cluster;
designating a subset comprising not more than a second number of said nodes as quorum disks for said server cluster, said second number less than said first number, wherein said quorum disks are accessed in response to a split-brain event that partitions said server cluster into different sub-clusters of nodes;
storing, on each of said quorum disks, a first list identifying said nodes that constitute said server cluster;
storing a second list identifying said subset of nodes designated as quorum disks on at least a simple majority of nodes on said second list; and
replacing said second list with a third and more recent list of quorum disks only if said third list is updated on at least a simple majority of quorum disks on said second list.
7 Assignments
0 Petitions
Accused Products
Abstract
A node in a server cluster is designated as a quorum disk. The node stores a list of other nodes in the server cluster also designated as quorum disks. The node can replace the first list with a second and more recent list of quorum disks only if the second list is updated on at least a simple majority of quorum disks on the first list.
14 Citations
19 Claims
-
1. A non-transitory computer-readable storage medium having computer-executable instructions for causing a computer system to perform a method comprising:
-
identifying a first number of nodes that constitute a server cluster;
designating a subset comprising not more than a second number of said nodes as quorum disks for said server cluster, said second number less than said first number, wherein said quorum disks are accessed in response to a split-brain event that partitions said server cluster into different sub-clusters of nodes;storing, on each of said quorum disks, a first list identifying said nodes that constitute said server cluster; storing a second list identifying said subset of nodes designated as quorum disks on at least a simple majority of nodes on said second list; and replacing said second list with a third and more recent list of quorum disks only if said third list is updated on at least a simple majority of quorum disks on said second list. - View Dependent Claims (2, 3, 4, 5, 6, 7)
-
-
8. A computer-implemented method comprising:
-
accessing a server cluster comprising a first number of nodes; identifying a first subset of said nodes during a first phase of a search, said search to identify nodes designated as quorum disks for said server cluster; storing, on each of said quorum disks, a first list identifying said nodes that constitute said server cluster; after said first phase, propagating said search through succeeding subsets of said nodes, wherein each succeeding subset of said nodes is selected based upon lists of nodes stored on nodes identified in a preceding phase of said search; identifying a latest list of said nodes, wherein said latest list is selected from lists of nodes identified during said search and comprises a second subset comprising not more than a second number of said nodes in said server cluster, said second number less than said first number, wherein said second subset of nodes comprises said quorum disks; and storing said latest list identifying said second subset of nodes designated as quorum disks on at least a simple majority of nodes on said latest list, wherein further nodes in said latest list are accessed in response to a split-brain event that partitions said server cluster into different sub-clusters of nodes. - View Dependent Claims (9, 10, 11, 12, 13)
-
-
14. A data server in a server cluster, said data server comprising:
-
a processor; and memory coupled to said processor and having stored therein instructions that, if executed by said data server, cause said data server to execute a method comprising; selecting a subset of a first number of data servers that are members of said server cluster and designating data servers in said subset as quorum disks for said server cluster, wherein said subset includes said data server and comprises not more than a second number of said data servers in said server cluster, said second number less than said first number; storing, on each of said data servers designated as quorum disks, a first list identifying said data servers that constitute said server cluster; storing a second list identifying said subset of data servers designated as quorum disks on at least a simple majority of data servers on said second list; and replacing said second list with a third and more recent list of quorum disks only if said second list is received by at least a simple majority of quorum disks on said second list, wherein said data server is accessed in response to a split-brain event that partitions said server cluster into different sub-clusters of data servers. - View Dependent Claims (15, 16, 17, 18, 19)
-
Specification