Abstract: An image rescue system includes an application program for communication with a mass storage device, the application program being in communication with an operating system layer for accessing the mass storage device to read and write information. The image rescue system further includes a device driver in communication with the application program, the operating system layer and the mass storage device, the device driver for allowing the application program to access the mass storage device to read and write information by bypassing the operating system layer, the device driver for communicating with the mass storage device to allow the application program to access information in the mass storage device considered damaged by the operating system layer, the damaged information being inaccessible to the operating system layer, wherein the image rescue system accesses the mass storage device to retrieve and recover information accessible and inaccessible to the operating system layer.

Abstract: A dynamic pool of virtual instances is managed. Each virtual instance corresponds to one or more hardware resources. Management includes tracking for each virtual instance: historical and current utilization, an operating cost, a capacity, and a characteristic associated with a capability of the hardware resources to which the virtual instance corresponds. A given virtual instance of the dynamic pool of virtual instances on which to schedule a workload for completion is selected, based on a characteristic of the workload matching the characteristic of the given virtual instance, and taking into account the capacity, the current utilization, and the operating cost of the given virtual instance. The hardware resources are managed by service providers different than a service provider managing computing devices on which the virtual instances are managed and the workload is scheduled, and the workload is received from a customer different than any of these service providers.

Abstract: A method for managing application modalities using dialogue states can include the step of asserting a set of activation conditions associated with a dialogue state of an application. Each of the activation conditions can be linked to at least one programmatic action, wherein different programmatic actions can be executed by different modality components. The application conditions can be monitored. An application event can be detected resulting in an associated application condition being run. At least one programmatic action linked to the application condition can be responsively initiated.

Abstract: A technique includes distributing a plurality of tasks among a plurality of worker nodes to perform a processing operation on an array. Each task is associated with a set of a least one data block of the array, and an order of the tasks is defined by an array-based programming language. Distribution of the tasks includes, for at least one of the worker nodes, selectively reordering the order defined by the array-based programming language to regulate an amount of data transferred to the worker node.

Abstract: A virtualization system for supporting at least two operating systems and resource allocation method of the virtualization system are provided. The method includes allocating resources to the operating systems, calculating, when one of the operating systems is running, workloads for each operating system, and adjusting resources allocated to the operating systems according to the calculated workloads. The present invention determines the workloads of a plurality of operating systems running in the virtualization system and allocates time resources dynamically according to the variation of the workloads.

Abstract: Determining a schedule of a batch workload of MapReduce jobs is disclosed. A set of multi-stage jobs for processing in a MapReduce framework is received, for example, in a master node. Each multi-stage job includes a duration attribute, and each duration attribute includes a stage duration and a stage type. The MapReduce framework is separated into a plurality of resource pools. The multi-stage jobs are separated into a plurality of subgroups corresponding with the plurality of pools. Each subgroup is configured for concurrent processing in the MapReduce framework. The multi-stage jobs in each of the plurality of subgroups are placed in an order according to increasing stage duration. For each pool, the multi-stage jobs in increasing order of stage duration are sequentially assigned from either a front of the schedule or a tail of the schedule by stage type.

Abstract: This document describes tools capable of communicating events or event data between application components. These tools allow an application component to communicate an event and event data to another application component even if the two application components are in separate layers or do not exist at the same time.

Abstract: Operating profiles for consumers of computing resources may be automatically determined based on an analysis of actual resource usage measurements and other operating metrics. Measurements may be taken while a consumer, such as a virtual machine instance, uses computing resources, such as those provided by a host. A profile may be dynamically determined based on those measurements. Profiles may be generalized such that groups of consumers with similar usage profiles are associated with a single profile. Assignment decisions may be made based on the profiles, and computing resources may be reallocated or oversubscribed if the profiles indicate that the consumers are unlikely to fully utilize the resources reserved for them. Oversubscribed resources may be monitored, and consumers may be transferred to different resource providers if contention for resources is too high.

Abstract: Illustrative embodiments include a method for creating a virtual machine using a preprovisioned mutated template. A template to use for creating the virtual machine is identified, a template including data usable to create the virtual machine on a data processing system. A block of data is selected in the mutated template for reconstructing the template from the mutated template. The block of data is included in the mutated template at a location specified in a manifest associated with the mutated template. A data structure of the template is populated with the block of data such that the block of data occupies a predetermined position in the template, thereby reconstructing the template from the mutated template. The virtual machine is created on the data processing system using the template.

Abstract: Methods, systems, and computer executable instructions for performing distributed data analytics are provided. In one exemplary embodiment, a method of performing a distributed data analytics job includes collecting application-specific information in a processing node assigned to perform a task to identify data necessary to perform the task. The method also includes requesting a chunk of the necessary data from a storage server based on location information indicating one or more locations of the data chunk and prioritizing the request relative to other data requests associated with the job. The method also includes receiving the data chunk from the storage server in response to the request and storing the data chunk in a memory cache of the processing node which uses a same file system as the storage server.

