Emc IP Holding Company LLC

Emc Corporation

Nutanix, Inc.

Veritas Technologies LLC

Dheer Moghe

Sazzala Reddy

Karan Gupta

Nitin Garg

Hua Zhong

Roger Sean Liao

Srikant Varadan

Gowtham Alluri

Arth Patel

Abhinav Duggal

Fabiano C Botelho

Ying Xie

Guilherme Vale Ferreira Menezes

Curtis Anderson

Prajakta Balkrishna Ayachit

Anshul Nirmalendu Purohit

Ajay Raghavan

George Mathew

Craig Harmer

Rahul Ugale

Mahesh Kamat

Satish Visvanathan

Anurag Agarwal

Shuang Liang

Akshay Narayan Muramatti

Joseph Michael Maionchi

Nookala Sunder Phani Kumar

Ajith Krishnamurthy

Ganesh Karuppur Rajagopalan

Hung Hing (Anthony) Pang

Vivek Velankar

Edwin F Menze, Iii

Jobi Ariyamannil

Sajal Jindal

Sazzala Venkata Reddy

In accordance with some aspects of the present disclosure, a non-transitory computer readable medium is disclosed. The non-transitory computer readable medium includes instructions when executed by a processor cause the processor to write an object to an object store using an object-based access protocol, look up the object from the object store using a file-based access protocol, and create one or more directories on-demand in the object store.

Concurrent multiprotocol access to an object storage system

An illustrative embodiment disclosed herein is an apparatus including a processor with programmed instructions to receive a request to process storage data using a compute application, determine that a first location of the storage data is in a first storage resource in a first cluster of compute, storage, and network resources, determine that a second location of the compute application is in a first compute resource of a second cluster of compute, storage, and network resources, determine whether the first cluster includes a second compute resource that is compatible with the compute application, and respectively, either, based on a first compatibility determination, migrate the compute application from the first compute resource to the second compute resource, or, based on a second compatibility determination, replicate the storage data from the first storage resource to a second storage resource in the second cluster.

System and method for hyperconvergence at the datacenter

An illustrative embodiment disclosed herein is an apparatus including a processor and a memory. In some embodiments, the memory includes programmed instructions that, when executed by the processor, cause the apparatus to store a first object and a second object in a first region based on the first object and the second object having a first policy. In some embodiments, the memory includes programmed instructions that, when executed by the processor, cause the apparatus to store a third object in a second region based on the third object having a second policy. In some embodiments, a virtual disk includes the first region and the second region.

System and method for mapping objects to regions

An illustrative embodiment disclosed herein is an apparatus including a processor having programmed instructions to map a plurality of objects to a region and map the region to a plurality of vdisks. The plurality of objects are stored in the plurality of vdisks. The processor has programmed instructions to, responsive to mapping the plurality of objects to the region, identify a policy associated with the region. The policy specifies a policy action in response to satisfying a predetermined condition. The processor has programmed instructions to, responsive to satisfying the predetermined condition, access the plurality of vdisks and perform the policy action on the plurality of objects.

Exemplary methods, apparatuses, and systems maintain a plurality of summary data structures corresponding to a plurality of logical file system namespaces representing a plurality of hierarchies of one or more directories having one or more files, each file being stored in the storage system as a plurality of segments in a deduplicated manner. In response to a request to estimate a storage usage by a first of the file system namespace, identify a first of the summary data structures corresponding to the first file system namespace, wherein the first summary data structure stores information summarizing deduplicated segments referenced by one or more files of the first file system namespace. Estimate the storage usage of the first file system namespace based on the first summary data structure and a global summary data structure, wherein the global summary data structure stores information summarizing deduplicated segments referenced by all of the file system namespaces.

System and method for determining physical storage space of a deduplicated storage system

Embodiments are described for repairing the locality of a namespace index on a deduplication storage device. A namespace index is selected from a plurality of namespace indices, each of which is mountable on the storage system. The selected namespace index is traversed and divided into regions, each of which was stored in one or more storage containers. Locality information for each region is generated, including a density metric and a distribution metric. If either metric is below a threshold value for the metric, then the region is enqueued for namespace locality repair. A region can be repaired by reading the region into memory and flushing the memory to co-located containers on the storage system.

