Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for reducing latency in presenting content. In one aspect, a system includes a native application that presents an interactive item and a latency reduction engine. The latency reduction engine detects interaction with the interactive item that links to a first electronic resource that is different from the native application and provided by a first network domain and in response to the detecting, reduces latency in presenting the first electronic resource, including executing a first processing thread and a second processing thread in parallel. The first processing thread requests a second electronic resource from a second network domain and loads the second electronic resource and, in response to the loading, stores a browser cookie for the second network domain. The second processing thread requests the first electronic resource and presents the first electronic resource.

Abstract: A data processing apparatus comprises a plurality of data storage elements, each configured to store data. Mask storage circuitry stores a mask and processing circuitry executes one or more instructions. A data saver is configured, in response to a transactional start instruction, to select a subset of the data storage elements and to save a backup of the subset of the data storage elements. Mask control circuitry then updates the mask to indicate the subset of the data storage elements selected by the data saver. Finally, a monitor detects write or write attempts made to one of the data storage elements not indicated by the mask. Accordingly, a user need not save all data storage elements (e.g. registers) in a system or specify precisely which data storage elements must be saved in order to perform a transaction.

Abstract: A “grain” is a unit of space allocation in a virtual disk. Grains are represented in physical storage only when used, that is, when they contain data. Grains may be located in storage using an in-memory grain-range table. The grain-range table is derived from a grain table in storage. A grain-range table includes entries for the starting grains of incrementing and or decrementing ranges; grain-table entries that do not start a range are omitted in the grain-range table. Accordingly, a grain-range table can serve as a compressed form of a grain table. This compression makes it feasible to store large numbers of grain-range tables in memory in cases where it would not be feasible to store the corresponding grain tables in memory. As a result, one rather than two storage accesses are require per storage access request, resulting in a substantial performance improvement.

Abstract: An information processing apparatus includes: a reconfiguration device which can change a circuit configuration through a dynamic partial reconfiguration; and a controller which controls a circuit arrangement in the reconfiguration device, in which when a processing circuit related to a new task is arranged in the reconfiguration device, the controller determines a circuit assignment of a processing circuit related to an existing task in execution and the processing circuit related to the new task with respect to an area as a result of combining an area used for the processing circuit related to the existing task in execution and a space area, based on a predicted end time of the processing of the respective tasks, and arranges the processing circuits related to the respective tasks in the reconfiguration device in accordance with the determined circuit assignment.

Abstract: A technique for job distribution within a grid environment includes receiving a job at a submission cluster for distribution of the job to at least one of a plurality of execution clusters where each execution cluster includes one or more execution hosts. Resource attributes are determined corresponding to each execution host of the execution clusters. For each execution cluster, execution hosts are grouped based on the resource attributes of the respective execution hosts. For each grouping of execution hosts, a mega-host is defined for the respective execution cluster where the mega-host for a respective execution cluster defines resource attributes based on the resource attributes of the respective grouped execution hosts. An optimum execution cluster is selected for receiving the job based on a weighting factor applied to select resources of the respective execution clusters.

Abstract: Concurrent processing of objects is scheduled using time buckets of different time bucket generations. A time bucket generation includes a configuration for time buckets associated with that time bucket generation. The concurrent use of different time bucket generations includes the concurrent processing of objects referenced by time buckets of different time bucket generations.

Abstract: A given host machine in a virtualization system having a virtual distributed storage system may receive an iSCSI protocol packet from a computer system separate from the given host machine. Processing the iSCSI protocol may include accessing distributed storage device (iSCSI target) comprising storage connected to the two or more host machines in the virtualization system. The given host machine may generate an outbound iSCSI protocol packet comprising return data received from the target and send the outbound iSCSI protocol packet to the computer system.

Abstract: A management system and method for deploying a virtual processing instance from an open virtual appliance (OVA) template file involves accessing the OVA template file stored on a storage of a computer to stream at least one file from the storage of the computer for processing and to transmit a disk image file of the virtual processing instance in the OVA template file from the storage of the computer to a storage of a destination host computer on which the virtual processing instance is to be deployed.

Abstract: Methods, systems, and computer-readable media for decentralized task execution that bypasses a task execution service are disclosed. A connection is established over one or more communication channels between a task execution interface and agent software of a compute instance. The agent software is executable to receive task execution documents from a task execution service and initiate local task execution based (at least in part) on the task execution documents. A task execution document is sent from the task execution interface to the agent software over the one or more channels. In sending the task execution document from the task execution interface to the compute instance, the task execution service is bypassed. Execution of one or more tasks is initiated on the compute instance by the agent software based (at least in part) on the task execution document.

Abstract: A method and processing apparatus for accelerating program processing is provided that includes a plurality of processors configured to process a plurality of tasks of a program and a controller. The controller is configured to determine, from the plurality of tasks being processed by the plurality of processors, a task being processed on a first processor to be a lagging task causing a delay in execution of one or more other tasks of the plurality of tasks. The controller is further configured to provide the determined lagging task to a second processor to be executed by the second processor to accelerate execution of the lagging task.

