Patent application number | Description | Published |
20120102350 | Reducing Energy Consumption and Optimizing Workload and Performance in Multi-tier Storage Systems Using Extent-level Dynamic Tiering - Embodiments of the invention relate to reducing energy consumption and optimizing workload and performance in multi-tier storage systems using extent-level dynamic tiering. An aspect of the invention includes a receiving data access information of a storage extent stored in a storage system and utilization information of storage devices in the storage system. The storage system includes a plurality of storage tiers and each of the plurality of storage tiers is made up of a plurality of storage devices. Storage resources required for each of the plurality of the storage tiers to satisfy the storage extent's performance and capacity requirements are estimated based on the data access information. One storage tier that would incur the lowest power consumption to the storage system for satisfying the storage extent's performance and capacity requirements is determined. The one storage tier is determined by calculating the amount of power that would be consumed by the storage extent in each of the plurality of storage tiers based on the estimated storage resources. At least one storage device in the one storage tier that has available storage resources that would satisfy the storage extent's performance and capacity requirements is determined based on the data access information and utilization information. The storage extent is allocated to the one storage tier and to one storage device (among the at least one storage device) that has the least amount of available storage capacity. | 04-26-2012 |
20130198148 | ESTIMATING DATA REDUCTION IN STORAGE SYSTEMS - Embodiments of the present invention provide a system, method and computer program products for estimating data reduction in a file system. A method includes selecting a sample of all data from data files in the file system, wherein said sample represent a subset of all the data in the file system. The method further includes estimating a data reduction ratio by data deduplication for the file system based on said sample. The method further includes estimating a data reduction ratio by data compression for the file system based said sample. The method further includes generating a combined data reduction estimate for the file system based on said data compression estimate and said data deduplication estimate. | 08-01-2013 |
20130198449 | MULTI-TIER STORAGE SYSTEM CONFIGURATION ADVISER - Embodiments of the invention relate to providing configuration options for optimizing storage extent placement in multi tiered storage systems. In one aspect of the invention, In one embodiment, a configuration adviser provides configuration options for a multi-tiered storage system that includes a number of different storage tiers, each of which include storage devices of a particular storage type. Data access information for storage extents to be stored in the storage system are received. Resource information for available storage tiers in the storage system to place the storage extents on are also received. A cost incurred by the storage system for placing each of the storage extents on each of the storage tiers is determined. Each storage extent is assigned to a particular one of the storage tiers that would incur the lowest cost to the storage system for storing the storage extent. For each storage tier, a minimum number of storage devices are selected, within the assigned storage tier, that would satisfy data access and capacity requirements for all storage extents assigned to that tier. | 08-01-2013 |
20130290276 | ENHANCING PERFORMANCE-COST RATIO OF A PRIMARY STORAGE ADAPATIVE DATA REDUCTION SYSTEM - Data reduction in a storage system comprises determining attributes of data for storage in the storage system and determining expected data reduction effectiveness for the data based on said attributes. Said effectiveness indicates the benefit that data reduction is expected to provide for the data based on said attributes. The data reduction further comprises applying data reduction to the data based on the expected data reduction effectiveness and performance impact, to improve resource usage efficiency. | 10-31-2013 |
20130290277 | DEDUPLICATING STORAGE WITH ENHANCED FREQUENT-BLOCK DETECTION - Detecting data duplication comprises maintaining a fingerprint directory including one or more entries, each entry including a data fingerprint and a data location for a data chunk. Each entry is associated with a seen-count attribute which is an indication of how often the fingerprint has been seen in arriving data chunks. Higher-frequency entries in the directory are retained, while also taking into account recency of data accesses. A data duplication detector detects that the data fingerprint for a new chunk is the same as the data fingerprint contained in an entry in the fingerprint directory. | 10-31-2013 |
20140301545 | ACHIEVING STORAGE EFFICIENCY IN PRESENCE OF END-TO-END ENCRYPTION USING DOWNSTREAM DECRYPTERS - Embodiments of the invention relate to efficiently storing encrypted data in persistent storage or passing to another data processing component. A downstream decrypter is utilized to act within the data path between a data generator and a storage server. The decrypter fetches an encryption key and any other necessary auxiliary information necessary to decrypt received data. Following decryption of the data, the decrypter has the ability to operate directly on plaintext and perform storage efficiency functions on the decrypted data. The decrypter re-encrypts the data prior to the data leaving the decrypter for persistent storage to maintain the security of the encrypted data. | 10-09-2014 |
20140333457 | Random Extraction From Compressed Data - Aspects of the invention are provided for decoding a selected span of data within a compressed code stream. A selection of data within the compressed code stream from an arbitrary position is presented for decompression. The arbitrary position is the starting point in the compressed code stream for decompression, and a phrase within the compressed code stream containing the starting point is identified. From the arbitrary starting point, a back pointer may provide direction to the literal. The literal is extracted as a decoding of the compressed data associated with the starting point. | 11-13-2014 |
20140358857 | DE-DUPLICATION WITH PARTITIONING ADVICE AND AUTOMATION - Migrating a sub-volume in data storage with at least two de-duplication domains, each of the domains having at least one sub-volume. A first sub-volume is assigned to a de-duplication domain and a first content summary is computed for the first sub-volume. Similarly, a second sub-volume is assigned to a second de-duplication domains and a second content summary is computed for the second sub-volume. A first content affinity is calculated between the first sub-volume and a third sub-volume, and a second content affinity is calculated between the second sub-volume and the third sub-volume. A domain placement is selected for the third sub-volume based on comparison of the first content affinity and the second content affinity. | 12-04-2014 |
20140358867 | DE-DUPLICATION DEPLOYMENT PLANNING - Assignment of files to a de-duplication domain. Address space of data files is divided into multiple containers. For each of the containers, a file metadata scan is performed to obtain file system metadata, which is aggregated and summarized in a content feature summary. A content feature summary prediction measurement is measured between containers from the generated content feature summary, and files from each container are assigned to a de-duplication domain based upon the content similarity predication measurement. | 12-04-2014 |
20140358870 | DE-DUPLICATION DEPLOYMENT PLANNING - Assignment of files to a de-duplication domain. Address space of data files is divided into multiple containers. For each of the containers, a file metadata scan is performed to obtain file system metadata, which is aggregated and summarized in a content feature summary. A content feature summary prediction measurement is measured between containers from the generated content feature summary, and files from each container are assigned to a de-duplication domain based upon the content similarity predication measurement. | 12-04-2014 |
20140359244 | DE-DUPLICATION WITH PARTITIONING ADVICE AND AUTOMATION - Migrating a sub-volume in data storage with at least two de-duplication domains, each of the domains having at least one sub-volume. A first sub-volume is assigned to a de-duplication domain and a first content summary is computed for the first sub-volume. Similarly, a second sub-volume is assigned to a second de-duplication domains and a second content summary is computed for the second sub-volume. A first content affinity is calculated between the first sub-volume and a third sub-volume, and a second content affinity is calculated between the second sub-volume and the third sub-volume. A domain placement is selected for the third sub-volume based on comparison of the first content affinity and the second content affinity. | 12-04-2014 |