Abstract: A method and software is described for recreating on a target datastore a set of hierarchical files that are present on a source datastore. A content identifier (ID) is maintained for each component of the set of hierarchical files. The content ID of a component is updated when its contents are modified. The child component is copied from the source datastore to the target datastore. The content ID corresponding to the parent component on the source datastore is compared with content IDs corresponding to files present on the target datastore. When a matching content ID is discovered, it infers a copy of the parent component. The matching file on the target datastore is associated with the copied child component so that the matching file becomes a new parent component to the copied child component, thereby recreating the set of hierarchical files on the target.

Abstract: The current application is directed to monitoring subsystems, and monitoring methods incorporated within the monitoring subsystems, that monitor operation of devices and systems in order to identify normal states and to quickly determine when a device or system transitions from a normal state to an abnormal state. The methods and monitoring components to which the current application is directed employ self-organizing maps and moving-average self-organizing maps to both characterize normal system behavior and to identify transitions to abnormal system behaviors.

Abstract: Embodiments of the present invention include systems and methods for controlling input-output (IO) requests of a plurality of virtual machines to a datastore. The method includes: monitoring, for each virtual machine, a throughput of IO to a datastore for a preset time interval; identifying a peak value of the throughput; calculating a value of input-output-per-second (IOPS) using the peak value; and setting the value of IOPS as an IOPS limit for a corresponding virtual machine.

Abstract: Exemplary methods, apparatuses, and systems include a first host system configuring storage of the first host to serve as a primary cache for a virtual machine running on the first host. A second host system configures storage of the second host to serve as a secondary cache and boots a placeholder virtual machine. The first host transmits, in response to write operations from the virtual machine directed to the primary cache, copies of the write operations to the second host to create mirrored copies on the secondary cache. The first host acknowledges each write operation from the virtual machine when the write operation is committed to both the primary cache and the secondary cache. When the virtual machine is restarted on the second host in response to a failure or migration event, the secondary cache is promoted to serve as a new primary cache for the virtual machine.

Abstract: Systems and techniques are described for automated zoom and selection of content on a touch screen device. A described technique includes receiving a first touch input contacting a touch screen display of a user device at a first position in a user interface presented at a first magnification, while continuing to receive the first touch input determining that a duration of the first touch input has exceeded a predetermined threshold duration, and increasing, based on determining that the duration of the first touch input has exceeded than the predetermined threshold duration, the magnification of the user interface to a second magnification, and performing an action based on the first touch input.

Abstract: Exemplary methods, apparatuses, and systems that can intelligently copy data to a plurality of datastores are described. In one embodiment, a distance value of a path between each datastore is determined. Based on the distance values, a graph cluster analysis creates clusters of the datastores within close proximity to one another. Also, a shortest path tree determines the most efficient paths available for copying data from a source datastore to one or more destination datastores. The source datastore is designated as the root of the shortest path tree, and the one or more destination datastores are designated as the vertices of the tree. After each child vertex of the source datastore is ordered in descending order according to a number of unique clusters to which descendants of the child vertex belong, the data is copied from the source datastore to the one or more destination datastores in the descending order.

Abstract: Exemplary methods, apparatuses, and systems that can intelligently copy data to a plurality of datastores using performance monitoring are described. In one embodiment, a shortest path tree determines the most efficient paths available for copying data from a source datastore to one or more destination datastores. During the copying of the data between a source datastore and the one or more destination datastores, a performance value of each of the datastores involved in the copying process is compared to a threshold. In response to determining that the performance value of a given source or destination datastore involved in the copying exceeds the threshold, the copying of the data to the corresponding destination datastore is suspended. An updated shortest path tree is determined to locate a more efficient path for copying data to the suspended destination datastore. Copying is resumed to the suspended destination datastore using the updated shortest path tree.

Abstract: Computational methods and systems that aid an enterprise in deciding whether to execute an application entirely within a private cloud or a hybrid combination of the private cloud and public cloud services offered by a public cloud service provider are described. The methods and system receive a set of quantitative parameters associated with running an application using computational services provided by a public cloud service provider and a set of organizational parameters associated with an enterprise. The quantitative and organizational parameters are normalized and input to a decision model that generates a recommendation that indicates exclusive use of a private cloud or a hybrid private cloud and public cloud to execute the application.

Abstract: One embodiment of the present invention is a system including: (a) plural virtualization systems configured in a cluster; (b) storage accessible to each virtualization system of the cluster, wherein for each virtual machine operative in a virtualization system of the cluster, the storage maintains a representation of virtual machine state that includes at least a description of a hardware system virtualized and an image of virtualized memory state for the virtual machine; and (c) a failover system that, responsive to an interruption of, or on, a particular one of the virtualization systems, transitions at least one affected virtual machine to another virtualization system of the cluster and resumes computations of the transitioned virtual machine based on state encoded by a corresponding one of the virtual machine states represented in the storage.

Abstract: Replicated data storage units are autonomously identified and assembled into generationally related data storage volumes. A data storage manager, implementing a re-signaturing process executed at defined intervals or manually initiated on a server or client system connected to the storage area network, scans the collection of visible data storage units to identify those related as a data storage volume. Each replicated data storage unit includes metadata that embeds an identification of the replicated data storage unit and volume accessible to the data storage manager. To assemble a set of replicated data storage units into a generational volume, the data storage unit metadata is rewritten to establish a unique data storage volume identity including information to associate the data storage volume in a lineage with the source data storage volume.

