WO2012042678A1 - Computer system and method of managing computer system - Google Patents

Computer system and method of managing computer system Download PDF

Info

Publication number
WO2012042678A1
WO2012042678A1 PCT/JP2010/069222 JP2010069222W WO2012042678A1 WO 2012042678 A1 WO2012042678 A1 WO 2012042678A1 JP 2010069222 W JP2010069222 W JP 2010069222W WO 2012042678 A1 WO2012042678 A1 WO 2012042678A1
Authority
WO
WIPO (PCT)
Prior art keywords
pool
volume
predetermined
real
size
Prior art date
Application number
PCT/JP2010/069222
Other languages
French (fr)
Japanese (ja)
Inventor
健一 木原
正靖 淺野
原 純一
Original Assignee
株式会社日立製作所
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Priority to JP2010218242A priority Critical patent/JP5602564B2/en
Priority to JP2010-218242 priority
Application filed by 株式会社日立製作所 filed Critical 株式会社日立製作所
Priority claimed from US13/054,759 external-priority patent/US8543786B2/en
Publication of WO2012042678A1 publication Critical patent/WO2012042678A1/en

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from or digital output to record carriers, e.g. RAID, emulated record carriers, networked record carriers
    • G06F3/0601Dedicated interfaces to storage systems
    • G06F3/0628Dedicated interfaces to storage systems making use of a particular technique
    • G06F3/0638Organizing or formatting or addressing of data
    • G06F3/0644Management of space entities, e.g. partitions, extents, pools
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from or digital output to record carriers, e.g. RAID, emulated record carriers, networked record carriers
    • G06F3/0601Dedicated interfaces to storage systems
    • G06F3/0602Dedicated interfaces to storage systems specifically adapted to achieve a particular effect
    • G06F3/0604Improving or facilitating administration, e.g. storage management
    • G06F3/0607Improving or facilitating administration, e.g. storage management by facilitating the process of upgrading existing storage systems, e.g. for improving compatibility between host and storage device
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from or digital output to record carriers, e.g. RAID, emulated record carriers, networked record carriers
    • G06F3/0601Dedicated interfaces to storage systems
    • G06F3/0628Dedicated interfaces to storage systems making use of a particular technique
    • G06F3/0629Configuration or reconfiguration of storage systems
    • G06F3/0631Configuration or reconfiguration of storage systems by allocating resources to storage systems
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from or digital output to record carriers, e.g. RAID, emulated record carriers, networked record carriers
    • G06F3/0601Dedicated interfaces to storage systems
    • G06F3/0668Dedicated interfaces to storage systems adopting a particular infrastructure
    • G06F3/067Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]

Abstract

The present invention selectively implements an adequate coping method if the volume of pool for providing a real storage area to a virtual logic volume becomes insufficient. A management computer determines whether or not a given pool needs to extend the pool size exists on the basis of the use conditions of each pool. If a given pool is detected, of a volume adding method for adding unused real volume to the given pool and a data transfer method for transferring virtual logic volume data to another pool except for the given pool, the management computer selects at least any one of the methods on the basis of a given selection criterion, and extends the pool size of the given pool in accordance with the selected method.

Description

Computer system and computer system management method

The present invention relates to a computer system and a computer system management method.

Large storage is also called a storage subsystem, which not only enables high-speed and large-capacity data storage, but also has advanced data management functions. A plurality of physical storage devices such as hard disk drives are mounted in the storage. A logical volume, which is a logical storage area, is configured using the storage areas in these storage devices. The storage apparatus provides a logical volume to the host computer. The host computer reads / writes data from / to the logical volume.

In recent years, thin provisioning technology that improves the capacity efficiency of logical volumes has been proposed. Thin provisioning technology provides a host with a virtual logical volume (hereinafter referred to as a virtual volume) in place of a conventional logical volume.

A conventional logical volume requires a physical storage area (real storage area) of a size specified at the time of volume creation. On the other hand, in the virtual volume, when data is actually written, a real storage area for storing the data is taken out of the pool and assigned to the virtual volume. When the thin provisioning technology is used, it is not necessary to allocate a real storage area to a virtual volume until data is actually written, so that the real storage area can be saved.

However, depending on the status of data writing to the virtual volume, the amount of data written to the virtual volume may exceed the size of the real storage area that can be allocated to the virtual volume. If the real storage area to be allocated to the virtual volume is insufficient, an error may occur.

Therefore, when the thin provisioning technology is used, it is preferable to accurately manage the amount of the real storage area (actual usage amount) that can be allocated to the virtual volume.

In the first conventional technique, when a capacity shortage occurs in a pool, an available volume is added to the pool to expand the size of the pool (Patent Document 1). In the second conventional technique, the lack of capacity of the migration source pool is resolved by migrating the virtual volume using the pool to another pool (Patent Document 2).

JP 2007-193573 A JP 2010-86424 A

The above-mentioned two methods are known as countermeasures when the pool size is insufficient. However, since the configuration of the computer system is complicated and the situation changes, the user who is an administrator of the computer system is confused about which countermeasure should be selected.

∙ In a heterogeneous computer system with multiple heterogeneous storages, it is more difficult to select an appropriate countermeasure because there are many factors to consider. In particular, a user who has little experience and lacks knowledge does not have a standard to rely on, so the selection of the target method becomes more difficult.

Therefore, an object of the present invention is to reduce the burden on the administrator and expand the pool size by selecting and executing at least one method from a plurality of methods based on a predetermined selection criterion. The object is to provide a computer system and a management method of the computer system.

In order to solve the above problems, a computer system according to the present invention includes a plurality of storage control devices that generate at least one virtual logical volume, at least one host computer that uses a virtual logical volume, and each storage control. A computer system including an apparatus and at least one management computer for managing a host computer, wherein each storage control device has a real storage area of a real volume in a pool in response to a write access from the host computer Is assigned to a virtual logical volume, and write data received from the host computer is stored in the allocated real storage area. The management computer is read and executed by the microprocessor and the microprocessor. Memory for storing a predetermined computer program and each storage control device And a communication interface unit for communicating with the host computer, and the microprocessor reads and executes a predetermined computer program to obtain the use state of each pool, and the obtained use state of each pool And (A) a volume addition method for adding an unused real volume to the predetermined pool when a predetermined pool is detected and whether or not there is a predetermined pool that needs to be expanded. (B) At least one method is selected based on a predetermined selection criterion among data movement methods for moving data of a virtual logical volume to another pool other than the predetermined pool, and according to the selected method Increase the pool size of a given pool.

When selecting either the volume addition method or the data movement method, the microprocessor can expand the pool size of a given pool within a given time in consideration of the operating status of application programs that use virtual logical volumes. It can also be determined whether or not it is completed.

The volume addition method may include a first volume addition method for adding an unused first real volume, which is included in a predetermined storage control device to which a predetermined pool belongs among the storage control devices, to the predetermined pool. .

When the microprocessor executes the first volume addition method, the volume size of the first real volume, the attribute label preset in the predetermined pool, and the first real volume are preset as the predetermined selection criteria. It is also possible to consider the conformity state with the attribute label being used and the response performance of the predetermined pool when the first real volume is added to the predetermined pool.

In the volume addition method, the second real volume of each storage controller other than the predetermined storage controller is connected to the predetermined storage controller, so that the second A second volume addition method for adding an unused real volume to a predetermined pool may be included.

In the volume addition method, the third real volume provided in the first other pool of the predetermined storage control device is removed from each storage control device, and the removed third real volume is unused. A third volume addition method may be included in which a real volume is added to the predetermined pool.

In the volume addition method, the fourth real volume provided in the second other pool of the other storage control device other than the predetermined storage control device is removed, and the removed fourth real volume is removed. A fourth volume addition method for adding an unused real volume to a predetermined pool may be included.

The data movement method may include a first data movement method in which the host computer moves the data of the virtual logical volume to a pool other than the predetermined pool.

The data movement method may include a second data movement method in which a predetermined storage controller moves data of a virtual logical volume to a pool other than the predetermined pool.

The present invention can also be understood as a computer program or a recording medium for recording a computer program. Furthermore, the present invention is not limited to the combination of the above-described viewpoints, and can include combinations other than those.

FIG. 1 is an overall configuration diagram of a computer system according to the present embodiment. FIG. 2 is a diagram schematically illustrating a pool size expansion method. FIG. 3 is a diagram illustrating information on virtual volumes used by the host. FIG. 4 is a diagram showing storage information. FIG. 5 is a diagram illustrating pool information. FIG. 6 is a diagram showing information on unused volumes. FIG. 7 is a diagram illustrating management policy information. FIG. 8 is a flowchart of processing for monitoring the usage rate of the pool. FIG. 9 is a flowchart of processing for expanding the pool size. FIG. 10 is a flowchart showing a process for expanding the pool size in its own storage. FIG. 11 is a flowchart of processing for moving a virtual volume. FIG. 12 is a flowchart showing processing for expanding the pool size using another storage. FIG. 13 is a flowchart showing a process for expanding a pool size by diverting a volume used in another pool. FIG. 14 is a schematic diagram showing how a real storage area in a pool is allocated to a virtual volume and the effect obtained when the host computer moves the virtual volume.

Hereinafter, embodiments of the present invention will be described with reference to the drawings. In this embodiment, as will be described later, when a pool size is insufficient, a method for selecting a countermeasure for resolving the capacity shortage is presented.

Measures may be selected based on the following viewpoints, for example.

