# US 2013/0254483 A1 · Storage apparatus and data management method

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

- Number: US 2013/0254483 A1
- Document ID: US20130254483A1
- Status: Published application
- Kind: A1
- Application number: 13/499,906
- Filed: 2012-03-21
- Published: 2013-09-26
- Earliest claimed: 2012-03-21
- Assignees: Hitachi, Ltd.
- Inventors: Nobuhiro Iida
- Web page: https://patentgrep.com/patent/US20130254483A1

## CPC

- G06F 3/0665: {at area level, e.g. provisioning of virtual or logical volumes}
- G06F 3/061: {Improving I/O performance}
- G06F 3/0619: {in relation to data integrity, e.g. data losses, bit errors}
- G06F 3/0649: {Lifecycle management}
- G06F 3/067: {Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]}
- G06F 3/0683: {Plurality of storage devices}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A storage apparatus comprises storage devices of a plurality of types of varying performance, and a control unit which manages each of storage areas provided by the storage devices of the plurality of types by means of storage tiers of a plurality of different types, and assigns the storage areas in page units to a virtual volume from any of the storage tiers among the storage tiers of the plurality of types, wherein, if the data I/O request is received from the host, the control unit assigns storage areas in page units from the uppermost storage tier to the target areas of the virtual volume corresponding to the I/O request, and wherein the control unit changes the page unit storage area assignment to predetermined areas of the virtual volume from an upper storage tier to a lower storage tier in accordance with the speed of processing of the data I/O request from the host.

## Claims

### Claim 1

A storage apparatus which is coupled to a host which issues a data I/O request via a network, comprising:
storage devices of a plurality of types of varying performance; and
a control unit which manages each of storage areas provided by the storage devices of the plurality of types by means of storage tiers of a plurality of different types, and assigns the storage areas in page units to a virtual volume from any of the storage tiers among the storage tiers of the plurality of types in response to a request to write the data from the host,
wherein, if the data I/O request is received from the host, the control unit assigns storage areas in page units from the uppermost storage tier to the target areas of the virtual volume corresponding to the I/O request, and
wherein the control unit changes the page unit storage area assignment to predetermined areas of the virtual volume from an upper storage tier to a lower storage tier in accordance with the speed of processing of the data I/O request from the host.

### Claim 2 (depends on 1)

The storage apparatus according to claim 1,
wherein, if a target area of the virtual volume corresponding to the I/O request is an area to which a storage tier other than the uppermost storage tier is assigned, the control unit changes page unit storage area assignment to this area from a storage tier other than the uppermost storage tier to a storage tier below the uppermost storage tier.

### Claim 3 (depends on 1)

The storage apparatus according to claim 1,
wherein, in a case where the data I/O request is received from the host and where the target area of the virtual volume corresponding to the I/O request is an area to which a storage area has not yet been assigned, the control unit assigns storage areas in page units from the uppermost storage tier.

### Claim 4 (depends on 1)

The storage apparatus according to claim 1,
wherein the control unit takes a blank area of a predetermined capacity of the uppermost storage tier according to a user designation,
wherein the control unit calculates a time when unused capacity of the uppermost storage tier is depleted and time for securing the blank area on the basis of the speed of processing of the data I/O request from the host, and
wherein, based on the time when the unused capacity is depleted and the time for securing the blank area, the control unit changes page unit storage area assignment to predetermined areas of the virtual volume from the uppermost storage tier to a storage tier below the uppermost storage tier.

### Claim 5 (depends on 4)

The storage apparatus according to claim 4,
wherein the control unit takes, as a blank area, a capacity obtained by adding capacity of a fixed proportion to the uppermost storage tier capacity designed by the user.

### Claim 6 (depends on 4)

The storage apparatus according to claim 4,
wherein the control unit divides the unused capacity of the uppermost storage tier by the speed of processing of the data I/O request with regard to the uppermost storage tier from the host and calculates the time when the unused capacity of the uppermost storage tier is depleted.

### Claim 7 (depends on 4)

The storage apparatus according to claim 4,
wherein the capacity of the blank area of the uppermost storage tier is divided by the speed of processing of the data I/O request to the storage tier below the uppermost storage tier from the host and the time for securing the blank area is calculated.

### Claim 8 (depends on 1)

The storage apparatus according to claim 1, wherein the speed of processing of the data I/O request from the host is calculated from an average value of actual values spanning the previous minute.

### Claim 9

A data management method of a storage apparatus which comprises storage devices of a plurality of types of varying performance; and a control unit which manages each of storage areas provided by the storage devices of the plurality of types by means of storage tiers of a plurality of different types, and assigns the storage areas in page units to a virtual volume from any of the storage tiers among the storage tiers of the plurality of types, the data management method comprising:
a first step in which, if the data I/O request is received from the host, the control unit assigns storage areas in page units from the uppermost storage tier to the target areas of the virtual volume corresponding to the I/O request; and
a second step in which the control unit changes the page unit storage area assignment to predetermined areas of the virtual volume from an upper storage tier to a lower storage tier in accordance with the speed of processing of the data I/O request from the host.

### Claim 10 (depends on 9)

The data management method according to claim 9,
wherein, in the first step, if a target area of the virtual volume corresponding to the I/O request is an area to which a storage tier other than the uppermost storage tier is assigned, the control unit changes page unit storage area assignment to the area from a storage tier other than the uppermost storage tier to a storage tier below the uppermost storage tier.

### Claim 11 (depends on 9)

The data management method according to claim 9,
wherein, in the first step, in a case where the data I/O request is received from the host and where the target area of the virtual volume corresponding to the I/O request is an area to which a storage area has not yet been assigned, the control unit assigns storage areas in page units from the uppermost storage tier.

### Claim 12 (depends on 9)

The data management method according to claim 9, further comprising:
a third step in which the control unit takes a blank area of a predetermined capacity of the uppermost storage tier according to a user designation, and calculates a time when unused capacity of the uppermost storage tier is depleted and time for securing the blank area on the basis of the speed of processing of the data I/O request from the host; and
a fourth step in which, based on the time when the unused capacity is depleted and the time for securing the blank area, the control unit changes page unit storage area assignment to predetermined areas of the virtual volume from the uppermost storage tier to a storage tier below the uppermost storage tier.
