# US 2021/0240911 A1 · Online change of page size in a content aware storage logical layer

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2021/0240911 A1
- Document ID: US20210240911A1
- Status: Published application
- Kind: A1
- Application number: 16/779,778
- Filed: 2020-02-03
- Published: 2021-08-05
- Earliest claimed: 2020-02-03
- Assignees: EMC IP Holding Company LLC
- Applicants: EMC IP Holding Company LLC
- Inventors: Anton Kucherov; David Meiri
- Web page: https://patentgrep.com/patent/US20210240911A1

## CPC

- G06F 3/067: {Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]}
- G06F 3/0608: {Saving storage space on storage systems}
- G06F 3/061: {Improving I/O performance}
- G06F 3/0638: {Organizing or formatting or addressing of data}
- G06F 3/0644: {Management of space entities, e.g. partitions, extents, pools}
- G06V 30/414: Extracting the geometrical structure, e.g. layout tree; Block segmentation, e.g. bounding boxes for graphics or text
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G06V: IMAGE OR VIDEO RECOGNITION OR UNDERSTANDING

## Abstract

A system for optimizing page size associated with a snapshot tree associated with a storage array, where the system collects current page size information associated with the snapshot tree. The system determines an optimal page size for the snapshot tree. The system creates a new snapshot tree based on the snapshot tree, where the new snapshot tree comprises the optimal page size.

## Claims

### Claim 1

A method for optimizing page size associated with a snapshot tree associated with a storage array, the method comprising:
collecting current page size information associated with the snapshot tree;
determining an optimal page size for the snapshot tree; and
creating a new snapshot tree based on the snapshot tree, the new snapshot tree comprising the optimal page size.

### Claim 2 (depends on 1)

The method of claim 1, further comprising:
modifying a pointer to point from the snapshot tree to the new snapshot tree; and
deleting the snapshot tree.

### Claim 3 (depends on 1)

The method of claim 1, wherein collecting the current page size information associated with the snapshot tree comprises:
monitoring Input/Output (I/O) size of data during execution of at least one application.

### Claim 4 (depends on 1)

The method of claim 1, wherein determining the optimal page size for the snapshot tree comprises:
determining an optimal page size for an application executing on a volume comprising the snapshot tree, the storage array comprising the volume.

### Claim 5 (depends on 1)

The method of claim 1, wherein determining the optimal page size for the snapshot tree comprises:
determining a respective optimal page size for each snapshot tree of a plurality of snapshot trees associated with the storage array.

### Claim 6 (depends on 1)

The method of claim 1, wherein creating the new snapshot tree based on the snapshot tree comprises:
creating the new snapshot tree with the optimal page size, the new snapshot tree comprising a snapshot tree structure associated with the snapshot tree; and
copying the snapshot tree to the new snapshot tree.

### Claim 7 (depends on 6)

The method of claim 6, wherein copying the snapshot tree to the new snapshot tree comprises:
traversing the snapshot tree; and
copying each node from the snapshot tree to the new snapshot tree.

### Claim 8 (depends on 7)

The method of claim 7, wherein copying each node from the snapshot tree to the new snapshot tree comprises:
splitting a page of the current page size into a plurality of pages of the optimal page size; and
writing the plurality of pages to the new snapshot tree.

### Claim 9 (depends on 7)

The method of claim 7, wherein copying each node from the snapshot tree to the new snapshot tree comprises:
merging a plurality of pages into a page of the optimal page size; and
writing the page of the optimal page size to the new snapshot tree.

### Claim 10 (depends on 9)

The method of claim 9, wherein merging the plurality of pages into the page of the optimal page size comprises:
merging a plurality of consecutive pages into the page of the optimal page size.

### Claim 11 (depends on 7)

The method of claim 7, wherein copying each node from the snapshot tree to the new snapshot tree comprises:
for each hash handle in each node of the snapshot tree, reading a page associated with the hash handle; and
writing data associated with the page associated with the hash handle to a node in the new snapshot tree, wherein the data is written according to the optimal page size.

### Claim 12 (depends on 7)

The method of claim 7, further comprising:
calculating a new hash handle for each page written to the new snapshot tree.

### Claim 13 (depends on 7)

The method of claim 7, further comprising:
determining a changeset in the snapshot tree; and
updating the new snapshot tree with the changeset to synchronize the new snapshot tree with the snapshot tree.

### Claim 14 (depends on 13)

The method of claim 13, wherein updating the new snapshot tree with the changeset comprises:
creating a new snapshot of the snapshot tree that includes the changeset; and
copying the new snapshot to the new snapshot tree.

### Claim 15 (depends on 14)

The method of claim 14, wherein the new snapshot is created when the changeset does not meet a threshold.

### Claim 16 (depends on 13)

The method of claim 13, wherein updating the new snapshot tree with the changeset comprises:
determining the changeset exceeds a threshold;
scanning entries associated with data in the snapshot tree; and
updating the new snapshot tree with the data in the snapshot tree.

### Claim 17 (depends on 16)

The method of claim 16, wherein updating the new snapshot tree with the data in the snapshot tree comprises:
detecting an update to data associated with an entry that has been scanned; and
updating the snapshot tree and the new snapshot tree with the updated data.

### Claim 18 (depends on 16)

The method of claim 16, wherein updating the new snapshot tree with the data in the snapshot tree comprises:
detecting an update to data associated with an entry that has not been scanned; and
updating the new snapshot tree with the updated data when the entry is scanned.

### Claim 19

A system for optimizing page size associated with a snapshot tree associated with a storage array, the system comprising a processor configured to:
collect current page size information associated with the snapshot tree;
determine an optimal page size for the snapshot tree; and
create a new snapshot tree based on the snapshot tree, the new snapshot tree comprising the optimal page size.

### Claim 20

A computer program product for optimizing page size associated with a snapshot tree associated with a storage array, the computer program product comprising:
a computer readable storage medium having computer executable program code embodied therewith, the program code executable by a computer processor to:
collect current page size information associated with the snapshot tree;
determine an optimal page size for the snapshot tree; and
create a new snapshot tree based on the snapshot tree, the new snapshot tree comprising the optimal page size.