(Aspect 1) Considering an environment where heterogeneous host computers and heterogeneous storages coexist. Coping functions (for example, a function for expanding a pool and a virtual volume) possessed by each host computer and each storage included in the computer system Function) is not necessarily the same. Accordingly, the management computer selects the coping method after grasping the presence / absence of the coping function and the preconditions.

(Aspect 2) Consideration regarding the urgency of response and the time required for response Reduce the risk that may occur if a response method with a longer required time is selected and implemented. The risk is that the pool size is not expanded in time and the pool size is exhausted. For example, care should be taken when selecting a countermeasure for moving a virtual volume to another pool while the application program is not running. If the application program starts running before the migration of the virtual volume is completed, the pool size may be exhausted. On the other hand, the shorter the required time, the better. If a countermeasure with a shorter time than necessary is selected, the degree of freedom in selecting the countermeasure may be reduced, which may affect usability.

(Aspect 3) Consideration regarding optimization of pool usage rate Even if a measure is taken, the shortage of capacity will not be resolved if the pool usage rate remains high. In other words, it is necessary to implement an effective countermeasure for reducing the pool usage rate. However, operations that lower the pool usage rate more than necessary will result in wasted storage size.

(Aspect 4) Consideration regarding attributes of volumes and pools Virtual volumes, real volumes (logical volumes), and pools have attributes (for example, performance, price, department, etc.) according to their configuration or purpose. If these attributes are ignored and the virtual volume is moved to another pool or a real volume is freely added to the pool, the usability and the like may decrease. For example, a virtual volume that requires a high-speed response is moved to a pool with low response performance, or a virtual volume that requires high reliability is moved to a pool with low reliability. Furthermore, for example, when a low-speed logical volume is added to a pool composed of high-speed logical volumes, the response performance of the pool decreases. Therefore, an attribute label (referred to as “category” in the embodiment described later) is set for the virtual volume, logical volume, and pool, and a countermeasure is selected so that the attribute label matches.

(Aspect 5) Consideration regarding performance change before and after execution of countermeasure When executing the countermeasure, the performance of the virtual volume or the performance of the pool changes. Take this into consideration when selecting a corrective action so that the performance of the virtual volume or the performance of the pool does not fall below the allowable range before and after executing the corrective action.

Hereinafter, modes for carrying out the invention will be described with reference to the drawings. FIG. 1 is an overall configuration diagram of a computer system according to this embodiment. The computer system includes, for example, at least one management terminal 10, at least one management computer 20, a plurality of storages 30, at least one host computer 40, a management network 51, and a storage network 52.

The management terminal 10, the management computer 20, each storage 30 and the host computer 40 are connected by a management network 51 so that bidirectional communication is possible. Furthermore, the management computer 20, each storage 30 and the host computer 40 are connected by a storage network 52 so that bidirectional communication is possible.

The management network 51 and the storage network 52 are communication lines, and are communication paths for transmitting and receiving data between information processing apparatuses. In FIG. 1, the management network 51 and the storage network 52 are shown as separate communication lines, but both networks 51 and 52 may be configured as a common communication line.

The management terminal 10 is an information processing apparatus. For example, the memory 11, a microprocessor (CPU in the figure) 12, a display device 13, a keyboard 14, a mouse 15, a host interface (hereinafter referred to as an I / O interface). F and display) 16.

The memory 11 stores data and computer programs. A microprocessor (hereinafter referred to as a processor) 12 reads a computer program from the memory 11 and executes it. The display device 13 displays data and the like. The keyboard 14 receives input by characters from the user. The mouse 15 is used to point to an arbitrary point on the screen displayed on the display device. The host I / F 16 transmits / receives data to / from the management computer 20 via the management network 51. The user interface is not limited to a display device, a keyboard, and a mouse. For example, a voice instruction device, an electroencephalogram instruction device, or the like can be used.

The console program 111 is stored in the memory 11. When the processor 12 executes the console program 111, a function of exchanging data with the management computer 20 via the host I / F 16 and the management network 51, a function of displaying information on the display device 13, a keyboard 14 and a mouse 15 and a function of accepting an input from the user via 15.

The management terminal 10 is used as a window for a user (storage administrator) who is involved in storage operation and management to operate and manage the storage 30.

The management computer 20 is an information processing apparatus, and includes, for example, a memory 21, a processor 22, a SAN I / F 23, and a host I / F 24.

The memory 21 stores data and computer programs. The processor 22 reads a computer program from the memory 21 and executes it. Thereby, each function mentioned later is realized. The SAN I / F 23 is a circuit for performing an operation instruction or information inquiry to each storage 30 via the storage network 52. The host I / F 24 is a circuit for data communication with the other information processing apparatuses 10, 30, and 40 via the management network 51.

The management server program 211 is a computer program for managing each storage 30 and is stored in the memory 21. The host-volume information 212 is information for managing the configuration and usage of the virtual volume used on the host computer 40. The storage information 213 is information for managing the functions installed in each storage 30. The pool information 214 is information for managing the configuration and usage status of each pool. The unused volume information 215 is information regarding unused volumes in each storage 30. The management policy information 216 is information that defines the operation of the management server program 211.

Host-volume information 212, storage information 213, pool information 214, unused volume information 215, and management policy information 216 are stored in the memory 21. Details of the information 212, 213, 214, 215, 216 will be described later.

Although FIG. 1 shows a case where the management computer 20 and the host computer 40 are separately configured, the host computer 40 may be made to realize the function of the management computer instead. For example, the computer program 211 and the various management information 212 to 216 of the management computer 20 may be provided in at least one of the plurality of host computers 40.

Each storage 30 as a “storage control device” is a device for storing information. Each storage 30 includes, for example, a storage controller 31 and a disk unit 32.

The storage controller 31 includes a host I / F 311, a SAN I / F 312, a microprocessor 313, a memory 314, and a disk controller 315. The host I / F 311 is a circuit for connecting to the management network 51. The SAN I / F 312 is a circuit for connecting to the storage network 52.

In the memory 314, for example, an input / output processing program (I / O program in the figure) 3141, a volume migration program (migration program in the figure) 3142, and a thin provisioning program 3143 are stored. The microprocessor 313 reads and executes these computer programs 3141, 3142, 3143. The disk controller 315 controls reading and writing of data with respect to the disk drive 321.

The disk unit 32 includes a plurality of disk drives 321. It is possible to group physical storage areas that each disk drive 321 has, and to set a plurality of logical storage areas in the grouped physical storage areas. The logical storage area is called a logical volume 322.

As the disk drive, for example, various devices capable of reading and writing data such as a hard disk drive, a semiconductor memory drive, an optical disk drive, and a magneto-optical disk drive can be used.

When using a hard disk drive, for example, an FC (Fibre Channel) disk, a SCSI (Small Computer System Interface) disk, a SATA disk, an ATA (AT Attachment) disk, a SAS (Serial Attached SCSI) disk, or the like can be used. Also, for example, flash memory, FeRAM (Ferroelectric Random Access Memory), MRAM (Magnetoresistive Random Access)
Various storage devices such as “Memory”, phase change memory (Ovonic Unified Memory), and RRAM (Resistance RAM) can also be used.

The input / output processing program 3141 defines a logical volume in response to a request from the management computer 20. Further, the input / output processing program 3141 reads / writes data from / to the logical volume and virtual volume in response to a request from the host computer 40.

The volume migration program 3142 migrates the virtual volume to another pool in response to an instruction from the management computer 20. A description of the virtual volume and the pool will be described later with reference to FIG.

The thin provisioning program 3143 provides, for example, pool configuration management, pool operation management, virtual volume configuration management, virtual volume operation management, data read / write function, and the like.

The host computer 40 is an information processing apparatus, and includes, for example, a SAN I / F 41, a host I / F 42, a processor 43, and a memory 40.

The SAN I / F 41 is a circuit for data communication with each storage 30 via the storage network 52. The host I / F 42 is a circuit for data communication with the management computer 20 via the management network 51.

In the memory 44, for example, a management agent program 441, a migration program (also referred to as a volume migration program) 442, an application program 443, and an OS (operating system) 444 are stored. The processor 43 reads and executes each computer program 441, 442, 443.

The management agent program 441 executes the volume migration program 442 based on an instruction from the management server program 211.

The volume migration program 442 is a program for migrating data of a logical volume or a virtual volume to another logical volume or another virtual volume.

The application program 443 is a program for executing business processing on the host computer 40.

The OS 444 is basic software that is an execution base of the management agent program 441 and the application program 443.

FIG. 2 is a conceptual diagram showing a logical configuration of an information processing system using the thin provisioning technology and a coping method when the pool capacity is insufficient.

First, the pool and virtual volume in the thin provisioning technology will be described. The storage 30 (1) is a storage specified by an identification name “DKC-A”. The storage 30 (1) includes a pool 611 identified by an identification name “POOL-A”.

The pool 611 includes a plurality of logical volumes 621, 622, and 623. To the pool 611, a virtual volume 631 identified by an identification name “VVOL-A” and a virtual volume 632 identified by an identification name “VVOL-B” belong.

The virtual volume 631 is a volume 651 specified by the identification name “VOL-A” on the host computer 40 (1). The volume 651 is used from the application program 443 (1) specified by the identification name “AP-A”. In such a configuration, when the application program 443 (1) writes data to the volume 651, the following processing is performed.

