# US 2006/0053139 A1 · Methods, systems, and computer program products for implementing single-node and cluster snapshots

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

- Number: US 2006/0053139 A1
- Document ID: US20060053139A1
- Status: Published application
- Kind: A1
- Application number: 11/218,567
- Filed: 2005-09-06
- Published: 2006-03-09
- Earliest claimed: 2004-09-03
- Assignees: Red Hat, Inc.
- Inventors: Benjamin Marzinski; Daniel Phillips
- Web page: https://patentgrep.com/patent/US20060053139A1

## CPC

- G06F 11/1435: {using file system or storage system metadata}
- G06F 11/1464: {for networked environments}
- G06F 11/1466: {to make the backup process non-disruptive}
- G06F 3/0605: {by facilitating the interaction with a user or administrator}
- G06F 3/065: {Replication mechanisms}
- G06F 3/067: {Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]}
- G06F 2201/84: Using snapshots, i.e. a logical point-in-time copy of the data
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A computer assisted method of organizing a data structure for managing a computer storage device that contains a plurality of blocks. The method comprises initializing entries of the data structure to indicate that the blocks are shared between an origin and one or more snapshots and receiving a first request to modify a first portion of the storage device. The method also includes identifying a first chunk that contains the first portion to be modified, wherein the first chunk includes at least one block and writing first metadata into an entry of the data structure to indicate that the first chunk is unshared. The method also includes allowing the first chunk to be modified. Similar systems and software products are also described.

## Claims

### Claim 1

A computer assisted method of organizing a data structure for managing a computer storage device that contains a plurality of blocks, the method comprising:
(a) initializing entries of the data structure to indicate that the blocks are shared between an origin and one or more snapshots;
(b) receiving a first request to modify a first portion of the storage device;
(c) identifying a first chunk that contains the first portion to be modified, wherein the first chunk includes at least one block;
(d) writing first metadata into an entry of the data structure to indicate that the first chunk is unshared; and
(e) allowing, after act (d), the first chunk to be modified.

### Claim 2 (depends on 1)

The method of claim 1, further comprising:
copying, before act (e), data of the first chunk into a free space of the storage device; and
recording an address of the free space as part of the first metadata.

### Claim 3 (depends on 1)

The method of claim 1 further comprising:
creating a btree structure;
using the btree structure as the data structure; and
using leaf nodes of the btree as the entries.

### Claim 4 (depends on 3)

The method of claim 3, wherein the act of writing metadata that the first chunk is unshared comprises:
associating the first chunk with one of the leaf nodes; and
creating an exception for the associated leaf node to indicate that the chunk is unshared.

### Claim 5 (depends on 3)

The method of claim 3 further comprising:
receiving a second request to modify a second portion of the storage device;
locating a leaf node associated with a second chunk that contains the second portion; and
determining whether the leaf node includes an exception indicating that the second chunk is unshared.

### Claim 6 (depends on 1)

The method of claim 1, wherein the act of receiving the first request further comprises:
receiving a query message asking a permission to write to the first portion of the storage device.

### Claim 7 (depends on 6)

The method of claim 6 further comprising:
sending a reply message after the act (d) of writing the first metadata.

### Claim 8 (depends on 1)

The method of claim 1 further comprising:
receiving a third request to transfer a selected snapshot among the one or more snapshots to the origin.

### Claim 9 (depends on 8)

The method of claim 8 further comprising:
locking the origin after determining that the origin is unused.

### Claim 10 (depends on 8)

The method of claim 8 further comprising:
searching the data structure to locate one or more chunks that are unshared between the origin and the selected snapshot;
copying data of the unshared chunks of the selected snapshot to corresponding origin chunks; and
modifying the data structure to indicate that the chunks of the selected snapshots are shared with the chunks of the origin.

### Claim 11 (depends on 10)

