Abstract: The present invention discloses a user interface for creating a dynamic computing environment using allocateable resources. The interface enables the fast, efficient selection and configuration of resources for the computing environment. The resources are fully selectable and allocable by a system architect. In a first embodiment, the ability is provided that allows a customer or system architect to design a system by allocating resources and specifying how the resources are to be used. The system architect may create a computing environment from a remotely accessible user interface such as a web page on the Internet. Thus, the system architect can create, modify and operate the environment from anywhere in the world.

Abstract: A system and method for querying file system content. In one embodiment, the system may include a storage device configured to store a plurality of files and a file system configured to manage access to the storage device. The file system may be further configured to perform in-band detection of a file system content access event and to responsively generate a given metadata record. The system may further include a query system configured to query the given metadata record.

Abstract: Various methods and systems for ending a communication protocol connection in response to detecting the failure of a cluster node are disclosed. One method involves detecting a failed node within a cluster. The failed node communicates with a client via a communication protocol connection. In response to detecting the failed node, a communication protocol message is sent to the client. Receipt of the communication protocol message causes the client to terminate the communication protocol connection.

Abstract: A plurality of data objects may be replicated across a plurality of computing nodes coupled to a network. The network may include a first node operable to initiate an update operation to update a plurality of replicas of a first object. If one or more of the replicas are not reachable then the update operation may update a subset (e.g., a quorum) but not all of the replicas. For each node on which one of the replicas was updated in the update operation, the node may add the object to a list of incoherent objects. The list of incoherent objects may subsequently be used to bring the lagging replicas in sync with the replicas that were updated. In another embodiment, a plurality of replicas of an object may be stored on a plurality of nodes, similarly as described above. A first node that stores a replica of the object may store a first timestamp associated with the replica on the first node.

Abstract: Systems, methods, apparatus and software can utilize storage resource locks to prevent modification (including relocation) of data in the storage resource while a third-party copy operation directed at the storage resource is occurring. A data transport mechanism such as a data restore application requests that a relevant portion of the storage resource be locked. Once locked, the data transport mechanism requests a data mover to perform a third-party copy operation whereby data is moved from a data source to the locked portion of the storage resource. When the third party-copy operation is complete, the data transport mechanism requests release of the lock on the portion of the storage resource.

Abstract: Various embodiments of systems and methods are disclosed for performing online backup and restore of volume configuration information. In some embodiments, a method involves receiving a request to restore a volume configuration and, in response to the request, writing volume configuration information to a storage device. The volume configuration information includes a first disk signature, which identifies the storage device.

Abstract: A mechanism to collate, interpret, target or view communication items retained by an organization is presented. Such a mechanism can be used as an aid in identifying communication items (e.g., documents) during electronic discovery, as well as discovery of communication chains. Embodiments of the present invention provide a method, system, apparatus and computer program product for storing communication data, generating a people map data structure using the communication data, generating an evidence map data structure using the communication data, and coupling the people map data structure and evidence map data structure.

Abstract: Various systems and methods are disclosed for storing one or more point-in-time images of data stored in a block device in a sparse file. In one embodiment, a method involves identifying a block of data within a block device and copying the block of data to a sparse file. The block of data is identified in response to being modified. The sparse file stores an incremental image of data stored in the block device. In addition to storing an incremental image, sparse files can be used to store full images. Furthermore, a sparse file can store multiple images (full and/or incremental) of data stored in a block device.

Abstract: A method, system, and computer-readable medium to quickly synchronize copies of data that have diverged over time. The present invention can be used in synchronizing replicated copies of data that have become unsynchronized due to the restoration of primary data from a backup copy of the primary data. The solution enables copies of data to be synchronized without copying all of the data from one copy to another. The solution uses minimal resources to maintain data consistency and has minimal effect on performance of applications using the data and on network usage. The method includes determining that a change occurred to data in a region of a primary volume without including the region in a set of regions designated for replication to a secondary volume. The region is added to the set of regions designated for replication to the secondary volume and replicated.

Abstract: A method and system of generating a point-in-time image of at least a portion of a database is disclosed. According to one embodiment, a method is provided wherein a plurality of components of a database are discovered, a component of the plurality of components is selected, a data management resource of a plurality of data management resources is selected using an attribute of the component, and a point-in-time image of the component is generated using the data management resource.

Abstract: A method, system, computer system, and computer-readable medium to efficiently coordinate caching operations between nodes operating on the same file while allowing different regions of the file to be written concurrently. More than one program can concurrently read and write to the same file. Pages of data from the file are proactively and selectively cached and flushed on different nodes. In one embodiment, range locks are used to effectively flush and invalidate only those pages that are accessed on another node.

