Abstract: An information processing unit of a communication apparatus includes a non-volatile memory and a volatile memory. A control unit of the communication apparatus loads the boot image from the non-volatile memory to the volatile memory upon activation of the communication apparatus, activates the virtual machine template in the loaded boot image on the volatile memory, deactivates the activated virtual machine template after reconfiguring the activated virtual machine template to minimum required configuration to execute a virtual machine.

Abstract: A preempt of a live migratable workload, or job, in a distributed computing environment is performed, allowing it to release its resources for use by a higher priority workload by moving to another place in the distributed computing environment without interruption. A job scheduler receives a request to schedule a higher priority job, wherein resources needed to run the higher priority job are already dedicated for use by a currently running lower priority job. A dummy job is scheduled at a highest priority that is a copy of the lower priority job. Resources required to run the dummy job are reserved. A live migration of the lower priority job to another host is initiated, and its resources are then released. Upon a successful completion of the live migration of the lower priority job, the higher priority job is then dispatched to run using the now released resources.

Abstract: A preempt of a live migratable workload, or job, in a distributed computing environment is performed, allowing it to release its resources for use by a higher priority workload by moving to another place in the distributed computing environment without interruption. A job scheduler receives a request to schedule a higher priority job, wherein resources needed to run the higher priority job are already dedicated for use by a currently running lower priority job. A dummy job is scheduled at a highest priority that is a copy of the lower priority job. Resources required to run the dummy job are reserved. A live migration of the lower priority job to another host is initiated, and its resources are then released. Upon a successful completion of the live migration of the lower priority job, the higher priority job is then dispatched to run using the now released resources.

Abstract: In one embodiment, a method includes calculating ideal resource apportionments from a current set of consumable resources for each of a plurality of reservations. Each reservation corresponds to one of a plurality of customers. The method further includes running an apportionment process relative to the plurality of reservations. The running includes attempting to apportion to each reservation its ideal resource apportionment. The running yields an actual resource apportionment for each reservation. Each customer's actual resource apportionment comprises a sum of the actual resource apportionments for the customer's reservations. In addition, the method includes, responsive to an indication of unapportioned resources following the running, performing a first optimization to increase resource utilization by at least one needy customer.

Abstract: A storage unit stores information indicting the past execution records of a plurality of related tasks. An operating unit obtains information indicating the execution status of a plurality of tasks. After obtaining the information, the operating unit obtains the execution status of an unexecuted task included in the plurality of related tasks, which was not yet executed, at an estimated time by which the unexecuted task is completed and which is estimated based on the information stored in the storage unit.

Abstract: In one embodiment, a method includes empirically analyzing a set of active reservations and a current set of consumable resources belonging to a class of consumable resources. Each active reservation is of a managed task type and includes a group of one or more tasks requiring access to a consumable resource of the class. The method further includes, based on the empirically analyzing, clocking the set of active reservations each clocking cycle. In addition, the method includes, responsive to the clocking, sorting a priority queue of the set of active reservations.

Abstract: A technique for predictive distributed resource scheduling and distributed power management includes analyzing patterns in the workload, predicting future workloads, and making recommendations for changes to the virtual computing environment. In addition, a cost-benefit analysis can be performed to determine whether the recommended change would likely result in improved performance.

Abstract: One or more embodiments of the invention facilitate displaying application icons of a guest environment in a host environment of a mobile device, wherein the guest environment is running in a virtual machine supported by a hypervisor running within the host environment. One method comprises forwarding, by a hypervisor-aware service running in the virtual machine to the hypervisor, a list of applications installed in a guest operating system (OS) of the virtual machine. For each of the installed applications, the hypervisor provides metadata to a host OS running in the host environment, wherein the metadata comprises an application icon and an instruction to launch a proxy application installed in the host environment. Upon a launch of the proxy application when a user selects the application icon, the proxy application requests the hypervisor to communicate with the hypervisor-aware service to launch the installed application in the guest environment.

Abstract: Provided are methods of determining success of a software process that includes multiple process operations, ones of which use multiple programs for execution. Such methods may include receiving a request to perform the software process. The request includes a process map that defines the process operations corresponding to the software process and process operation success criteria to determine the success or failure of ones of the process operations. The process operations are scheduled to be performed serial to one another according to the process map. Data corresponding to results of ones of the process operations is collected. Results of the data are evaluated to define whether the ones of the process programs executed successfully based on the process operation success criteria to determine if the software process is a success or a failure.

Abstract: Systems and methods for virtual machine data replication with shared resources. An example method may include: identifying resources that are shared across a plurality of virtual machines, storing a copy of the resources, receiving, an indication of a portion of virtual storage of a virtual machine to be replicated, determining that the portion of virtual storage is not included in the resources, in response to the determination, updating a replicated copy of the virtual machine in view of the portion of virtual storage, the replicated copy further including the resources that are shared across a plurality of virtual machines, determining an initialization efficiency metric in relation to the replicated copy, and in response to the determination that the initialization efficiency metric exceeds an efficiency threshold, storing a copy of the virtual storage.

