Abstract: A virtual computer system, including a plurality of virtual machines (VMs) running on one or more host computers, is configured to manage virtual disks in a manner to facilitate making copies of one or more virtual machines (VMs) by means of a method known as linked cloning. Techniques are disclosed for scanning a storage system to determine the set of VMs, identifying virtual disks associated with each VM, examining parent/child relationships among the virtual disks, and displaying the virtual disk hierarchy. Redundant virtual disks may be identified as the set of virtual disks that have exactly one child disk and that are not associated with a snapshot. Provisions for generating a relocate list to support migration of a linked clone may also be utilized.

Abstract: The second computer detects performance of processing to record the execution status of a batch job on a storing device, selects a recording method to be used from among a plurality of recording methods according to the detected performance, and notifies the first computer of the result. The first computer records the execution status of the batch job, executed in the own computer, on the storing device, using the recording method notified from the second computer.

Abstract: The present invention provides an information processing device that outputs a machine disposition plan for moving virtual machines while suppressing deterioration in user experience performance in a virtual-machine-type thin client system. The information processing device is provided with: a connection time determination unit that, for each first virtual machine, calculates a time slot coverage rate that is the fraction of a connection time slot covered by a high-load time slot, and determines as a second virtual machine a first virtual machine of which the time slot coverage rate exceeds a minimum coverage rate; and a disposition plan generating unit that, on the basis of time-series data of the amount of resource use of each second virtual machine, calculates the number of physical servers necessary to hold the second virtual machines in each of the high-load time slot and a low-load time slot, and associates the number to the virtual machines, outputting the result.

Abstract: An in-car information system includes a portable information terminal and an in-car device. The information terminal includes a storage unit in which applications are stored and a control unit that executes an application manager. The application manager has a launch function that enables execution of the application stored in the storage unit in the foreground and a communication function that enables execution of communication processing in the background to allow the information terminal and the in-car device to exchange information.

Abstract: In a data processing system that is executing a parent execution entity of an application, the parent execution entity has a first affinity setting. The data processing system enables the parent execution entity to create a worker execution entity that has a second affinity setting without changing the affinity setting of the parent execution entity. Workload for the application may then be performed in parallel by the parent execution entity and the worker execution entity. In one embodiment, to create the worker execution entity with the second affinity setting, the system first creates a delegate execution entity that has the first affinity setting. The system then changes the affinity setting of the delegate execution entity to the second affinity setting. The delegate execution entity then creates the worker execution entity with the second affinity setting. Another embodiment involves a super-delegate execution entity. Other embodiments are described and claimed.

Abstract: A method of mapping processes to processors in a parallel computing environment where a parallel application is to be run on a cluster of nodes wherein at least one of the nodes has multiple processors sharing a common memory, the method comprising using compiler based communication analysis to map Message Passing Interface processes to processors on the nodes, whereby at least some more heavily communicating processes are mapped to processors within nodes. Other methods, apparatus, and computer readable media are also provided.

Abstract: Certain exemplary embodiments relate to a method for integrating at least one Open Services Gateway initiative (OSGi) environment into a Service-oriented Architecture (SOA). The OSGi environment includes at least one OSGi object, and the SOA includes a SOA registry. The method includes publishing the at least one OSGi object to the SOA registry. The publishing includes creating an SOA object in the SOA registry corresponding to the at least one OSGi object. The SOA object includes information reflecting at least one relationship of the at least one OSGi object to at least one further OSGi object within the OSGi environment.

Abstract: A method and system for providing a guest with virtual media that can be read by the guest. A hypervisor hosted by a computer system presents a guest-to-host channel to a guest in the computer system. The hypervisor receives content from the guest via the guest-to-host channel, the content to be stored and managed by the hypervisor in a memory area associated with the guest in the computer system, the memory area not being directly accessible to the guest. The hypervisor then receives a request from the guest indicating that the guest is to perform at least one operation on the content, and provides the content for the guest to perform the at least one operation.

Abstract: Reducing virtual memory power consumption during idle states in virtual memory systems comprising tracking the topology of the system memory by the system hypervisor and operating system running on any selected virtual machine hosted by the system hypervisor. The idle states in the system memory are dynamically monitored and then the power consumption states in the system memory are dynamically reduced through the interaction of the hypervisor and the operation system running on the selected virtual machine.

Abstract: A virtual machine manager that provisions of virtual machines on hosts that share a tenant store. Virtual machines can be provisioned using an arraying subsystem of the tenant store without having to actually physically copy all of the operating system files for each virtual machine. Instead, the arraying subsystem virtually copies the operating system files by generating virtual operating system containers that point to a master operating system container that actually contains operating system content in the tenant store. To increase the limit on the number of virtual operating system containers that can be virtually copied from a master operating system container, the master operating system container may itself by physically, rather than virtually copied. Then, virtual operating system containers may be virtually copied from any of the master operating system containers that contain the same operating system content.

