Netapp, Inc.

Vmware, Inc.

Mukul Sharma

Alok Sharma

Kartik Rathnakar

Venkateswarlu Tella

Girish Hebbale Venkata Subbaiah

Dnyaneshwar Nagorao Pawar

Kiran Nenmeli Srinivasan

Rajesh Khandelwal

Rupesh Bajaj

Venkateswarlu Telia

Abhishek Bagchi

Satbir Singh Bhatti

Jitender Rohilla

Techniques are provided for asynchronous semi-inline deduplication. A multi-tiered storage arrangement comprises a first storage tier, a second storage tier, etc. An in-memory change log of data recently written to the first storage tier is evaluate to identify a fingerprint of a data block recently written to the first storage tier. A donor data store, comprising fingerprints of data blocks already stored within the first storage tier, is queried using the fingerprint. If the fingerprint is found, then deduplication is performed for the data block to create deduplicated data based upon a potential donor data block within the first storage tier. The deduplicated data is moved from the first storage tier to the second storage tier, such as in response to a determination that the deduplicated data has not been recently accessed. The deduplication is performed before cold data is moved from first storage tier to second storage tier.

Asynchronous semi-inline deduplication

One or more techniques and/or computing devices are provided for inline deduplication. For example, a checksum hash table and/or a block number hash table may be maintained within memory (e.g., a storage controller may maintain the hash tables in-core). The checksum hash table may be utilized for inline deduplication to identify potential donor blocks that may comprise the same data as an incoming storage operation. Data within an in-core buffer cache is eligible as potential donor blocks so that inline deduplication may be performed using data from the in-core buffer cache, which may mitigate disk access to underlying storage for which the in-core buffer cache is used for caching. The block number hash table may be used for updating or removing entries from the hash tables, such as for blocks that are no longer eligible as potential donor blocks (e.g., deleted blocks, blocks evicted from the in-core buffer cache, etc.).

Inline deduplication

A technique for data de-duplication is applied to suspend and resume operations for virtual machines (VMs) to reduce the time needed to suspend or resume a virtual machine and store the suspended VMs in a space-efficient and time-efficient manner. A VM's state is serialized and written to disk in the form of key values that are used to retrieve data from a key-data map. The key-data map stores unique data blocks for suspended VM images. The key-data map can be stored in a solid-state drive to further reduce latency and access time.

Suspend-resume of virtual machines using de-duplication

Growing community of inventors

Raebarel, India

Mukul Sharma