Abstract: A method comprising calculating for each agent, an average quality of tasks that were completed in the past by the agent; allocating tasks to the agents, wherein said allocating comprises selecting an agent to perform a task, the selection is based on the average quality of the agent; in response to the agent completing the task, computing a reward for the agent, wherein the reward is calculated according to a total contribution of the agent to the system by completing the task; whereby biasing said allocating to prefer allocating tasks to a first agent over a second agent, if a quality of the first agent is greater than a quality of the second agent, wherein said biasing is not dependent on prior knowledge of the qualities. Optionally, the agents choose whether or not to perform a task and an agent's quality affects the contributions of the agent performing tasks.

Abstract: A computer manages methods for determining workload placement in a computing environment. The computer receives a plurality of workloads with associated information, wherein the associated information for each workload contains at least: contract information, billing information, and resource availability information. The computer determines a profitability factor for each workload of the plurality of workloads, wherein the profitability factor is at least based on the billing information. The computer determines a penalty factor for each workload of the plurality of workloads, wherein the penalty factor is at least based on the contract information. The computer determines a preference factor for each workload of the plurality of workloads, wherein the preference factor is at least based on the resource availability information. The computer assigns a priority ordering for each of the workloads from the plurality of workloads.

Abstract: Systems, methods, and machine-readable and executable instructions are provided for dynamically ranking and scheduling monitoring tasks. Dynamically ranking and scheduling monitoring tasks can include determining an updated ranking for each of a number of monitoring tasks, where the updated ranking can include analyzing historical measurements of each of the number of monitoring tasks. An order of execution can be scheduled for each of the number of monitoring tasks based on the updated ranking for each of the number of monitoring tasks.

Abstract: In a distributed server storage environment, a set of like tasks to be performed is organized into a first group, and a last used processing group associated with the like tasks is stored. Upon a subsequent dispatch, the last used processing group is compared to other processing groups and the tasks are assigned to a processing group based upon a predetermined threshold.

Abstract: A set of like tasks to be performed is organized into a first group, and a last used processing group associated with the like tasks is stored. Upon a subsequent dispatch, the last used processing group is compared to other processing groups and the tasks are assigned to a processing group based upon a predetermined threshold.

Abstract: A system, method and computer program product for implementing a video camera that is accessible by different Virtual Machine GOSs and the Host system. A standard USB video camera is build into a Host system. A VM running a Guest OS is launched on the Host system. The Guest OS has virtual driver for the Host video camera. The virtual driver is connected to a virtual USB bus, which communicates with a special Host library over a Virtual Machine Monitor (VMM). A special Host side VM application acquires and processes video data from a standard Host system video processing API that communicates directly with a Host-side virtual camera driver. Video frames are provided via the Host-side VM application to the virtual USB bus and to the virtual driver. Host applications or other VMs can acquire video streams from the Host USB camera simultaneously.

Abstract: In server/client architectures, the server application and client applications are often developed in different languages and execute in different environments specialized for the different contexts of each application (e.g., low-level, performant, platform-specialized, and stateless instructions on the server, and high-level, flexible, platform-agnostic, and stateful languages on the client) and are often executed on different devices. Convergence of these environments (e.g., server-side JavaScript using Node.js) enables the provision of a server that services client applications executing on the same device. The local server may monitor local events occurring on the device, and may execute one or more server scripts associated with particular local events on behalf of local clients subscribing to the local event (e.g., via a subscription model).

Abstract: Technologies for low power execution of one or more threads of a multithreaded program by one or more processing elements are generally disclosed.

Abstract: Systems and methods for tracing an emulated execution order of non-native instructions based on natively executing code on a computing system having a native instruction set architecture are provided. One method includes, during emulated execution of non-native program code, maintaining a jump history in the computing system, the jump history including a listing of non-native jump instructions for which execution is emulated in the computing system. The method includes, for each of the non-native jump instructions included in the jump history, accessing non-native program code including the non-native instructions to determine one or more non-native instructions executed between the non-native jump instruction and a last-executed non-native jump instruction, and aggregating the non-native jump instruction and the one or more non-native instructions into an instruction trace.

Abstract: A system may perform work stealing using a dynamically configurable separation between stealable and non-stealable work items. The work items may be held in a double-ended queue (deque), and the value of a variable (index) may indicate the position of the last stealable work item or the first non-stealable work item in the deque. A thread may steal a work item only from the portion of another thread's deque that holds stealable items. The owner of a deque may add work items to the deque and may modify the number or percentage of stealable work items, the number or percentage of non-stealable work items, and/or the ratio between stealable and non-stealable work items in the deque during execution. For example, the owner may convert stealable work items to non-stealable work items, or vice versa, in response to changing conditions and/or according to various work-stealing policies.