Abstract: A system, method, and computer program product are provided for processing a task utilizing a virtual machine as a function of an aspect of another virtual machine. In use, a task to be processed is identified. Furthermore, the task is processed utilizing at least one virtual machine located in a device as a function of at least one aspect of at least one other virtual machine located on the device.

Abstract: A method and circuit arrangement process a workload in a multithreaded processor that includes a plurality of hardware threads. Each thread receives at least one message carrying data to process the workload through a respective inbox from among a plurality of inboxes. A plurality of messages are received at a first inbox among the plurality of inboxes, wherein the first inbox is associated with a first thread among the plurality of hardware threads, and wherein each message is associated with a priority. From the plurality of received messages, a first message is selected to process in the first thread based on that first message being associated with the highest priority among the received messages. A second message is selected to process in the first thread based on that second message being associated with the earliest time stamp among the received messages and in response to processing the first message.

Abstract: A method for running, on a processor in non-privileged mode, different computer programs P while, in a nominal mode, using privileged instructions including running a hypervisor program in privileged mode of the processor, the hypervisor program providing the computer programs P with services substantially equivalent to those available for running in privileged mode, source codes of the computer programs P being modified beforehand for replacing the privileged instructions with calls for services supplied by the hypervisor program, and the hypervisor program creates at least two privileged submodes organized into a hierarchy within the non-privileged mode and the processor includes only two operating modes.

Abstract: [Object] To provide a resource management system capable of stably providing most recently updated resource information at a high speed. [Means for Solving Problems] A resource information update unit (223) collects resource information (31) from a plurality of agents (3) by manes of agent connection management unit (226) according to an update schedule of resource information stored in a schedule storage unit (225), and stores the same in a resource information storage unit (221). A retrieval processing unit (221) accesses the resource information storage unit (222) to acquire retrieval results of resource information. A static schedule generation unit (224) selects update interval for each of resource information, generates a static schedule, and stores the same in the schedule storage unit (225).

Abstract: An embodiment of the invention is a virtual machine monitor that is executable by computer processor. The virtual machine monitor runs a virtual processor. When the virtual processor encounters a faulting instruction the virtual processor is unmapped from the physical processor, and generates a list of other physical processors that could execute the instruction. The virtual machine monitor determines if one of the other of the physical processors in the list is currently idle, and when one of the other of the physical processors in the list is determined to be currently idle, the virtual processor is mapped to a second physical processor, which is the one of the other of the physical processors in the list that was determined to be currently idle.

Abstract: Systems, methods and articles of manufacture are disclosed for processing documents for electronic discovery. A request may be received to perform a task on documents, each document having a distinct document identifier. A task record may be generated to represent the requested task. The task record may include information specific to the request task. However, the task record need not include any document identifiers. At least one batch record may be generated that includes the document identifier for each of the documents. The task record may be associated with the at least one batch record. The requested task may be performed according to the task record and the at least one batch record. An audit record may be generated for the performed task. The audit record may be associated with the at least one batch record.

Abstract: Systems, methods and articles of manufacture are disclosed for processing documents for electronic discovery. A request may be received to perform a task on documents, each document having a distinct document identifier. A task record may be generated to represent the requested task. The task record may include information specific to the request task. However, the task record need not include any document identifiers. At least one batch record may be generated that includes the document identifier for each of the documents. The task record may be associated with the at least one batch record. The requested task may be performed according to the task record and the at least one batch record. An audit record may be generated for the performed task. The audit record may be associated with the at least one batch record.

Abstract: An automated resource allocation technique for scheduling a batch computer job in a multi-computer system environment. According to example embodiments, resource allocation processing may be performed when receiving a batch computer job that needs to be run by a software application executable on more than one computing system in the multi-computer system environment. The job may be submitted for pre-processing analysis by the software application. A pre-processing analysis result comprising job evaluation information may be received from the software application and the result may be evaluated to select a computing system in the multi-computer system environment that is capable of executing the application to run the job. The job may be submitted to the selected computing system to have the software application run the job to completion.

Abstract: An automated resource allocation technique for scheduling a batch computer job in a multi-computer system environment. According to example embodiments, resource allocation processing may be performed when receiving a batch computer job that needs to be run by a software application executable on more than one computing system in the multi-computer system environment. The job may be submitted for pre-processing analysis by the software application. A pre-processing analysis result comprising job evaluation information may be received from the software application and the result may be evaluated to select a computing system in the multi-computer system environment that is capable of executing the application to run the job. The job may be submitted to the selected computing system to have the software application run the job to completion.

