Emc Corporation

Emc IP Holding Company LLC

Mu Chai

Aditya Kapoor

Peter Armorer

Wenlu Ma

Craig G Duncan

Vladimir Mandic

Gururaj Reddy Kulkarni

Anand Raj

Roland Anthony Fernandes

Uday Devidas Muchalambe

Gururaj M Jayaram

Sunil Kumar Yadav

Upanshu Singhal

Matthew Dickey Buchman

Soumen Acharya

Patrick M Simonich

Eric Alfred Herrmann

Poornima Ramu

Troy Thompson

Jeff Beeghly

Ma Wenlu

A virtual machine (VM) is disclosed. The VM includes a virtual processor including a plurality of applications, a volume shadow copy service (VSS) controller and an intelligent application requester that is configured to discover an application in the plurality of applications. The discovered application requires VSS supported backup and needs to be monitored for disk input/output (I/O) from a time a backup operation of the application is initiated till the back operation ends. The VM also includes a software component configured to monitor the disk I/O related to the application. The software component is configured to interface with the VSS controller to effectuate VSS supported backup of the application. The VM includes a control interface to enable an external software to control the intelligent application requester.

Virtual machine backup

In one example method, a group of directories is backed, and then a failure of an emitter is experienced. A respective saveset is created for each of several dynamic parallel save streams, where each saveset is associated with one or more emitters. Next, a path checkpoint 'P' is created using the smallest emitter, and a time checkpoint 'S' is created using an earliest savetime of all of the savesets. A retry is started using the time checkpoint &#x2018;S&#x2019; and the path checkpoint &#x2018;P&#x2019;. One or more items are identified for backup and then sent to a director to be backed up. Next, savesets are generated for the backed up items. Finally, the generated savesets are combined with the savesets of the dynamic parallel save streams to form a global image for all save streams.

Time based checkpoint restart

According to one embodiment, in response to a request to transfer a data set from a source system to a target system over a network, an adaptive performance control (APC) controller allocates a plurality of data streams for transferring the data set. The APC controller activates one or more data streams from the allocated data streams to transfer the data set from the source system to the target system. The APC controller monitors an overall throughput of the activated data streams assigned to transfer the data set from the source system to the target system. The APC controller dynamically adjusts a number of the activated data streams based on the monitored overall throughput of the activated data streams, such that a maximum overall throughput of the activated data streams is reached while maintaining a minimum number of the activated data streams.

Adaptive performance control of multi-stream data transfer from a source system to a target system

Exemplary methods for dynamically performing multiple save streams include in response to receiving a request to perform backup of an aggregate backup data, splitting the backup data into savepoints based on a splitting policy. In one embodiment, the method includes creating a first set of directors, each director responsible for backing up one of the savepoints. The method further includes allocating save streams to each of the directors, wherein each save stream is used by the corresponding director for backing up its savepoint. In one embodiment, in response to receiving an indication from a first director of the first set of directors that its savepoint has been backed up, creating a second set of directors, and allocating one or more save streams from a number of save streams freed by the first director to a second (unfinished) director from the first set of directors.

Dynamic parallel save streams

In one example of a backup method, a backup process is started but experiences a failure prior to completion of the backup such that only a first portion of the set of data is backed up prior to the failure. A failed saveset associated with a second portion of the set of data is discarded, and a retry started. The retry includes performing an incremental backup of the first portion of the set of data and performing either a full or incremental backup of the second portion of the data. Upon successful completion of the retry, the incremental backup of the first portion of the set of data is combined with the backup of the second portion of the set of data to create a restore saveset. The restore saveset is used to create a full backup image that includes a full backup of the set of data.

Non-stream-based backup restart

A method, system, article of manufacture, and apparatus for creating backups of workloads in a clustered environment is discussed. In some embodiments, each node in the environment may sequentially back up its active workloads. The nodes may take data snapshots of a cluster shared volume, and thereafter extract the necessary workload data. The process may be controlled from a master node or an external server.

Federated backup of cluster shared volumes

In one example of a time-based checkpoint restore method, a backup of data is commenced. Prior to completion of the backup, a failure is experienced such that only a portion of the data is backed up. A first partial saveset is created, and time and path checkpoints are identified. The backup is then retried, using the time and path checkpoints. Data backed up prior to failure is incrementally backed up, and the remaining data not already backed up is fully backed up. A second partial saveset of these backups is created and combined with the first partial saveset to create a resultant saveset that can then be used to create a full backup image that includes a full backup of the data.

An application framework is disclosed for receiving requests for access to application modules. A module thread is instantiated and placed in a wait state for each request and the application framework associates a plurality of predefined events with a plurality of event handling functions for each event. Upon receiving a user generated event, the application framework sets a corresponding module thread to execute the corresponding event handling function and changes the thread state to 'running.' Threads in the 'running' state are executed concurrently under the control of a system thread manger and are returned to a &#x2018;wait&#x2019; state when the handling function ends. Each such thread maintains the session state throughout the use of the application.

Event-driven state thread architecture

An application framework is disclosed for handling predefined events for various application modules executing as threads. Events are received and associated with a thread and an event handling function. Event handling functions are classified as mutually exclusive and non-mutually exclusive. Mutually exclusive functions are blocked while another mutually exclusive function is executing. Event handling functions are processed by setting a corresponding thread to execute the function and placing the thread in a 'non-wait' state. Threads in the 'non-wait' state are then executed concurrently under the control of a system thread manger and are returned to a &#x2018;wait&#x2019; state when the handling function ends. Each such thread maintains the session state throughout use of the application.

User interface for event-driven state thread architecture

Methods and systems for performing rapid recovery of deleted object in Active Directory. The invention allows automated recovery of any object at any point in an Active Directory hierarchy. In one embodiment, the method for recovering a deleted object includes determining whether the object of interest is contained in the tombstone and, if not, recursively evaluating higher-order parent nodes until a parent node is found that exists in the tombstone. The object of interest can then be reanimated and its attributes automatically restored as well as those for all of the children of the object of interest.

Active directory container recovery

Systems and methods for generating a selection representation for items in a tree structure using an include modifier and an exclude modifier. The methods exemplarily include updating a selection representation subsequent to an initial selection of a node in an item tree structure. Methods exemplarily include identifying a branch including the next selected node, selecting a top node in the branch whose selection type has either changed or not changed based on the next selection, and building the selection representation based on whether the selection type of the top node has changed or not changed.

Real-time construction of a selection representation for items in tree structures

Systems and methods for generating selection representations for items in a tree structure and applying selection representations to logical groupings. An exemplary method includes retrieving a first tree structure that reflects a hierarchy of data from at least one of memory or storage, identifying a first grouping of items in the first tree structure, identifying a remainder of items in the first tree structure, displaying the first grouping and the remainder of items in the first tree structure on the display, receiving positive selections or unselections of at least one of the first grouping of items or the remainder of items for including or excluding in performing a predetermined function on the positively selected or unselected items, generating a selection representation for the first grouping of items and the remainder of items based on the user input, and merging the selection representation for the first grouping of items and the remainder of items to generate a final selection representation.

Selection representation methods applied to logical groupings

Systems and methods for generating a selection representation for items in a tree structure using an include modifier and an exclude modifier. The method exemplarily includes analyzing a parent node of the tree structure to determine if the parent node is an inclusive selection, including a path of the parent node in the selection representation if the parent node is an inclusive selection, analyzing a first child node of the parent node to determine if the first child node is a different selection type than the parent node, and including a path of the first child node if the first child node is a different selection type than the parent node.

Growing community of inventors

Bellevue, WA, United States of America

Mu Chai