Abstract: A method, system and apparatus for dynamically repartitioning a partitioned computer system in response to workload demands are provided. In one embodiment, a monitoring software is used to monitor workloads on all resources in all the partitions. If a workload on a resource in a partition is determined to exceed a maximum threshold, a similar resource is allocated to the partition. The similar resource is preferentially an unassigned or unallocated resource. However, resources from other partitions may also be used. In another embodiment, a workload schedule is stored in a workload profile. If a scheduled workload in any of the resources of a partition is to exceed a maximum threshold, additional similar resources will be allocated to the partition before the scheduled workload.

Abstract: A method, system, and computer usable program product for an improved object placement in integrated circuit design are provided in the illustrative embodiments. The IC design includes cells, the cells including electronic components, wires, and pins defined for interconnections of the IC. An initial placement corresponding to the design is received. A characteristic of the initial placement is estimated, which may include congestion, pin density, or both in an area of the initial placement. A transformation is performed on a part of the initial placement including the area to improve the characteristic. If the characteristic has improved in the transformed placement, a final placement corresponding to the transformed placement is produced. The transformation may be any combination of resizing an object, weighting a connection, clustering a plurality of objects, shortening of a route taken by a wire, and straightening a bend in a wire in the initial placement.

Abstract: A method, system, and computer usable program product for in an integrated circuit are provided in the illustrative embodiments. A signal to be measured is identified in the IC. The signal is provided as a first control voltage input to a first VCO in the IC. A first output frequency is generated from the first VCO, the first output frequency having a first frequency value corresponding to the signal. The signal is provided as a second control voltage input to a second VCO in the IC. A second output frequency is generated from the second VCO, the second output frequency having a second frequency value corresponding to the signal. The first and the second output frequency values are exported from the IC. A mean value and a standard deviation of the signal are computed using the output first and second frequency values.

Abstract: A solution is proposed for reducing the response time of query submitted by a client to server and, at the same time optimizing the sorting time of the results. Some canonical sorting algorithms are conceived to produce the first sorted records as soon as possible even if the sort operation is not completed. Even if such kind of algorithms match the above described needs, they could become impracticable because of their computational complexity. On the other side, some other algorithms have a lower computational complexity but the sorted result can be available only after the last iteration when the algorithm has completed. The present invention provides an improved method which combines the advantages of both families of algorithms.

Abstract: A solution for metering usage of services—for example, in a SOA Framework—is proposed. For this purpose, the submission of any invocation of a provider service by a consumer service is intercepted by a license manager; a corresponding request is then submitted to a dedicated licensing service, which returns an entitlement code when the consumer service is entitled to submit the service invocation. The service invocation is decorated with this entitlement code and actually submitted to the provider service. The (decorated) service invocation addressed to the provider service is likewise intercepted by another license manager; a request is then submitted to the licensing service for verifying the received entitlement code. The running of the provider service is then enabled only if the entitlement code is correct.

Abstract: An instruction to delete the entry is received. A second entry that includes a reference to the entry is identified. A third entry including information to be preserved from the entry is added in a deleted entries subtree. The third entry is modified to include the reference information from the second entry. The third entry is saved such that during a restore of the entry the third entry provides the information to restore the entry and the reference to the entry. The third entry may include a set of attributes that store an identifier of the second entry. The entry is restored from the third entry and made available in the directory. A reference is recreated in the second entry to the restored entry forming a restored second entry.

Abstract: The compliance of a virtual machine image to a set of requirements is determined during a process to potentially introduce the virtual machine image into a network. One or more virtual machine images are identified. During compliance testing, the identified virtual machine image is controlled such that it cannot connect to the network. One or more tests are carried out to determine if the virtual machine image is compliant with one or more predetermined requirements. If a virtual machine is compliant with said one or more predetermined requirements, the virtual machine image is connected to the network.

Abstract: The present invention provides for analyzing document content for display with reduced cognitive load assists those who are blind, have low vision, or cognitive problems. This present invention also aids those who prefer to receive condensed information orally. Document content is analyzed, a set of salient words and phrases are generated from the document content and the set of salient words and phrases are read.

Abstract: A solution for distributing the workload across the servers (105) in a fail-over cluster (for example, based on the MSCS) is proposed. A fail-over cluster is aimed at providing high availability; for this purpose, a resource service (205) automatically moves each resource (220) that exhibits some sort of failure to another server in the cluster. The proposed solution adds a monitor (240) that periodically measures a responsiveness of each resource. If the responsiveness of a resource is lower than a threshold value, the monitor inquiries a metrics provider (245) for determining the workload of all the servers in the cluster. The monitor then causes the resource service to move that resource to the server having the lowest workload in the cluster.

Abstract: A back-up solution (300) is proposed for use in a data processing system, wherein different host machines support multiple guest machines. For this purpose, a master one of the host machines owns (306) a scheduling file, which indicates which guest systems are enabled to back-up their data, and when the back-up process must be performed. Every day, each other host machine verifies (309-318) whether the corresponding guest machines are included in the scheduling file for the current day. If so, the path of the respective data to be backed-up is added (324-330) to a control file on the master host machine. At the end of the procedure, the master host machine may then back-up the required data of the different guest machines (as indicated in the control file); at the same time, any critical guest machine automatically shuts-down (342-345), so as to ensure the consistency of the corresponding backed-up data.

