Symantec Corporation

Veritas Technologies LLC

Cray Incorporated

Stephan Gipp

Jeremy Wartnick

James P Ohr

Jeremy Swift

Adonijah Park

Michael John Zeis

Weibao Wu

Aaron Forest Godfrey

Claudia Lynne Rudolph

Shelley A Schmokel

Timothy J Stevens

Girish Sureshrao Jorapurkar

Steven Kappel

Junheng Yu

Dean Elling

Hongbin Gong

Neel Bhatt

William DesJardin

The disclosed computer-implemented method for storing data may include (i) identifying a request to backup a set of data according to a storage-as-a-service configuration that stores data into cloud storage, (ii) dividing the set of data to be backed up into chunks of data, (iii) dividing, for each of the chunks of data, a respective chunk into blocks of data, (iv) generating, for each of the chunks of data, at least one block of parity bits for the respective chunk of data based on applying an erasure code to the blocks of data, and (v) splitting, during backing up the chunks of data according to the storage-as-a-service configuration, the respective blocks of data and the generated block of parity bits into heterogeneous storage media targets such that the storage-as-a-service configuration benefits from the heterogeneous storage media targets. Various other methods, systems, and computer-readable media are also disclosed.

Systems and methods for storing data

A computer-implemented method for cloud-based data protection storage may include (1) identifying a request to maintain a data protection image for a volume of data, (2) identifying a third-party storage service to use for storing the data protection image, (3) receiving a stream of data to apply to the data protection image, (4) buffering a portion of the stream of data, (5) writing the buffered portion of the stream to the third-party storage service as a single storage object, and (6) associating the single storage object with the buffered portion of the stream in a data map. Various other methods, systems, and computer-readable media are also disclosed.

Systems and methods for cloud-based data protection storage

A computer-implemented method for deduplicating archive objects may include (1) tagging, using an archiving service, archive objects to indicate data related to the archive objects, (2) assigning an archive object and an additional archive object to be processed by a deduplication engine, (3) determining a degree of overlap between the archive object and the additional archive object based on tags assigned to the archive object and the additional archive object by the archiving service, and (4) adjusting, using the deduplication engine, deduplication between the archive object and the additional archive object using the degree of overlap determined to exist between the archive object and the additional archive object based on the tags assigned by the archiving service. Various other methods, systems, and computer-readable media are also disclosed.

Systems and methods for deduplicating archive objects

A computer-implemented method for managing an inline deduplication module is described. Congestion information is collected about a level of congestion on a network that communicates with an inline deduplication module. An instruction is sent to the inline deduplication module to adjust a deduplication rate based at least in part on the congestion information.

Auto adaptive deduplication to cloud based storage

A computer-implemented method for managing references in deduplicating data systems may include (1) identifying a first instance of a data segment stored within a deduplicating data system that reduces redundant data storage by storing at least two data objects such that each of the two data objects references the first instance of the data segment, (2) identifying an additional data object to be stored by the deduplicating data system that includes the data segment, (3) determining whether a reference limit associated with the first instance of the data segment has been reached, and (4) storing, based at least in part on determining that the reference limit associated with the first instance of the data segment has been reached, a second instance of the data segment within the deduplicating data system. Various other methods, systems, and computer-readable media are also disclosed.

Systems and methods for managing references in deduplicating data systems

Techniques for managing data compression in a data protection system are disclosed. In one particular exemplary embodiment, the techniques may be realized as a method for managing data compression comprising receiving a request for a data operation, analyzing a data management policy associated with the request, identifying a compression level associated with one or more portions of data in the data operation based at least in part on the data management policy, and identifying a compression algorithm to be used for one or more portions of data in the data operation.

Techniques for managing data compression in a data protection system

Techniques for adaptive data transfer are disclosed. In one particular exemplary embodiment, the techniques may be realized as a method for adaptive data transfer comprising receiving a write request at an application protocol layer, buffering the write request, transferring to electronic storage a first portion of data of the buffered write request using a first setting value in a range, measuring, a transfer rate of the first portion of transferred data, varying the first setting value by a small amount in a first direction to identify a second setting value, transferring to electronic storage a second portion of data of the buffered write request using the second setting value, measuring a transfer rate of the second portion of transferred data, and replacing the first setting value with the second setting value if the transfer rate of the second portion of transferred data is greater than the first transfer rate.

Techniques for adaptive data transfer