Abstract: A system or method for reestablishing data consistency between data volume P and its real time or near real time copy volume S. When volumes P and S enter a state of data inconsistency, data consistency can be restored through use of roll-back and/or roll-forward logs. The roll-forward log stores new data to be written to volume P. The roll-back log stores existing data of volume S before the existing data of volume S is overwritten with new data. As will be more fully described below, the roll-back log can be used to incrementally restore volume S to a prior data state in reverse chronological order, while a roll-forward log can be used to incrementally restore volume S in forward chronological to equal the data state of volume P.

Abstract: A method, apparatus, system and computer program product that provide a virtual worldwide name (vWWN) nameservice in a Fiber Channel storage area network (SAN) are provided. Embodiments of the vWWN nameservice can receive a request for a vWWN from a node in the SAN, where the request includes a identifier associated with resources in the SAN, then determine if the identifier matches contents of a field in one or more entries in a vWWN table or database, and provide the vWWN associated with a matching entry to the requesting node.

Abstract: Various embodiments of systems and methods for providing external device support for a device driver abstraction layer are disclosed. Some embodiments of a method may involve: accessing attribute information associating each of several keys with a respective device attributes, where each of the keys identifies a respective device; and configuring an interface to a device driver for communication with a device dependent on which device attributes the attribute information associates with the key that identifies the device. Configuring the interface may configure the interface to include one or more of interface features. Each of the interface features may support a respective device attribute.

Abstract: A method and mechanism for monitoring performance in a network computing system. A user application on a source system is configured to communication with a destination system. The application is configured to load a dynamic linked library upon execution. The dynamic linked library is configured to store packet identifiers and time stamp information for communication packets received from the application prior to the packets being conveyed to the destination system. Upon receipt of an acknowledgement packet from the destination system, the library code is configured to retrieve the previously stored time stamp information, determine transit latency information corresponding to the communication packet, and log the determined transit latency information. Acknowledgement packets may further include time stamp information which may be utilized to determine additional latency information corresponding to the communication packet and/or acknowledgement packet.

Abstract: A method and mechanism for diagnosing application failures. An executable application is augmented with code which generates a list of components, as well as version information, utilized by the application. Also created is data which associates application components with applications which utilize those components. The list of components, version information, and association data are stored in a database and updated each time the application is run. In response to detecting a failure of the application, a database query is generated which returns a list of components utilized by the failed application. By comparing the date that application components changed to the date the application was last successfully run, a high priority list of components which changed since the last successful run may be generated. Diagnosis of the application failure may then begin with components in the high priority list.

Abstract: A computer system and method for performing restore operations. A computer system includes one or more hosts. At least one host includes a backup agent. In response to a request to restore a file to a first host, a backup component identifies copies of portions of the file stored on a second host, retrieves the copies, and restores the file on the first host from the copies. The backup component maintains a catalog of entries corresponding to copies of portions of files stored on the hosts. In response to a request to restore the file to a first host, the backup component queries the catalog to identify one or more candidate locations where copies of portions of the file have been stored. The first and second hosts may be the same. The backup component may be located on a host or on a backup server.

Abstract: The present invention can provide an OS independent system for storing data within a storage system. The invention can provide a directory system which is designed dynamically to adapt based upon the caching memory available for searching directories. Received files can be stored in a current directory until a predetermined limit is reached. In parallel, a database can be created to record which files are stored in which directory. This database can be designed to be kept in physical memory to minimize file access latency. This arrangement provides that a data storage system can store data in a simple order of receipt manner while also managing the storage structure to limit the number of data objects in any given container, thus preventing a search function analysing any given container from needing to access an excessive number of data objects and thus slow down the search to an unacceptable level.

Abstract: A computer method for issuing an early warning includes determining, using change and test coverage and control flow and data flow analyses of a program, locations in the program at which to insert early warning (EW) code to monitor for an event. The program is instrumented with EW code which monitors for the event, by inserting EW code at the determined locations. Upon detecting the event, EW code performs an early action warning, or issues an early action. Early warnings are issued when an EW-instrumented block is reached. Issuance of an early warning action can be conditional upon execution of the program in a particular environment, such as a production environment. Issuance of an EW can also be conditional upon executing an untested block of code that was recently modified.

Abstract: A distributed data object sharing system in which a plurality of data objects are replicated across computing nodes. The system may be operable to identify replica conflicts for the data objects and modify tree structures to reflect the conflicts. In one embodiment, a tree structure may represent a plurality of replica versions. Replica versions in conflict with each other may be represented as child versions at branch points in the tree.