Abstract: The present disclosure relates to methods, systems, and software for performing parallel processing on a set of business object actions forming a batch process. The batch process may be performed by compiling a group of independent work packages, each work package representing a discrete business object action. The work packages are clustered and an individual session for each work package is created. The work packages are then executed in parallel by a framework for parallel processing, external of an application requesting the batch process. Each session is closed after processing of the work package is completed, and the cluster is closed after processing of the work packages is completed.

Abstract: A system and method for provisioning virtual machines for a demonstration are described. In one embodiment, the system comprises a scheduling server for enabling a user to schedule a demonstration by selecting a demonstration set and related details using a scheduling web page and a plurality of provisioning servers each connected to the scheduling server via an Internet connection, each of the provisioning servers having stored thereon a plurality of demonstration sets each comprising at least one VM. Responsive to selection of a demonstration set by the user, the scheduling server selects one of the provisioning servers to host the scheduled demonstration and notifies the selected provisioning server of details regarding the scheduled demonstration.

Abstract: A virtual-machine control program includes an operational-status inquiry unit that inquires of another machine about a memory usage status of virtual machines realized on another machine; a swapping-target selecting unit that selects a virtual machine capable of being swapped for a virtual machine realized on a machine from among the virtual machines realized on another machine based on information obtained by the operational-status inquiry unit; and a swapping performing unit that swaps the virtual machine realized on the machine for the virtual machine selected by the swapping-target selecting unit. The virtual-machine control program enables to move the virtual machine to another machine without preparing a free space in advance.

Abstract: Assigning queued tasks is disclosed. A request is received for a task assignment. A task is automatically assigned from a queue to a task performer based at least in part on a profile of the task performer.

Abstract: A CPU executes initialization for allocating a storage area of an auxiliary storage device for a program execution area after a particular application program is loaded into the program execution area and becomes executable. Subsequently, the CPU loads a plurality of application programs into the program execution area.

Abstract: A recovery virtual machine acquires execution frequency information from a file, and converts a procedure, of which execution frequency is high in the execution frequency information acquired, to native code, and the time for starting the conversion is thereby reduced. Furthermore, by performing conversion at a timing at which a target procedure is invoked, load occurring due to the conversion is distributed, to prevent occurrence of failure in execution of an application caused by the load occurring due to the conversion.

Abstract: Fair share scheduling to divide the total amount of available resource into a finite number of shares and allocate a portion of the shares to an individual user or group of users as a way to specify the resource proportion entitled by the user or group of users. The scheduling priority of jobs for a user or group of users depends on a customizable expression of allocated and used shares by that individual user or group of users. The usage by the user or group of users is accumulated and an exponential decay function is applied thereto in order to keep track of historic resource usage for a user or group of users by one piece of data and an update timestamp.

Abstract: A method and system for supporting Wake-on-LAN technology in a virtualized environment is described. An improved virtual switch comprises a listener, which receives a power-on message on behalf of virtual machines, extracts addresses of the virtual machines to be powered on, which are embedded in the power-on message, compares the extracted addresses with addresses of the virtual machines stored in a database, and selectively powers on those virtual machines for which the extracted and stored addresses match.

Abstract: Throttling of an iterative process in a computer system is disclosed. Embodiments of the present invention focus on non-productive iterations of an iterative process in a computer system. The number of productive iterations of the iterative process during a current timeframe is determined while the iterative process is executing. A count of the number of process starts for the iterative process during the current timeframe is stored. The count can be normalized to obtain a number of units of work handled during the current timeframe. A throttling schedule can be calculated, and the throttling schedule can be stored in the computer system. The throttling schedule can then be used to determine a delay time between iterations of the iterative process for a new timeframe. A formula can be used to calculate the throttling schedule. The throttling schedule can be overridden in accordance with a service level agreement (SLA), as well as for other reasons.

Abstract: Techniques for execution of multiple threads in a multithreaded computing programming environment are disclosed. The techniques are especially well suited for environments that use multilayered programming architecture where a higher layer can build on the functions provided by a lower layer where the delay time is an important consideration. In one aspect, the conceptual notion of a “Worker” effectively serves to represent the thread-specific execution context for a thread of execution (“thread”) in a multithreaded computing environment. Another aspect, provides the notion of an Exclusion Area (EA) as logical lock that serves to protect shared resources in a multithreaded environment. The combination of the worker and EA are used to provide a powerful framework that, among other things, allows minimizing of the delay time.

Abstract: Systems and methods are described herein that discuss how a computing platform executing a virtualized environment, in one example, can be integrity verified adaptively and on demand. This may occur at initial runtime, as well as during continued operations, and allows the platform user to install software from various vendors without sacrificing the integrity measurement and therefore the trustworthiness of the platform.