| CPC G06F 9/442 (2013.01) [G06F 9/45558 (2013.01); G06F 2009/45562 (2013.01); G06F 2009/4557 (2013.01)] | 20 Claims |
|
1. A computer-implemented method for managing a networked computer system, having a plurality of nodes, for a shutdown;
analyzing said networked system and determining a priority order to shut down said plurality of nodes accordingly;
determining an interval period between each node shutdown according to said priority order;
constructing a leaf node set for said system according to different shutdown types required for each node;
constructing a dependency tree by analyzing said leaf node set, wherein said leaf node set is determined from a relational tree generated based on a plurality of parent and children node dependencies, wherein at least two or more nodes are real and not virtual machines;
generating an optimized plan for shutdown based on a selection of leaf nodes to root nodes detected in said relational tree, wherein optimization includes at least one of application priority, cost or time constraints,
said optimized plan taking into account a determined time interval for shut down before another node starts to shut down, wherein said determined interval includes a minimum time for storing data as not jeopardize data integrity;
shutting down nodes according to said tree and said determined interval period between node shutdown; and
iteratively modifying said dependency tree and said interval period during said node shutdown until all nodes and ultimately said system shutdown has been completed, wherein said modifying includes checking a policy set for a process for initialization of an interval iteration and only allowing the process to be initialized when a policy does not exist for an interval iteration.
|