Abstract: This specification describes technologies relating to execution of applications and the management of an application's access to other applications. In general, a method can include loading a first application, designated to a first isolation environment, including first instructions using the first isolation environment provided by an application execution environment. A second application including second instructions is loaded using the first isolation environment despite the second application being designated to a second isolation environment provided by the application execution environment. The first application is prevented from modifying the second instructions of the second application. Data is processed using the first instructions of the first application and the second instructions of the second application, where the first instructions reference the second instructions. Information based on results of the processing is outputted.

Abstract: The present invention provides for a method and system for the disposition of tasks which failed to run during their originally scheduled time. The determination of whether to run missed or delayed tasks is based on calculated ratios rather than on fixed window sizes. A Lateness Ratio is calculated to determine if the time elapsed between the missed task and the scheduled run time is small enough to still allow a late task to run. A Closeness Ratio is calculated to determine if the next available run time for the missed task is close enough to the next scheduled execution of the task that the missed task will be run in place of the upcoming scheduled task. Each ratio is compared to a user defined ratio limit, so if the calculated ratio does not exceed the limit, then the missed task is executed at the first available opportunity.

Abstract: An apparatus, system, and method are disclosed for resolving computing resource deadlocks. In one embodiment, the present invention includes detecting a set of deadlocked processes within a set of executing processes, cancelling a lowest priority process of the set of deadlocked processes, generating a requested resources report for the set of executing processes, and enabling a user to assign a priority level to a process. In one embodiment, resolving computing resource deadlocks will efficiently detect deadlocks by using a report already generated by the operating system detailing information about allocated resources. By analyzing the resources report to gain information regarding executing processes, deadlocks may be easily determined and remedied. Resolving computing resource deadlocks may be conducted by a utility or it may run as a service of the operating system.

Abstract: An embodiment relates generally to a method of managing resources in a virtual environment. The method includes detecting an instantiation of a virtual machine and determining a delay value based on a unique identifier. The method also includes delaying an initiation of at least one support process for the virtual machine by the delay value.

Abstract: The invention relates to a device to be used with a thread scheduling method, and to a thread scheduling method comprising the steps of performing a scheduling for threads to be executed by a multithreaded (MT) processor (11), characterized in that the scheduling is performed as a function of a variable (idle) representing the processor idle time.

Abstract: According to one embodiment, a method for managing one or more virtual machines includes generating a request for at least one performance characteristic for at least one virtual machine, the at least one virtual machine being associated with a processing group, the processing group including one or more processing modules; receiving a response to the generated request for at least one performance characteristic for the at least one virtual machine; automatically determining whether an increase in the number of processing modules included in the processing group is required, by analyzing the received response to the generated request; and, in response to a determination that an increase in the number of processing modules included in the processing group is required, automatically adding at least one processing module to the processing group.

Abstract: A virtual machine is extended to include native support for co-routines. In this manner, high-level programmers are afforded access to such functionality. More particularly, supplied is a mechanism inside the virtual machine to enable method/function state to be maintained and subsequently restored. Consequently, a method/function can be called multiple times and resume where it last left off. This provides direct support for tier splitting patterns, iterators and comprehensions, among other things.

Abstract: A method and apparatus are provided for processing multiple streams of data on a plurality of execution threads. Data is selected from a plurality of data sources. An address in the data storage device is allocated for the selected data which is loaded into the allocated address. An execution task including the selected data source, the data address and an execution address is constructed and the data task is queued with previously constructed tasks. A determination is made as to which processing resources are required for each task and tasks are selected for execution in dependence on the determination. Tasks selected for execution are distributed across a plurality of processing threads.

Abstract: The invention builds a structure of software objects that captures the historically contingent development of an asynchronous program. The invention builds software objects that represent the resources and subtasks that make up the asynchronous program. The objects are connected into a hierarchy whose structure explicates interactions among the resources and subtasks. When a fault is detected, the structure tells the debugger everything the program was doing at the time of the fault and lays open the developmental history of the program that led to the fault. The debugger uses this information to trace the detected fault back through code and time to its origin. When a new feature is added, the structure tells maintenance personnel how the new feature affects existing functions. Within the structure, the invention provides mechanisms for handling reference counters and software locks. Groups of resources can be handled together, the structure taking care of coordination.

Abstract: Methods and apparatus for migrating and distributing processor tasks on a plurality of multi-processing systems distributed over a network. The multi-processing system includes at least one broadband entity, each broadband entity including a plurality of processing units and synergistic processing units, as well as a shared memory. Tasks from one broadband entity are bundled, migrated and processed remotely on other broadband entities to efficiently use processing resources, and then returned to the migrating broadband entity for completion or continued processing.