Method to repair the locality of the namespace on deduplication storage file system

An indication is received that a data object is to be deleted, wherein the data object comprises data stored in a segment within a container. It is determined no currently alive data object references any segment within the container. The container is placed in a delete-ready but not yet reclaimable state.

Recovering data lost in data de-duplication system

A method, article of manufacture, and apparatus for scaling an index on a solid state drive in a deduplicated storage system is discussed. The index may be scaled as index hash buckets approach capacity, or as new solid state drives are added to the system. The hash buckets may be mapped to HDD hash buckets, which are stored on a hard drive.

Scaling an SSD index on a deduplicated storage system

According to one embodiment, a request for seeding a predetermined number of small files with a predetermined locality in a storage system is received, each of the files to have a predetermined file size. In response to the request, a plurality of segments and fingerprints of the segments are generated. File trees representing the predetermined number of files respectively are generated based on the fingerprints of the segments, each of the files represented by the segments having the predetermined file size. A namespace representing one or more directories of the files is generated based on the file trees, where each of the directories of files satisfies the predetermined locality. The namespace and segments corresponding to the files of one or more directories are written to a storage device of the storage system.

Efficiently seeding small files with certain localities

In an embodiment of the present invention, a method can include converting a data-full snapshot having a plurality of user data and corresponding metadata to a dataless snapshot. The dataless snapshot stores the metadata corresponding to the user data. Converting the data-full snapshot to the dataless snapshot includes removing the user data from the data-full snapshot. The metadata can be at least one of a checksum or hash of the corresponding user data.

Using dataless snapshots for file verification

In an embodiment, a method can include loading a first snapshot of data stored on a storage device, the first snapshot being verified. The method can further include capturing a second snapshot of data stored on the store device after waiting an interval of time from creation of the first snapshot. The method can further include generating a list of closed files between the two snapshots by differentiating the first snapshot and the second snapshot. The method can additionally include verifying the second snapshot by comparing the closed files in the list of closed files by in the second snapshot to the closed files in the storage device, which is an active snapshot. The method can also include deleting the first snapshot.

Snapshot based file verification

A garbage collector of a storage system traverses a namespace of a file system of the storage system to identify segments that are alive in a breadth-first manner. The namespace includes information identifying files that are represented by segments arranged in a plurality of levels in a hierarchy, where an upper level segment includes one or more references to one or more lower level segments, and at least one segment is referenced by multiple files. All live segments of an upper level are identified before any of live segments of a lower level are identified. Upon all live segments of all levels have been identified, the live segments are copied from their original storage locations to a new storage location, and a storage space associated with the original storage locations is reclaimed.

Method and system for garbage collection of data storage systems

A garbage collector of a storage system traverses a namespace of a file system of the storage system to verify data integrity of segments. The namespace identifies files that are represented by segments arranged in multiple levels in a hierarchy, where an upper level segment includes one or more references to one or more lower level segments, and at least one segment is referenced by multiple files. Traversing the namespace includes computing and verifying checksums all segments in a level-by-level manner, where checksums of an upper level are verified before any of checksums of a lower level are verified. Upon all checksums of all levels have been verified, a garbage collection process is performed on the segments stored in the storage system.

Method and system for determining data integrity for garbage collection of data storage systems

Various methods and systems for implementing a file change log in a distributed file system are disclosed. In one embodiment, a method involves operating a distributed file system that presents a namespace and maintaining a file change log for the namespace. Operating the distributed file system involves executing an instance of a file system on each of several nodes. Maintaining the file change log can involve maintaining a single file change log for the namespace. Updates to the single file change log can be handled by a primary node or controlled using a locking mechanism. Alternatively, several private file change logs (e.g., one per node) can be maintained, and these private file change logs can be merged into a single file change log (e.g., by a primary node).

Growing community of inventors

Sunnyvale, CA, United States of America

Dheer Moghe