Abstract: A method and system for partial connection of iterations during loop unrolling during compilation of a program by a compiler. Unrolled loop iterations of a loop in the program are selectively connected, including redirecting, to the head of the loop, undesirable edges of a control flow from one iteration to a next iteration of the loop. Merges on a path of hot code are removed to increase a scope for optimization of the program. The head of the loop and a start of a replicated loop body of the loop are equivalent points of the control flow. A sequence of blocks on the path of hot code, unpolluted by a control flow of a path of cold code, is extended during the compilation. Information computed by an optimizer about the hot code in a first iteration is used to further optimize a second iteration, and the loop is further unrolled.

Abstract: A data storage device may be configured to use multiple task queues to schedule tasks. The multiple task queues may be configured based on an architecture of the data storage device. In some implementations, the multiple task queues may be used to organize tasks received from an access device. In other implementations, the multiple task queues may be used to identify tasks, and identification of the tasks may be associated with an order of execution of the tasks.

Abstract: A system and method for facilitating modifying a runtime application behavior and/or functionality of a networked software application, whereby UI-driven data model modifications effectively propagate back to the UI of the runtime application. The example method includes employing the runtime user interface display screen to present one or more indicators for one or more customizable user interface features of the runtime user interface display screen; generating one or more signals based upon user input, wherein the user input indicates a modification to be made to the one or more customizable user interface features; initiating one or more changes to a computing object and data model associated with the computing object in accordance with the one or more signals; and displaying a modified user interface display screen in accordance with the one or more changes.

Abstract: A system and method can support transaction processing in a transactional environment. A transactional system operates to route a request to a transactional server, wherein the transactional server is connected to a resource manager (RM) instance. Furthermore, the transactional system can assign an affinity context to the transactional server, wherein the affinity context indicates the RM instance that the transactional server is associated with, and the transactional system can route one or more subsequent requests that are related to the request to the transactional server based on the affinity context.

Abstract: The number of compute resource required by a user in a computing environment may change dynamically. For example, the virtual machine instances allocated to a particular user may host a web service. As queries to the web service increase, the current number of allocated virtual machine instances may be insufficient to provide timely responses. In response to the increased demand, the computing environment may increase the number of instances allocated to the user. To do so, the computing environment maintains one or more already executing virtual machine instances in a hotpool that have not been assigned to any user. When a user needs additional computing resources, one or more of the virtual machine instances in the hotpool may be allocated to the users. Because these instances are already executing, the computing environment avoids the relatively long delay corresponding to generating a new virtual machine instance.

Abstract: A data storage device may be configured to use multiple task queues to schedule tasks. The multiple task queues may be configured based on an architecture of the data storage device. In some implementations, the multiple task queues may be used to organize tasks received from an access device. In other implementations, the multiple task queues may be used to identify tasks, and identification of the tasks may be associated with an order of execution of the tasks.

Abstract: Embodiments relate to generating a virtual machine (VM) migration plan. An initial mapping of VMs to hosts is determined as an origin state and a final mapping of VMs to hosts as a goal state. Candidate paths are generated from the initial mapping to the final mapping. The candidate paths are evaluated based on a heuristic state transition cost from the origin state through intermediate states to the goal state by recursively obtaining a list of transitions that a parent state underwent. A heuristic goal cost is identified to reach the goal state from the intermediate states based on a fewest number of VM movements. The VM migration plan is generated based on the heuristic state transition cost of the candidate paths in combination with the heuristic goal cost of a sequence of transitions from the origin state to the goal state having a lowest total cost.

Abstract: Aspects of the present disclosure are directed toward collecting resource utilization data for a set of system components of a computing system. The resource utilization data may include performance records for a set of jobs. By analyzing the collected resource utilization data for the set of system components, a resource allocation may be identified for a particular job of the set of jobs. Aspects are also directed toward determining, based on the resource allocation for the particular job and the resource utilization data for the set of system components, a first execution time for the particular job. The first execution time may be a time when the computer system achieves a resource availability threshold with respect to the resource allocation. Aspects are also directed toward performing the particular job at the first execution time.

Abstract: A system and method for developing and distributing software. Third-party software development kits (SDKs) are received and stored by a software development and distribution platform (SDDP), with each third-party SDK published by a third-party service provider, the plurality of third-party SDKs including a first third-party SDK. An installation request from an application developer machine is received by the SDDP and the SDDP sends the first third-party SDK in response to the installation request for installation in an application under development.

Abstract: A method and system for promoting software code from a source database instance to a target database instance distributed amongst a plurality of networked servers is described. Software code migration information pertaining to software objects associated with the software code, the source database instance, and the target database instance is analyzed to determine whether errors associated with migrating the software code exceeds a predefined acceptance threshold. Such code migration information is further analyzed to determine whether migrating the software code from the source database instance to the target database instance will result in unacceptable data loss including disassociation, deletion, or change to data, or result in unacceptable non-data criteria before, during, or after the software code is migrated.