Abstract: Techniques for enhancing or replacing host operating system functionality by leveraging guest operating system functionality are disclosed. Incoming data is received from a computing resource of a host operating system, and, before the incoming data is transmitted to a higher-level module in the host operating system, the incoming data is intercepted by a set of one or more leveraged guest modules in a guest operating system. After intercepting the incoming data, the leveraged guest modules perform one or more operations on the incoming data. The leveraged guest modules may provide more advanced support and capabilities to perform these operations than any counterpart functionality in the host operating system. In addition to performing these operations, the leveraged guest modules also determine whether or not to return the incoming data to the host operating system.

Abstract: A user-level read-copy update (RCU) technique. A user-level RCU subsystem executes within threads of a user-level multithreaded application. The multithreaded application may include reader threads that read RCU-protected data elements in a shared memory and updater threads that update such data elements. The reader and updater threads may be preemptible and comprise signal handlers that process signals. Reader registration and unregistration components in the RCU subsystem respectively register and unregister the reader threads for RCU critical section processing. These operations are performed while the reader threads remain preemptible and with their signal handlers being operational.

Abstract: In an information handling system, a plurality of system resources are usable by at least one processor. An affinity structure includes elements describing the relative accessibility of the plurality of system resources to the processor. An affinity manager adjusts the affinity structure in response to a least a first one of the plurality of system resources operating outside of at least one operating parameter.

Abstract: A method, apparatus and program storage device for providing light weight system calls to improve user mode performance is disclosed. A range of system call code for the light weight system calls is provided in a system call table. The light weight system calls skip the code for saving and restore processor context.

Abstract: In a server/client system in which a plurality of servers and a client are connected through a network, and process-executing servers execute a process based on a process request from the client and transmit a process result to the client, a load distribution device includes a process information receiving unit that receives information on the process from the client; a determining unit that determines a server to execute the process from among the process-executing servers based on the information on the process; and a server information transmitting unit that transmits information on determined servers to the client, and the client includes a server information receiving unit that receives transmitted information on the servers; and a process request transmitting unit that transmits the process request to the determined servers.

Abstract: Embodiments of the present invention improve interactive audio task execution in mobile systems such as vehicles, for example. In one embodiment, task interrupt handling is provided to allow user's to resume task execution at or near the point in the task where the interrupt occurred. In one embodiment, a user's confidence that secondary tasks are being performed accurately is improved by providing confirmation and help for users to be more accurate on their secondary tasks. Accordingly, users can increase their confidence and trust in the system and focus more attention on primary tasks, such as driving a vehicle. Some embodiments of the invention further provide for more comprehensive confirmation following an interruption.

Abstract: A technique to process interrupts on a virtualized platform. A plurality of virtual machines (VMs) runs on the virtualized platform having at least a processor. The VMs include a power VM. A VM scheduler schedules the VMs for execution on the virtualized platform according a scheduling policy. A virtualized interrupt mask controller controls masking an interrupt from an interrupting source according to the scheduling policy.

Abstract: This task management method includes dividing a unit time of processing into a reserved band for guaranteeing real-timeness and a non-reserved band not for guaranteeing real-timeness, and skipping a task to be executed in the non-reserved band as appropriate when processor throughput falls. That is, when the operating frequency of the processor is lowered in order to suppress heat generation, the real-timeness of tasks to be executed in the reserved band is guaranteed at the expense of processing the task to be executed in the non-reserved band in a best-efforts fashion.

Abstract: A resource management system that manages a resource that a first function module and a plurality of second function modules that necessitates the first function module in execution thereof use. The system includes: a first resource limiting unit that limits a volume of resource that an entirety of the first function module and the plurality of second function modules uses; a resource limiting information acquisition unit that acquires resource limiting information that shows a limiting condition of the resource; and a second resource limiting unit that limits, based on the resource limiting information acquired at the resource limiting information acquisition unit, a volume of the resource that at least one of the plurality of second function modules uses.

Abstract: A method, system, program product and computer data structure for providing for two levels of server virtualization. A first hypervisor enables multiple logical partitions to share a set of resources and provides a first level of virtualization. A second hypervisor enables multiple, independent virtual machines to share the resources that are assigned to a single logical partition and provides a second level of virtualization. All events for all of the virtual machines within said single logical partition are grouped into a single partition-owned event queue for receiving event notifications from the shared resources for that single logical partition. A request for an interrupt is signaled for the grouped events from the partition-owned event queue for the demultiplexing of grouped events, by the machine, from the partition-owned event queue into individual, virtualized event queues that are allocated on a per virtual machine basis.