Abstract: A method for migrating a selected set of virtual machines from a first volume to a second volume. The method includes receiving a list of virtual machines which are not migrating from a first volume to a second volume, accessing a host file system usage map of a host machine that indicates active blocks of the host file system, and accessing virtual file system usage maps of a plurality of virtual machines that indicate active blocks. A filter usage map that identifies the active blocks of the virtual machines which are not migrating is generated. The plurality of virtual machines are migrated from the first volume to the second volume, wherein the active blocks of the virtual file systems which are not migrating are skipped in accordance with the filter usage map. Subsequently, the metadata at the second volume is processed to reflect the virtual machines which were not migrated.

Abstract: An apparatus, and an associated method, for facilitating bulk transfer of large volumes of data-center, ECM repository-stored content. Multiple, simultaneous threads or tasks are concurrently run both to import and to export content, as desired. A controller controls the running of the tasks and is connected to a thread container that runs the tasks by way of a TCP/IP socket or other suitable communication connection.

Abstract: Autonomous selection between multiple virtualization techniques implemented in a virtualization layer of a virtualized computer system. The virtual machine monitor implements multiple virtualization support subsystems that each provide for the comprehensive handling of potential virtualization exceptions. A virtual machine monitor resident performance monitor computes relative virtualization overhead costs that are and would be incurred in using different virtualization support subsystems for virtualization exceptions that occur in executing a guest operating system within a defined interval. Dependent on the relative virtualization overhead costs determined, the virtual machine monitor resident virtualization selection control switches the virtual machine monitor to use the optimal virtualization support subsystem for handling virtualization exceptions that occur over a second defined interval.

Abstract: A host controller sends a request for first status information to a host. The host controller receives first status information from the host along with a unique identifier that is associated with the first status information. After a time period, the host controller sends a new request for second status information to the host, the new request including the unique identifier. When second status information and the first status information are associated with the same unique identifier, the host controller receives a response from the host indicating that the second status information is the same as the first status information. When the second status information and first status information are not associated with the same unique identifier, the host controller receives the second status information and a new unique identifier from the host.

Abstract: A method for scheduling execution of a work unit in a data processing system comprises assigning to the work unit an expected execution duration; executing the work unit determining an actual execution duration of the work unit; determining a difference between the actual execution duration and the expected duration; and conditionally adjusting the expected execution duration assigned to the work unit based on the measured actual execution duration, wherein the conditionally adjusting includes preventing the adjustment of the expected execution duration in case said difference exceeds a predetermined threshold.

Abstract: The configuration of the logical processors of a logical partition is managed dynamically. A logical partition is initially configured with one or more logical processors. Thereafter, the configuration can be dynamically adjusted. This dynamic adjustment may be in response to workload of the logical partition.

Abstract: In a system including a plurality of physical machines to execute virtual machines (VM1, VM2), migration virtual machine information and definition information are saved in a physical machine executing a virtual machine (VM1) to be migrated and a storage of a physical machine as a migration destination. During the migration of the virtual machine, machine identification information of a migration partner, unique information assigned to the virtual machine, and information indicating whether the physical machine executing the processing is a migration-source or migration-destination physical machine are saved in a migration information storage area. A migration recovery section examines information stored in a definition information storage area and a migration information storage area to determine a recovery procedure to restore the virtual machine.

Abstract: In a system including a plurality of physical machines to execute virtual machines (VM1, VM2), migration virtual machine information and definition information are saved in a physical machine executing a virtual machine (VM1) to be migrated and a storage of a physical machine as a migration destination. During the migration of the virtual machine, machine identification information of a migration partner, unique information assigned to the virtual machine, and information indicating whether the physical machine executing the processing is a migration-source or migration-destination physical machine are saved in a migration information storage area. A migration recovery section examines information stored in a definition information storage area and a migration information storage area to determine a recovery procedure to restore the virtual machine.

Abstract: A method of summarizing data includes providing a multi-method summarization program including instructions for summarizing data for a transaction processing system. At least one functional aspect of the transaction processing system for which a summarization of a subset of the data is desired is determined. The functional subset to a user as a light summarization program is exposed. The dependencies of the functional subset can be enforced at runtime allowing packaging flexibility. A method for efficient parallel processing involving not necessarily filled requests for help.

Abstract: According to one embodiment, a method comprises receiving into a planning tool a representative workload for a consumer. The method further comprises determining, by the planning tool, an allocation of demand of the consumer for each of a plurality of different classes of service (COSs). According to one embodiment, a method comprises defining a plurality of classes of service (COSs) for use by a scheduler in allocating capacity of a resource pool to a consumer, wherein the COSs each specify a different priority for accessing the capacity of the resource pool. The method further comprises evaluating, by a planning tool, a representative workload of the consumer, and determining, by the planning tool, a partitioning of resource demands of the representative workload between the plurality of COSs.

Abstract: A system and method that provides an automated solution to obtaining quality scheduling for users of computing resources. The system, implemented in an enterprise software test center, collects information from test-shop personnel about test machine features and availability, test jobs, and tester preferences and constraints. The system reformulates this testing information as a system of constraints. An optimizing scheduling engine computes efficient schedules whereby all the jobs are feasibly scheduled while satisfying the users' time preferences to the greatest extent possible. The method and system achieves fairness: if all preferences can not be meet, it is attempted to evenly distribute violations of preferences across the users. The test scheduling is generated according to a first application of a greedy algorithm that finds an initial feasible assignment of jobs. The second is a local search algorithm that improves the initial greedy solution.