Abstract: Generation of a dependency graph for code that includes code portions such as resources or functions or both. For some or all of the nodes, the dependency is calculated by determining that the given node, a depending node, depends on an affecting node. The dependency is recorded so as to be associated with the node. Furthermore, the dependency calculation method is recorded so as to be associated with the dependency. The code may perhaps include portions within two different domains, in which the mechanism for calculating dependencies may differ. In some cases, the dependency graph may be constructed in stages, and perhaps additional properties may be associated with the node, and metadata of the properties may also be recorded.

Abstract: In an embodiment, if an estimated time to perform a task by a first virtual machine is less than or equal to an expiration time of the first virtual machine minus the current time, the task is performed by the first virtual machine. If the estimated time to perform the task by the first virtual machine is greater than the expiration time of the first virtual machine minus the current time, a selected virtual machine is selected from among a plurality of virtual machines with a smallest estimated time to perform the task and a request to perform the task is sent to the selected virtual machine.

Abstract: The present invention throttles notifications to a user based on changes in particular state values. A computer-implemented method manages notifications of changes to one or more settings of an application. The method includes: displaying a first notification of a change of a setting to a value; updating a count of notifications displayed for the value; and throttling a subsequent notification of a subsequent change of the setting to the value if the count exceeds a threshold.

Abstract: Architectures and techniques for substantially maintaining performance of hyperthreads within processing cores of processors. One technique can include determining that at least one of two or more hyperthreads has entered an idle state. The technique can further include executing an idle workload loop that comprises a set of instructions that substantially simulates execution of the one of the two or more hyperthreads that has entered the idle state.

Abstract: A capability is provided for reducing response variance of virtual processors. A controller receives a processing request. The controller may propagate the processing request toward multiple virtual processors hosted on multiple hardware devices contemporaneously. The controller may propagate the processing request toward a first virtual processor hosted on a first hardware device and propagate the processing request toward a second virtual processor hosted on a second hardware device based on a determination that a timeout period expires before a processing response is received from the first virtual processor. The timeout period may be determined based on one or more response time statistics of the virtual processor and one or more response time statistics of a physical processor.

Abstract: A system and method can provide efficient low-latency muxing between servers in the cluster. One such system can include a cluster of one or more high performance computing systems, each including one or more processors and a high performance memory. The cluster communicates over an InfiniBand network. The system can also include a middleware environment, executing on the cluster, which includes one or more application server instances. The system can include one or more selectors, wherein each said selector contains a queue of read-ready file descriptors. Furthermore, the system can include a shared queue, wherein the read-ready file descriptors in each said selector can be emptied into the shared queue. Additionally, a plurality of muxer threads operates to take work from said shared queue.

Abstract: In an embodiment, if an estimated time to perform a task by a first virtual machine is less than or equal to an expiration time of the first virtual machine minus the current time, the task is performed by the first virtual machine. If the estimated time to perform the task by the first virtual machine is greater than the expiration time of the first virtual machine minus the current time, a selected virtual machine is selected from among a plurality of virtual machines with a smallest estimated time to perform the task and a request to perform the task is sent to the selected virtual machine.

Abstract: Illustrative embodiments include a method for preprovisioning using a mutated template. A subset of templates is selected from a set of templates that can be provisioned to a data processing system, a template in the set of templates including data to create a virtual machine on the data processing system. The mutated template is constructed using the subset of templates. A manifest is constructed such that a template in the subset of templates can be reconstructed from the mutated template using the manifest. Instead of the subset of templates, the mutated template is preprovisioned to the data processing system.

Abstract: The subject matter disclosed herein provides methods and apparatus, including computer program products, for state alignment and transaction coupling to enable reliable communication between an application, such as a backend system, and a correlation engine (or rules engine). In one aspect there is provided a method. The method may provide a first interface to receive information from an adapter for an application separate from a state correlation engine and provide a second interface to receive information from the state correlation engine to the adapter. The first and second interfaces may provide state alignment between the application and the state correlation engine. Related systems, apparatus, methods, and/or articles are also described.

Abstract: A computer-implemented method for managing affinity rules in virtual-machine environments may include (1) identifying a first application configured to run on a first virtual machine, (2) identifying a second application configured to run on a second virtual machine, (3) identifying an application affinity rule between the first application and the second application, the application affinity rule indicating whether the first application and the second application should run on a same hypervisor within a plurality of hypervisors, and (4) selecting, based at least in part on which hypervisor among the plurality of hypervisors is running the first application, a hypervisor from among the plurality of hypervisors on which to run the second application that satisfies the application affinity rule between the first application and the second application. Various other methods, systems, and computer-readable media are also disclosed.