The OS 444 that has received a write request for the volume 651 issues a write request to the virtual volume 631 corresponding to the volume 651 to the storage 30 (1). The input / output processing program 3141 in the storage 30 (1) that has received the write request notifies the thin provisioning program 3143 that there has been a write request. When the thin provisioning program 3143 receives the notification, it is determined whether or not the storage area (real page or chunk) in the pool 611 has been allocated to the write target storage area (virtual page) among all the storage areas of the virtual volume 631. Determine.

When the thin provisioning program 3143 determines that the real page is not allocated to the write target virtual page, the thin provision program 3143 selects the real page from the real storage area of each logical volume configuring the pool 611, and Assign to a virtual page.
The data from the application program 443 (1) is written in the real page assigned to the virtual page. When a real page has already been assigned to the virtual page to be written, the data written from the application program 443 (1) is stored in the assigned real page.

The above processing is similarly performed for the virtual volume 632 sharing the pool 611, the volume 652 using the same, and further the application program 443 (2). An amount of storage area (real storage area) corresponding to the sum of the total number of real pages assigned to the virtual volume 631 and the total number of real pages assigned to the virtual volume 632 is used from the pool 611. .

Next, how to deal with when the pool size is insufficient is described. For example, the following five methods can be cited as a countermeasure when the capacity of the pool 612 in the storage 30 (2) becomes insufficient.

The first countermeasure is to expand the pool 612 using an unused volume 642 in the same storage 30 (2) (arrow 691 in FIG. 2). When an unused volume 642 exists in the storage 30 (2), the size of the pool 612 can be expanded by adding the volume 642 to the pool 612.

The second countermeasure is to expand the pool 612 using the unused volume 643 in the other storage 30 (4) (arrow 692 in FIG. 2). The condition that the second countermeasure can be used is that the unused volume 643 exists in the other storage 30 (4), and the function in which the storage 30 (2) accesses the volume in the other storage 30 (4). It is to have.

The function in which one storage 30 (2) accesses the volume 643 in the other storage 30 (4) can be called an external connection function. When viewed from one storage 30 (2), the other storage 30 (4) is an external storage existing outside the one storage 30 (2). The volume 643 in the other storage 30 (4) is an external volume existing outside the one storage 30 (1). A virtual volume 625 for connecting to the external volume 643 is provided in one storage 30 (1). The connection volume 625 can be called an external connection volume. The size of the pool 612 can be expanded by adding the external connection volume 625 to the pool 612.

When connecting the external volume 643 and the external connection volume 625, a connection table that defines the connection relationship between the external volume 643 and the external connection volume 625 is provided. In simple terms, the connection table is a mapping table showing the correspondence between the storage space of the external connection volume 625 and the storage space of the external volume 643.

When one storage 30 (2) receives a command from the host computer, it converts the command into a command for transmitting to the other storage 30 (4) using the mapping table. One storage 30 (2) transmits the converted command to the other storage 30 (4). One storage 30 (2) responds to the host computer based on the response from the other storage 30 (4).

The third countermeasure is to divert the logical volume 627 constituting the pool 614 in the other storage 30 (4) and expand the pool 612 (arrow 693 in FIG. 2). The condition that the third countermeasure can be used is that the logical volume 627 can be removed from the pool 614 in the other storage 30 (4) in addition to the condition of the second countermeasure.

The fourth countermeasure is to migrate the virtual volume 634 to the pool 613 in the other storage 30 (3) using the function of the storage 30 (2) (arrow 694 in FIG. 2). The condition that the fourth countermeasure can be used is that the storage 30 (2) has a function of migrating the virtual volume 634 to the other storage 30 (3), and that there is enough capacity to accommodate the virtual volume 634. It exists in the migration destination pool 613. To migrate the virtual volume 634 to another pool 613 means to associate the virtual volume 634 with the storage area of the other pool 613.

Note that in executing the function of migrating the virtual volume 634 to another pool 693, it may be a prerequisite that the application program 443 (3) is not operating (not operating). In that case, the precondition is also included in the conditions for using the fourth countermeasure.

The fifth countermeasure is to migrate the virtual volume to the pool 611 in the other storage 30 (1) using the function of the host computer 40 (2) (arrow 695 in FIG. 2). The condition that the fifth countermeasure can be used is that the host computer 40 (2) has a function of migrating the virtual volume 633 (the migrated virtual volume 632) from the storage 30 (2) to the other storage 30 (3). And the migration destination pool 611 has a sufficient capacity to accommodate the virtual volume 633.

As in the case of the fourth countermeasure, when executing the function of migrating the virtual volume 633 to another pool 611, when the application program 443 (2) is stopped (non-operating) as a precondition, the precondition It is necessary to satisfy.

If there are a plurality of pools in the storage 30 (2), the virtual volume can be migrated from one pool in the storage 30 (2) to another pool in the storage 30 (2). Furthermore, it is possible to remove a logical volume constituting another pool in the storage 30 (2) and add it to one pool.

Next, various information used by the management server program 211 and processing executed by the management server program 211 will be described. Hereinafter, a case where the management server program 211 automatically executes the selected countermeasure will be described. Instead, the management server program 211 may be configured to stop presenting the selected countermeasure to the user. If the user approves the presented countermeasure, the countermeasure is executed.