Abstract: A method, system and computer program product migrating non-native applications include launching a first Virtual Machine (VM) and a first original guest OS in the VM, on a computing system that has the host OS and a host desktop, wherein the first VM has a non-native application associated with the first VM and the first original guest OS; replacing the first original guest operating system (OS) system in the first VM with a different version of the guest OS; upon a user attempting to launch the non-native application, migrating the non-native application in the first VM to the second VM; launching a second Virtual Machine (VM) and a second original guest OS in the VM, on the computing system; associating the non-native application with the second VM; launching the non-native application inside the second VM; and displaying a non-native application window to the user.

Abstract: At least one master overloaded virtual image is deployed, by a virtual image configuration device, to a hypervisor cloud that includes a group of servers, each of the group of servers configured based upon a hypervisor platform to support at least one virtual machine. A service solution is instantiated as a group of virtual machines associated with at least one of the group of servers, based upon at least one master overloaded virtual image, where the service solution includes a platform agnostic pattern independent of the hypervisor platform. Startup is initiated for each of the instantiated group of virtual machines.

Abstract: A multi-thread processor in accordance with an exemplary aspect of the present invention includes a plurality of hardware threads each of which generates an independent instruction flow, a first thread scheduler that outputs a first thread selection signal designating a hardware thread to be executed in the next execution cycle, a first selector that outputs an instruction generated by the selected hardware thread according to the first thread selection signal, and an execution pipeline that executes an instruction output from the first selector, wherein whenever a hardware thread is executed in the execution pipeline, the first thread scheduler updates the priority rank of the executed hardware thread and outputs the first thread selection signal in accordance with the updated priority rank.

Abstract: Virtual machines are managed on the basis of data obtained from a management information database of a network switch having a plurality of Ethernet links coupled to compute nodes running a plurality of virtual machines. A management entity, such as a provisioning manager, determines the amount of network bandwidth being utilized through each of the first and second Ethernet links and the amount of network bandwidth being utilized by the Internet Protocol addresses attributable to each of the virtual machines. Accordingly, one of the virtual machines may be migrated from one compute node to another compute node coupled to an Ethernet link having a greater amount of unutilized network bandwidth. Virtual machines may be dynamically migrated in order to provide each virtual machine with a required amount of network bandwidth.

Abstract: Methods and apparatus involve monitoring spin locks for guest devices. Fully virtualized guests have multiple virtual processors configured under the scheduling control of a hypervisor on a physical hardware platform. The hypervisor posts On CPU and CR3 load information to shared communications pages for each of the processors. A monitoring module in the guest device monitors the pages to ascertain forward progress of the processors. If forward progress is being made, the virtual processors continue to spin. If not, the CPU's control is variously relinquished. The monitoring module typifies a kernel driver so that the guest can maintain an unmodified operating system. Ticket spin locks, and their ordering, are also considered as are computations for lock owners. Other features contemplate computing systems and computer program products, to name a few.

Abstract: A first computer program runs in user memory space of a computing environment, and a second computer program runs in kernel memory space of the computing environment. The first computer program determines processes that constitute a workload. The second computer program creates a workload identifier corresponding to the workload, and associates the processes with the workload identifier. The first computer program requests metrics regarding the workload. In response, the second computer program collects such metrics by collecting metrics regarding the processes that constitute the workload and that are associated with the workload identifier The second computer program reports the metrics regarding the workload to the first computer program.

Abstract: A workflow information generation unit is used for constructing a workflow configured with a plurality of processes. Information of the processes is storable in a workflow information storage. The workflow information generation unit includes a process-designation information obtaining unit, an advance notice output unit, an implementation-determination information obtaining unit, a process information output unit, a result information output unit. The process-designation information obtaining unit obtains information designating a process to be included in the workflow. The advance notice output unit outputs advance notice information to notify that information of the designated process is to be stored in the workflow information storage. The implementation-determination information obtaining unit obtains implementation-determination information indicating whether the designated process is allowed to be included in the workflow.

Abstract: The present invention comprises: a unit time calculating unit for calculating, as a unit time, the greatest common denominator of the individual operating cycles of a plurality of programs; an allocating unit for allocating the individual operating cycles of the plurality of programs into each of a plurality of continuous base periods that each have their respective unit times, in sequence beginning with the shortest operating cycle, and for allocating the operating cycles of remaining programs for which the operations have not been completed during one of the plurality of base periods into remaining base periods, in sequence beginning with the shortest operating cycles; and an operating unit for running the plurality of programs that are allocated to operating times.

Abstract: Concurrent processing of business transaction data uses a time slice-centered scheme to cope with the situation where multiple requests demand a same resource at the same time. The method divides the processing time into multiple time slices, allocates each request to a corresponding time slice, and iteratively processing requests according to their corresponding time slices. The method does not require the requests to be processed one by one, and therefore does not cause a situation where other requests have to wait until the current request has been completely processed. Moreover, if a certain time slice has been allocated multiple requests of a same type, the requests are collectively processed as if they were a single request to reduce the frequencies of resource locking and unlocking, as well as the waiting time in a queue for resource access.