A method and apparatus for scheduling data movers is described. The method and apparatus comprise monitoring utilization of a resource used by a data mover to process a data flow, determining rank information based on the utilization of the resource and scheduling a task according to the rank information.

Method and apparatus of scheduling data movers

Various embodiments of a computer system and methods are disclosed. In one embodiment, a computer system includes a backup application coupled to interconnected storage resources. The backup application creates a database of storage resources, wherein each database entry corresponds to one or more storage resources and is associated with one or more user-defined attributes describing the suitability of the associated resources for a backup operation. The backup application creates and stores a configuration of storage resources for a backup operation. Each storage resource is selected based on a value of an associated attribute. The storage resources may include logical unit numbers (LUNs), mount points providing access to LUNs, and hosts having physical access or network access through other hosts to mount points. An attribute specifies that the associated storage resources are either required or preferred for a backup operation. The database and configuration are created at backup application run time.

Controlling resource allocation for backup operations

A method, apparatus, and computer program product for implementing affinity based allocation for storage implementations employing deduplicated data stores is disclosed. According to an embodiment of the present invention, a backup manager determines if information associating a data source with a first data target of a plurality of data targets has been established. The first data target is a deduplication data store and the information associating the data source with the first data target indicates an increased likelihood of at least some information stored on the data source is already being stored on the first data target prior to performing a backup. If information associating the data source with the first data target has been established, the backup manager stores a set of data on the data target.

Affinity based allocation for storage implementations employing deduplicated data stores

A method and apparatus for optimizing a de-duplication rate for backup streams is described. In one embodiment, the method for optimizing data de-duplication using an extent mapping of a backup stream includes processing a backup stream to access an extent mapping associated with a plurality of data files, wherein the plurality of the data files are arranged within the backup stream and examining the extent mapping to identify at least one extent group within the backup stream, wherein the plurality of the data files are de-duplicated using at least one location of the at least one extent group.

Optimizing the de-duplication rate for a backup stream

A system and method for allocating system resources is described herein. In one embodiment, the method comprises creating, in a computer system, a resource consumer and assigning the resource consumer one of a set of flavors. The method further includes determining whether the resource consumer is limited to receiving resources from a certain one of a set of resource providers, wherein each of the set of resource providers has one of the set of flavors. The method further includes marking a field to indicate that the resource consumer is limited to receiving resources from the certain one of the set of resource providers, if the resource consumer is limited to receiving resources from the certain one of the set of resource providers. The method further includes allocating a resource to the resource consumer from one of the set of resource providers whose flavor matches the flavor assigned to the resource consumer.

System and method for mapping between resource consumers and resource providers in a computing system

A method and apparatus for routing a data stream through a plurality of data movers independent of a network interface type is provided. In one embodiment, the method for routing the data stream to a destination with indifference to network interface type includes segregating the data stream into a plurality of data blocks at an application layer, wherein the plurality of data blocks are to be routed to a destination through the plurality of data movers and coordinating data path selection for communicating the plurality of data blocks to the plurality of data movers over a plurality of data paths.

Method and apparatus for routing a data stream through a plurality of data movers independent of a network interface type

A method, system, and computer-readable storage medium are disclosed for sharing non-distributed, random-access storage resources among a plurality of computer systems. A first backup or restore operation may be initiated. In response to initiation of the first backup or restore operation, a volume of a random-access storage device may be automatically mounted at a first computer system. The random-access storage device may be coupled to the first computer system by a network, and the volume may store a non-distributed file system. The first backup or restore operation may be completed by transmitting a first set of data between the random-access storage device and the first computer system. In response to completion of the first backup or restore operation, the volume of the random-access storage device may be automatically unmounted at the first computer system.

Automatically mounting and unmounting a volume during a backup or restore operation

A distributed computer system and a method for replicating data in a distributed computer system. The system includes a plurality of processing nodes. A processing node comprises at least one processor and at least one local memory, where the local memory is in communication with each processing node. The system also includes maintenance software to determine whether data is read substantially more frequently than it is written and to replicate the data that is read substantially more frequently than it is written among the plurality of processing nodes. The method includes reviewing classes of data, identifying whether at least a portion of data of a certain class used by the processing nodes is read substantially more frequently than it is written and replicating copies of the data of that class in the local memories.

Growing community of inventors

Inver Grove Heights, MN, United States of America

Stephan Gipp