Abstract: Embodiments relate to generating a virtual machine (VM) migration plan. A method includes determining an initial mapping of VMs to hosts as an origin state and a final mapping of VMs to hosts as a goal state. Candidate paths are generated from the initial mapping to the final mapping. The candidate paths are evaluated based on a heuristic state transition cost from the origin state through intermediate states to the goal state by recursively obtaining a list of transitions that a parent state underwent. A heuristic goal cost is identified to reach the goal state from the intermediate states based on a fewest number of VM movements. The VM migration plan is generated based on the heuristic state transition cost of the candidate paths in combination with the heuristic goal cost of a sequence of transitions from the origin state to the goal state having a lowest total cost.

Abstract: According to certain aspects, a method of creating customized bootable images for client computing devices in an information management system can include: creating a backup copy of each of a plurality of client computing devices, including a first client computing device; subsequent to receiving a request to restore the first client computing device to the state at a first time, creating a customized bootable image that is configured to directly restore the first client computing device to the state at the first time, wherein the customized bootable image includes system state specific to the first client computing device at the first time and one or more drivers associated with hardware existing at time of restore on a computing device to be rebooted; and rebooting the computing device to the state of the first client computing device at the first time from the customized bootable image.

Abstract: Disclosed is a mechanism for performing rolling updates in a networked virtualization environment for storage management. The approach is applicable to any resource in the system, including controller VMs, hypervisors, and storage devices. Integrated processing may be performed across multiple types of upgrades.

Abstract: An apparatus in which at least two pieces of software capable of controlling a device may be installed, each of the pieces of software capable of controlling a device, the apparatus including a setting unit provided by a first piece of software, the setting unit being capable of controlling the device, and a determining unit configured to determine whether the device is to be controlled by a second piece of software that is different from the first piece of software. In this case, if the determining unit determines that the device is to be controlled by the second piece of software, at least partial control of the device is suppressed on a setting screen of the setting unit.

Abstract: An information processing device includes a processor; and a memory which stores a plurality of instructions, which when executed by the processor, cause the processor to execute: determining whether or not an action is executable based on a condition of a rule associated with the condition, the action, and a start priority; comparing a current priority that changes according to a state of an action in execution and an elapsed time since start of the state, with the start priority of the rule associated with the action determined to be executable; and instructing a management unit managing the execution of the actions to switch the action to be executed to the action of the rule associated with the start priority, based on the comparison result.

Abstract: A method for performing rolling updates with data unavailability checks in a networked virtualization environment for storage management.

Abstract: Embodiments relate to generating a virtual machine (VM) migration plan. A method includes determining an initial mapping of VMs to hosts as an origin state and a final mapping of VMs to hosts as a goal state. Candidate paths are generated from the initial mapping to the final mapping. The candidate paths are evaluated based on a heuristic state transition cost from the origin state through intermediate states to the goal state by recursively obtaining a list of transitions that a parent state underwent. A heuristic goal cost is identified to reach the goal state from the intermediate states based on a fewest number of VM movements. The VM migration plan is generated based on the heuristic state transition cost of the candidate paths in combination with the heuristic goal cost of a sequence of transitions from the origin state to the goal state having a lowest total cost.

Abstract: A method of localizing a computer program code comprises, with a manager node, updating a message catalog, localizing code at the manager node, and distributing the localize code to a number of client nodes. An apparatus for localizing computer program code comprises a processor, and a memory communicatively coupled to the processor, in which the memory comprises a message catalog, and in which the processor updates a message catalog, localizes code at the manager node, and distributes localized code to a number of client nodes.

Abstract: A value stored in a guest device register is received from a virtual machine. A hypervisor generates a page table including a first mapping between the value stored in the guest device register and a first address of the host operating system and a second mapping between a second address of the guest operating system and a third address of a virtual machine function on the host operating system. The hypervisor modifies a first access status of the first mapping to include rendering memory of the host device referenced by the value stored in the guest device register accessible to the virtual machine function, and a second access status of the second mapping to include rendering the virtual machine function accessible to the virtual machine. The hypervisor initializes code on the virtual machine function to access the memory of the host device.

Abstract: A distributed computing application is described that provides a highly elastic and multi-tenant platform for Hadoop applications and other workloads running in a virtualized environment. Multiple instances of a distributed computing framework, such as Hadoop, may be executed concurrently. A centralized manager detects when contention for computing resources, such as memory and CPU, causes tasks to run slower on VMs executing on a given host, and scales up or scales down a cluster based on the detected resource contention.