Methods and systems for dynamic partition management of shared-interconnect partitions
Abstract
Methods and systems for dynamic partitioning of multiple processor systems. Upon receipt of an on-line event request, the routing management application dynamically implements an alternate routing table (ART) for all nodes affected by the on-line event, the ART reflecting an altered system topology corresponding to the on-line event. For one embodiment, nodes affected by the on-line event are determined and source nodes are quiesced. An ART is loaded for each determined node and the nodes are directed to use the ART. The quiesced source nodes are then directed to leave quiescence. An alternative embodiment of the invention is applicable to a multiple processor system supporting multiple virtual networks. An ART, specific to a virtual network not used for primary routing, is loaded for each determined node. The primary routing table is used concurrently with the ART until each source node has been directed, and has begun to use the ART.
Claims
exact text as granted — not AI-modified1 . A method comprising:
receiving a request for an on-line event, the on-line event in regard to a node of a multiple-node system in which messages are routed using a primary routing table; and dynamically implementing an alternate routing table for each node of the multiple-node system that is affected by the on-line event, the alternate routing tables reflecting an altered system topology corresponding to the on-line event.
2 . The method of claim 1 wherein implementing an alternate routing table for each node of the multiple-node system affected by the on-line event includes quiescing all source nodes of the affected nodes, loading the alternate routing table for each affected node, directing each affected node to use the alternate routing table, and directing each quiesced node to leave quiescence.
3 . The method of claim 2 wherein the operation of quiescing all source nodes of affected nodes and the operation of loading the alternate routing table for each affected node are initiated concurrently.
4 . The method of claim 2 wherein each source node includes an agent selected from the group consisting of a processor, a memory controller, an input/output hub, a chipset, and integrated combinations thereof.
5 . The method of claim 2 further comprising:
redesignating the primary routing table as the alternate routing table in anticipation of a subsequent on-line event; and providing an indication that the multiple-node system is ready to receive a subsequent on-line event request.
6 . The method of claim 4 wherein each node agent stores the primary routing table and the alternate routing table.
7 . The method of claim 2 wherein the operation of loading the alternate routing table for each affected node is initiated upon detecting completion of the operation of quiescing all source nodes of affected nodes.
8 . The method of claim 7 further comprising:
overwriting the primary routing table for each node with the alternate routing table upon completion of the operation of quiescing all source nodes of affected nodes.
9 . The method of claim 8 wherein the overwriting is effected for each node in a specific order such that routing to each source node is possible.
10 . The method of claim 1 wherein the multiple-node system supports a plurality of virtual networks, at least one virtual network not required to support a topology of the multiple-node system, and primary routing is not effected on at least one virtual network.
11 . The method of claim 10 wherein implementing an alternate routing table for each node of the multiple-node system affected by the on-line event includes determining nodes of a subject partition and any affected partitions, loading the alternate routing table for each determined node, the alternate routing table specific to the at least one virtual network, and directing each determined node to use the alternate routing table.
12 . The method of claim 11 further comprising:
quiescing the subject partition; verifying that all determined nodes are using the alternate routing table and that the primary routing table is not being used by any node; and granting the on-line event request.
13 . The method of claim 12 wherein verifying that the primary routing table is not being used by any node is effected by waiting a time period equal to at least the longest transaction lifetime for the multiple-node system.
14 . An article of manufacture comprising:
a machine-accessible medium having associated data, wherein the data, when accessed, results in a machine performing operations comprising: receiving a request for an on-line event, the on-line event in regard to a node of a subject partition of a multiple-partition, multiple-node system in which messages are routed using a primary routing table; quiescing all source nodes of the subject partition and any affected partitions in regard to an on-line event request; loading an alternate routing table for each node of the subject partition and the affected partitions; and directing each node for which an alternate routing table has been loaded to use the alternate routing table.
15 . The article of manufacture of claim 14 wherein the machine-accessible medium further includes data, which when accessed, results in the machine performing an operation comprising directing each quiesced node to leave quiescence.
16 . The article of manufacture of claim 14 wherein the machine-accessible medium is a read-only memory device.
17 . The article of manufacture of claim 14 wherein the operation of quiescing all source nodes of affected nodes and the operation of loading the alternate routing table for each affected node are initiated concurrently.
18 . The article of manufacture of claim 15 further comprising:
redesignating the primary routing table as the alternate routing table in anticipation of a subsequent on-line event; and providing an indication that the multiple-node system is ready to receive a subsequent on-line event request.
19 . The article of manufacture of claim 18 wherein each node agent stores the primary routing table and the alternate routing table.
20 . The article of manufacture of claim 15 wherein the operation of loading the alternate routing table for each affected node is initiated upon detecting completion of the operation of quiescing all source nodes of affected nodes.
21 . The article of manufacture of claim 20 wherein the machine-accessible medium further includes data, which when accessed, results in the machine performing an operation comprising overwriting the primary routing table for each node with the alternate routing table upon completion of the operation of quiescing all source nodes of affected nodes.
22 . An article of manufacture comprising:
a machine-accessible medium having associated data, wherein the data, when accessed, results in a machine performing operations comprising: receiving a request for an on-line event, the on-line event in regard to a node of a subject partition of a multiple-partition, multiple-node system in which messages are routed using a primary routing table, the multiple node system supporting a plurality of virtual networks, at least one virtual network not required to support a topology of the multiple-node system, and primary routing is not effected on at least one virtual network; determining nodes of the subject partition and any affected partitions; loading the alternate routing table for each determined node, the alternate routing table specific to the at least one virtual network; and directing each determined node to use the alternate routing table.
23 . The article of manufacture of claim 22 wherein the machine-accessible medium further includes data, which when accessed, results in the machine performing operations comprising:
quiescing the subject partition; verifying that all determined nodes are using the alternate routing table and that the primary routing table is not being used by any node; and granting the on-line event request.
24 . The method of claim 23 wherein verifying that the primary routing table is not being used by any node is effected by waiting a time period equal to at least the longest transaction lifetime for the multiple-node system.
25 . A system comprising:
a plurality of agents partitioned into a plurality of partitions having one or more agents, the agents having a shared interconnection in which messages are routed using a primary routing table; and a corresponding memory coupled to each agent, the memory storing instructions which, when executed by a processor, cause the processor to receive a request for an on-line event, the on-line event in regard to one of the agent nodes of a multiple-node system, and dynamically implement an alternate routing table for each agent that is affected by the on-line event, the alternate routing tables reflecting an altered system topology corresponding to the on-line event.
26 . The system of claim 25 wherein implementing an alternate routing table for each node of the multiple-node system affected by the on-line event includes quiescing all source nodes of the affected nodes, loading the alternate routing table for each affected node, directing each affected node to use the alternate routing table, and directing each quiesced node to leave quiescence.
27 . The system of claim 26 wherein the operation of quiescing all source nodes of affected nodes and the operation of loading the alternate routing table for each affected node are initiated concurrently.
28 . The system of claim 26 wherein the operation of loading the alternate routing table for each affected node is initiated upon detecting completion of the operation of quiescing all source nodes of affected nodes, further comprising:
overwriting the primary routing table for each node with the alternate routing table upon completion of the operation of quiescing all source nodes of affected nodes, the overwriting effected for each node in a specific order such that routing to each source node is possible.
29 . The system of claim 25 wherein the multiple-node system supports a plurality of virtual networks, at least one virtual network not required to support a topology of the multiple-node system, and primary routing is not effected on at least one virtual network.
30 . The system of claim 29 wherein implementing an alternate routing table for each node of the multiple-node system affected by the on-line event includes determining nodes of a subject partition and any affected partitions, loading the alternate routing table for each determined node, the alternate routing table specific to the at least one virtual network, and directing each determined node to use the alternate routing table.Cited by (0)
No later patents cite this yet.
References (0)
No backward citations on record.