Abstract: Read requests to a commonly accessed storage volume are conditionally issued, depending on whether or not a requested data block is already stored in memory from a prior access or to be stored in memory upon completion of a pending request. A data structure is maintained in memory to track physical memory pages and to indicate for each physical memory page the corresponding location in the storage volume from which the contents of the physical memory were read and the number of virtual memory pages that are mapped thereto.

Abstract: Multiple computers are connected to a data storage unit that includes a file system, which further includes multiple data entities, including files, directories and the file system itself. The file system also includes, for each data entity, an owner field for indicating which computer, if any, has exclusive or shared access to the data entity, along with a time field for indicating when a lease of the data entity began. When a computer wants to lease a data entity, the computer uses a disk reservation capability to temporarily lock the data storage unit, and, if the data entity is not currently leased, the computer writes its own identification value into the owner field and a current time into the time field for the data entity, to claim the data entity for a renewable lease period. If a prior lease of a data entity has expired, another computer may break the lease and claim ownership for itself.

Abstract: In one embodiment, a client node generates a listing of files associated with a user account, where the listing includes one or more files that are stored remotely on a server system without being synchronized to local storage of the client node. The client node further receives a request to access a file from the listing and determines whether the file is stored locally on the client node. If the file is not stored locally on the client node, the client node discovers peer client nodes that are coupled with the client node and determines whether the file is stored locally on any peer client node. If the file is stored locally on a peer client node, the client node retrieves the file from the peer client node. If the file is not stored locally on any peer client node, the client node retrieves the file from the server system.

Abstract: Techniques are described for utilizing synchronous APIs which normally block callers until a result is returned. In particular, the techniques described herein enable an application or other programming construct to boost performance by executing synchronous APIs (e.g., long running time APIs) within a proxy container rather than executing the synchronous APIs in the context of the application itself. Since the proxy is a separate process or thread, the caller application is thereby released from waiting for the synchronous API call and may proceed with other processing instead of waiting for the synchronous API to return. The application may then monitor the proxy to determine whether a result has been received, such as by periodically polling the proxy.

Abstract: A computer-implemented method for managing an independent virtual disk. The method includes creating an independent virtual disk; in response to the creating the independent virtual disk, creating a first virtual machine; and attaching an independent virtual disk to the first virtual machine; and managing the independent virtual disk by controlling the first virtual machine that is attached to the independent virtual disk.

Abstract: Activity level of memory pages is classified in virtual machine environment, so that processes such as live VM migration and checkpointing, among others, can be carried out more efficiently. The method includes the steps of scanning page table entries of hypervisor-managed page tables continuously over repeating scan periods to determine whether memory pages have been accessed or not, and for each memory page, determining an activity level of the memory page based on whether the memory page has been accessed or not since a prior scan and storing the activity level of the memory page. The activity level of the memory page may be represented by one or more bits of its page table entry and may be classified as having at least two states ranging from hot to cold.

Abstract: A virtualized storage stack includes logical layers above the physical storage layer. Each logical layer allocates data blocks, and the data block allocation is propagated down to the physical storage layer. To facilitate contiguous storage, each layer of the virtualized storage stack maintains additional metadata associated with data blocks. For each data block, the metadata indicates whether the data block is free, provisioned and includes a tag that indicates when the data block was first written. Data blocks that were first written as part of the same write request share the same tag, and are mostly guaranteed to be physically co-located. Block allocations that reuse data blocks having the same tag are preferred. Such preference increases the likelihood of the blocks being contiguous in the physical storage as these blocks were allocated as part of the same first write.

Abstract: Methods, systems, and computer programs are provided for managing remote display performance. One method includes operations for receiving notifications of events identified by an operating system, and for receiving notifications of display updates destined to a remote display coupled to a remote client. The method includes an operation for correlating events and display updates to determine the transmittal priority for the updates, where the priority is associated with a criticality for presenting the display updates on the remote display. Further, a subset of the display updates are identified as unnecessary for transmission to the remote client based, at least in part, on the priority of the display updates. Additionally, the method includes an operation for performing at least one of: discarding the subset; consolidating the subset into a single display update for transmittal to the remote client; or limiting the frequency of transmission of the subset to the remote client.

Abstract: Embodiments of the present invention include systems and methods for controlling input-output (IO) requests of a plurality of virtual machines to a datastore. The method includes: monitoring, for each virtual machine, a throughput of IO to a datastore for a preset time interval; identifying a peak value of the throughput; calculating a value of input-output-per-second (IOPS) using the peak value; and setting the value of IOPS as an IOPS limit for a corresponding virtual machine.

Abstract: A management server clones a source virtual machine to a plurality of target host computers. For each target host, the management server creates linked clones of the source virtual machine in a target data store that is accessible to the target host. The management server starts execution of the linked clones in the target hosts. While the linked clones execute, for each target host, the management server creates full clones of the source virtual machine in the target data store and, after creating the full clones, suspends execution in the linked clones and resumes execution in the full clones.