Emc IP Holding Company LLC

Emc Corporation

Emp IP Holding Company LLC

Ivan Basov

Philippe Armangau

Sorin Faibish

Istvan Gonczi

Philip N Shilane

Vamsi K Vankamamidi

William C Davenport

Ahsan Rashid

Walter Forrester

Rohit K Chawla

Sitaram D Pawar

Christopher H Stacey

Michal Marko

Jean-Pierre Bono

Anton Kucherov

Junping Zhao

Uday K Gupta

Xiaoye Jiang

Christopher Alan Seibel

Stephen A Fridella

Morgan A Clark

Jiannan Zheng

Yining Si

Eyal Zimran

Christian J Chuba

A method, computer program product, and computer system for identifying duplicate sectors in a block of a plurality of blocks. The duplicate sectors in the block may be zeroed out. A data reduction operation may be performed on the block after the duplicate sectors are zeroed out.

System and method for sub-block deduplication with search for identical sectors inside a candidate block

A method, computer program product, and computer system for identifying a plurality of blocks. At least one heuristic associated with at least a portion of the plurality of blocks may be determined. It may be determined whether to compress at least the portion of the plurality of blocks based upon, at least in part, the at least one heuristic. At least the portion of the plurality of blocks may be compressed based upon, at least in part, the at least one heuristic.

System and method for improving space efficiency by compressing multi-block aggregates

A method, computer program product, and computing system for receiving a candidate data portion; calculating a distance-preserving hash for the candidate data portion; and performing an entropy analysis on the distance-preserving hash to generate a hash entropy for the candidate data portion.

System and method for hash-based entropy calculation

A method, computer program product, and computer system for identifying a plurality of blocks. At least one heuristic associated with at least a portion of the plurality of blocks may be determined. It may be determined whether at least the portion of the plurality of blocks is a candidate for deduplication based upon, at least in part, the at least one heuristic. At least the portion of the plurality of blocks may be deduplicated based upon, at least in part, the at least one heuristic.

System and method for detecting deduplication opportunities

A method, computer program product, and computing system for performing an entropy analysis on each of a plurality of candidate data chunks associated with a potential candidate to generate a plurality of candidate data chunk entropies; performing an entropy analysis on each of a plurality of target data chunks associated with a potential target to generate a plurality of target data chunk entropies; identifying a candidate data chunk entropy limit, chosen from the plurality of candidate data chunk entropies, and a target data chunk entropy limit, chosen from the plurality of candidate data chunk entropies; and comparing a specific candidate data chunk associated with the candidate data chunk entropy limit to a specific target data chunk associated with the target data chunk entropy limit to determine if the specific candidate data chunk and the specific target data chunk are identical.

System and method for offset-based deduplication

A method, computer program product, and computing system for processing a data portion to divide the data portion into a plurality of data chunks; performing an entropy analysis on each of the plurality of data chunks to generate a plurality of data chunk entropies; and determining an average data chunk entropy from the plurality of data chunk entropies.

System and method for average entropy calculation

A method, computer program product, and computing system for identifying a potential deduplication candidate and a related deduplication target; executing a comparison operation with respect to the potential deduplication candidate and the related deduplication target to generate a comparison result; and determining a level of similarity between the potential deduplication candidate and the related deduplication target by processing the comparison result.

System and method for data deduplication

Methods and apparatus are provided for reporting fragment filling in storage systems. An exemplary method comprises obtaining at least one compressed allocation unit of data in a storage system; reserving space for the at least one compressed allocation unit in a compressed segment based on a greater of (i) a size of the at least one compressed allocation unit, and (ii) a minimum target fragment length specified for at least one write operation class; and writing the at least one compressed allocation unit to the reserved space. An attempt is optionally first made to fill the at least one compressed allocation unit of data in a free extent and/or a hidden fragment of at least one compressed segment prior to reserving the space. The reserving the space is optionally only performed if the attempt to fill the at least one compressed allocation unit of data is not successful.

Fragment filling for storage system with in-line compression

4th 115078 A method, computer program product, and computing system for encoding a candidate data portion to generate an encoded candidate data portion; identifying one or more portion similarities between the encoded candidate data portion and an encoded target data portion to position the one or more portion similarities with respect to the encoded target data portion, thus generating one or more portion similarity measurements; identifying one or more portion differences between the encoded candidate data portion and the encoded target data portion to generate one or more portion difference measurements; and combining the one or more portion similarity measurements and the one or more portion difference measurements to generate a candidate similarity measurement for the candidate data portion.

System and method for encoding-based deduplication

A method is usd in managing inline data compression in storage systems. Multiple requests are received to write data to a data object stored in a storage system. A range is determined for a system throughput rate for the storage system. Based on the range, performance of performing inline data compression of the data is assessed. Compressed data is produced prior to storing the data in the data object. Based on the assessment, performing inline data compression in the storage system is affected.

Managing inline data compression in storage systems

Methods and apparatus are provided for reporting space savings due to data reduction in storage systems. An exemplary method comprises establishing a leaf pointer for a plurality of allocation units of data in a storage system; for at least a first allocation unit of data matching a second allocation unit of data, replacing the leaf pointer for the first allocation unit with a deduplication pointer to the leaf pointer of the second allocation unit; determining a total number of pointers as a sum of a number of the leaf pointers and a number of the deduplication pointers; determining a difference between the total number of pointers and the number of leaf pointers; and providing a data reduction attributed to deduplication based on the difference. The allocation units of data are optionally also compressed. Data reduction attributed to the compression can optionally be determined independent of the data reduction attributed to the deduplication.

Data reduction reporting in storage systems

Methods and apparatus are provided for reporting space savings due to pattern matching in storage systems. An exemplary method comprises, when a given allocation unit in a storage system matches one or more predefined patterns, (i) setting a corresponding pattern flag for the given allocation unit, and (ii) incrementing at least one pattern counter; generating at least one snapshot of at least a portion of a file comprising the given allocation unit; and determining a data reduction attributed to pattern matching based on the at least one pattern counter, wherein the one or more predefined patterns in the at least one snapshot are excluded from the data reduction attributed to pattern matching.

Reporting of space savings due to pattern matching in storage systems

A method is used in managing inline data compression in storage systems. A number of allocation units in which data of a file system is stored in a segment in a compressed format is determined. The segment comprises of a first storage space for storing a set of allocation units and a second storage space that is not allocated to the set of allocation units. Based on a policy, the second storage space of the segment is associated to at least one allocation unit of the set of allocation units.

A data access pattern is determined by a file system mapping component for prefetching data for performing I/O requests on the data. Information associated with determination of the data access pattern is provided by the file system mapping component to a block mapping component. Based on the information, prefetching of data is managed by the block mapping component from a storage device for performing the I/O requests.

Growing community of inventors

Brookline, MA, United States of America

Ivan Basov