Abstract: Responsive to a hypervisor determining that insufficient local resources are available for reservation to meet a performance parameter for at least one resource specified in a reservation request for a particular logical partition managed by the hypervisor in a host system, the hypervisor identifies another logical partition managed by the hypervisor in the host system that is assigned at the least one resource meeting the performance parameter specified in the reservation request. The hypervisor estimates a first cost of migrating the particular logical partition and a second cost of migrating the another logical partition to at least one other host system communicatively connected in a peer-to-peer network based on at least one previously recorded cost stored by the host system of migrating a previous logical partition to the at least one other host system.

Abstract: Embodiments of the disclosure serializing wrapping of a circularly wrapping trace buffer via a compare-and-swap (CS) instruction by a method including executing a CS loop to advance to a location in the buffer indicated by a next free pointer. The method also includes incrementing a master wrap sequence number each time the next free pointer returns to a top of the buffer and executing another CS loop to increment a wrap number stored in a trace block corresponding to the location indicated by the next free pointer. Based upon determining that the wrap number stored in the trace block is one less than or equal to the master wrap sequence number, the method includes reserving space in a buffer associated with the trace block and storing the wrap number stored in the trace block as an old wrap number and incrementing a use-count of the trace block.

Abstract: A data processing apparatus and method for allocating data to processors, allowing the processors to process the data efficiently. The data processing apparatus may predict a result of processing data, based on a workload for the data, according to a number of processors, and may determine the number of processors to be allocated with the data, using the predicted processing result.

Abstract: A method includes determining historical resource metrics for a host, and determining a workload forecast for the host based on the historical resource metrics. The method also includes determining a first series of virtual resource configurations based on the workload forecast. Each virtual resource configuration corresponds to a respective virtual machine of a plurality of virtual machines from the host. Each virtual resource configuration includes a time interval of the workload forecast, a processing specification of the corresponding virtual machine, and a host assignment indicative of a corresponding target host of the plurality of hosts on which to run the corresponding virtual machine. The method further includes configuring each respective virtual machine according to each corresponding virtual resource configuration in the first series of virtual resource configurations.

Abstract: Techniques to prioritize and optimize the execution of upgrade operations are described. A technique may include determining the size of data blocks that are to be copied from one storage medium to another, and the dependencies of upgrade tasks on the data blocks and on other tasks. A task may be prioritized according to a weight that includes the cumulative sizes of the data blocks that it and its dependent tasks depend on. A data block copying may be prioritized according to the cumulative weights of the tasks that depend on that data block. Some embodiments may perform several data copying and/or tasks in parallel, rather than sequentially. Other embodiments are described and claimed.

Abstract: A computer implemented method may include identifying allocations for each virtual function of a plurality of virtual functions that are provided via an input/output adapter. The computer implemented method may further include determining a range associated with each group of a plurality of groups based on the identified allocations. The computer implemented method may also include associating each virtual function with a group of the plurality of groups based on the range associated with the group. Where at least one group of the plurality of groups is empty, and where one or more groups of the plurality of groups has two or more virtual functions associated with the one or more groups, the computer implemented method may include distributing the two or more virtual functions to the at least one empty group. The computer implemented method may further include transferring the plurality of virtual functions from each group to a corresponding category at the input/output adapter.

Abstract: Apparatus, systems, and methods may operate to construct a memory barrier to protect a thread-specific use counter by serializing parallel instruction execution. If a reader thread is new and a writer thread is not waiting to access data to be read by the reader thread, the thread-specific use counter is created and associated with a read data structure and a write data structure. The thread-specific use counter may be incremented if a writer thread is not waiting. If the writer thread is waiting to access the data after the thread-specific use counter is created, then the thread-specific use counter is decremented without accessing the data by the reader thread. Otherwise, the data is accessed by the reader thread and then the thread-specific use counter is decremented. Additional apparatus, systems, and methods are disclosed.

Abstract: The application discloses an information delivery method and device. The device includes: a receiving module configured to receive information to be delivered and a name of a target task which are sent from a source task; a searching module configured to search, according to the name of the target task, a preset global relationship table for a core number corresponding to the name of the target task; and a sending module configured to search a multi-core system for a core corresponding to the core number and to send the information to be delivered to the task corresponding to the name of the target task in the core. The information delivery method and device provided by the disclosure enable the delivery of information within a multi-core system or between multi-core systems with high reliability.

Abstract: Technologies are generally described for a multi-processor core and a method for transferring threads in a multi-processor core. In an example, a multi-core processor may include a first group including a first core and a second core. A first sum of the operating frequencies of the cores in the first group corresponds to a first total operating frequency. The multi-core processor may further include a second group including a third core. A second sum of the operating frequencies of the cores in the second group may correspond to a second total operating frequency that is substantially the same as the first total operating frequency. A hardware controller may be configured in communication with the first, second and third core. A memory may be configured in communication with the hardware controller and may include an indication of at least the first group and the second group.

Abstract: Embodiments are directed towards managing the distribution of tasks in a storage system. An execution path for tasks may be generated based on the type of the task and characteristics of the storage system such that the execution path includes storage computers in a storage system. The tasks may be provided to each storage computer in the execution path. A working set of intermediate results may be generated on the storage computer in the execution path. If there is more than one storage computer in the execution path, working sets may be iteratively communicated to a next storage computer in the execution path such that the next storage computer employs a previously generated working set to generate a next working set until each storage computer in the execution path has been employed to generate a working set. The results may be stored on the storage computers.