FIG. 3 shows the data structure and data example of the host-volume information 212 used by the management server program 211. The host-volume information 212 holds information for each virtual volume. The attribute information includes a virtual volume number (VVOL # in the figure) 2121, an application program number (AP # in the figure) 2122, an assigned pool number (POOL number in the figure) 2123, a use size 2124, and an application program operation period 2125. , Volume migration function (migration function in the figure) 2126 and cost category 2127.

In the following description, a name, an identifier, identification information, and a number are information used to distinguish an object from other objects, and can be converted into each other. For example, the virtual volume number can be called a virtual volume identifier or a virtual volume name. Further, the configuration of each table is not limited to the illustrated example. For example, information necessary in this embodiment can be managed by linking a plurality of tables.

Next, each attribute of the host-volume information 212 will be described. The virtual volume number 2121 holds the identification name of the virtual volume. The application program number 2122 holds the identification name of the application program 443 that uses the virtual volume. The affiliation pool number 2123 holds the identification name of the pool to which the virtual volume belongs. The used size 2124 holds the size that is actually used among all the volume sizes of the virtual volume, in other words, the size to which pages in the pool are allocated.

The application program operating period 2125 holds the operating period of the application program 443 that uses the virtual volume. The volume migration function 2126 indicates whether or not volume migration is possible on the host computer 40 that uses the virtual volume. If possible, it also indicates whether or not the application program 443 can be migrated. In the example of FIG. 3, “I / O non-stop” indicates that the virtual volume can be migrated while the application program 443 is running.

The cost category 2127 indicates the cost category of the pool to which the virtual volume belongs. The cost category is an identification name. The cost classification is set to distinguish the grade of each logical volume constituting the pool or the department to which it belongs.

¡Grades are classified according to the price range of logical volumes, for example. For example, “A” indicates a volume in a high price range, “B” indicates a volume in a medium price range, and “C” indicates a volume in a low price range. The pool in which the cost category “A” is set is configured only from volumes in the high price range. The pool in which the cost classification “A, B” is set is configured with a high price range volume and / or a medium price range volume. A high price range volume can be called a high reliability volume, a medium price range volume can be called a medium reliability volume, and a low price range volume can be called a low reliability volume. The high reliability volume is composed of a high reliability disk drive. The medium reliability volume is composed of medium reliability disk drives. The low reliability volume is composed of a low reliability disk drive.

The department to which the organization belongs is used when the logical volumes that make up the pool are allocated by department. “A” is set for department A, “B” for department B, and “C” for department C. Cost partitioning is used to prevent changes in the nature or positioning of virtual volumes and pools.

By determining whether or not the cost classification is suitable, for example, an important virtual volume to be associated with a pool composed of high-priced logical volumes is composed of low-priced logical volumes. Can be prevented from being transferred to the pool. Alternatively, the virtual volume used in the department A can be prevented from being migrated to a pool configured with the logical volume of the department B.

Cost category 2144 may include a plurality of categories as described above. If multiple categories are set, it indicates that both are applicable. The host-volume information 212 includes information that can be acquired from the thin provisioning program 3143 in the storage 30, the application program 443 on the host computer 40, the volume migration program 442, and the like, and information input from the administrator. Can be created based on.

FIG. 4 shows a data structure and data example of the storage information 213 used by the management server program 211. The storage information 213 holds information in units of storage 30. The attribute information includes a storage number (storage # in the figure) 2131, a volume migration function (migration function in the figure) 2132, and an access function to volumes in other storages (external connection function in the figure) 2133.

The storage number 2131 holds the identification name of the storage 30. The volume migration function 2132 holds whether or not the storage 30 has a volume migration function. If it has a migration function, it also indicates whether or not migration is possible only when the application program 443 is stopped. For example, “I / O stop” in the example of FIG. 4 indicates that the volume can be migrated only when the application program 443 is stopped and no I / O request is generated. The storage information 213 can be created based on information that can be acquired from the input / output program 3141 and the volume migration program 3142 in the storage 30.

FIG. 5 shows a data structure and data example of the pool information 214 used by the management server program 211. The pool information 214 holds information for each pool. The attribute information includes a pool number (pool # in the figure) 2141, a pool size 2142, a usage rate 2143, and a cost category 2144.

The pool number 2141 holds a pool identification name. The pool size 2142 holds the total size of the pool, that is, the total size of real pages that can be allocated to the virtual volume. The usage rate 2143 indicates the ratio of the page size allocated to the virtual volume in the pool size 2142. When all pool sizes are assigned to virtual volumes, the usage rate is 100%.

The cost category 2144 is assigned for the same purpose as the cost category 2127 in the host-volume information 212. The cost category 2144 is an identification name for distinguishing the logical volumes constituting the pool. The pool information 214 may be created based on the thin provisioning program 3143 in the storage 30 and information directly input from the administrator.

FIG. 6 shows the data structure and data string of the unused volume information 215 used by the management server program 211. The unused volume information 215 holds information in unused volume units. The attribute information includes an unused volume number 2151, a storage number 2152, a size 2153, and a cost category 2154.

The unused volume number 2151 holds the identification name of the unused volume. The storage number 2152 holds the identification name of the storage in which the unused volume exists. The size 2153 holds the storage size of the unused volume. The cost category 2154 holds an identification name indicating the cost category of the unused volume. The cost category 2154 may hold a plurality of identification names. The unused volume information 215 may be created based on the thin provisioning program 3143 in the storage 30, information that can be acquired from the disk controller 315, information that is directly input from the administrator, and the like.

FIG. 7 shows the data structure and data string of the management policy information 216 used by the management server program 211. The management policy information 216 holds information for each management policy. The management policy is information indicating a guideline for the management server program 211 to execute various management operations. The management policy indicates, for example, a response policy when the pool size is insufficient.

The attributes of the management policy information 216 are a policy number 2161, an application target 2162, an activation condition 2163, an action 2164, and a success condition 2165. The policy number 2161 holds a policy identification name. The application target 2162 holds a policy application target. In the example of FIG. 7, “all pools” indicates that the same policy is applied to all pools. When the identification name of a specific pool is specified as an application target, the policy is applied only to the specified pool.

The activation condition 2163 holds a condition that triggers execution of a specific action. In the example of FIG. 7, the activation condition is defined as a condition regarding the pool usage rate. The action 2164 holds the type of action. Examples of action types include “pool size expansion” and “warning”. “Pool size expansion” means, for example, expanding the pool size when the pool size is insufficient. “Warning” means, for example, issuing a warning to the user when the pool size is likely to be insufficient.

The success condition 2165 holds the condition that is the purpose of the action. In the illustrated example, the action success condition (purpose) is to keep the pool usage rate within a specific range. The management policy information 216 may have a configuration prepared in advance by the vendor of the management server program 211, or a configuration that can be manually created by an administrator.

FIG. 8 is a flowchart showing a process for monitoring the capacity usage rate of the pool. Hereinafter, step is abbreviated as S. The capacity usage rate of the pool is an index for measuring whether the pool size is excessive or insufficient, and the closer the value is to 100%, the more insufficient the size is. In monitoring the capacity usage rate, a threshold value for monitoring is set in advance, and some action is executed when the capacity usage rate of each pool exceeds the threshold value. The specific procedure is shown below. In the following description, the subject of the operation will be described as a management computer. Since the following functions are realized by the microprocessor 22 reading and executing the management server program 211, the microprocessor 22 or the management server program 211 can also be described as an operation subject.

The management computer 20 refers to the pool information 214 and selects the first pool (S8101). The management computer 20 determines whether or not the processing target pool has been selected (S8102). If there is no pool to be selected, the process ends (S8102: NO). If there is a pool to be selected, the following processing is executed.

The management computer 20 acquires the capacity usage rate of the selected pool (S8103). The management computer 20 checks whether or not the capacity usage rate acquired in S8103 has exceeded the threshold defined in the management policy information 216 (S8104). In other words, it is determined whether or not the acquired capacity usage rate matches the activation condition 2163.

If the capacity usage rate exceeds the threshold (S8104: YES), the management computer 20 executes a process of expanding the pool size to cope with the capacity shortage (S8105). Details of the pool size expansion process will be described later with reference to FIG.

If the capacity usage rate of the processing target pool does not match the activation condition (S8104: NO), S8105 is skipped.

The management computer 20 selects the next pool from the pool information 214 as a new processing target pool (S8106), and returns to S8102. When the processing is completed for all the pools registered in the pool information 214 and there are no selectable pools (S8102: NO), this processing ends normally.

FIG. 9 is a flowchart of processing for expanding the pool size in order to cope with the shortage of the pool size. The flowchart of FIG. 9 is executed in S8105 of FIG. In this process, the appropriateness of each countermeasure when the pool size is insufficient is evaluated in order, and the countermeasure that is evaluated as valid is executed. A specific procedure will be described below. Hereinafter, the processing target storage 30 is referred to as a self storage, and is distinguished from other storages other than the processing target storage.

First, the management computer 20 determines whether or not the pool expansion is possible in the storage (self-storage) where the capacity is insufficient, and executes it if it is possible (S8201). Details of the process of expanding the pool size in the own storage will be described later with reference to FIG. When the pool capacity shortage is resolved by the execution of S8201 (S8202: YES), this process ends.

If the shortage of the pool capacity is not resolved even after executing S8201 (S8202: NO), the management computer 20 creates a list of other storages (other storage list) excluding its own storage based on the storage information 213 (S8203). ). In addition, instead of creating the other storage list separately from the storage information 213, the configuration may be such that information on other storage is acquired from the storage information 213. In that case, the local storage is not selected in S8204 and S8211.

The management computer 20 selects one other storage described at the top of the other storage list (S8204). The management computer 20 determines whether another storage subject to processing has been selected (S8205). If another storage could not be selected (S8205: NO), the management computer 20 issues an alert indicating that a method for resolving the pool capacity shortage is not found (S8206), and ends this process.

If another storage to be processed can be selected (S8205: YES), the management computer 20 checks the validity of the coping method of expanding the pool size by virtual volume migration, and executes the coping method if it is valid ( S8207). A method for expanding the pool size by moving the virtual volume will be described later with reference to FIG. As a result of processing S8207, when the pool capacity shortage is resolved, this processing ends (S8208: YES).

If either the virtual volume cannot be moved or if the lack of the pool capacity is not resolved even if the virtual volume is moved (S8208: NO), the management computer 20 uses the other storage storage pool size. The validity of the coping method of extension of is checked, and if it is valid, the coping method is executed (S8209). Details of S8209 will be described later with reference to FIG.

If the pool capacity deficiency is resolved as a result of executing the pool size expansion method using other storage, this processing is terminated (S8210: YES). If the pool capacity shortage cannot be resolved even if other storage is used (S8210: NO), the management computer 20 selects the next other storage from the other storage list (S8211), and returns to S8205.

FIG. 10 is a flowchart showing a process of expanding the pool size in the own storage, and is executed in S8201 of FIG. In the following processing, the validity of each unused volume in its own storage is evaluated as to whether it is appropriate as a pool size expansion volume in terms of its size, its cost, and its performance. An unused volume that is evaluated as valid is added to a pool of insufficient size, causing the pool to expand in size.

First, the management computer 20 creates a list of unused volumes in its own storage (hereinafter also referred to as a candidate volume list for expansion) from the unused volume information 215 (S8301).

Note that the candidate volume list may be obtained from the unused volume information 215 instead of creating the candidate volume list separately from the unused volume information 215. In that case, in S8302 and S8307, only an unused volume in the own storage is selected.

The management computer 20 selects the first unused volume from the candidate volume list (S8302). If there is no selectable unused volume (S8303: NO), the process is terminated as the countermeasure is incomplete. If no selectable unused volume is found (S8303: NO), a process (S8600) described later with reference to FIG. 13 may be performed.

When the management computer 20 can select one unused volume from the candidate volume list (S8303: YES), the management computer 20 determines whether or not the size of the unused volume is a predetermined size (S8304).

The predetermined size is, for example, a size necessary for solving the shortage of the pool size. Specifically, the predetermined size means a size necessary to satisfy the success condition 2165 of the management policy. Thus, whether or not the size of the unused volume matches the purpose can be determined based on the contents of the management policy list 216.

For example, for a pool with a capacity usage rate of 75%, as shown in FIG. 7, a policy with a startup condition 2163 of “pool usage rate 70 to 84%” is applied. The content of the success condition 2165 regarding the action of the policy is defined as “reducing the pool usage rate to a range of 40-60%”. Here, the reason why the lower limit of the usage rate of “40%” is set is to prevent excessive measures. From the current pool size and capacity usage rate, the additional size required to obtain the target capacity usage rate is obtained by the following equation (1).

(Additional size) = (1 / Target capacity usage rate) x Current capacity usage rate x Current pool size-Current pool size ... (1)

If the size of the selected unused pool is 100 TB, the additional size necessary for setting the capacity usage rate 75% to 40% is (1 ÷ 0.4) × 0. 75 × 100−100 = 87.5 TB. Similarly, the additional size necessary for setting the capacity usage rate 75% to 60% is (1 ÷ 0.6) × 0.75 × 100−100 = 25 TB.

Therefore, in order to keep the capacity usage rate of the pool within the range of 40% to 60% from the current 75%, an additional size in the range of 25 TB to 87.5 TB is required. If the size of the selected unused volume is within the above range, it can be determined that pool expansion using that volume is appropriate.

If the size of the selected unused volume does not match the predetermined size (S8304: NO), the management computer 20 selects the next unused volume from the candidate volume list (S8307), and proceeds to S8303.

If the size of the selected unused volume matches the predetermined size (S8304: YES), the management computer 20 evaluates the validity of the cost category of the unused volume (S8305). In the figure, for convenience, the “cost category” is simply expressed as “cost”.

Specifically, in the management computer 20, the content of the cost category set for the selected unused volume (the content of the cost category 2154 of the unused volume information 215) is set in the allocation destination pool. It is determined whether or not it is included in the content of the cost category (the content of the cost category 2144 of the pool information 214).

For example, as shown in FIG. 6, “A” is set as the cost category 2154 for the unused volume having the identification name “UVOL-A”. On the other hand, as shown in FIG. 5, “A, B” is set as the cost category 2144 in the pool having the identification name “POOL-B”. In this case, since the cost category “A” of the unused volume is included in the cost category “A, B” of the pool, the cost category of the pool (POOL-B) matches the cost category of the unused volume. To do.

If it is determined that the unused pool cost category and the pool cost category do not match (S8305: NO), the management computer 20 moves to S8307.

If the unused volume cost category and the pool cost category match (S 8305: YES), the management computer 20 predicts and evaluates the performance after the pool size is expanded (8306). When the selected unused volume is added to the pool, the management computer 20 determines whether or not the pool can maintain performance of a predetermined value or higher.

For example, when a low-speed logical volume is added to a pool that is composed of high-speed logical volumes, the average response performance of the pool decreases. When the response performance of the pool decreases, the I / O performance of the virtual volume that uses the pages in the pool also decreases.

In order to prevent the performance of the virtual volume from degrading, for example, the unused volume to be added may be limited to a logical volume having the same or better performance than the currently used logical volume.

Note that adding an unused volume to a pool increases the parallelism of I / O processing for each logical volume in the pool. Therefore, even when a low-speed logical volume is added, the average performance as a pool may not decrease or may increase. In S8306, this point may be taken into consideration.

Furthermore, in S8306, the degree of performance degradation of the virtual volume may be estimated, and if the degree is within the allowable range, the selected unused volume may be added to the pool.

When it is predicted that no performance problem will occur after the volume is added (S8306: YES), the management computer 20 causes the selected unused volume to be expanded (S8308), and the process is terminated. To do.

When it is predicted that when the selected unused volume is added to the pool, the pool cannot maintain the performance exceeding the predetermined value (S8306: NO), the management computer 20 selects the next unused volume from the candidate volume list. (S8307) and the process returns to S8303.

Note that the processing of FIG. 10 describes a case where a shortage of the capacity of the pool can be dealt with by simply adding one unused volume to the pool. However, the present invention is not limited to the configuration in which one unused volume is added, and a configuration in which a plurality of unused volumes are added to the pool to solve the pool capacity shortage may be employed.

In this case, for example, in the size check in S8304, it is determined that the size of the unused volume matches the additional purpose except when the size exceeds the upper limit. Then, a list of unused volumes that pass each check of S8305 and S8306 is created, and a plurality of unused volumes whose total size is a predetermined size are extracted from the list, and the plurality of unused volumes are stored in the pool. A configuration may be added.

Furthermore, a configuration may be adopted in which one unused volume determined to be less than the predetermined size in S8304 is added to the pool. In that case, it is assumed that a plurality of countermeasures (FIGS. 11 and 12) are used together in addition to the countermeasure shown in FIG.

Furthermore, even when the target usage rate defined as a success condition is not reached, the usage rate of the pool can be lowered as compared with the case where no unused volume is added. Therefore, even if an unused volume that is less than the predetermined size is added to the pool, the risk of the pool size being depleted can be reduced.

In addition, when multiple pools exist in the local storage, move logical volumes used in other pools (other pools in the local storage) other than the target pool with insufficient capacity to the target pool. It is also possible to deal with the shortage of capacity.

Such a countermeasure is shown as S8600 in FIG. With reference to FIG. 13, a coping method using another pool in the own storage will be described.

Before ending the countermeasure as incomplete in the flowchart of FIG. 10, the management computer 20 creates a list of each logical volume constituting the other pool for one or a plurality of other pools existing in its own storage (S8601). ).

The management computer 20 selects the first volume from the list of volumes constituting the other pool (S8602). The management computer 20 determines whether or not the selected volume can be diverted to the processing target pool (the own pool whose capacity is insufficient) (S8603).

As one criterion for determining whether or not diversion is possible, for example, even when the logical volume is removed from another pool, the capacity usage rate of the other pool can be equal to or less than a predetermined criterion. This standard is provided in order to prevent the pool of the diversion source from running out of capacity due to the diversion of the logical volume.

When the logical volume in the other pool can be diverted (S8603: YES), the management computer 20 makes each determination similar to that described in FIG. The management computer 20 determines whether or not the logical volume has a predetermined size (S8604). Next, the management computer 20 determines whether or not the cost category of the logical volume matches the cost category of the diversion destination pool (own pool) (S8605). Next, the management computer 20 predicts whether or not the own pool has a performance equal to or higher than a predetermined value (S8606).

Furthermore, the management computer 20 can take into consideration that if the logical volume is removed from the other pool, the performance of the other pool may be degraded, and that it takes time to remove the logical volume (S8607).

If one logical volume is removed from another pool, the number of logical volumes that make up the other pool decreases, and the parallelism of I / O processing in the other pool decreases. Therefore, there is a possibility that the response performance of other pools will be reduced. When removing a logical volume from another pool, it is necessary to copy and move the data stored in the logical volume to another logical volume in the other pool. Therefore, depending on the amount of data stored in the logical volume to be diverted, there is a possibility that the data copy time becomes long. From this viewpoint, a logical volume with a large amount of stored data may be determined as a volume that cannot be diverted.

If there are multiple logical volumes that can be diverted, for example, according to criteria such as the capacity usage rate of the diversion source pool, the size of the logical volume, the time required for removal, and the performance degradation is small. Any one logical volume may be selected.

If the determination steps are not satisfied, the management computer 20 selects the next volume (S8608) and returns to S8603. When all the determination steps are satisfied, the management computer 20 removes the logical volume in the other pool from the other pool and adds it to the own pool in the capacity shortage state (S8609). Returning to FIG.

FIG. 11 is a flowchart showing a process of resolving the pool capacity shortage by moving the virtual volume, and is executed in S8207 of FIG. In this process, each virtual volume using a pool with insufficient capacity is evaluated in terms of the presence / absence of migration means, volume size, suitability of cost classification, migration completion time, and performance after migration. A virtual volume for which it is determined that the movement of another storage to another pool is appropriate is moved to another pool in the other storage. The specific procedure is shown below.

First, the management computer 20 creates a list of virtual volumes using a pool with insufficient capacity (S8401). Since the list of virtual volumes indicates a list of virtual volumes that are migration candidates, in the following description, it is referred to as a migration candidate virtual volume list.

The migration candidate virtual volume list may be created from the virtual volume information 212. Alternatively, the migration candidate virtual volume list can be obtained from the virtual volume information 212 instead of being created separately from the virtual volume information 212. In that case, in S8402 and S8409, a virtual volume belonging to a pool with insufficient capacity is selected.

The management computer 20 selects the first virtual volume from the migration candidate virtual volume list (S8402). If the virtual volume could not be selected (S8403: NO), this process ends as a countermeasure incomplete.

If one virtual volume can be selected (S8403: YES), the management computer 20 checks whether there is a means for moving the virtual volume to the selected other storage 30 (S8404). There are means for moving the virtual volume on the storage 30 side and means for moving the virtual volume on the host computer 40 side.

Whether or not the storage 30 has means for moving the virtual volume can be determined from the contents of the volume migration function 2132 of the storage information 213. Whether or not the host computer 40 has a means for moving a virtual volume can be determined by the contents of the volume migration function 2126 of the virtual volume information 212.

The management computer 20 confirms the presence / absence of virtual volume migration means on the storage side and the presence / absence of virtual volume migration means on the host computer side, and has at least one means for migrating the virtual volume to another storage It is determined whether or not to perform (S8404).

If there is no means for migrating the virtual volume to another storage (S8404: NO), the management computer 20 selects the next virtual volume (S8409) and returns to S8403.

When there is at least one means for moving the virtual volume to another storage (S8409: YES), the management computer 20 determines whether the size of the virtual volume is a predetermined size (S8405). Whether or not the size of the virtual volume matches the purpose of the management policy can be determined based on the contents of the management policy list 216.

For example, for a pool with a capacity usage rate of 75%, as shown in FIG. 7, a policy with a startup condition 2163 of “pool usage rate 70 to 84%” is applied. The content of the success condition 2165 regarding the action of the policy is defined as “reducing the pool usage rate to a range of 40-60%”. From the current pool size and capacity usage rate, the virtual volume migration size necessary to obtain the target capacity usage rate is obtained by the following equation (2).

(Migration size) = (Current capacity usage-Target capacity usage) x Pool size (2)

If the pool size is 100 TB, the additional size required to reduce the capacity usage rate of 75% to 40% is (0.75−0.4) × 100 = 35 TB. Similarly, the additional size required to reduce the capacity usage rate 75% to 60% is (0.75−0.6) × 100 = 15 TB.

Therefore, in order to keep the capacity usage rate of the pool within the range of 40% to 60%, it is necessary to migrate a virtual volume having a volume size ranging from 15 TB to 35 TB to another pool of other storage.

If the size of the virtual volume selected in S8403 is within the above range, it can be determined that the migration of the virtual volume is appropriate. If it is determined that the size of the virtual volume does not match the predetermined size (S8405: NO), the process moves to S8409.

When the size of the virtual volume matches the predetermined size (S8405: YES), the management computer 20 matches the cost category set for the virtual volume with the cost category set for the other pool of the migration destination. It is determined whether or not (S8406).

Specifically, when the content of the cost category 2154 of the virtual volume information 212 is included in the content of the cost category 2144 of the pool information 214, it can be determined that both cost categories are suitable. For example, a case will be described in which it is evaluated that a virtual volume having an identification name “VVOL-B” shown in FIG. 3 is moved to a pool having an identification name “POOL-A” shown in FIG. As shown in FIG. 3, the cost category 2154 of the virtual volume (VVOL-B) is “A, B”. As shown in FIG. 5, “A” is set in the cost category 2144 of the pool (POOL-A). Since the cost category “A” of the migration destination pool is included in the cost category “A, B” of the virtual volume, the management computer 20 determines that both cost categories are suitable. If it is determined that the cost category of the virtual volume and the cost category of the migration destination pool do not match, the process advances to step S8409.

If it is determined that both cost categories are suitable (S8406: YES), does the management computer 20 take the time required to migrate the virtual volume to another pool (migration required time) in time to resolve the pool capacity shortage? It is determined whether or not (S8407).

For example, when the capacity usage rate of the pool rises rapidly, it is necessary to deal with the shortage of the pool capacity immediately. Before the capacity usage rate of a pool reaches 100%, it is necessary to expand the size of the pool. For this purpose, it is necessary to estimate the date and time when the pool capacity usage rate reaches 100% (date and time when the pool size is depleted) and the date and time when the capacity shortage countermeasure is completed (migration completion date and time).

The pool size depletion date and time may be calculated based on, for example, an increase rate per unit time obtained from the past history of the pool capacity usage rate. The migration completion date / time is, for example, (a) whether the virtual volume can be migrated while the application program 443 is in operation, (b) the operation period of the application program 443, (c) processing time required for migration of the virtual volume, etc. It may be calculated based on the information.

(A) can confirm the volume migration program 442 in the host computer 40 by referring to the volume migration function 2126 of the virtual volume information 212. When the volume migration program 3142 in the storage 30 is used, it can be confirmed by referring to the volume migration function 2132 of the storage information 213.

(B) can be confirmed by referring to the application program operating period 2125 of the virtual volume information 212.

(C) is obtained by multiplying the size of the virtual volume by the virtual volume migration time per size. The virtual volume migration time per size can be calculated, for example, based on a reference value set in advance, or can be selected from the time taken to migrate the past virtual volume. A reference value is prepared for each performance of each logical volume.

The method for calculating the movement completion date / time differs depending on the contents of (a). In other words, if the virtual volume can be moved without stopping the application program 443, the current time is the time required for the migration required in (c).

On the other hand, when the virtual volume cannot be moved during the operation of the application program 443, the time required for the migration in (c) is added to the operation end time of the application program 443.

It should be noted that when the time required for migration of the virtual volume is long, the migration of the virtual volume may not be completed by the business start time. In order to prevent such a situation from occurring, for example, when the virtual volume cannot be moved while the application program 443 of FIG. If it is after the start time of the program 443, it may be determined that the virtual volume cannot be migrated.

It should be noted that the pool size depletion date and time and the virtual volume migration completion date and time are both estimated values, so it is preferable to judge with sufficient margin. In other words, the pool size depletion date and time is, for example, a time earlier than the predicted value by a certain amount. The transition completion date and time is a time later than the predicted value by a certain amount. As a result, the occurrence of a situation where the pool size is depleted earlier than expected or a situation where the migration of the virtual volume is completed later than expected can be suppressed.

Further, as an alternative to the above, when the absolute value of the capacity usage rate is higher than a predetermined upper limit value, or when the increase rate of the capacity usage rate is higher than the predetermined increase rate, the response is relatively urgent. In such a case, it may be configured to always select a countermeasure (for example, pool expansion) with a relatively short processing time until the countermeasure is completed.

If both the virtual volume migration by the volume migration program 442 in the host computer 40 and the virtual volume migration by the volume migration program 3142 in the storage 30 can be performed, one of them is selected by some method. There is a need to.

The selection criteria may include, for example, the speed of time until processing is completed, the load on the host computer 40, the load on the storage 30, and the like. As shown in FIG. 14, when the volume migration program 442 of the host computer 40 is used, there is an effect that the data transfer size can be relatively reduced and unnecessary data may be removed.

Refer to FIG. The file system manages n pieces of data D1, D2, D3 of size SZ1. The used size on the file system is SZ1 × n. These data D1, D2, and D3 are written to the virtual volume 720 in a discrete manner. In the virtual volume 720, n chunks (real pages) C1, C2, and C3 are allocated to store the data D1, D2, and D3. The chunk size is SZ2 (SZ2> SZ1). Therefore, the page allocation size to the virtual volume 720 is SZ2 × n.

The data transfer amount when the host computer 40 moves the virtual volume is SZ1 × n, whereas the data transfer amount when the storage 30 moves the virtual volume is SZ2 × n, the latter being larger. For this reason, in the example shown in FIG. 14, when the storage 30 moves a virtual volume, the time required for migration becomes longer than when the host computer 40 moves a virtual volume.

Therefore, the difference between the used size (SZ1 × n) on the file system and the page allocation size (SZ2 × n) to the virtual volume may be used as a reference for selecting the volume migration means.

Furthermore, even if data is deleted on the file system 710 of the OS 444, there may be a case where the storage 30 cannot recognize that the deleted data is unnecessary data. In this case, pages (chunks) remain allocated to the virtual volume 720 due to unnecessary data.

Suppose that the volume migration program 442 in the host computer 40 has a mechanism for migrating data excluding deleted data. When virtual volume data is migrated from the migration source pool 720 to the migration destination pool 721 using the volume migration program 442 (arrows 751 and 752 in FIG. 14), the deleted unnecessary data is not stored in the migration destination pool 721. . Therefore, the used size of the pool can be reduced compared to before the migration of the virtual volume.

By using this phenomenon, when the difference (or ratio) between the used size on the file system 710 and the page allocation size to the virtual volume exceeds a certain level, the volume migration program 442 in the host computer 40 is preferentially executed. You may do it.

Return to FIG. As a result of executing S8407, if it is determined that the insufficient capacity of the pool cannot wait until the data migration completion time of the virtual volume (S8407: NO), the process proceeds to S8409.

When it is determined that the data migration of the virtual volume can be completed (S8407: YES), the management computer 20 predicts and evaluates the performance of the virtual volume after the virtual volume migration (S8408). That is, the management computer 20 determines whether or not the performance of the virtual volume can be maintained even after the migration.

<Migrating a virtual volume from a pool in its own storage to a pool in another storage may reduce the I / O performance of the virtual volume. Whether or not the I / O performance of the virtual volume decreases after migration is determined for each of the migration source pool and the migration destination pool, the performance of the logical volumes that make up the pool, the number of logical volumes, the size of the pool load, The determination may be made in consideration of the I / O amount of the migration target virtual volume. If the degree of performance degradation of the virtual volume is within the allowable range, the migration may be recognized as having no particular problem.

If it is determined that there is no performance problem as a result of the execution of S8408, the selected virtual volume is migrated to the selected other storage 30 (S8410), and the process is terminated as the countermeasure is complete.

When the performance of the virtual volume is lowered by a predetermined value or more after migration (S8408: NO), the next virtual volume is selected from the migration candidate virtual volume list (S8409), and the process returns to S8403.

The flowchart in FIG. 11 shows a case where the capacity of the migration source pool is expanded only by migrating one virtual volume, but the present invention is not limited to this, and a configuration in which a plurality of virtual volumes are migrated may be used. In this case, for example, in the volume size check in S8405, it is determined that the purpose is to solve the pool capacity shortage except when the virtual volume size is over. A list of a plurality of virtual volumes that pass each determination of S8404, S8406, and S8407 is created, and a plurality of virtual volumes are extracted from the list so that the total size of the virtual volumes falls within the required size range. Migrate a plurality of extracted virtual volumes to a plurality of other pools.

Note that even if the size of the virtual volume does not reach the predetermined size in S8405, a configuration may be adopted in which migration of the virtual volume is performed. In that case, a plurality of countermeasures are used together. Even if the capacity usage rate of the final target is not reached, the capacity usage rate of the pool can be reduced as compared with the case where virtual volume migration is not performed. Therefore, the risk that the pool size is depleted can be reduced.

Although not described in detail in the flowchart of FIG. 11, when there are a plurality of pools in another storage, the steps from S8405 to S8408 are performed for each pool in the other storage.

If there are multiple pools suitable for virtual volume migration, select one migration destination pool based on the capacity usage rate of the migration destination pool, short migration time, little performance degradation after migration, etc. Good.

Although not shown in the flowchart of FIG. 11, consideration may be given to the case where a plurality of pools exist in the own storage. In the case where a plurality of pools exist in the own storage, a method of migrating a virtual volume from a pool with insufficient capacity to a pool with sufficient free capacity can be included in the options. In this case, as in the flowchart of FIG. 11, for example, whether there is a means for migrating the virtual volume to another pool, the size of the virtual volume matches the purpose, or the cost category of the migration destination pool and the cost category of the virtual volume match Whether the pool with insufficient capacity can wait until the migration completion time or whether the performance after the migration is maintained may be evaluated.

FIG. 12 is a flowchart of a process for expanding the size of the own storage pool using the logical volume of other storage, and is executed in S8209 of FIG. In this process, as described below, it is checked whether or not it is possible to connect to the selected other storage volume (external volume) from its own storage. If connection is possible, the validity of whether the unused volume among the selected volumes in the other storage is appropriate as a volume for pool expansion in terms of volume size, cost category, and performance change To evaluate. If there is an unused external volume that is evaluated as valid, the local storage is connected to the unused external volume, the external volume is allocated to a pool in the local storage, and the pool size is expanded.

First, the management computer 20 checks whether or not its own storage has a function (external connection function) for connecting to the volume of the selected other storage (S8501). For this check, the external connection function 2133 of the storage information 213 may be referred to.

If the own storage device does not have an external connection function (S8501: NO), this process ends as a countermeasure incomplete. When the own storage has an external connection function (S8501: YES), the following processing is performed.

The management computer 20 creates an unused volume list (hereinafter, candidate volume list) in the selected other storage from the unused volume information 215 (S8502). Instead of creating the candidate volume list separately from the unused volume information 215, the configuration may be such that information on unused candidate volumes is read from the unused volume information 215. In that case, in S8503 and S8508, only the unused volume in the selected other storage is selected.

The management computer 20 selects one leading unused volume from the candidate volume list (S8503). The management computer 20 determines whether an unused volume has been selected (S8504). If there is no unused volume that can be selected (S8504: NO), the processing is terminated as the countermeasure is incomplete.

If an unused volume in another storage can be selected (S8504: YES), the management computer 20 determines whether or not the size of the unused volume is a predetermined size (S8505). That is, it is confirmed whether the selected unused volume has an appropriate size for solving the shortage of the capacity of the pool in the own storage. Whether or not the size of the unused volume is a predetermined size may be determined based on the contents of the management policy list 216. The processing content is the same as S8304 in FIG. More specifically, the management computer 20 determines whether or not the size of the unused volume is in a range necessary for achieving the purpose.

If the size of the selected unused volume is not the predetermined size (S8505: NO), the management computer 20 selects the next unused volume from the candidate volume list (S8508), and returns to S8504.

When the size of the selected unused volume is a predetermined size (S8505: YES), the management computer 20 determines whether the cost category of the unused volume matches the cost category of the allocation destination pool (S8506). ). The specific processing content is the same as S8305 in FIG.

