Source: http://www.google.com/patents/US20040230766?dq=3984803
Timestamp: 2016-02-14 03:00:15
Document Index: 246885964

Matched Legal Cases: ['arts 450', 'arts 450', 'art 450', 'art 450', 'art 460', 'art 460', 'art 470', 'art 470', 'art 480']

Patent US20040230766 - Thin-provisioning with snapshot technology - Google PatentsSearch Images Maps Play YouTube News Gmail Drive More »Sign inPatentsA method is provided to allow a system administrator of a utility storage server to provision virtual volumes several times larger than the amount of physical storage within the storage server. A virtual volume is a virtual representation of multiple disks as a single large volume to a host or an application....http://www.google.com/patents/US20040230766?utm_source=gb-gplus-sharePatent US20040230766 - Thin-provisioning with snapshot technologyAdvanced Patent SearchPublication numberUS20040230766 A1Publication typeApplicationApplication numberUS 10/840,956Publication dateNov 18, 2004Filing dateMay 7, 2004Priority dateMay 12, 2003Also published asUS6823442, US20050044310, WO2004102391A1Publication number10840956, 840956, US 2004/0230766 A1, US 2004/230766 A1, US 20040230766 A1, US 20040230766A1, US 2004230766 A1, US 2004230766A1, US-A1-20040230766, US-A1-2004230766, US2004/0230766A1, US2004/230766A1, US20040230766 A1, US20040230766A1, US2004230766 A1, US2004230766A1InventorsDouglas CameronOriginal AssigneeCameron Douglas J.Export CitationBiBTeX, EndNote, RefManPatent Citations (13), Referenced by (57), Classifications (12), Legal Events (8) External Links: USPTO, USPTO Assignment, EspacenetThin-provisioning with snapshot technology
US 20040230766 A1Abstract
A method is provided to allow a system administrator of a utility storage server to provision virtual volumes several times larger than the amount of physical storage within the storage server. A virtual volume is a virtual representation of multiple disks as a single large volume to a host or an application. In one embodiment, a virtual volume comprises an exception list containing the set of differences from dummy base volume consisting of all zeros. This exception list can be made up of address tables that map virtual volume pages to logical disk pages. As storage demand grows, additional storage is allocated for the address tables and the data pages from separate pools of storage. If any of the pools runs low, more logical disk regions are allocated to that pool. Images(9) Claims(18)
What is claimed is: 1. A method for writing to a virtual volume mapped to a logical disk, comprising: receiving a request to write a data to the virtual volume at an address; traversing a first table representing the virtual volume to find a first pointer at a first offset based on a first portion of the address, the first pointer leading to one of a plurality of second tables (“said one second table”) also representing the virtual volume; following the first pointer to said one second table; traversing said one second table to find a second pointer at a second offset based on a second portion of the address, the second pointer leading to one of a plurality of third tables (“said one third table”); if said one second table does not exist, determining if the number of available table pages in a first pool is less than a first threshold; if the number of available table pages in the first pool is not less than the first threshold, allocating one table page from the first pool to form said one second table; writing the first pointer at the first offset in the first table; if the number of available table pages in the first pool is less than the first threshold, requesting additional table pages to be added to the first pool. 2. The method of claim 1, further comprising: if the number of available table pages in the first pool is less than the first threshold, requesting additional table pages to be added to the first pool; determining if the additional table pages have been added before timing out; if the additional table pages have been added before timing out, allocating one table page from the first pool to form said one second table; writing the first pointer at the first offset in the first table; if the additional table pages have not been added before timing out, returning a write failure message. 3. The method of claim 2, further comprising: following the second pointer to said one third table; traversing said one third table to find a third pointer at a third offset based on a third potion of the address, the third pointer leading to one of a plurality of data pages (“said one data page”); if said one third table does not exist, determining if the number of available table pages in the first pool is less than the first threshold; if the number of available table pages in the first pool is not less than the first threshold, allocating one table page from the first pool to form said one third table; writing the second pointer at the second offset in the second table. 4. The method of claim 3, further comprising: if the number of available table pages in the first pool is less than the first threshold, requesting additional table pages to be added to the first pool; determining if the additional table pages have been added before timing out; if the additional table pages have been added before timing out, allocating one table page from the first pool to form said one third table; writing the second pointer at the second offset in the second table; if the additional table pages have not been added before timing out, returning the write failure message. 5. The method of claim 4, further comprising: following the third pointer to said one data page; writing the data to said one data page at a fourth offset based on a fourth portion of the address and returning a write pass message; if said one data page does not exist, determining if the number of available data pages in a second pool is less than a second threshold; if the number of available data pages in the second pool is not less than the second threshold, allocating one data page from the second pool to form said one data page; writing the third pointer at the third offset in the third table; writing the data to said one data page at the fourth offset and returning the write pass message. 6. The method of claim 5, further comprising: if the number of available data pages in the second pool is less than the second threshold; requesting additional data pages to be added to the second pool; determining if the additional data pages have been added before timing out; if the additional data pages have been added before timing out, allocating one data page from the second pool to form said one data page; writing the third pointer at the third offset in the third table; writing the data to said one data page at the fourth offset and returning the write pass message; if the additional data pages have not been added before timing out, returning the write failure message. 7. The method of claim 6, in response to said requesting additional table pages to be added to the first pool or said requesting additional data pages to be added to the second pool, retrieving an allocation control structure associated with the requesting virtual volume, the allocation control structure comprising a first maximum physical allocation for the virtual volume, a second maximum physical allocation for a group of virtual volumes including the virtual volume, a first warning point on the first maximum physical allocation, a second warning point on the second maximum physical allocation, and RAID parameters controlling the creation of additional logical disk storage; determining if the virtual volume is greater than the first maximum physical allocation; if the virtual volume is greater than the first maximum physical allocation, issuing an allocation failure alert and terminating the allocation request processing. 8. The method of claim 7, further comprising, if the virtual volume is not greater than the first maximum physical allocation, determining if the logical disk has one storage unit (“logical disk region”) available; if the logical disk has one logical disk region available, dividing said one logical disk region into table or data pages; allocating the table or data pages to the first or the second pool; updating a system table of contents to record the allocation of said one logical disk region to the virtual volume; determining if the virtual volume is greater than the first warning point; if the virtual volume is greater than the first warning point, issuing an allocation warning alert. 9. The method of claim 8, further comprising: if the logical disk does not have one logical disk region available, determining if the group of virtual volumes is greater than the second maximum physical allocation; if the group of virtual volume is greater than the second maximum physical allocation, issuing an allocation failure alert and terminating the allocation request processing. 10. The method of claim 9, further comprising: if the virtual volume is not greater than the second maximum physical allocation, creating a new logical disk; determining if the group of virtual volumes is greater than the second warning point; if the group of virtual volumes is greater than the second warning point, issuing an allocation warning alert; dividing a logical disk region from the new logical disk into table or data pages; allocating the table or data pages to the first or the second pool; and updating a system table of contents to record the allocation of the logical disk region to the virtual volume. 11. The method of claim 1, wherein the virtual volume is distributed amongst a system of nodes, the method further comprising replicating the data to another node in the system. 12. A method for provisioning a virtual volume mapped to a logical disk, comprising: receiving a request to write a data to the virtual volume at an address; traversing a table representing the virtual volume to find a pointer at an offset based on a portion of the address, the pointer leading to one of a plurality of data pages (“said one data page”); if said one data page does not exist, determining if the number of available data pages in a pool is less than a threshold; if the number of available data pages in the pool is less than the threshold, requesting additional data pages to be added to the pool; determining if the logical disk has one storage unit (“logical disk region”) available; if the logical disk has one logical disk region available, dividing said one logical disk region into data pages; allocating the data pages to the pool. 13. The method of claim 12, further comprising: if the logical disk does not have one logical disk region available, creating a new logical disk; dividing a logical disk region from the new logical disk into data pages; allocating the data pages to the pool. 14. The method of claim 13, further comprising: if the number of available data pages in the pool is not less than the threshold, allocating one data page from the pool to form said one data page; writing the data to said one data page at the offset based on another portion of the address and returning a write pass message. 15. The method of claim 12, in response to said requesting additional data pages to be added to the pool, further comprising: issuing an allocation failure alert if the virtual volume is greater than a limit point on maximum physical allocation. 16. The method of claim 15, in response to said requesting additional data pages to be added to the pool, further comprising: issuing an allocation warning alert if the virtual volume is greater than a warning point on maximum physical allocation, the warning point being less than the limit point. 17. The method of claim 12 in response to said requesting additional data pages to be added to the pool, further comprising: issuing an allocation failure alert if a group of virtual volume is greater than a limit point on maximum physical allocation. 18. The method of claim 17, in response to said requesting additional data pages to be added to the pool, further comprising: issuing an allocation warning alert if a group of virtual volumes including the virtual volume is greater than a warning point on maximum physical allocation, the warning point being less than the limit point. Description
FIELD OF INVENTION [0002] This invention relates to a utility storage server and more particularly to virtual volume management of the utility storage server. DESCRIPTION OF RELATED ART [0003] A utility storage server may be defined as any carrier-class storage system that provisions physical storage to multiple users and/or applications. To meet the demands of multiple users and applications, a system administrator has to purchase enough physical storage for the users and the applications. Often the purchased physical storage is underutilized as the users and the applications generally fill their provisioned storage over time. Thus, what is needed is a method that allows the system administrator to increase asset utilization and defer expenses spent on the physical storage. SUMMARY [0004] In one embodiment of the invention, a method is provided to allow a system administrator of a utility storage server to provision virtual volumes several times larger than the amount of physical storage within the storage server. A virtual volume is a virtual representation of multiple disks as a single large volume to a host or an application. In one embodiment, a virtual volume comprises an exception list containing the set of differences from a dummy base volume consisting of all zeros. This exception list can be made up of address tables that map virtual volume pages to logical disk pages. As storage demand grows, additional storage is allocated for the address tables and the data pages from separate pools of storage. If any of the pools runs low, more logical disk regions are allocated to that pool. BRIEF DESCRIPTION OF THE DRAWINGS [0005] [0005]FIG. 1 illustrates a software architecture of a utility storage server in one embodiment of the invention. [0006] [0006]FIG. 2 illustrates a representation of the mapping of pages in a virtual volume pages to pages in a logical disk of a node in one embodiment. [0007] [0007]FIG. 3 illustrates the mapping of logical disk regions to physical disks in one embodiment of the invention. [0008] [0008]FIG. 3A illustrates a virtual volume block address and its component segments in one embodiment of the invention. [0009] [0009]FIGS. 4A, 4B, and 4C illustrate a method for a virtual volume layer to respond to a write request to the virtual volume in one embodiment of the invention. [0010] [0010]FIG. 5 illustrates a method for a system manager to respond to an event requesting an additional logical disk region from the virtual volume layer in one embodiment of the invention. [0011] [0011]FIG. 6 illustrates a method for the virtual volume layer and the logical disk layer to respond to a read request from the host in one embodiment.
DETAILED DESCRIPTION [0012] For a description of a utility storage server, please see U.S. Pat. No. 6,658,478, entitled “Data Storage System,” attorney docket no. M-8494 US, and U.S. patent application Ser. No. 09/883,681, entitled “Node Controller for a Data Storage System,” attorney docket no. M-8496 US, which are incorporated by reference in their entirety. [0013] [0013]FIG. 1 illustrates a software architecture of a utility storage server 100 in one embodiment. For simplicity, utility storage server 100 is shown to include a cluster of nodes 102-1 and 102-2 although the cluster may include additional nodes. [0014] Node 102-1 includes a system manager 104 residing in the user level above the operating system and a data stack 106-1 residing in the kernel level of the operating system. Data stack 106-1 includes a target driver 108-1, a virtual volume layer 110-1, a logical disk layer 112-1, a physical disk layer 114-1, and an initiator driver 116-1. [0015] Initiator driver 116-2 performs the actual reads and writes to the physical disk drive using, e.g., the SCSI protocol. Physical disk layer 114-1 routes the read and write requests to the appropriate node with access to the physical disk drives on disk chassis 120. [0016] Logical disk layer 112-1 organizes “chunklets” of physical disks 202-1 to 202-i (FIG. 3) into logical disks (LDs) of specific RAID levels. In one embodiment, a chunklet is 256 megabytes of contiguous disk space. System manager 104 allocates logical disk storage space, in units of logical disk regions (shown as a stripe through chunklets 204-1 to 204-i from physical disks 202-1 to 202-i in FIG. 3), to virtual volume layer 110-1. In one embodiment, an LD region is 256 megabytes of logical disk storage space. Virtual volume layer 110-1 divides up each LD region into pages for storing data. In one embodiment, a page has a size of 16 kilobytes and holds thirty-two 512 byte data blocks. Virtual volume layer 110-1 maps pages in a virtual volume to pages in the logical disk and sends the read/write requests to the proper logical disk addresses within logical disk layer 112-1. [0017] Target driver 108-1 communicates the read and write requests to virtual volume layer 110-1. A host 118 sends read and write requests to the virtual volume via target driver 108-1 using, e.g., the SCSI protocol. [0018] Similarly, node 102-2 includes a data stack 106-2 residing in the kernel level. Data stack 106-2 also includes a target driver 108-2, a virtual volume layer 110-2, a logical disk layer 112-2, a physical disk layer 114-2, and an initiator driver 116-2. Components of data stacks 106-1 and 106-2 communicate by a node-to-node link 122. [0019] System manager 104 resides only on one of the nodes of utility storage server 100. If system manager 104 fails at one of the nodes, it can be restarted at another node. System manager 104 keeps a single system image of utility storage server 100. System manager 104 also services events from the data stacks, delivers configuration commands to the data stacks, and records system configuration information in a table of contents (TOC) on a physical disk drive. [0020] [0020]FIG. 2 illustrates the mapping of a virtual volume 208 to a logical disk (e.g., logical disk 207 in FIG. 3) in one embodiment of the invention. Virtual volume 208 is an exception list made up of address tables that map pages of a virtual volume 208 to pages of logical disk 207 storage. Virtual volume 208 also includes pools 412 and 414 of logical disk storage from which these exception list tables and logical disk data pages are allocated. In one embodiment, virtual volume 208 is implemented using a snapshot mechanism in which the exception list tracks changes to a dummy base volume consisting of only zeroes. [0021] The address tables are divided into three levels. This is because virtual volume 208 is written or read in blocks each identified by a virtual volume block address. The virtual volume block address includes a virtual volume page address consisting of parts 450, 460, and 470 (FIG. 3A). Parts 450, 460, and 470 lead to a page in virtual volume 208, which is mapped to a corresponding page in logical disk 207. The virtual volume block address further includes a block offset 480 (FIG. 3A) that leads to a data block in the corresponding page in logical disk 207. [0022] A level 1 table (e.g., table 402) consists of entries that can be indexed by the first part 450 of the page address. Specifically, part 450 provides an offset from the start of the level 1 table. Each entry in the level 1 table stores a pointer to the start of a level 2 table that shares the first part of the page address. [0023] Each of the level 2 tables (e.g., table 404-0 to 404-31) consists of entries that can be indexed by the second part 460 of the page addresses. Specifically, part 460 provides an offset from the start of a level 2 table. Each entry in the level 2 table stores a pointer to the start of a level 3 table that shares the first and the second part of the page address. [0024] Each of the level 3 tables (e.g., tables 406-0 to 406-2047 in one embodiment) consists of entries that can be indexed by the third part 470 of the page addresses. Specifically, part 470 provides an offset from the start of a level 3 table. Each entry in the level 3 table stores a pointer to a page in a logical disk. Accordingly, a page in the virtual volume (e.g., VV data page) is mapped to a page in a logical disk (e.g., LD data page). Part 480 of the page address identifies an offset of a data block (i.e., block offset) from the start of the LD data page. [0025] Virtual volume layer 110-1 initially creates virtual volume 208 with only a blank level 1 table. As data is written to virtual volume 208 (described later), virtual volume layer 110-1 allocates LD data pages and adds the level 2 and level 3 tables that are necessary to manage these LD data pages. [0026] [0026]FIGS. 4A, 4B, and 4C illustrate a method 300 for virtual volume layer 110-1 to respond to a write request from host 118 (or an application) to virtual volume 208 in one embodiment. [0027] In step 302, virtual volume layer 110-1 receives a write request to a data block in virtual volume 208. The write request identifies the data block by the ID of virtual volume 208 and its virtual volume block address. Step 302 is followed by step 304. [0028] In step 304, virtual volume layer 110-1 traverses tables 402, 404, and 406 to find the LD data page that corresponds to the virtual volume block address. Step 304 is followed by step 306. [0029] In step 306, virtual volume layer 110-1 determines if the corresponding LD data page has been found. If so, step 306 is followed by step 308. Otherwise step 306 is followed by step 312. The corresponding LD data page cannot be found if the VV data page to-be-written in virtual volume 208 has not been mapped to an LD data page by pointers and address tables as described above. [0030] In step 308, virtual volume layer 110-1 instructs logical disk layer 112-1 to issue a write to the corresponding LD data page. Specifically, virtual volume 110-1 identifies the block by a logical disk ID and an offset from the start of the logical disk. The offset from the start of the logical disk is determined from the sum of (1) the offset of the LD region from the start of the logical disk, (2) the offset of the LD data page from the start of the LD region, and (3) the block offset of the data block from the start of the LD data page. In one embodiment, the write is replicated to the other nodes (e.g., node 102-2) for failover protection. Step 308 is followed by step 310. [0031] In step 310, virtual volume layer 110-1 returns a “pass” status to the host and ends method 300. [0032] In step 312, virtual volume layer 110-1 determines if a level 2 (L2) address table exists for the requested VV data page. If so, then step 312 is followed by step 326. Otherwise step 312 is followed by step 314. [0033] In step 314, virtual volume layer 110-1 determines if the number of available LD table pages in a pool 412 (FIG. 2) for storing address tables is less than a threshold. If so, then step 314 is followed by step 316. Otherwise step 314 is followed by step 322. [0034] In step 316, virtual volume layer 110-1 issues an event to system manager 104. In response to the event, system manager 104 may allocate an available LD region to virtual volume layer 110-1. System manager 104 may allocate the LD region in a method 500 described later in reference to FIG. 5. Virtual volume layer 110-1 divides the allocated LD region into LD table pages and increments pool 412 with these new pages. Step 316 is followed by step 318. [0035] In step 318, virtual volume layer 110-1 determines if an LD table page is available to be used as an L2 table. If so, then step 318 is followed by step 322. Otherwise step 318 is followed by step 319A. [0036] In step 319A, virtual volume layer 110-1 sleeps for a predetermined amount of time. Step 319A is followed by step 319B. [0037] In step 319B, virtual volume 110-1 determines if a timeout has been reached. If so, then step 319B is followed by step 320. Otherwise step 319B is followed by step 318. [0038] In step 320, virtual volume 110-1 returns a “fail” status to the host and ends method 300. [0039] In step 322, virtual volume 110-1 creates an L2 table from an available LD table page in pool 412. Step 322 is followed by step 324. [0040] In step 324, virtual volume 110-1 updates the level one (L1) table with a pointer to the newly created L2 table. Specifically, virtual volume 110-1 writes the pointer in the L1 table entry having an offset identified by the first part of the virtual volume page address. Step 324 is followed by step 326. [0041] In step 326 (FIG. 4B), virtual volume layer 110-1 determines if a level 3 (L3) table exists for the requested VV data page. If so, then step 326 is followed by step 340. Otherwise step 326 is followed by step 328. [0042] In step 328, virtual volume layer 110-1 determines if the number of available LD table pages in pool 412 (FIG. 2) for storing address tables is less than a threshold. If so, then step 328 is followed by step 330. Otherwise step 328 is followed by step 336. [0043] In step 330, virtual volume layer 110-1 issues an event to system manager 104. In response to the event, system manager 104 may allocate an available LD region to virtual volume layer 110-1. System manager 104 may allocate the LD region in a method 500 described later in reference to FIG. 5. Virtual volume layer 110-1 divides the LD region into LD table pages and increments pool 412 with these new pages. Step 330 is followed by step 332. [0044] In step 332, virtual volume layer 110-1 determines if an LD table page is available to be used as an L3 table. If so, then step 332 is followed by step 336. Otherwise step 332 is followed by step 333A. [0045] In step 333A, virtual volume layer 110-1 sleeps for a predetermined amount of time. Step 333A is followed by step 333B. [0046] In step 333B, virtual volume 110-1 determines if a timeout has been reached. If so, then step 333B is followed by step 334. Otherwise step 333B is followed by step 332. [0047] In step 334, virtual volume 110-1 returns a “fail” status to the host and ends method 300. [0048] In step 336, virtual volume 110-1 creates an L3 table from an available page in pool 412. Step 336 is followed by step 338. [0049] In step 338, virtual volume 110-1 updates the corresponding L2 table with a pointer to the newly created L3 table. Specifically, virtual volume 110-1 writes the pointer in the L2 table entry having an offset identified by the second part of the virtual volume page address. Step 338 is followed by step 340. [0050] In step 340 (FIG. 4C), virtual volume layer 110-1 determines if an LD data page in the logical disk exists for the virtual volume block address received. If so, then step 340 is followed by step 352. Otherwise step 340 is followed by step 342. [0051] In step 342, virtual volume layer 110-1 determines if the number of available LD data pages in a pool 414 (FIG. 2) for storing data is less than a threshold. If so, then step 342 is followed by step 344. Otherwise step 342 is followed by step 350. [0052] In step 344, virtual volume layer 110-1 issues an event to system manager 104. In response to the event, system manager 104 may allocate an available LD region to pool 414. System manager 104 may allocate the LD region in method 500 described later in reference to FIG. 5. Virtual volume layer 110-1 divides the LD region into LD data pages and increments pool 414 with these new pages. Step 344 is followed by step 346. [0053] In step 346, virtual volume layer 110-1 determines if an LD data page is available to be used. If so, then step 346 is followed by step 350. Otherwise step 346 is followed by step 347A. [0054] In step 347A, virtual volume layer 110-1 sleeps for a predetermined amount of time. Step 347A is followed by step 347B. [0055] In step 347B, virtual volume layer 110-1 determines if a timeout has been reached. If so, then step 347B is followed by step 348. Otherwise step 347B is followed by step 346. [0056] In step 348, virtual volume layer 110-1 returns a “fail” status to the host and ends method 300. [0057] In step 350, virtual volume layer 110-1 allocates an LD data page to virtual volume 208 from pool 414 to store data. Step 350 is followed by step 351. [0058] In step 351, virtual volume layer 110-1 updates the corresponding L3 table with a pointer to the new LD data page in virtual volume 208. Specifically, virtual volume 110-1 writes the pointer in the L3 table entry having an offset identified by the third part of the virtual volume page address. Step 351 is followed by step 352. [0059] In step 352, virtual volume layer 110-1 writes the data into the new LD data page at an offset identified by the block offset of the virtual volume block address. Specifically, virtual volume layer 110-1 identifies the block by a logical disk ID and an offset from the start of the logical disk. The offset from the start of the logical disk is determined from the sum of (1) the offset of the LD region from the starting address of the logical disk, (2) the offset of the LD data page from the starting address of the LD region, and (3) the block offset of the data block from the starting address of the LD data page. Step 352 is followed by step 354. [0060] In step 354, virtual volume 110-1 returns a “pass” status to the host and ends method 300. [0061] [0061]FIG. 5 illustrates a method 500 for system manager 104 to respond to the event from a virtual volume layer (e.g., virtual volume layer 110-1) in one embodiment. [0062] In step 502, system manager 104 validates the virtual volume ID and retrieves a data allocation control structure (DC) for the virtual volume identified by the virtual volume ID. DC, also known common provisioning group (CPG), is a part of system manager 104 that sets the maximum physical allocation for each virtual volume, the maximum physical allocation of all the virtual volumes owned (i.e., controlled) by the DC, and warning points for the physical allocation of each virtual volume and the DC itself. DC also sets the RAID characteristics of the logical disks and the set of nodes in a cluster from which the physical disk drive chunklets are allocated when creating additional logical disks. [0063] In step 504, system manager 104 determines if the physical allocation of the identified virtual volume (e.g., virtual volume 208) is over the maximum physical allocation specified by the DC. The maximum physical allocation can have a default value or be set by the user. If the size of the virtual volume is over the maximum physical allocation, step 504 is followed by step 528. If not, step 504 is followed by step 508. [0064] In step 508, system manager 104 determines if one or more LD regions are available in existing logical disks (e.g., logical disk 207). If one or more LD regions are available, step 508 is followed by step 514. If not, step 508 is followed by step 510. [0065] In step 510, system manager 104 determines if the total physical allocation of the virtual volumes owned by the DC is over the maximum physical allocation specified by the DC. If the size of the DC is over the maximum physical allocation, step 510 is followed by step 528. If not, step 510 is followed by step 512. [0066] In step 512, system manager 104 instructs logical disk layer 112-1 to create one or more new logical disks from chunklets in the physical disks. Step 512 is followed by step 513A. [0067] In step 513A, system manager 104 determines if the size of the DC is over a warning point specified by the DC. The warning point provides an early warning to the user that the physical limit is approaching. The warning point can have a default value or be set by the user. If the size of the DC is over the warning point, step 513A is followed by step 513B. If not, step 513A is followed by step 514. [0068] In step 513B, system manager 104 issues an allocation warning alert to the administrator of system 100. Step 513B is followed by step 514. [0069] In step 514, system manager 104 allocates (e.g., assigns) one or more available LD regions in the logical disk (whether existing or newly created) to be mapped to virtual volume pages. Each LD region is identified by a logical disk ID and an offset from the start of the logical disk. Step 514 is followed by step 516. [0070] In step 516, system manager 104 determines if the physical allocation of the virtual volume is over a warning point specified by the DC. The warning point provides an early warning to the user that the physical limit is approaching. The warning point can have a default value or be set by the user. If the size of the virtual volume is over the warning point, step 516 is followed by step 518. If not, step 516 is followed by step 520. [0071] In step 518, system manager 104 issues an allocation warning alert to the administrator of system 100. Step 518 is followed by step 520. [0072] In step 520, system manager 104 updates the table of contents (TOC). TOC stores the organization of the virtual volumes, the logical disks, and the chunklets of server 100 on one or more physical disk drives. Step 520 is followed by step 522. [0073] In step 522, system manager 104 delivers the one or more LD regions to virtual volume layer 110-1. As described above, virtual volume layer 110-1 divides the one or more LD regions into LD table or data pages and increments pool 412 or 414 with these new pages. Step 522 is followed by step 532. [0074] In step 528, system manager 104 issues an allocation failure alert to the administrator of system 100. Step 528 is followed by step 532. [0075] In step 532, system manager 104 ends method 500. [0076] [0076]FIG. 6 illustrates a method 700 for a virtual volume layer (e.g., virtual volume layer 110-1) and a LD layer (e.g., logical disk layer 112-1) to respond to a read request from host 118 in one embodiment. [0077] In step 702, virtual volume layer 110-1 receives from host 118 a read request of a data block in a virtual volume (e.g., virtual volume 208). The read request identifies the VV data block by a virtual volume ID and a virtual volume block address. [0078] In step 704, volume layer 110-1 traverses tables 402, 404, and 406 to find a LD data page corresponding to the virtual volume block address. As described above, if such an LD data page exists, the virtual volume block address can be mapped by a pointer identifying a logical disk ID and an offset from the start of the logical disk. Step 704 is followed by step 706. [0079] In step 706, volume layer 110-1 determines if it has found the logical disk ID and the offset from the start of the logical disk. If so, step 706 is followed by step 710. Otherwise step 706 is followed by step 708. [0080] In step 708, virtual volume layer 110-1 returns all zeros to host 118 in response to the read request. In one embodiment when the virtual volume (also referred to as a “Thin Provisioned Virtual Volume” or “TPVV”) is implemented using snapshot technology as a list of differences (exceptions) from a dummy base volume having all zeros. When a data block for a read request cannot be found in the virtual volume exception list, virtual volume layer 110-1 will look to the dummy base volume for the requested data block having the specified virtual volume block address. When searching for the requested data block in the dummy base volume, virtual volume layer 110-1 will find only zeros and thus return only zero data to host 118. For a description of a snapshot implemented as an exception list, please see U.S. patent application Ser. No. 10/655,951, entitled “Time-And-Space Efficient Mechanism To Create Virtual Storage Volume Copies,” attorney docket no. 3PD-M-8497 US; U.S. patent application Ser. No. 10/655,963, entitled “Efficient And Reliable Virtual Volume Mapping,” attorney docket no. 3PD-M-8498 US; and U.S. patent application Ser. No. 10/655,961, entitled “Read/Write Snapshot,” attorney docket no. 3PD-P100, which are incorporated by reference in their entirety. Step 708 is followed by step 714. [0081] In step 710, virtual volume layer 110-1 issues a read command to the data block identified by the logical disk ID and the identified offset to logical disk layer 112-1. Step 708 is followed by step 712. [0082] In step 712, logical disk layer 112-1 performs a normal read to the data block identified by the logical disk ID and the identified offset. Step 712 is followed by step 714. [0083] In step 714, logical disk layer 112-1 ends method 600. [0084] Various other adaptations and combinations of features of the embodiments disclosed are within the scope of the invention. Numerous embodiments are encompassed by the following claims. Patent CitationsCited PatentFiling datePublication dateApplicantTitleUS4947319 *Sep 15, 1988Aug 7, 1990International Business Machines CorporationArbitral dynamic cache using processor storageUS5394537 *Oct 1, 1993Feb 28, 1995Texas Instruments IncorporatedAdaptive page placement memory management systemUS6092157 *Jul 2, 1996Jul 18, 2000Canon Kabushiki KaishaProcessing method, apparatus and system for memory management using shared memories with common data areasUS6260129 *Sep 8, 1998Jul 10, 2001International Business Machines CorportionManagement of fixed pages in memory for input/output operationsUS6421767 *Feb 23, 2000Jul 16, 2002Storage Technology CorporationMethod and apparatus for managing a storage system using snapshot copy operations with snap groupsUS6477612 *Feb 8, 2000Nov 5, 2002Microsoft CorporationProviding access to physical memory allocated to a process by selectively mapping pages of the physical memory with virtual memory allocated to the processUS6732171 *May 31, 2002May 4, 2004Lefthand Networks, Inc.Distributed network storage system with virtualizationUS20020112113 *Jan 11, 2002Aug 15, 2002Yotta Yotta, Inc.Storage virtualization system and methodsUS20030131207 *Apr 12, 2002Jul 10, 2003Hiroshi ArakawaVirtualized volume snapshot formation methodUS20030140210 *Aug 13, 2002Jul 24, 2003Richard TestardiDynamic and variable length extentsUS20030204597 *Jan 30, 2003Oct 30, 2003Hitachi, Inc.Storage system having virtualized resourceUS20030225884 *May 31, 2002Dec 4, 2003Hayden Mark G.Distributed network storage system with virtualizationUS20040111485 *Feb 26, 2003Jun 10, 2004Yasuyuki MimatsuConnecting device of storage device and computer system including the same connecting device* Cited by examinerReferenced byCiting PatentFiling datePublication dateApplicantTitleUS7594137 *Mar 6, 2006Sep 22, 2009Hitachi, Ltd.Storage system and data restoration method thereofUS7840771 *Feb 27, 2009Nov 23, 2010Hitachi, LtdMethod and a computer for storage area managementUS7917722Aug 28, 2009Mar 29, 2011Hitachi, Ltd.Storage area dynamic assignment methodUS7941630Oct 29, 2010May 10, 2011Hitachi, Ltd.Storage system for a storage pool and virtual volumesUS7949847 *Nov 29, 2006May 24, 2011Hitachi, Ltd.Storage extent allocation method for thin provisioning storageUS8010837Sep 21, 2009Aug 30, 2011Hitachi, Ltd.Storage sub system and data restoration method thereofUS8024442 *Jul 8, 2008Sep 20, 2011Network Appliance, Inc.Centralized storage management for multiple heterogeneous host-side serversUS8032701 *Mar 30, 2007Oct 4, 2011Emc CorporationSystem and method for managing provisioning of storage resources in a network with virtualization of resources in such a networkUS8055938 *Jun 9, 2006Nov 8, 2011American Megatrends, Inc.Performance in virtual tape librariesUS8131956Jan 28, 2011Mar 6, 2012Hitachi, Ltd.Virtual storage system and method for allocating storage areas and releasing storage areas from allocation based on certain commandsUS8140790 *Dec 19, 2008Mar 20, 2012Hitachi, Ltd.Failure management method in thin provisioning technology for storageUS8161262Mar 4, 2011Apr 17, 2012Hitachi, Ltd.Storage area dynamic assignment methodUS8180989Feb 11, 2011May 15, 2012Hitachi, Ltd.Storage controller and storage control methodUS8219774Feb 5, 2010Jul 10, 2012Hitachi, Ltd.Storage controller and storage control methodUS8244868Mar 24, 2008Aug 14, 2012International Business Machines CorporationThin-provisioning adviser for storage devicesUS8255666Aug 28, 2012Hitachi, Ltd.Storage system for a storage pool and virtual volumesUS8352678 *Sep 15, 2011Jan 8, 2013Hitachi, Ltd.Storage controllerUS8359444 *Sep 24, 2008Jan 22, 2013Hitachi, Ltd.System and method for controlling automated page-based tier management in storage systemsUS8412908Mar 15, 2012Apr 2, 2013Hitachi, Ltd.Storage area dynamic assignment methodUS8453011Jul 21, 2011May 28, 2013Hitachi, Ltd.Storage system and data restoration method thereofUS8504524 *Feb 9, 2010Aug 6, 2013American Megatrends, Inc.Reclaiming space from a file systemUS8595431May 18, 2009Nov 26, 2013Hitachi, Ltd.Storage control system including virtualization and control method for sameUS8627038Jun 21, 2012Jan 7, 2014Hitachi, Ltd.Storage controller and storage control methodUS8688941Dec 27, 2012Apr 1, 2014Hitachi, Ltd.System and method for controlling automated page-based tier management in storage systemsUS8688950 *Apr 27, 2010Apr 1, 2014Hitachi, Ltd.Mainframe storage apparatus that utilizes thin provisioningUS8793461Nov 21, 2008Jul 29, 2014Hitachi, Ltd.Storage system for controlling assignment of storage area to virtual volume storing specific pattern dataUS8806154Jun 24, 2011Aug 12, 2014Chelsio Communications, Inc.Thin provisioning row snapshot with reference count mapUS8825963 *Apr 15, 2013Sep 2, 2014Netapp, Inc.Dynamic balancing of performance with block sharing in a storage systemUS8838917Jun 12, 2013Sep 16, 2014Hitachi, Ltd.Storage control system and control method for the sameUS9002794 *Aug 6, 2013Apr 7, 2015American Megatrends, Inc.Reclaiming space from a file systemUS9047016Sep 21, 2011Jun 2, 2015Hitachi, Ltd.Storage system for controlling assignment of storage area to virtual volume storing specific pattern dataUS9122416Feb 12, 2014Sep 1, 2015Hitachi, Ltd.Mainframe storage apparatus that utilizes thin provisioningUS9146853Mar 28, 2013Sep 29, 2015Microsoft Technology Licensing, LlcManaging capacity of a thinly provisioned storage systemUS9239680Jul 23, 2012Jan 19, 2016Hitachi, Ltd.Storage system for a storage pool and virtual volumesUS20060277386 *Aug 12, 2005Dec 7, 2006Yoshiaki EguchiStorage system for a strage pool and virtual volumesUS20070067588 *Nov 22, 2006Mar 22, 2007Hitachi, Ltd.Data copying method and apparatus in a thin provisioned systemUS20070174673 *Mar 6, 2006Jul 26, 2007Tomohiro KawaguchiStorage system and data restoration method thereofUS20080126734 *Nov 29, 2006May 29, 2008Atsushi MuraseStorage extent allocation method for thin provisioning storageUS20080155120 *Dec 10, 2007Jun 26, 2008Deutsche Telekom AgMethod and system for peer-to-peer content disseminationUS20090172272 *Feb 27, 2009Jul 2, 2009Hitachi, Ltd.Method and a computer for storage area managementUS20090240809 *Mar 24, 2008Sep 24, 2009International Business Machines CorporationThin-provisioning adviser for storage devicesUS20090319751 *Dec 24, 2009Masayuki YamamotoStorage area dynamic assignment methodUS20100011239 *Sep 21, 2009Jan 14, 2010Tomohiro KawaguchiStorage system and data restoration method thereofUS20100077168 *Mar 25, 2010Hitachi, Ltd.System and method for controlling automated page-based tier management in storage systemsUS20100082896 *Apr 1, 2010Hitachi, Ltd.Storage system for controlling assignment of storage area to virtual volume storing specific pattern dataUS20100088485 *Apr 8, 2010Hirokazu IkedaFailure management method in thin provisioning technology for storageUS20100185814 *Jan 27, 2010Jul 22, 2010Hitachi, Ltd.Data copying method and apparatus in a thin provisioned systemUS20110047344 *Oct 29, 2010Feb 24, 2011Yoshiaki EguchiStorage system for a storage pool and virtual volumesUS20110138143 *Jun 9, 2011Hitachi, Ltd.Storage controller and storage control methodUS20110179263 *Jul 21, 2011Yoshiaki EguchiStorage system for a storage pool and virtual volumesUS20110320714 *Apr 27, 2010Dec 29, 2011Hitachi, Ltd.Mainframe storage apparatus that utilizes thin provisioningEP1736861A1 *Mar 8, 2006Dec 27, 2006Hitachi, Ltd.A storage system for a storage pool and virtual volumesEP1837751A2 *Nov 3, 2006Sep 26, 2007Hitachi, Ltd.Storage system, storage extent release method and storage apparatusEP1845439A2 *Mar 26, 2007Oct 17, 2007Hitachi, Ltd.Storage area dynamic assignment methodEP1936488A2 *Oct 10, 2007Jun 25, 2008Hitachi, Ltd.Storage controller and storage control methodEP1990720A1 *Nov 27, 2007Nov 12, 2008Hitachi, Ltd.Methods and apparatus to backup and restore data for virtualized storage areaEP2239655A2 *Oct 10, 2007Oct 13, 2010Hitachi Ltd.Storage controller and storage control method* Cited by examinerClassifications U.S. Classification711/203, 711/170, 711/112International ClassificationG06F12/08, G06F12/00, G06F3/06Cooperative ClassificationG06F3/0689, G06F3/0665, G06F3/0605European ClassificationG06F3/06A6L4R, G06F3/06A2A2, G06F3/06A4V4Legal EventsDateCodeEventDescriptionAug 31, 2004ASAssignmentFeb 28, 2008ASAssignmentOwner name: 3PAR INC.,CALIFORNIAFree format text: CHANGE OF NAME;ASSIGNOR:3PARDATA, INC.;REEL/FRAME:020571/0664Effective date: 20070731Jun 2, 2008REMIMaintenance fee reminder mailedJun 18, 2008FPAYFee paymentYear of fee payment: 4Jun 18, 2008SULPSurcharge for late paymentMay 10, 2011ASAssignmentOwner name: HEWLETT-PACKARD DEVELOPMENT COMPANY, L.P., TEXASFree format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:3PAR INC.;REEL/FRAME:026250/0322Effective date: 20110412May 23, 2012FPAYFee paymentYear of fee payment: 8Nov 9, 2015ASAssignmentOwner name: HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP, TEXASFree format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:HEWLETT-PACKARD DEVELOPMENT COMPANY, L.P.;REEL/FRAME:037079/0001Effective date: 20151027RotateOriginal ImageGoogle Home - Sitemap - USPTO Bulk Downloads - Privacy Policy - Terms of Service - About Google Patents - Send FeedbackData provided by IFI CLAIMS Patent Services