Selecting a master node in a multi-node computer system

• US 20080281938A1
• Filed: 05/09/2007
• Published: 11/13/2008
• Est. Priority Date: 05/09/2007
• Status: Abandoned Application

• Current Assignee: Oracle International Corporation (Oracle Corporation)
• Original Assignee: Oracle International Corporation (Oracle Corporation)
• Inventors: Srivastava, Alok, Tellez, Juan, Rai, Vikram
• Application Number:
  US11/801,494
• Publication Number:
  US 20080281938A1
• Time in Patent Office: Days
• US Class Current: 709/209
• CPC Class Codes: G06F 15/177 Initialisation or configuration control processor initialisation G06F9/4405

Abstract

Selecting a master node in a multi-node computer system is described. Each node of the multi-node computer system selects a timeout value (e.g., randomly). Each node starts a timer, which is set to expire at the selected timeout value of its corresponding node. The node with the timer that expires earliest broadcasts an election message to the other nodes of the multi-node computer system, which informs the other nodes that the broadcasting node is a candidate for mastership over the multi-node computer system. The other nodes respond to the election message upon receiving it. In the absence of a refusal message from one or more of the other nodes, the candidate is established as master node in the multi-node computer system and wherein the other nodes function as slave nodes therein.

Claims

1. A method for selecting a master node in a multiple node computer system;

comprising;

each node of multiple nodes in the multiple node computer system selecting a timeout value;

each node starting a timer, wherein each timer is set to expire at the selected timeout value of its corresponding node;

the node with the timer that expires earliest broadcasting an election message to the other nodes of the multiple nodes wherein the election message informs the other nodes that the broadcasting node is a candidate for mastership over the multiple node computer system; and

the other nodes responding to the election message, upon receipt thereof wherein, in the absence of a refusal message from one or more of the other nodes, establishing the candidate as master node in the multiple node computer system and wherein the other nodes function as slave nodes therein.

2. The method as recited in claim 1 wherein the slave nodes send to the master node messages to which the master node sends replies wherein, prior to sending the messages, the slave nodes each start timers wherein, upon receipt of the replies, the slave nodes cancel the timer.

3. The method as recited in claim 2 wherein each of the selected timeout values is greater than an interval between synchronizing messages that are exchanged among the nodes within the multiple node computer system.

4. The method as recited in claim 2 further comprising:

upon a slave node'"'"'s timer expiring prior to the slave node receiving a reply message from the master node to its message, the slave node broadcasting an election message to the other nodes of the multiple node computer system wherein the election message informs the other nodes that the broadcasting node is a candidate for mastership over the multiple node computer system; and

the other nodes responding to the election message, upon receipt thereof wherein, in the absence of a refusal message from one or more of the other nodes, the broadcasting node is established as master node in the multiple node computer system and wherein the other nodes function as slave nodes therein.

5. The method as recited in claim 2 wherein the messages are exchanged between the nodes with a fast message service.

6. The method as recited in claim 5 wherein the fast message service transmits the messages in the order with which they were broadcast.

7. The method as recited in claim 5 wherein the method further comprises, upon the timers of two or more of the nodes expiring and the two or more nodes broadcasting respective election messages to the other nodes of the multiple node computer system:

the other nodes receiving the respective election messages in the order with which they were transmitted over the fast message service;

the other nodes replying with an acceptance message to the respective election message that was received first and with a refusal message to the respective election messages that are received subsequent to receiving the first respective election message; and

establishing the node that transmitted the election message that was received first as master node in the multiple node computer system and wherein the other nodes function as slave nodes therein.

8. The method as recited in claim 1 wherein, upon receiving a refusal message from one or more of the other nodes, the candidate node functions as a slave node of the multiple node computer system.

9. The method as recited in claim 1 wherein selecting a timeout value is performed randomly.

10. The method as recited in claim 1 further comprising:

upon the other nodes receiving the election message from the mastership candidate node and at least one subsequent election message from one or more nodes, which contend for mastership in the multiple node computer system, the other nodes;

responding to the election message with an acceptance reply message; and

responding to the at least one subsequent election message with an refusal reply message;

wherein the mastership candidate node is established as the master node in the multiple node computer system and wherein the one or more contending nodes function as slaves in the multiple node computer system.

11. The method as recited in claim 1 wherein the method is triggered in response to one or more of:

rebooting the master node in the multi-node computer system;

rebooting the multi-node computer system wherein no master node persistence is set;

the master node ceasing to function;

the master node leaving the multi-node computer system;

a application executing in the multi-node computer system requesting selection of a master node in the multi-node computer system;

or

one or more nodes of lacking awareness of a master node in the multi-node computer system to which they belong.

12. The method as recited in claim 11 wherein the lacking awareness arises from one or more nodes:

failing to receive one or more messages;

or

one or more nodes receiving one or more messages in an other than timely period.

13. A computer readable medium having instructions encoded therewith which, when executed with one or more processors of a computer system, cause the processors to execute the method recited in claim 1.

14. A computer readable medium having instructions encoded therewith which, when executed with one or more processors of a computer system, cause the processors to execute the method recited in claim 2.

15. A computer readable medium having instructions encoded therewith which, when executed with one or more processors of a computer system, cause the processors to execute the method recited in claim 3.

16. A computer readable medium having instructions encoded therewith which, when executed with one or more processors of a computer system, cause the processors to execute the method recited in claim 4.

17. A computer readable medium having instructions encoded therewith which, when executed with one or more processors of a computer system, cause the processors to execute the method recited in claim 5.

18. A computer readable medium having instructions encoded therewith which, when executed with one or more processors of a computer system, cause the processors to execute the method recited in claim 6.

19. A computer readable medium having instructions encoded therewith which, when executed with one or more processors of a computer system, cause the processors to execute the method recited in claim 7.

20. A computer readable medium having instructions encoded therewith which, when executed with one or more processors of a computer system, cause the processors to execute the method recited in claim 8.

21. A computer readable medium having instructions encoded therewith which, when executed with one or more processors of a computer system, cause the processors to execute the method recited in claim 9.

22. A computer readable medium having instructions encoded therewith which, when executed with one or more processors of a computer system, cause the processors to execute the method recited in claim 10.

23. A computer readable medium having instructions encoded therewith which, when executed with one or more processors of a computer system, cause the processors to execute the method recited in claim 11.

24. A computer readable medium having instructions encoded therewith which, when executed with one or more processors of a computer system, cause the processors to execute the method recited in claim 12.