If the unused volume cost category and the pool cost category do not match (S8506: NO), the process moves to S8508.

When the cost classification of the unused volume matches the cost classification of the pool (S8506: YES), the management computer 20 evaluates the performance when the unused volume is added to the pool (S8507). The performance evaluation method is the same as S8306 in FIG.

However, in the case of S8507, using the external connection function, an unused volume in another storage is added to the pool in the own storage. Therefore, it is necessary to access the other storage from the own storage, resulting in overhead. Therefore, it is advisable to perform overhead correction. That is, in this process, a change in the performance value of the pool is predicted in consideration of overhead. For example, the pool performance can be predicted using the amount of overhead set as a fixed value in advance. Alternatively, the input / output processing program 3141 of the storage 30 may be provided with a function for measuring the overhead amount, and the pool performance may be predicted based on the measured value.

If it is determined that the performance of the pool is maintained even if an unused volume in another storage is added to the pool (S8507: YES), the pool size is expanded using the selected unused volume (S8509). ). This process ends as the countermeasure is completed. If it is predicted that the performance of the pool will decrease by more than the allowable value (S8507: NO), the process moves to S8508.

In the flowchart of FIG. 12, a case has been described in which a shortage of pool capacity is dealt with just by adding one unused volume to the pool. Alternatively, a configuration may be adopted in which a plurality of unused volumes are added to the pool to deal with a lack of pool capacity.

