Emc Corporation

Emc IP Holding Company LLC

Samuel Mullis

Miles Aram De Forest

Xiangping Chen

Dennis Thomas Duprey

David Haase

Dean A Herington

Robert L Fair

Alan Lee Taylor

Richard P Ruef

Karl M Owen

Charles Christopher Bailey

Dean D Throop

Monica Chaudhary

Yaming Kuang

James Mark Holt

Siyu Zhou

Li Wan

Prabu Surendra

Jeffrey Kittridge Janvrin

Changxin Liu

Brian M Spadafora

Vinod K Rajasekaran

Michael J Lanni

Aron A Suliman

Disclosed is a method, apparatus, and system for a method for implementing a mutual-exclusion semantic for target update, the method comprising: receiving a tagset update request for a tagset associated with an object, the tagset update request comprising one or more metadata tags to be updated; determining whether updating the tagset based on the received tagset update request would cause a value of any existing metadata tag in the tagset to change; and in response to determining that updating the tagset based on the received tagset update request would cause a value of at least one existing metadata tag in the tagset to change, rejecting the tagset update request.

Set-based mutual exclusion using object metadata tags in a storage appliance

A copy technique involves generating, upon receiving a command to copy at least a portion of a source file, a set of pointers for a destination file that point to a set of pointers for the source file ('physical block pointers'), which in turn point to physical blocks storing data of the file in a storage system. In response to the copy command, a storage processor allocates an inode from an inode table of a file system for the destination file and stores a set of inode pointers in the inode of the destination file that point to the set of pointers for the source file. Thus, instead of creating a redundant copy of the data of the source file, the improved creates technique creates pointers that point to the data stored for the source file.

Efficient file copy that avoids data duplication

A method is used in managing data deduplication in storage systems. A data deduplication process is performed by applying a deduplicating technique to data of a deduplication domain. The data deduplication process is scheduled based on a priority. Characteristics of data deduplication performed by the data deduplication process are evaluated. Based on the evaluation, execution of the data deduplication process is effected.

Managing data deduplication in storage systems

A method is used in iterating in parallel for deduplication. Based on an iteration scheme, a collection of sections is selected from a set of storage extents. Each section of the collection of sections includes subset of the contents of a storage extent of the set of storage extents. Based on the iteration scheme, each section of the collection of sections is arranged in an ordered arrangement. Based on the ordered arrangement, a deduplicating technique is applied in parallel to each section of the collection of sections.

Iterating in parallel for deduplication

A technique of managing thin pool logical unit (TLU) recovery is performed in a data storage array that forms TLUs from a slice storage pool of logical unit (LUN) slices. The technique involves allocating a set of LUN slices of the slice storage pool to support TLU recovery. The technique further involves, after the set of LUN slices has been allocated, taking offline a TLU which currently requires TLU recovery. The technique further involves, while the TLU is offline, performing a TLU recovery procedure to recover the TLU. The TLU recovery procedure utilizes the set of LUN slices that was allocated to support TLU recovery.

Managing TLU recovery using pre-allocated LUN slices

Systems, methods, and computer readable media for an adaptive block allocation mechanism are disclosed. According to one aspect, a method for allocating slices of storage in a storage medium based on scores is disclosed. The method occurs at a storage processor for controlling access to a storage medium divided into a plurality of logical slices of storage. The method includes determining one or more scores associated with one or more slices. Determining one or more scores includes combining plural dissimilar characteristics of the slice into a single value. The method further includes receiving a slice allocation request, and in response to the slice allocation request, selecting a slice for allocation using the scores.

Systems, methods, and computer readable media for an adaptative block allocation mechanism

A method is used in managing multi-tiered storage pool provisioning. One or more physical devices of a data storage system are configured for use in connection with provisioning a storage pool. A provisioning specification is received describing a RAID type and an auto-tiering selection. A rule is received describing one or more sets of data storage system best practices. Each of the one or more sets specifies data storage system best practices for a different type of data storage system including a first type associated with the data storage system. Configuration processing is performed in connection with initialization of the data storage system to configure a first portion of the one or more physical devices for use with auto-tiering in the storage pool. A rules engine and best practices for the first type of data storage system specified in the rule are used in performing the configuration processing.

Managing multi-tiered storage pool provisioning

According to one aspect, the subject matter described herein includes a method for tier-based slice allocation and data relocation in a data storage array. The method is performed at a data storage array including physical data storage capacity being logically divided into one or more logical units (LUs) and each of the one or more LUs being further subdivided into one or more slices, where the data storage array includes a resource pool being divided into a plurality of resource groupings, where each resource grouping includes one or more resources of a common type. The method includes receiving a slice allocation request for allocating a slice from the data storage array, where the slice allocation request includes at least one constraint. In response to receiving the slice allocation request, a slice that honors the at least one constraint is allocated.

Methods, systems, and computer readable medium for tier-based data storage resource allocation and data relocation in a data storage array

Systems, methods, and computer readable media for improving synchronization performance after partially completed writes are disclosed. According to one aspect, a method for improving synchronization performance after partially completed writes includes receiving, from a requesting entity, data to be written to storage. The data to be written is sent to each of a plurality of data storage entities, including a primary data storage entity and at least one secondary data storage entity for providing a duplicate of the primary data storage entity. For each of the plurality of data storage entities, the portion of the data that was stored to the respective data storage entity is determined. For each of the secondary data storage entities, the portions of the secondary data storage entity that do not contain a duplicate of the corresponding portion of the primary data storage entity are identified as requiring synchronization, while the portions of secondary data storage entity that contain a duplicate of the corresponding portion of the primary data storage entity are identified as not requiring synchronization.

Growing community of inventors

Raleigh, NC, United States of America

Samuel Mullis