Method of Computer Clustering

• US 20090265449A1
• Filed: 04/21/2009
• Published: 10/22/2009
• Est. Priority Date: 04/22/2008
• Status: Abandoned Application

• Current Assignee: Hewlett Packard Enterprise Development LP (Hewlett-Packard Enterprise Company)
• Original Assignee: Hewlett-Packard Development Company, L.P. (HP Inc.)
• Inventors: Prasad, Sudhindra, Krishnappa, Nagendra
• Application Number:
  US12/427,615
• Publication Number:
  US 20090265449A1
• Time in Patent Office: Days
• US Class Current: 709/220
• CPC Class Codes: G06F 2209/505 Clust
• CPC Class Codes: G06F 9/5061 Partitioning or combining of resources
• CPC Class Codes: H04L 61/35 involving non-standard use of addresses for implementing network functionalities, e.g. coding subscription information within the address or functional addressing, i.e. assigning an address to a function
• CPC Class Codes: H04L 61/5038 for local use, e.g. in LAN or USB networks, or in a controller area network [CAN]

Abstract

A method for clustering comprising acquiring the required number of nodes for cluster formation based on node selection criteria; electing a cluster coordinator; and assigning the packages on the member nodes. The cluster coordinator is elected based on the mean time between failures value of the member nodes which may be calculated with the help of a diagnostic tool by logging the failure instances of the member nodes.

Claims

1. A method of forming a computer cluster comprising:

receiving, at a node, a request to create a dynamic cluster;

acquiring the required number of member nodes for cluster formation based on a node selection criteria;

electing a cluster coordinator from the member nodes;

wherein the cluster coordinator is elected based on a mean time between failures value of the member nodes.

2. A method of claim 1 wherein the time spent by a node within the cluster is measured with a cluster ware with a thread implemented to perform required diagnosis.

3. A method of claim 1 wherein the mean time between failures value of member nodes is assigned randomly on the initialization of the cluster.

4. A method of claim 1 further comprising assigning a node ID to the member nodes based on the mean time between failures.

5. A method of claim 1 wherein the node with the highest meantime between failures value is elected as cluster coordinator.

6. A method as claimed in claim 4 wherein the node with the lowest node ID is elected as cluster coordinator.

7. A method of claim 1 further comprising in case of more than one member node with same mean time between failures value and/or node ID a cluster coordinator is elected randomly.

8. A method of forming a computer cluster comprising:

receiving, at a node, a request to create a dynamic cluster;

acquiring the required number of member nodes for cluster formation based on a node selection criteria;

electing a cluster coordinator from the member nodes;

assigning packages to the member nodes

wherein the packages are assigned based on a failover weight of the member nodes for a package, the failover weight being based at least partly on a mean time between failures value of a node.

9. A method of claim 8 wherein the failover weight of node for a package is calculated as critical factor of the package over mean time between failures value of a node and package load of the node.

10. A method of claim 9 wherein critical factor of a package is the required degree of package availability.

11. A method of claim 9 wherein the critical factor of a package is the priority of the package relative to other packages in a computer cluster.

12. A method of claim 9 wherein the package load of a node is a function of CPU and I/O overhead introduced by the packages on a node.

13. A method of claim 9 wherein a package is assigned to a node with the highest failover weight for the package.

14. A computer program product for clustering, the computer program product comprising storage medium readable by a processing circuit and storing instruction for execution by a processing circuit for performing a method comprising the step of comprising:

receiving, by a node, a request to create a dynamic cluster;

acquiring the required number of member nodes for cluster formation based on a node selection criteria; and

electing a cluster coordinator and assigning the packages on the member nodes;

wherein the cluster coordinator is elected based on the mean time between failures value of the member nodes and/or the packages are assigned based on the failover weight of the node for a package.

15. A computer program product of claim 14 wherein failover weight of a package for a node is calculated as critical factor of the package over mean time between failures value of a node and package load of the node.