Managing Partitioning in a Cluster of Nodes

• US 20080301287A1
• Filed: 11/08/2007
• Published: 12/04/2008
• Est. Priority Date: 11/11/2006
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Preston, Adrian James
• Granted Patent: US 8,645,525 B2
• Time in Patent Office: Days
• US Class Current: 709/224
• CPC Class Codes: G06F 2209/505 Clust
• CPC Class Codes: G06F 9/5061 Partitioning or combining of resources

Abstract

For managing partitioning in a cluster of nodes, each node is assigned a prime number for use in determining which partition should be activated following partitioning of the cluster. The cluster is monitored for partitioning. If partitioning is detected, a partition value is calculated from the product of the prime numbers assigned to each node in each partition. A node is activated only if it is within the partition having the greatest partition value.

Claims

1. A method for managing partitioning in a cluster of nodes, the method comprising the steps of:

a) assigning a prime number for a node in a cluster of nodes;

b) monitoring said cluster for partitioning of said cluster;

c) if partitioning of said cluster is detected then calculating a partition value from the product of prime numbers assigned to each said node in each partition; and

d) activating said node only if said node is within said partition having the greatest partition value then enabling said node to be active within said partition.

2. A method according to claim 1 in which each said node maintains a record of prime numbers assigned to each node in the cluster.

3. A method according to claim 2 in which said prime number for a new node to said cluster is selected as the lowest prime number not assigned to any other node in the cluster obtained by incrementing the highest prime number held in said record of another said existing node within the cluster.

4. A method according to claim 1 in which, in response to assigning said prime number for a node, said node transmits a unique identifier and said assigned prime number to all other nodes in said cluster.

5. A method according to claim 1 in which if said node is within said partition not having the greatest partition value then said node deactivates.

6. A method according to claim 1, comprising the further steps of:

calculating the number of nodes in each said partition and enabling activating only said node to remain active if said node is with said partition comprising the largest number of nodes and if more than one said partition has said largest number of nodes then using said partition value to determine which of said partitions whether said node to is enabled to remain active.

7. A method according to claim 1 in which higher prime numbers are assigned to one or more particular nodes so as to increase the probability of said particular nodes being in said active partition.

8. A method according to claim 7 in which said prime numbers are randomly selected from a range of prime numbers.

9. A method according to claim 8 in which a plurality of ranges of prime numbers are provided, each for assignment to different categories of nodes.

10. A method according to claim 1 in which the number of bits used to represent said prime numbers is moderated within a predetermined limit.

11. Apparatus for managing partitioning in a cluster of nodes, the apparatus being operable to:

a) assign a prime number for a node in a cluster of said nodes;

b) monitor said cluster for partitioning of said cluster;

c) calculate, if partitioning of said cluster is detected, a partition value from the product of said prime numbers assigned to each said node in each partition; and

d) enable said node to be active within said partition if said node is within said partition having the greatest partition value.

12. Apparatus according to claim 11 in which said node maintains a record of all of the prime numbers assigned to each node in the cluster.

13. Apparatus according to claim 12 in which said prime number for a new node to said cluster is selected as the lowest prime number not assigned to any other node in the cluster.

14. Apparatus according to claim 11 in which said node transmits a unique identifier and said assigned prime number to all other nodes in said cluster.

15. Apparatus according to claim 11 in which if said node is within said partition not having the greatest partition value then said node is arranged to deactivate.

16. Apparatus according to claim 11 being further operable to calculate the number of nodes in each said partition and to enable said node to remain active if said node is within the partition comprising the largest number of nodes and if more than one said partition has said largest number of nodes then to use said partition value to determine whether said node is enabled to remain active.

17. Apparatus according to claim 11 in which higher prime numbers are assigned to one or more particular nodes so as to increase the probability of said particular nodes being in said active partition.

18. A computer program product for managing partitioning in a cluster of nodes, the computer program product comprising a computer usable medium having computer usable program code tangibly embodied therewith, the computer usable medium having:

a) computer usable program code configured to assign a prime number for a node in a cluster of said nodes;

b) computer usable program code configured to monitor said cluster for partitioning of said cluster;

c) computer usable program code configured to, if partitioning of said cluster is detected, calculate a partition value from the product of prime numbers assigned to each said node in each partition; and

d) computer usable program code configured to activate said node only if said node is within said partition having the greatest partition value then enabling said node to be active within said partition.

19. The computer program product of claim 18, wherein the computer usable program code further includes computer usable program code configured to maintain a record of prime numbers assigned to each node in the cluster.

20. The computer program product of claim 19, in which said prime number for a new node to said cluster is selected as the lowest prime number not assigned to any other node in the cluster obtained by incrementing the highest prime number held in said record of another said existing node within the cluster.