The method of claim 10 further comprising:
creating second metatdata for one or more unselected snapshots, wherein the second metadata indicates that the one or more chunks are unshared between the origin and the one or more unselected snapshots.

### Claim 12

A computer program product, residing on a computer readable medium, for use in organizing a data structure for managing a computer storage device that contains a plurality of blocks, said computer program product comprising instructions for causing a computer to:
(a) initialize entries of the data structure to indicate that the blocks are shared between an origin and one or more snapshots, wherein each entry is associated with a chunk that includes at least one block;
(b) modify data stored in the storage device;
(c) modify the entries for chunks based on whether the chunks are shared between the origin and the one or more snapshots after the storage device has been modified; and
(d) receive a first request to transfer a selected snapshot among the one or more snapshots to the origin.

### Claim 13 (depends on 12)

The product of claim 12 further comprising instructions for causing the computer to:
lock the origin after determining that the origin is unused.

### Claim 14 (depends on 12)

The product of claim 12 further comprising instructions for causing the computer to:
search the data structure to locate one or more chunks that are unshared between the origin and the selected snapshot.

### Claim 15 (depends on 14)

The product of claim 14 further comprising instructions for causing the computer to:
create first metatdata for one or more unselected snapshots, wherein the first metadata indicating that the one or more chunks are unshared between the origin and the one or more unselected snapshots.

### Claim 16 (depends on 12)

The product of claim 12 further comprising instructions for causing the computer to:
receive a second request to modify a first portion of the storage device;
identify a first chunk that contains the first portion to be modified; and
write second metadata into an entry of the data structure to indicate that the first chunk is unshared.

### Claim 17 (depends on 16)

The product of claim 16 further comprising instructions for causing the computer to:
create a btree structure;
use the btree structure as the data structure; and
use leaf nodes of the btree as the entries.

### Claim 18 (depends on 17)

The product of claim 17, wherein the act of writing metadata that the first chunk is unshared comprises instructions for causing the computer to:
associate the first chunk with one of the leaf nodes; and
create an exception for the associated leaf node to indicate that the first chunk is unshared.

### Claim 19

A computing system for organizing a data structure for managing a computer storage device that contains a plurality of blocks, the system comprising:
a computer configured to run a server process, wherein the server process is configured to
(a) initialize entries of the data structure to indicate that the blocks are shared between an origin and one or more snapshots;
(b) receive a first request to modify a first portion of the storage device;
(c) identify a first chunk that contains the first portion to be modified, wherein the first chunk includes at least one block;
(d) write first metadata into an entry of the data structure to indicate that the first chunk is unshared; and
(e) allow, after act (d), the first chunk to be modified.

### Claim 20 (depends on 19)

The system of claim 19, wherein the server process is further configured to:
copy, before act (e), data of the first chunk into a free space of the storage device; and
record an address of the free space as part of the first metadata.

### Claim 21 (depends on 19)

The system of claim 19, wherein the server process is further configured to:
create a btree structure;
use the btree structure as the data structure; and
use leaf nodes of the btree as the entries.

### Claim 22 (depends on 21)

The system of claim 21, wherein the server process is further configured to:
associate the first chunk with one of the leaf nodes; and
create an exception for the associated leaf node to indicate that the chunk is unshared.

### Claim 23 (depends on 19)

The system of claim 19, wherein the server process is further configured to:
receive a second request to transfer a selected snapshot among the one or more snapshots to the origin.

### Claim 24 (depends on 19)

The system of claim 19, wherein the server process is further configured to:
lock the origin after determining that the origin is unused.

### Claim 25 (depends on 19)

The system of claim 19, wherein the server process is further configured to:
search the data structure to locate one or more chunks that are unshared between the origin and the selected snapshot.

### Claim 26 (depends on 25)

The system of claim 25, wherein the server process is further configured to:
create second metatdata for one or more unselected snapshots, wherein the second metadata indicates that the one or more chunks are unshared between the origin and the one or more unselected snapshots.