In that case, for example, in the size check in S8505, it is determined that the volume is suitable for the purpose except when the volume size exceeds a predetermined size (predetermined size range). Further, a list of unused volumes that pass each check of S8506 and S8507 is created, and a plurality of unused volumes that have a total size of unused volumes within the required size range are extracted from the list. The pool size can also be expanded by adding a plurality of extracted unused volumes to the pool.

Note that the pool size may be expanded using an unused volume that does not reach the predetermined size. In that case, multiple countermeasures will be implemented. Even when an unused volume for realizing the target capacity usage rate cannot be obtained, the capacity usage rate of the pool can be lowered as compared with the case where no unused volume is added to the pool. Therefore, even if an unused volume of insufficient size is added to the pool, the risk of the pool capacity being depleted can be reduced.

In the flowchart of FIG. 12, the expansion of the pool size of the own storage is described using an unused volume in another storage. Instead of this, a configuration may be used in which used logical volumes allocated to other pools are used for size expansion of the pool of the own storage.

Therefore, the process of S8600 described in FIG. 13 may be performed after “NO” is determined in S8504.

Note that the present invention is not limited to the above-described embodiment. A person skilled in the art can make various additions and changes within the scope of the present invention.

10: Management terminal, 20: Management computer, 30: Storage, 40: Host computer

