Nutanix, Inc.

Facebook, Inc.

Other

Kannan Muthukkaruppan

Karthik Ranganathan

Manosiz Bhattacharyya

Tabrez Parvez Memon

Vinayak Hindurao Khot

Liyin Tang

Jiakai Liu

Rahul Narayan Iyer

Ruifang Ge

Dylan Nugent

Neil Le

Anshuman Singh

Baban K Kenkre

A method for maintaining a mapping structure for maintaining metadata for snapshots in a virtualized storage environment, includes taking a snapshot of a virtual disk, generating an entry in a metadata structure for the snapshot, wherein the entry includes metadata for blocks in the snapshot that have been modified since a preceding snapshot and lazily generating an entry in the mapping structure for the snapshot, wherein the entry includes values for each block in the snapshot, wherein a value for a block indicates a presence of metadata in the metadata structure for the block or an absence of metadata in the metadata structure for the block.

Mapping structure for maintaining metadata for snapshots in a virtualized storage environment

A region-based placement policy that can be used to achieve a better distribution of data in a clustered storage system is disclosed herein. The clustered storage system includes a master module to implement the region-based placement policy for storing one or more copies of a received data across many data nodes of the clustered storage system. When implementing the region-based placement policy, the master module splits the received data into one or more regions, where each region includes a contiguous portion of the received data. Further, for each of the plurality of regions, the master module stores complete copies of the region in a subset of the data nodes.

Placement policy

The present application provides an improved approach for managing performance tier de-duplication in a virtualization environment. A content cache is implemented on high performance tiers of storage in order to maintain a working set for the user virtual machines accessing the system, and associates fingerprints with data stored therein. During write requests from the user virtual machines, fingerprints are calculated for the data to be written. However, no de-duplication is performed during the write. During read requests, fingerprints corresponding to the data to be read are retrieved and matched with the fingerprints associated with the data in the content cache. Thus, while multiple pieces of data having the same fingerprints may be written to the lower performance tiers of storage, only one of those pieces of data having that fingerprint will be stored in the content cache for fulfilling read requests.

Method and system for implementing performance tier de-duplication in a virtualization environment

Systems for managing a multi-level cache in high-performance computing. A method is practiced over a multi-tier caching subsystem that comprises a first cache tier of random access memory, and a second cache tier that comprises a block-oriented device. The solid-state drive device is a block-oriented device comprising a plurality of blocks having a minimum block size. Cache entries are initially stored in the first cache, including cache entries that are smaller than the minimum block size of the block-oriented device. During cache operations such as first tier eviction, a plurality smaller entries are packed into blocks of the minimum block size before being spilled into the second tier. If an entry in the packed block is accessed again, the entire packed block is brought into the first tier. A key structure is maintained to track individual invalidated entries in a packed block without invalidating other entries in the packed block.

Spilling small cache entries to a solid state device

Disclosed is an improved approach for implementing de-duplication, by selecting data such that the de-duplication efficacy of the storage will be increased without arbitrarily increasing metadata size.

Method and system for implementing high yield de-duplication for computing applications

The disclosed techniques provide systems and methods for deletion of end-user messages, message threads, attachments, and/or other message information. More specifically, a key-value store residing in computer memory on the storage system is described. Each value in the key-value store is indexed by a key and structured to include multiple column portions associated with multiple column families. In one embodiment, a deletion column family having an associated retention policy for data stored therein is defined.

Growing community of inventors

Union City, CA, United States of America

Kannan Muthukkaruppan