Abstract: An application execution apparatus that is capable of preventing display of an incomplete image. A virtual machine controls an installed application. A reference unit refers to attribute information showing whether an application draws a background of an image when the application draws the image. And a setting unit sets so that the virtual machine draws the background when it is not set that the application draws the background of the image to the attribute information.

Abstract: The management computer has a memory which stores management information and management programs, and a CPU which refers to the management information and executes the management programs; the management information includes storage management information for allowing determination as to whether the plurality of storage resources can be paired in a redundant configuration, and couplable configuration management information for determining whether the plurality of storage resources and the plurality of server resources can be connected to each other; and when the CPU deploys a virtual machine, the CPU first determines, by reference to the storage management information, storage resources to be paired in a redundant configuration, then selects, by reference to the couplable configuration management information, server resources each of which can be connected to a respective one of the storage resources that are to be paired in a redundant configuration, and pairs the selected server resources in the redundant c

Abstract: An apparatus (2) has processing circuitry (6) having access to a first processing resource (20-0) and a second processing resource (20-3). A first thread can be processed using the first processing resource. In a thread mode the second processing resource (20-3) can be used to process a second thread while in a transaction mode the second processing resource (20-3) can be used to process a transaction of the first thread comprising a number of speculatively performed operations for which results are committed at the end of the transaction. By sharing resources for supporting additional threads and supporting transactions, circuit area and power consumption can be reduced.

Abstract: Measures, including methods, systems and computer-readable storage mediums, for use in configuring virtual machines on a host device including a plurality of processing cores. A first virtual machine is configured to run on a subset of cores of the plurality. The first virtual machine is of a first type. A second virtual machine is configured to run on any of the cores in the plurality. The second virtual machine is of a second, different type. The first virtual machine is configured to have a first priority which is higher than a second priority of the second virtual machine such that processing resources are available to the first virtual machine when required by the first virtual machine instead of being available to the second virtual machine.

Abstract: Systems and methods for data storage and retrieval for a computer memory include processing a computational workflow having multiple data-processing steps, generating and storing a first hash value associated with a first step of the data-processing steps based on an input to the first step, generating and storing a second hash value associated with a second step of the data-processing steps based on the generated first hash value, and reconstructing a computational state of the workflow based on the second hash value, and thereby avoid re-execution of a portion of the workflow corresponding to the second hash value.

Abstract: A native Job Control Language (JCL) execution engine is provided in a mainframe rehosting platform/open platform for executing a migrated JCL job without converting the JCL job to another language. The JCL execution engine provides a framework which supports an internal JCL mechanism, a simulation of a plurality of mainframe utilities commonly used in JCL jobs, and a simulation of commonly used database utilities. When the JCL execution engine receives a JCL job, it generates a statement sequence from the JCL job, orders statements in the sequence into a doubly-linked sequence, and parses the doubly-linked sequence to construct a job element hierarchy tree for execution. A plurality of job initiators are provided to dequeue jobs from a job queue and dispatch the jobs to the JCL execution engine or another type of execution engine.

Abstract: Detecting deadlock in a distributed computing environment. Potential deadlocks between resources of nodes in a computing cluster by determining resource reverse pairs of the resources for each transaction from trace or log files using data analytics. The potential deadlocks are identified offline by matching a global or local resource between the nodes in sub-transactions of each transaction as recursively identified from a transaction resource chain.

Abstract: A method may include generating, by a diagnosis manager, a plurality of pre-processed files based on a plurality of log files containing operational information related to one or more of the plurality of modules operating in the cloud environment. The method may include generating a set of weightage matrices based on a plurality of tokens extracted from the plurality of pre-processed files, and identifying a plurality of clusters based on the set of weightage matrices. The method may further include determining, by a resolution manager coupled with the diagnosis manager, an operational issue for a specific module selected from the plurality of modules and associated with a specific cluster selected from the plurality of clusters, based on the subset of tokens associated with the specific cluster; and performing a predefined action on the specific module based on the operational issue.

Abstract: Systems and methods for aligning needs of virtual devices with hardware resources. The performance of virtual devices are tested using different groupings to determine mappings or relationships between the virtual devices and the physical devices from which they are drawn. Based on the results of the tests, spindle groups can be optimized.

Abstract: Techniques for implementing OS/hypervisor-based persistent memory are provided. In one embodiment, an OS or hypervisor running on a computer system can allocate a portion of the volatile memory of the computer system as a persistent memory allocation. The OS/hypervisor can further receive a signal from the computer system's BIOS indicating an AC power loss or cycle event and, in response to the signal, can save data in the persistent memory allocation to a nonvolatile backing store. Then, upon restoration of AC power to the computer system, the OS/hypervisor can restore the saved data from the nonvolatile backing store to the persistent memory allocation.