Claims (14)

  1. A plurality of storage control devices for generating at least one virtual logical volume; at least one host computer using the virtual logical volume; and at least for managing each of the storage control devices and the host computer A computer system including one management computer,
    Each storage control device is assigned a real storage area of a real volume in a pool to the virtual logical volume in response to a write access from the host computer, and is assigned write data received from the host computer. It is to be stored in the real storage area,
    The management computer is
    A microprocessor, a memory that stores a predetermined computer program that is read and executed by the microprocessor, and a communication interface unit for communicating with each of the storage control devices and the host computer,
    The microprocessor reads and executes the predetermined computer program,
    Get the usage status of each pool,
    Based on the acquired usage status of each pool, it is determined whether there is a predetermined pool that needs to be expanded in pool size,
    When the predetermined pool is detected, (A) a volume addition method for adding an unused real volume to the predetermined pool; and (B) data of the virtual logical volume is stored in a pool other than the predetermined pool. Selecting at least one of the data movement methods to be moved to a predetermined selection criterion,
    Expanding the pool size of the predetermined pool according to the selected method;
    Computer system.
  2. (A) The volume addition method includes:
    (A1) a first volume addition method for adding an unused first real volume, which is included in a predetermined storage control device to which the predetermined pool belongs among the storage control devices, to the predetermined pool;
    (A2) By connecting an unused second real volume of a storage control device other than the predetermined storage control device among the storage control devices to the predetermined storage control device, the second A second volume addition method of adding an unused real volume to the predetermined pool;
    (A3) The third real volume provided in the first other pool of the predetermined storage control device among the storage control devices is removed, and the removed third real volume is unused. A third volume adding method for adding a real volume to the predetermined pool;
    (A4) Remove the fourth real volume provided in the second other pool that the other storage control device other than the predetermined storage control device has, and remove the removed fourth real volume. A fourth volume addition method for adding the specified real volume to the predetermined pool;
    Is included,
    (B) The data movement method includes:
    (B1) a first data movement method in which the host computer moves data of the virtual logical volume to the other pool other than the predetermined pool;
    (B2) a second data movement method in which the predetermined storage control device moves the data of the virtual logical volume to the other pool other than the predetermined pool;
    Is included,
    The microprocessor is
    (C1) As the predetermined selection criterion when the first volume addition method is executed, the first real volume has a volume size sufficient to lower the usage rate of the predetermined pool below a predetermined usage rate. And an attribute label preset in the predetermined pool matches an attribute label preset in the first real volume, and the first pool is in the first pool. Even when a real volume is added, if the response performance of the predetermined pool is equal to or higher than a predetermined pool performance value, the first volume addition method is executed,
    (C2) As the predetermined selection criterion when executing the second volume addition method, a volume size that allows the second real volume to reduce the usage rate of the predetermined pool to be equal to or lower than the predetermined usage rate. And the attribute label set in advance in the predetermined pool and the attribute label set in advance in the second real volume are compatible with each other, and When the response performance of the predetermined pool is equal to or higher than the predetermined pool performance value even when the second real volume is added, the second volume addition method is executed.
    (C3) As the predetermined selection criterion when executing the third volume addition method, a volume size sufficient for the third real volume to reduce the usage rate of the predetermined pool to be equal to or lower than the predetermined usage rate. And the attribute label preset in the predetermined pool matches the attribute label preset in the third real volume, and the predetermined pool has the first label Even if 3 real volumes are added, the response performance of the predetermined pool is equal to or higher than the predetermined value, and even if the third real volume is removed from the first other pool, the response of the first other pool When the response performance exceeds the other pool performance value, execute the third volume addition method,
    (C4) As the predetermined selection criterion when the fourth volume addition method is executed, a volume size sufficient for the fourth real volume to reduce the usage rate of the predetermined pool to be equal to or lower than the predetermined usage rate. And the attribute label set in advance in the predetermined pool and the attribute label set in advance in the fourth real volume are compatible with each other, and When the response performance of the predetermined pool is equal to or higher than the predetermined pool performance value even when the real volume of 4 is added, the fourth volume addition method is executed,
    (C5) The host computer has a function for moving the data of the virtual logical volume to the other pool as the predetermined selection criterion when executing the first data movement method. And the data size of the virtual logical volume has a size that reduces the usage rate of the predetermined pool below the predetermined usage rate, and is preset in the virtual logical volume. And the attribute label set in advance in the other pool match, and the time for moving the virtual logical volume data to the other pool is preset. Even if the data of the virtual logical volume is shorter than a predetermined time and the data of the virtual logical volume is moved to the other pool, the response performance of the virtual logical volume is predetermined. If the volume performance value or more, performs the first data migration method,
    (C6) The storage control device has a function for moving the data of the virtual logical volume to the other pool as the predetermined selection criterion when executing the second data movement method. And the size of the data of the virtual logical volume is small enough to reduce the usage rate of the predetermined pool below the predetermined usage rate, and the virtual logical volume is preliminarily stored in the virtual logical volume. The set attribute label matches the attribute label set in advance in the other pool, and the time for moving the virtual logical volume data to the other pool is set in advance. The response performance of the virtual logical volume is predetermined even when the data of the virtual logical volume is moved to the other pool. If the volume performance value or more, and execute the second data migration method,
    Further, (A1) the first volume adding method, (A2) the second volume adding method, (B1) the first data moving method, (B2) the second data moving method, (A3) Priorities are set in the order of the third volume addition method, (A4) the fourth volume addition method,
    The microprocessor executes the methods based on the priority order.
    The computer system according to claim 1.
  3. When selecting either the volume addition method or the data movement method, the microprocessor considers the operating status of the application program that uses the virtual logical volume, and within a predetermined time, Determine whether the pool size expansion is complete,
    The computer system according to claim 1.
  4. The volume addition method includes:
    A first volume addition method for adding an unused first real volume of a predetermined storage control device to which the predetermined pool belongs among the storage control devices to the predetermined pool;
    The computer system according to claim 1.
  5. When the microprocessor executes the first volume addition method, as the predetermined selection criterion,
    A matching state between a volume size of the first real volume, an attribute label preset in the predetermined pool, and an attribute label preset in the first real volume, and the first pool in the first pool; Considering the response performance of the predetermined pool when adding a real volume of
    The computer system according to claim 4.
  6. The volume addition method includes:
    By connecting an unused second real volume of another storage control device other than the predetermined storage control device among the storage control devices to the predetermined storage control device, the second unused A second volume addition method is included for adding the real volume to the predetermined pool,
    The computer system according to claim 1.
  7. When the microprocessor executes the second volume addition method, as the predetermined selection criterion,
    A matching state between a volume size of the second real volume, an attribute label preset in the predetermined pool, and an attribute label preset in the second real volume; and the second real volume in the second pool Considering the response performance of the predetermined pool when adding a real volume of
    The computer system according to claim 6.
  8. The volume addition method includes:
    The third real volume provided in the first other pool of the predetermined storage control device is removed from each of the storage control devices, and the removed third real volume is set as an unused real volume. A third volume addition method for adding to the predetermined pool is included;
    The computer system according to claim 1.
  9. When the microprocessor executes the third volume addition method, as the predetermined selection criterion,
    The volume size of the third real volume, the conformity state of the attribute label preset in the predetermined pool and the attribute label preset in the third real volume, and the first pool in the predetermined pool. Considering the response performance of the predetermined pool when 3 real volumes are added,
    The computer system according to claim 8.
  10. The volume addition method includes:
    The fourth real volume provided in the second other pool of the other storage control device other than the predetermined storage control device is removed, and the removed fourth real volume is used as an unused real volume. The computer system according to claim 1, further comprising a fourth volume addition method for adding a volume to the predetermined pool.
  11. When the microprocessor executes the fourth volume addition method, as the predetermined selection criterion,
    A matching state between a volume size of the fourth real volume, an attribute label preset in the predetermined pool, and an attribute label preset in the fourth real volume, and the fourth pool in the predetermined pool; Considering the response performance of the predetermined pool when adding a real volume of
    The computer system according to claim 10.
  12. The data movement method includes:
    A first data movement method in which the host computer moves data of the virtual logical volume to the other pool other than the predetermined pool;
    The computer system according to claim 1.
  13. The data movement method includes:
    A second data movement method in which the predetermined storage control device moves the data of the virtual logical volume to the other pool other than the predetermined pool;
    The computer system according to claim 1.
  14. A method for managing a computer system including a plurality of storage controllers that generate at least one virtual logical volume and at least one host computer that uses the virtual logical volume,
    Each storage control device is assigned a real storage area of a real volume in a pool to the virtual logical volume in response to a write access from the host computer, and is assigned write data received from the host computer. It is to be stored in the real storage area,
    Get the usage status of each pool,
    Based on the acquired usage status of each pool, it is determined whether there is a predetermined pool that needs to be expanded in pool size,
    When the predetermined pool is detected, (A) a volume addition method for adding an unused real volume to the predetermined pool; and (B) data of the virtual logical volume is stored in a pool other than the predetermined pool. Selecting at least one of the data movement methods to be moved to a predetermined selection criterion,
    Expanding the pool size of the predetermined pool according to the selected method;
    Computer system management method.
