A conventional data storage system presents a mapped logical unit of storage (LUN) for block-level access. The mapped LUN includes slices of storage that are formed from physical drives configured as a redundant array of independent disk (RAID) group. For example, in accordance with RAID Level 5, each block-level data stripe (multiple data blocks and a parity block) extends across all of the physical drives of the RAID group (one block being placed on each physical drive), and these data stripes form slices of storage of the LUN.
During operation, the data storage system may move slices of data between RAID groups of different storage tiers. For example, the data storage system may promote a frequently accessed slice of data to a first RAID group in a solid state memory storage tier (i.e., a fast tier) from a second RAID group in a magnetic memory storage tier (i.e., a slow tier) to reduce access latency for that slice of data. Additionally, the data storage system may demote a slice of data that is infrequently accessed from first RAID group in the solid state memory storage tier to the second RAID group in the magnetic memory storage tier to free up storage space within the solid state memory storage tier.
Unfortunately, there are deficiencies to the above-described conventional data storage system in which each block-level data stripe extends across all of the physical drives of the RAID group. For example, in response to failure of a physical drive, such a data storage system requires excessive access to a new physical drive during data restoration. Such access results in relatively long data restoration time thus leaving the data storage system vulnerable to data loss if second physical drive fails before data restoration completes.
However, suppose that the data is stored in a mapped-RAID environment instead of the above-described conventional data storage system in which each block-level data stripe extends across all of the physical drives of the RAID group. Although data restoration may complete faster in the mapped-RAID environment since the restored data may be written across more than one existing storage device rather than a single new storage device, the mapped-RAID environment may provide uneven input/output (I/O) loading and/or wearing of storage devices. That is, the mapped-RAID environment may form imbalances (e.g., hot spots) since each block-level data stripe does not extend across all of the physical drives of the RAID group. If there is no compensation provided for these imbalances, latency to overloaded storage devices that form hot spots may be sub-optimal and these overloaded storage devices may fail prematurely.
In contrast to the above-described conventional data storage system in which each block-level data stripe extends across all of the physical drives of the RAID group, improved techniques are directed to re-placing (or relocating) data within a mapped-RAID environment to provide improved I/O load and wear balancing among storage devices. In particular, such techniques identify imbalances (e.g., heavily accessed slices of data) and move the imbalances among the storage devices of the mapped-RAID environment (e.g., redistribute the heavily accessed slices of data). Such operation statistically balances the storage devices in terms of I/O performance and wearing thus reducing overall latency and reducing failures due to premature wear.
One embodiment is directed to a method of balancing data storage activity within a mapped-RAID environment. The method includes selecting, by processing circuitry, a source slice of storage from multiple slices of storage of the mapped-RAID environment, the source slice containing particular data to be relocated. The method further includes selecting, by the processing circuitry, a destination slice of storage from the multiple slices of storage of the mapped-RAID environment. The method further includes relocating, by the processing circuitry, the particular data from the source slice to the destination slice to balance data storage activity within the mapped-RAID environment. The mapped-RAID environment includes multiple storage devices. Each storage device provides multiple non-overlapping device extents. Each slice of the multiple slices of storage of the mapped-RAID environment is formed of storage stripes extending across device extents provided by a group of storage devices that includes less than all of the storage devices of the mapped-RAID environment.
In some arrangements, the method further includes, prior to selecting the source slice and the destination slice, performing a set of input/output (I/O) operations that accesses the particular data while the particular data resides in the source slice. In these arrangements, the method further includes updating, in response to performing the set of I/O operations, a set of statistics that tracks data storage activity of the mapped-RAID environment.
In some arrangements, selecting the source slice of storage from the multiple slices of storage of the mapped-RAID environment includes identifying the source slice among other slices of the mapped-RAID environment based on the set of statistics that tracks data storage activity of the mapped-RAID environment indicating that the source slice has experienced higher data storage activity than the other slices of the mapped-RAID environment.
In some arrangements, selecting the destination slice of storage from the multiple slices of storage of the mapped-RAID environment includes identifying the destination slice among the other slices of the mapped-RAID environment based on the set of statistics that tracks data storage activity of the mapped-RAID environment indicating that the destination slice has experienced less data storage activity than the other slices of the mapped-RAID environment.
In some arrangements, the method further includes, while performing the set of I/O operations that accesses the particular data while the particular data resides in the source slice, maintaining an initial set of address mappings that map a portion of a logical unit of storage (LUN), which is addressable by a set applications, to the source slice.
In some arrangements, the method further includes, upon relocating the particular data from the source slice to the destination slice, maintaining a subsequent set of address mappings that map the portion of the LUN to the destination slice.
In some arrangements, the method further includes, after relocating the particular data from the source slice to the destination slice, performing another set of I/O operations that accesses the particular data while the particular data resides in the destination slice. In these arrangements, the method further includes updating the set of statistics that tracks data storage activity of the mapped-RAID environment in response to performing the other set of I/O operations.
Another embodiment is directed to data storage equipment which includes a communications interface, memory, and control circuitry coupled to the communications interface and the memory. The memory includes a mapped-RAID environment having multiple storage devices, each storage device providing multiple non-overlapping device extents. The memory stores instructions which, when carried out by the control circuitry, cause the control circuitry to:
Yet another embodiment is directed to a computer program product having a non-transitory computer readable medium which stores a set of instructions to balance data storage activity within a mapped-RAID environment. The set of instructions, when carried out by computerized circuitry, causing the computerized circuitry to perform a method of:
It should be understood that, in the cloud context, at least some of electronic circuitry is formed by remote computer resources distributed over a network. Such an electronic environment is capable of providing certain advantages such as high availability and data protection, transparent operation and enhanced security, big data analysis, etc.
Other embodiments are directed to electronic systems and apparatus, processing circuits, computer program products, and so on. Some embodiments are directed to various methods, electronic components and circuitry which are involved in re-placing data within a mapped-RAID environment.
The foregoing and other objects, features and advantages will be apparent from the following description of particular embodiments of the present disclosure, as illustrated in the accompanying drawings in which like reference characters refer to the same parts throughout the different views. The drawings are not necessarily to scale, emphasis instead being placed upon illustrating the principles of various embodiments of the present disclosure.
An improved technique is directed to relocating (or moving) data within a mapped-RAID environment to provide improved input/output (I/O) performance and wear balancing among storage devices. Along these lines, such a technique identifies imbalances (e.g., heavily accessed slices of data) and moves that data among the storage devices (e.g., redistributes the heavily accessed slices of data to less frequently accessed locations). Such operation statistically balances the storage devices in terms of I/O loading and wearing thus reducing overall latency and reducing failures due to premature wear.
Each host computer 22 is constructed and arranged to perform useful work. For example, a host computer 22 may operate as a web server, a file server, an email server, an enterprise server, combinations thereof, and so on, which provides I/O requests 30 (e.g., small computer system interface or SCSI commands) to the data storage equipment 24. Such I/O requests 30 direct the data storage equipment 24 to store and retrieve host data 32 on behalf of the host computers 22.
The data storage equipment 24 includes storage processing circuitry 40 and an array of storage devices 42. The storage processing circuitry 40 may include one or more physical storage processors or engines, data movers, director boards, blades, I/O modules, storage drive controllers, switches, other hardware, combinations thereof, and so on. The storage processing circuitry 40 is constructed and arranged to provide a variety of data storage system services. For example, the storage processing circuitry 40 processes the I/O requests 30 from the host computers 22 by robustly and reliably storing host data 32 (and associated metadata) in a mapped-RAID environment 44 provided by the array of storage devices 42 and retrieving the host data 32 from the mapped-RAID environment 44. Additionally, the storage processing circuitry 40 moves data between different slices of the mapped-RAID environment 44 to provide even I/O loading and wear. Accordingly, I/O latency and failures due to premature wearing are reduced.
The communications medium 26 is constructed and arranged to connect the various components of the data storage setting 20 together to enable these components to communicate via exchanging electronic signals 50 (e.g., see the double arrow 50). At least a portion of the communications medium 26 is illustrated as a cloud to indicate that the communications medium 26 is capable of having a variety of different topologies including backbone, hub-and-spoke, loop, irregular, combinations thereof, and so on. Along these lines, the communications medium 26 may include copper-based data communications devices and cabling, fiber optic communications devices and cabling, wireless communication devices, combinations thereof, etc. Furthermore, the communications medium 26 is capable of supporting SAN-based communications, LAN-based communications, cellular communications, WAN-based communications, distributed infrastructure communications, other topologies, combinations thereof, etc.
During operation, the storage processing circuitry 40 of the data storage equipment 24 writes host data 32 to the array of storage devices 42 and reads host data 32 from the array of storage devices 42 in response to the I/O requests 30. Routinely, the storage processing circuitry 40 re-places data (e.g., host data 32, metadata, etc.) among slices of the mapped-RAID environment 44 to more evenly distribute loading and wear. As a result, there is lower I/O latency and fewer failures due to premature wearing. Further details will now be provided with reference to
The communications interface 70 is constructed and arranged to connect the data storage equipment 24 to the communications medium 26 (also see
The memory 72 is intended to represent both volatile storage (e.g., DRAM, SRAM, etc.) and non-volatile storage (e.g., flash memory, magnetic memory, etc.). In some arrangements, the memory 72 utilizes a portion of the array of storage devices 42 (
The operating system code 82 refers to an operating system which is involved in controlling various electronic resources of the data storage equipment 24. For example, the operating system manages/allocates processor cycles, memory space, application installations, access control and privileges, and so on.
The data storage code 84 refers to the instructions that are involved in routine data storage operations (e.g., write and read operations). The data storage code 84 may include operating parameters, drivers, other metadata, etc. that form one or more portions of the I/O stack, mapping tables, and so on. In some arrangements, the data storage code 84 is tightly integrated with the operating system code 82 (e.g., a kernel).
The data relocation code and data 86 refers to specialized instructions that identify source slices containing data for relocation, and then relocate that data. In some arrangements, the data relocation code and data 86 includes a database which stores a set of statistics that tracks data storage activity of the mapped-RAID environment 44. Such statistics are then used to identify candidate source and destination slices for re-placement.
The other code and data 88 refers to various other instructions, parameters, data, etc. For example, the data storage equipment 24 may be equipped with other tools and utilities, user-level applications, and so on.
The processing circuitry 74 is constructed and arranged to operate in accordance with the various software constructs 80 stored in the memory 72. As will be explained in further detail shortly, the processing circuitry 74 executes code of the various software constructs 80 to form specialized circuitry that concurrently carries out data storage operations as well as perform data redistribution operations.
Such processing circuitry 74 may be implemented in a variety of ways including via one or more processors (or cores) running specialized software, application specific ICs (ASICs), field programmable gate arrays (FPGAs) and associated programs, discrete components, analog circuits, other hardware circuitry, combinations thereof, and so on. In the context of one or more processors executing software, a computer program product 90 is capable of delivering all or portions of the software constructs 80 to the electronic circuitry 60. In particular, the computer program product 90 has a non-transitory (or non-volatile) computer readable medium which stores a set of instructions which controls one or more operations of the electronic circuitry 60. Examples of suitable computer readable storage media include tangible articles of manufacture and apparatus which store instructions in a non-volatile manner such as CD-ROM, DVD, flash memory, disk memory, tape memory, and the like.
The other circuitry 76 represents additional hardware. For example, the other circuitry 76 may include a storage drive (or array) interface to communicate with the storage drives 42 (e.g., SATA, SAS, PCIe, etc.). As another example, the other circuitry 76 may include a user terminal or service processor that enables a human user to control and/or configure the data storage equipment 24, and so on. Further details will now be provided with reference to
As shown in
The data storage equipment 24 then combines device extents 100 from different storage devices 42 to form RAID extents 110. Each RAID extent 110 includes storage for data and parity such as RAID 4+1 which includes four device extents 100 that hold data and one device extent 100 that holds parity. For example, as shown in
The data storage equipment 24 combines multiple RAID extents 110(1), 110(2), . . . to form a RAID group 120. By way of example, if the size of each device extent 100 is 1 GB, the size of each RAID extent 110 is 5 GB in a RAID 4+1 implementation. Of course, other RAID implementations and other RAID extent sizes are suitable for use in the mapped-RAID environment 44.
It should be understood that, in the RAID 4+1 example, a RAID group 120 that includes two RAID extents 110 distributes data across a maximum of ten (10) storage devices 42 (i.e., where there are no storage devices 42 in common between the two RAID extents 110). Likewise, in the RAID 4+1 example, a RAID group 120 that includes three RAID extents 110 distributes data across a maximum of fifteen (15) storage devices 42, and so on.
The data storage equipment 24 divides each RAID extent 110 (see the RAID extent 110(1) in
The data storage equipment 24 then combines multiple storage stripes 130 together to form slices 140(1), . . . 140(N−1), 140(N), 140(N+1), . . . (collectively, slices 140) of a logical unit of storage (LUN) 150. The arrow 142 pointing to a portion of the slice 140(N) delineated by hash marks is intended to illustrate the relationship between a storage stripe 130 and a slice 140. In some arrangements, each slice 140 is 256 MB in size, although other sizes (e.g., 128 MB, 512 MB, 1 GB, etc.) are suitable for use as well.
It should be understood that such a LUN 150 is addressable in that data can be read using offsets (e.g., logical block addresses which are mapped to underlying storage). In some arrangements, such a LUN 150 is thickly provisioned in that actual physical storage from the storage devices 42 supports the entire LUN address space. In other arrangements, such a LUN 150 is thinly provisioned in that physical storage from the storage devices 42 is allocated only upon storage of actual data.
Additionally, each storage tier 160 includes at least one RAID group 120 (also see
As shown in
In some embodiments, the storage processing circuitry 40 is configured and operative to read wear data from each storage device 42 periodically. Along these lines, the storage processing circuitry 40 obtains the current program-erase (P/E) cycle number and the maximum number of P/E cycles. From this information, the storage processing circuitry 40 is able to ascertain the percentage of wear of each storage device 42 (e.g., the current P/E divided by the maximum number of P/E cycles as a percentage). Additionally, the storage processing circuitry 40 is able to estimate how many cycles are consumed between updates (e.g., the number of P/E cycles consumed since the last time the storage processing circuitry read the wear data, and so on). Other metrics can be obtained, derived, and/or estimated as well.
During operation, the storage processing circuitry 40 selects data within a source slice 140(S) to re-place within the mapped-RAID environment 44 in order to improve loading and wear characteristics. In particular, the storage processing circuitry 40 identifies a source slice 140(S) containing hot data among the other slices 140 based on the database 170 containing the set of statistics that tracks data storage activity (e.g., the most frequently accessed slice 140, a slice 140 having a number of writes that exceeds a predefined write threshold, a slice 140 having a number of accesses that exceeds a predefined access threshold, etc.). In some arrangements, the database 170 includes moving averages, and the storage processing circuitry 40 compares particular slice metrics to one or more of the moving averages in order to identify a candidate source slice 140(S) that stands out from a relative perspective among the other slices 140. Accordingly, the results of such evaluation by the storage processing circuitry 40 may be viewed essentially as predictions as to when source slice activity justifies relocating the slice data.
In some embodiments, the storage processing circuitry selects a destination slice 140(D) within the mapped-RAID environment 44 to be an available slice 140 that is different from the current source slice 140(S). As a result, I/O and wear are balanced statistically. That is, from time to time, the source slice 140(S) moves from one place to another and the corresponding I/O moves with it.
In alternative embodiments, the storage processing circuitry 40 selects a destination slice 140(D) within the mapped-RAID environment 44. Similarly, the storage processing circuitry 40 identifies a destination slice 140(D) among other slices 140 based on the set statistics that tracks data storage activity (e.g., the least frequently accessed slice 140, a slice 140 having a number of writes that is below a predefined write threshold, a slice 140 having a number of accesses that is below a predefined access threshold, etc.). Again, in some arrangements, the storage processing circuitry 40 compares particular slice metrics to one or more moving averages in order to identify, as the destination slice 140(D), a slice 140 that stands out from a relative perspective among the other slices 140.
Once the source slice 140(S) and the destination slice 140(D) have been chosen, the storage processing circuitry 40 relocates data (the shaded portions) from the source slice 140(S) to the destination slice 140(D) (see the arrow 180 in
Upon relocating the particular data from the source slice 140(S) to the destination slice 140(D), the storage processing circuitry 40 updates a set of address mappings that maps the LUN 150 to actual storage. Accordingly, subsequent I/O operations to access the slice data are no longer directed to the source slice 140(S) but are now directed to the destination slice 140(S).
It should be understood that while host data 32 is moved from a source slice 140(S) to a destination slice 140(D), the host data 32 may be accessed by the set of host computers 22. In particular, the data may be read, modified, written, etc. Accordingly, all changes are eventually reflected in the host data 32 that resides in the destination slice 140(D). Moreover, the storage processing circuitry 40 continues to update the set of statistics within the database 170 so that the database 170 continues to track the data storage activity of the mapped-RAID environment 44.
Furthermore, the storage processing circuitry 40 may impose policies on data relocation. Along these lines, the storage processing circuitry 40 may restrict metadata (e.g., data used by the data storage equipment 24 during operation that is transparent to the host computers 22) to a particular storage tier 160 (e.g., the fastest storage tier 160). Other policies are suitable for use as well.
It should be further understood that such moving of slice data from a source slice 140(S) to a destination slice 140(D) may occur within the same RAID group 120 within the same storage tier 160. Such re-placement of the slice data may be warranted for frequently accessed slice data that resides in a relatively lightly used RAID group 120 or when the data storage system 24 (or the particular storage tier 160) includes only one RAID group 120.
Alternatively, the storage processing circuitry 40 may move slice data from a source slice 140 in one RAID group 120 to a destination slice 140 in a different RAID group 120 within the same storage tier 160. Such re-placement of the slice data may be warranted for frequently accessed slice data that resides a heavily used RAID group 120 in an appropriate storage tier 160 or when the data storage system 24 includes only one storage tier 160.
As yet another alternative, the storage processing circuitry 40 may move slice data from a slice 140 in one RAID group 120 to a slice 140 in a different RAID group 120 within different storage tiers 160. Such re-placement of the slice data may be warranted for frequently accessed slice data that resides a heavily used RAID group 120 in an inappropriate storage tier 160 (e.g., when the slice data should be promoted or demoted due to a chance in access frequency, etc., also see the darkened arrows extending between tiers 160 in
It should be understood that such moving of data slices may occur in the background and be transparent to the host computers 22 (
At 202, the data storage equipment 24 selects a source slice of storage from multiple slices of storage of the mapped-RAID environment. The source slice contains particular data to be relocated. Such selection may be based on an evaluation of historical data storage activity (e.g., also see the database 170 in
At 204, the data storage equipment 24 select a destination slice of storage from the multiple slices of storage of the mapped-RAID environment. Again, such selection may be based on an evaluation of historical data storage activity.
At 206, data storage equipment 24 relocates the particular data from the source slice to the destination slice to balance data storage activity within the mapped-RAID environment. The mapped-RAID environment includes multiple storage devices. Each storage device provides multiple non-overlapping device extents. Each slice of the multiple slices of storage of the mapped-RAID environment is formed of storage stripes extending across device extents provided by a group of storage devices that includes less than all of the storage devices of the mapped-RAID environment. It should be understood that such operation may take place while host computers 22 access host data within the mapped-RAID environment (i.e., I/O operations are performed concurrently).
As described above, improved techniques are directed to re-placing (or relocating) data within a mapped-RAID environment 44 to provide improved I/O load and wear balancing among storage devices 42. In particular, such techniques identify imbalances (e.g., heavily accessed slices of data) and move the imbalances among the storage devices 42 of the mapped-RAID environment 44 (e.g., redistribute the heavily accessed slices of data). Such operation statistically balances the storage devices 42 in terms of I/O performance and wearing thus reducing overall latency and reducing failures due to premature wear.
One should appreciate that the above-described techniques do not merely read/write data. Rather, the disclosed techniques involve improvements to the technology of data storage. For example, such techniques improve data access speeds by balancing I/O activity across multiple storage devices 42. Additionally, such techniques reduce the chance of encountering an unexpected storage device failure due to earlier than anticipated wear on a particular storage device 42, and so on.
While various embodiments of the present disclosure have been particularly shown and described, it will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the spirit and scope of the present disclosure as defined by the appended claims.
For example, it should be understood that various components of the data storage setting 20 such as the host computers 22 are capable of being implemented in or “moved to” the cloud, i.e., to remote computer resources distributed over a network. Here, the various computer resources may be distributed tightly (e.g., a server farm in a single facility) or over relatively large distances (e.g., over a campus, in different cities, coast to coast, etc.). In these situations, the network connecting the resources is capable of having a variety of different topologies including backbone, hub-and-spoke, loop, irregular, combinations thereof, and so on. Additionally, the network may include copper-based data communications devices and cabling, fiber optic devices and cabling, wireless devices, combinations thereof, etc. Furthermore, the network is capable of supporting LAN-based communications, SAN-based communications, combinations thereof, and so on.
The individual features of the various embodiments, examples, and implementations disclosed within this document can be combined in any desired manner that makes technological sense. Furthermore, the individual features are hereby combined in this manner to form all possible combinations, permutations and variants except to the extent that such combinations, permutations and/or variants have been explicitly excluded or are impractical. Support for such combinations, permutations and variants is considered to exist within this document. Such modifications and enhancements are intended to belong to various embodiments of the disclosure.
Filing Document | Filing Date | Country | Kind |
---|---|---|---|
PCT/RU2017/000273 | 4/27/2017 | WO | 00 |
Publishing Document | Publishing Date | Country | Kind |
---|---|---|---|
WO2018/199794 | 11/1/2018 | WO | A |
Number | Name | Date | Kind |
---|---|---|---|
5345584 | Hill | Sep 1994 | A |
5734861 | Cohn et al. | Mar 1998 | A |
6173306 | Raz et al. | Jan 2001 | B1 |
8706960 | Ives et al. | Apr 2014 | B1 |
8832363 | Sundaram | Sep 2014 | B1 |
8935493 | Dolan et al. | Jan 2015 | B1 |
9311002 | Scott et al. | Apr 2016 | B1 |
9330105 | Duprey et al. | May 2016 | B1 |
9383940 | Ives et al. | Jul 2016 | B1 |
9594514 | Bono et al. | Mar 2017 | B1 |
9684593 | Chen et al. | Jun 2017 | B1 |
9703664 | Alshawabkeh et al. | Jul 2017 | B1 |
9940033 | Alshawabkeh et al. | Apr 2018 | B1 |
9965218 | Martin et al. | May 2018 | B1 |
10025523 | Dagan et al. | Jul 2018 | B1 |
10073621 | Foley et al. | Sep 2018 | B1 |
10078569 | Alshawabkeh et al. | Sep 2018 | B1 |
10089026 | Puhov et al. | Oct 2018 | B1 |
10095425 | Martin | Oct 2018 | B1 |
10126988 | Han et al. | Nov 2018 | B1 |
10140041 | Dong et al. | Nov 2018 | B1 |
10146447 | Dong et al. | Dec 2018 | B1 |
10146456 | Gao et al. | Dec 2018 | B1 |
10146459 | Gao et al. | Dec 2018 | B1 |
10146624 | Gong et al. | Dec 2018 | B1 |
10146646 | Foley et al. | Dec 2018 | B1 |
10152254 | Kang et al. | Dec 2018 | B1 |
20020095532 | Surugucchi et al. | Jul 2002 | A1 |
20030065883 | Bachmat | Apr 2003 | A1 |
20060161807 | Dawkins | Jul 2006 | A1 |
20060212746 | Amegadzie et al. | Sep 2006 | A1 |
20080028164 | Ikemoto et al. | Jan 2008 | A1 |
20080059749 | Gerber et al. | Mar 2008 | A1 |
20080109601 | Klemm et al. | May 2008 | A1 |
20100250501 | Mandagere et al. | Sep 2010 | A1 |
20110047321 | Taguchi | Feb 2011 | A1 |
20110066767 | Hyde, II | Mar 2011 | A1 |
20110167236 | Orikasa | Jul 2011 | A1 |
20120259901 | Lee et al. | Oct 2012 | A1 |
20130067187 | Moss | Mar 2013 | A1 |
20130275653 | Ranade et al. | Oct 2013 | A1 |
20140095439 | Ram | Apr 2014 | A1 |
20140317346 | Moon | Oct 2014 | A1 |
20150134926 | Yang et al. | May 2015 | A1 |
20160188401 | Shen et al. | Jun 2016 | A1 |
20160196075 | Matsushita | Jul 2016 | A1 |
20160364149 | Klemm et al. | Dec 2016 | A1 |
20170285972 | Dalmatov | Oct 2017 | A1 |
20180121129 | Sawhney | May 2018 | A1 |
Number | Date | Country |
---|---|---|
20160072971 | May 2016 | WO |
Entry |
---|
EMC, “EMC Celerra Automated Storage Tiering Applied Best Practices Guide”, Aug. 2009, P/N h6499, pp. 1-36. |
EMC, “EMC VNX@ Unified Best Practices for Performance Applied Best Practice Guide”, Oct. 2005, P/N H10938.8, pp. 1-37. |
EMC, “Managing Data Relocation in Storage Systems”, U.S. Appl. No. 13/929,664, filed Jun. 27, 2013. |
Tomek, “EMC VNX-Fast VP Explained—Storage Freak”, retrieved from http://www.storagefreak.net/2014/06/emc-vnx-fast-vp-explained, Jun. 2, 2014, pp. 1-6. |
International Search Report and the Written Opinion from International Searching Authority (RU) for International Application No. PCT/RU2017/000273, dated Jan. 25, 2018, 7 pages. |
Number | Date | Country | |
---|---|---|---|
20210191619 A1 | Jun 2021 | US |