Snapshot visualization for content-based storage
View Patent ↗A computer program product, system, and method for calculating a resource usage metric over each node of a snapshot tree within a content-based storage system having a plurality of volumes and/or snapshots and generating a visualization of the snapshot tree using the calculated resource usage metrics.
1. A method for data storage management comprising:
calculating, by at least one processor, a resource usage metric for each of a plurality of nodes in a snapshot tree, any of the plurality of nodes representing either a respective volume in the storage system or a respective snapshot, and the plurality of nodes including a first node and a plurality of second nodes;
generating a visualization of the snapshot tree using the calculated resource usage metrics; and
outputting the visualization of the snapshot tree for presentation to a user;
wherein any given one of the second nodes has a parent node, the parent node being either the first node or another one of the second nodes;
wherein the first node is associated with a respective first snapshot and an address-to-hash (A2H) table corresponding to the respective first snapshot;
wherein any given one of the second nodes is associated with a different respective second snapshot and an A2H table that corresponds to the respective second snapshot, the respective second snapshot being generated by cloning another snapshot that is associated with the given second node's parent node;
wherein the resource usage metric for at least one of the second nodes is calculated based at least in part on a count of shadow addresses that are present in an A2H table corresponding to the parent of the at least one second node, each of the shadow addresses being an address that is: (i) absent from the A2H table that is associated with the at least one second node, (ii) present in the A2H table that is associated with the parent node of the at least one second node, and (iii) present in the A2H table that is associated with another second node that has the same parent node as the at least one second node.
2. The method of claim 1 wherein generating a visualization of the snapshot tree includes:
generating a root pane;
initializing a current node to a root node of the snapshot tree;
initializing a current pane to the root pane;
(a) partitioning the current pane into or more sub-panes sized according to the resource usage metrics for the current node and its child nodes; and
(b) for each child node of the current node, setting the current node to the child node, setting the current pane to one of the sub-panes, and repeating steps (a)-(b).
3. The method of claim 1 wherein calculating a resource usage metric for each node of a snapshot tree includes determining an amount of memory capacity that would be freed by deleting the node.
4. The method of claim 1 wherein calculating a resource usage metric for each node of a snapshot tree includes determining a minimum amount of disk capacity that would be freed by deleting the node.
5. The method of claim 1 wherein calculating a resource usage metric for each node of a snapshot tree includes estimating a minimum amount of disk capacity that would be freed by deleting the node.
6. A computer program product tangibly embodied in a non-transitory computer-readable medium, the computer-readable medium storing program instructions that are executable to:
calculate a resource usage metric for each of a plurality of nodes in a snapshot tree, any of the plurality of nodes representing either a respective volume in the storage system or a respective snapshot, and the plurality of nodes including a first node and a plurality of second nodes;
generate a visualization of the snapshot tree using the calculated resource usage metrics; and
output the visualization of the snapshot tree for presentation to a user;
wherein any given one of the second nodes has a parent node, the parent node being either the first node or another one of the second nodes;
wherein the first node is associated with a respective first snapshot and an address-to-hash (A2H) table corresponding to the respective first snapshot;
wherein any given one of the second nodes is associated with a different respective second snapshot and a respective A2H table that corresponds to the respective second snapshot, the respective second snapshot being generated by cloning another snapshot that is associated with the given second node's parent node;
wherein the resource usage metric for at least one of the second nodes is calculated based at least in part on a count of shadow addresses that are present in an A2H table corresponding to the parent of the at least one second node, each of the shadow addresses being an address that is: (i) absent from the A2H table that is associated with the at least one second node, (ii) present in the A2H table that is associated with the parent node of the at least one second node, and (iii) present in the A2H table that is associated with another second node that has the same parent node as the at least one second node.
7. The computer program product of claim 6 , wherein generating a visualization of the snapshot tree includes:
generating a root pane;
initializing a current node to a root node of the snapshot tree;
initializing a current pane to the root pane;
(a) partitioning the current pane into or more sub-panes sized according to the resource usage metrics for the current node and its child nodes; and
(b) for each child node of the current node, setting the current node to the child node, setting the current pane to one of the sub-panes, and repeating steps (a)-(b).
8. The computer program product claim 6 wherein calculating a resource usage metric for each node of a snapshot tree includes determining an amount of memory capacity that would be freed by deleting the node.
9. The computer program product of claim 6 wherein calculating a resource usage metric for each node of a snapshot tree includes determining a minimum amount of disk capacity that would be freed by deleting the node.
10. The computer program product of claim 6 wherein calculating a resource usage metric for each node of a snapshot tree includes estimating a minimum amount of disk capacity that would be freed by deleting the node.
11. A system data storage management, comprising:
a processor;
a volatile memory; and
a non-volatile memory storing computer program code that when executed on the processor causes the processor to:
calculate a resource usage metric for each of a plurality of nodes in a snapshot tree, any of the plurality of nodes representing either a respective volume in the storage system or a respective snapshot, and the plurality of nodes including a first node and a plurality of second nodes;
generate a visualization of the snapshot tree using the calculated resource usage metrics; and
output the visualization of the snapshot tree for presentation to a user,
wherein any given one of the second nodes has a parent node, the parent node being either the first node or another one of the second nodes;
wherein the first node is associated with a respective first snapshot and an address-to-hash (A2H) table corresponding to the respective first snapshot;
wherein any given one of the second nodes is associated with a different respective second snapshot and an A2H table that corresponds to the respective second snapshot, the respective second snapshot being generated by cloning another snapshot that is associated with the given second node's parent node;
wherein the resource usage metric for at least one of the second nodes is calculated based at least in part on a count of shadow addresses that are present in an A2H table corresponding to the parent of the at least one second node, each of the shadow addresses being an address that is: (i) absent from the A2H table that is associated with the at least one second node, (ii) present in the A2H table that is associated with the parent node of the at least one second node, and (iii) present in the A2H table that is associated with another second node that has the same parent node as the at least one second node.
12. The system of claim 11 wherein generating a visualization of the snapshot tree includes:
generating a root pane;
initializing a current node to a root node of the snapshot tree;
initializing a current pane to the root pane;
(a) partitioning the current pane into or more sub-panes sized according to the resource usage metrics for the current node and its child nodes; and
(b) for each child node of the current node, setting the current node to the child node, setting the current pane to one of the sub-panes, and repeating steps (a)-(b).
13. The system of claim 11 wherein calculating a resource usage metric for each node of a snapshot tree includes determining an amount of memory capacity that would be freed by deleting the node.
14. The system of claim 11 wherein calculating a resource usage metric for each node of a snapshot tree includes determining a minimum amount of disk capacity that would be freed by deleting the node.
15. The system of claim 11 wherein calculating a resource usage metric for each node of a snapshot tree includes estimating a minimum amount of disk capacity that would be freed by deleting the node.