PCT/JP2010/069222 2010-09-29 2010-10-28 Computer system and method of managing computer system WO2012042678A1 (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
JP2010218242A JP5602564B2 (en) 2010-09-29 2010-09-29 Computer system and computer system management method
JP2010-218242 2010-09-29

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
US13/054,759 US8543786B2 (en) 2010-09-29 2010-10-28 Computer system and computer system management method for adding an unused real volume to a pool

Publications (1)

Publication Number Publication Date
WO2012042678A1 true WO2012042678A1 (en) 2012-04-05

Family

ID=45892181

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/JP2010/069222 WO2012042678A1 (en) 2010-09-29 2010-10-28 Computer system and method of managing computer system

Country Status (2)

Country Link
JP (1) JP5602564B2 (en)
WO (1) WO2012042678A1 (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2014041591A1 (en) * 2012-09-11 2014-03-20 株式会社日立製作所 Administration device and administration method

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2016129053A1 (en) * 2015-02-10 2016-08-18 株式会社日立製作所 Management computer for storage device
WO2017163322A1 (en) * 2016-03-23 2017-09-28 株式会社日立製作所 Management computer, and management method for computer system

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2005275829A (en) * 2004-03-25 2005-10-06 Hitachi Ltd Storage system
JP2010086424A (en) * 2008-10-01 2010-04-15 Hitachi Ltd Device for managing storage device

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP4890033B2 (en) * 2006-01-19 2012-03-07 株式会社日立製作所 Storage device system and storage control method
JP2010079626A (en) * 2008-09-26 2010-04-08 Hitachi Ltd Load distribution method and system for computer system
JP4809413B2 (en) * 2008-10-08 2011-11-09 株式会社日立製作所 Storage system
JP2010170411A (en) * 2009-01-23 2010-08-05 Hitachi Ltd Computer system and storage pool management method
JP5235154B2 (en) * 2009-03-31 2013-07-10 富士通株式会社 Management device and management program

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2005275829A (en) * 2004-03-25 2005-10-06 Hitachi Ltd Storage system
JP2010086424A (en) * 2008-10-01 2010-04-15 Hitachi Ltd Device for managing storage device

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2014041591A1 (en) * 2012-09-11 2014-03-20 株式会社日立製作所 Administration device and administration method
US9043571B2 (en) 2012-09-11 2015-05-26 Hitachi, Ltd. Management apparatus and management method
JPWO2014041591A1 (en) * 2012-09-11 2016-08-12 株式会社日立製作所 Management apparatus and management method

Also Published As

Publication number Publication date
JP5602564B2 (en) 2014-10-08
JP2012073825A (en) 2012-04-12

Similar Documents

Publication Publication Date Title
US9727454B2 (en) Memory controller that provides addresses to host for memory location matching state tracked by memory controller
EP2423814B1 (en) System software interfaces for space-optimized block devices
JP4958453B2 (en) System and method for managing disk space in a thin provisioned storage subsystem
JP4890033B2 (en) Storage device system and storage control method
JP4452261B2 (en) Storage system logical volume management method, logical volume management program, and storage system
US7917722B2 (en) Storage area dynamic assignment method
US8239644B2 (en) Control device of a storage system comprising storage devices of a plurality of types
KR100876084B1 (en) Computing systems that can deliver information to remove the flash storage device
JP5236086B2 (en) Management system to calculate the storage capacity to be added / removed
US20060010169A1 (en) Hierarchical storage management system
JP4874368B2 (en) Storage system management method and computer using flash memory
US8832371B2 (en) Storage system with multiple flash memory packages and data control method therefor
JP4933861B2 (en) Storage control device, data management system, and data management method
JP5079841B2 (en) Method and storage apparatus for controlling data write to virtual logical volume according to Thin Provisioning
US8639899B2 (en) Storage apparatus and control method for redundant data management within tiers
US20130097377A1 (en) Method for assigning storage area and computer system using the same
EP1876519A2 (en) Storage system and write distribution method
WO2012090247A1 (en) Storage system, management method of the storage system, and program
JP4814119B2 (en) Computer system, storage management server, and data migration method
US8862849B2 (en) Storage system providing virtual volumes
US7447832B2 (en) Automated on-line capacity expansion method for storage device
WO2010095176A1 (en) Storage system and method for operating storage system
JP2007114874A (en) Storage-control system and storage-control method
WO2010122674A1 (en) Computer system and method for controlling same
US8990538B2 (en) Managing memory with limited write cycles in heterogeneous memory systems

Legal Events

Date Code Title Description
WWE Wipo information: entry into national phase

Ref document number: 13054759

Country of ref document: US

121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 10857891

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase in:

Ref country code: DE

122 Ep: pct app. not ent. europ. phase

Ref document number: 10857891

Country of ref document: EP

Kind code of ref document: A1