Abstract: A method, system and computer program product for remotely debugging a malfunctioning node controller of a node in a distributed node network through a functioning node controller of the same node. The method comprises establishing a serial link between the malfunctioning node controller and a functioning node controller and configuring the functioning node controller as a virtual console by the remotely-located central data processing system (DPS). The method further includes receiving, via an internal Fru Support Interface (FSI) link, serial data from the malfunctioning node controller through the virtual console, and debugging, by the DPS, a failure condition of the malfunctioning node controller, in response to receipt of the serial data through the virtual console.

Abstract: A co-operative mechanism in which a service processor and a host CPU (with an as running thereupon) work together to implement both power capping and utilization-based power savings, and with negligible side effects. Preferably, a 2-level modulation scheme is employed to undertake both power capping and energy savings simultaneously. Preferably, a frequency governor in the as running on a host processor saves power by modulating p-states based on a shared table, thus avoiding SMIs. The range of the p- I states in the shared table is adjusted to implement power capping in conjunction with power sensors in the system. This adjustment can be done either by a service processor, which can monitor total energy consumption, or an as or software running on the host processor, which can read energy consumption from the service processor and adjust the shared table.

Abstract: A method, system, and computer usable program product for managing multi-node multi-version systems are provided in the illustrative embodiments. A process associates a version identifier with a first version of data available at a first node in the multi-node multi-version system. The version identifier corresponds to the first version of the data. The data includes an update. The process sends the data and the associated version identifier to a second node without learning a second version of data available at the second node. In one embodiment, the first version of data may be a subset of the second version of data. In another embodiment the second version of data may be a subset of the first version of data. The process repeats the sending for each update at the first node.

Abstract: A method, system, and computer program for installing a shared software component on a computer are proposed. The process is driven by an exploiter of this (new) shared component. If the required shared component is not available on the computer, it is installed at the desired location (specified by the exploiter). On the contrary, if another shared component is already available (for further exploiters), the process verifies whether this available shared component is at the required level. If not, the available shared component is upgraded accordingly; for example, this result can be achieved by causing the available shared component to refuse any new request and then waiting for the completion of any pending request. In this case, the install location of the available shared component is returned to the exploiter, so as to have it point to the available shared component automatically.

Abstract: A computer-implemented method, computer program product and data processing system to improve runtime performance of executable program code when executed on the data-processing system. During execution, data is collected and analyzed to identify runtime behavior of the program code. Heuristic models are applied to select region(s) of the program code where application of a performance improvement algorithm is expected to improve runtime performance. Each selected region is recompiled using selected performance improvement algorithm(s) for that region to generate corresponding recompiled region(s), and the program code is modified to replace invocations of each selected region with invocations of the corresponding recompiled region. Alternatively or additionally, the program code may be recompiled to be adapted to characteristics of the execution environment of the data processing system.

Abstract: A method, system, and computer usable program product for transferring messages to a directory are provided in the illustrative embodiments. A listing of message templates that is stored in a computer usable storage medium is received. A list of messages is received. The listing of message templates is loaded in a directory. The directory executes in a data processing system and is configured to store messages. The list of messages are loaded in the directory. Messages are loaded in the directory by receiving a list of messages in the directory. A message is selected and identified from the list of messages. A determination is made if the message corresponds to an existing base message entry in the directory. A message instance entry is created in relation to the existing base message entry if the message corresponds to an existing base message entry and the message is otherwise handled if not.

Abstract: A software patch management solution is proposed. The devised solution is based on the idea of automating the installation of the patches through a software distribution infrastructure. An automation engine is added to a distribution server. The automation engine interfaces with a patch provider acting as a proxy, which stores a local copy of the patches and of a patch catalogue for detecting corresponding vulnerabilities. The automation engine automatically builds a distribution plan for deploying the patches to the relevant endpoints, according to a vulnerability catalogue that stores the actual exposures of the endpoints. The distribution plan arranges the required activities in the correct order, to minimize the number of rebooting of the endpoints; the distribution plan ends with an activity for scanning the endpoints, to update the vulnerability catalogue accordingly.

Abstract: Parallel prefix circuits for computing a cyclic segmented prefix operation with a mesh topology are disclosed. In one embodiment of the present invention, the elements (prefix nodes) of the mesh are arranged in row-major order. Values are accumulated toward the center of the mesh and partial results are propagated outward from the center of the mesh to complete the cyclic segmented prefix operation. This embodiment has been shown to be time-optimal. In another embodiment of the present invention, the prefix nodes are arranged such that the prefix node corresponding to the last element in the array is located at the center of the array. This alternative embodiment is not only time-optimal when accounting for wire-lengths (and therefore propagation delays), but it is also asympotically optimal in terms of minimizing the number of segmented prefix operators.

Abstract: Methods, systems and computer program products for architecting fault tolerant applications. Embodiments of the invention include a method for executing an application in a computer system, the method including monitoring a behavior of the computer system, the computer system having a subsystem in an operating system of the computer system, in response to encountering a problem in the computer system, performing switching the application from a normal mode of operation to a critical mode of operation, executing the application in the critical mode of operation, determining if the computer system has returned to the normal mode of operation, in response to the computer system returning to the normal mode of operation switching the application to execute in the normal mode and executing the application in the normal mode of operation.

Abstract: A method for managing a virtual memory system configured to allow multiple page sizes is described. Each page size has at least one table associated with it. The method involves maintaining entries in the tables to keep track of the page size for which the effective address is mapped. When a new effective address to physical address mapping needs to be made for a page size, the method accesses the appropriate tables to identify prior mappings for another page size in the same segment. If no such conflicting mapping exists, it creates a new mapping in the appropriate table. A formula is used to generate an index to access a mapping in a table.