Granted Patent B2

US 10,320,702 · App. 14/870,390 · Granted Jun 11, 2019

Inventors: Jai Gahlot (Maharashtra, IN); Amol S. Katkar (Assam, IN); Udipta Das (Maharashtra, IN); Pranav Peshwe (Assam, IN)

Assignee: Veritas Technologies, LLC

H04L47/746G06F11/1425G06F11/2028G06F11/2046G06F11/2094H04L12/18H04L41/06H04L41/0806H04L41/12H04L41/5054H04L67/1095H04L67/16H04L67/288

Abstract

Claims (62)

1. A computer-implemented method comprising:

a second node receiving a matrix from a first node, wherein the matrix comprises information indicating accessibility of each coordination point of a plurality of coordination points by the first node;

the second node updating the matrix to include information indicating accessibility of each coordination point of the plurality of coordination points by the second node;

transmitting the updated matrix to one or more other nodes;

wherein the plurality of coordination points includes at least three coordination points;

wherein the plurality of coordination points comprise an odd number of coordination points;

wherein the plurality of coordination points enable access to one or more storage devices shared by the first node, the second node and the one or more other nodes;

wherein each of the coordination points can fence off one or more nodes from accessing the one or more storage devices.

2. The computer-implemented method of claim 1 , wherein

the second node receives the matrix in response to the first node's attempt to join a cluster.

3. The computer-implemented method of claim 2 , further comprising:

determining that the first node can, in combination with the second node, access a majority of the plurality of coordination points; and

based on the determining, joining the cluster.

4. The computer-implemented method of claim 2 , further comprising:

accessing a configuration file; and

determining a total number of the plurality of coordination points based on information in the configuration file.

5. The computer-implemented method of claim 4 , further comprising:

determining that the one or more other nodes are already part of the cluster, wherein the first node is not part of the one or more other nodes; and

requesting a second matrix from the cluster, wherein

the second matrix comprises information indicating accessibility of each of the coordination points of the plurality of coordination points by each of the one or more other nodes, and the plurality of coordination points are part of the cluster.

6. The computer-implemented method of claim 1 , wherein the plurality of coordination points comprise

one or more coordinator disks, or

one or more coordination point servers.

7. A non-transitory computer readable storage medium storing program instructions executable to:

receive a matrix from a first node, wherein the matrix comprises information indicating accessibility of each coordination point of a plurality of coordination points by the first node;

update the matrix to include information indicating accessibility of each coordination point of the plurality of coordination points by a second node;

transmit the updated matrix to one or more other nodes;

wherein the plurality of coordination points includes at least three coordination points;

wherein the plurality of coordination points enable access to one or more storage devices shared by the first node, the second node and the one or more other nodes;

wherein each of the coordination points can fence off one or more nodes from accessing the one or more storage devices;

wherein the plurality of coordination points comprise an odd number of coordination points.

8. The non-transitory computer readable storage medium of claim 7 , wherein

the second node receives the matrix in response to the first node attempting to join a cluster.

9. The non-transitory computer readable storage medium of claim 8 , further comprising:

determining that the first node can, in combination with the second node, access a majority of the plurality of coordination points; and

based on the determining, joining the cluster.

10. The non-transitory computer readable storage medium of claim 8 , further comprising:

accessing a configuration file; and

determining a total number of the plurality of coordination points based on information in the configuration file.

11. The non-transitory computer readable storage medium of claim 10 , further comprising:

determining that the one or more other nodes are already part of the cluster, wherein the first node is not part of the one or more other nodes; and

requesting a second matrix from the cluster, wherein

the second matrix comprises information indicating accessibility of each of the coordination points of the plurality of coordination points by each of the one or more other nodes, and

the plurality of coordination points are part of the cluster.

12. A system comprising:

one or more processors; and

a memory coupled to the one or more processors, wherein the memory stores program instructions executable by the one or more processors to:

receive a matrix from a first node, wherein the matrix comprises information indicating accessibility of each coordination point of a plurality of coordination points by the first node;

update the matrix to include information indicating accessibility of each coordination point of the plurality of coordination points by a second node;

transmit the updated matrix to one or more other nodes;

wherein the plurality of coordination points includes at least three coordination points;

wherein the plurality of coordination points enable access to one or more storage devices shared by the first node, the second node and the one or more other nodes;

wherein each of the coordination points can fence off one or more nodes from accessing one or more storage devices;

wherein the plurality of coordination points comprise an odd number of coordination points.

13. The system of claim 12 , wherein

the second node receives the matrix in response to the first node attempting to join a cluster.

14. The system of claim 12 , further comprising

determining that the first node can, in combination with the second node, access a majority of the plurality of coordination points; and

based on the determining, joining a cluster.

15. The system of claim 13 , further comprising:

accessing a configuration file; and

determining a total number of the plurality of coordination points based on information in the configuration file.

Assignments (13)

Continuity (1)

Cited By (2)

US 12,632,338 US 12,717,680