Abstract: Protecting privacy when communicating with a web server via a communication network, includes receiving by a first privacy agent a request from an application program of a client system for a connection to a web server having a target web server address, sending the request together with a first identification from the first privacy agent to the second privacy agent, forwarding the request together with a second identification from the second privacy agent to the third privacy agent. Further processing is performed responsive to determining that the target web server address matches a defined web server address which is accessible by the third privacy agent.

Abstract: The invention provides methods for determining the susceptibility of cancer patients to developing adverse reactions if treated with a telomerase inhibitor drug by measurement of telomere length in appropriate cells of the patient prior to initiation of the telomerase inhibitor treatment.

Abstract: The invention provides methods for determining the susceptibility of cancer patients to developing adverse reactions if treated with a telomerase inhibitor drug by measurement of telomere length in appropriate cells of the patient prior to initiation of the telomerase inhibitor treatment.

Abstract: A solution is proposed for maintaining virtual machines being available in a data-processing system. A mechanism determines a list of software components installed on each virtual machine, retrieves a set of maintenance policies for each software component, each maintenance policy being indicative of a patch to be applied to the corresponding software component. The mechanism determines a set of old virtual machines having at least one old software component thereof requiring the application of at least a new one of the corresponding patches according to a comparison among the maintenance policies and a maintenance register indicative of a current state of the software components of the virtual machines. The mechanism applies the corresponding at least one new patch to each old software component of each old virtual machine and updates the maintenance register according to the application of said at least one new patch to each old software component of each old virtual machine.

Abstract: A method for managing jobs scheduled for execution on a target system in which some jobs may spawn additional jobs scheduled for execution on the target system including intercepting jobs scheduled for execution in the target system, determining whether there is resource sufficiency in the target system for executing jobs, responsive to an affirmative determination of resource sufficiency, releasing previously intercepted jobs for execution in the target system, computing a limit of a number of jobs which can be concurrently scheduled by an external system to the target system, and transmitting the computed limit to the external system.

Abstract: A system or computer usable program product for managing jobs scheduled for execution on a target system in which some jobs may spawn additional jobs scheduled for execution on the target system including intercepting jobs scheduled for execution in the target system, determining whether there is resource sufficiency in the target system for executing jobs, responsive to an affirmative determination of resource sufficiency, releasing previously intercepted jobs for execution in the target system, computing a limit of a number of jobs which can be concurrently scheduled by an external system to the target system, and transmitting the computed limit to the external system.

Abstract: Provided are a computer program product, system, and method for monitoring resources in a cloud computing environment. A set of cloud resources is provisioned to a user of the cloud-computing environment. A set of private resources is provided for the user, each private resource being provisioned within the set of cloud resources of the user. Monitoring templates are exposed, each one for a corresponding type of a private resource to the user. A user subscription is received to at least one of the monitoring templates, wherein each of the subscribed monitoring templates is for one of the user private resources. A private monitoring agent is provided within the cloud resources of the user housing the private resource of the user to monitor the private resource according to the corresponding selected monitoring template.

Abstract: Methods, systems, and computer program products for aggregating service components in a data processing system according to predefined aggregation rules. The method includes providing a plurality of visual elements, each visual element representing a corresponding service component; selecting a new visual element for addition to an aggregation structure; determining a set of eligible visual elements of eligible service components among the instantiated service components; associating a visual cue with the eligible visual elements; and aggregating the new service component to a selected eligible service component in the aggregation structure. The new service component is compatible for aggregation with each eligible service component according to the aggregation rules. The aggregation structure includes an aggregation of instantiated visual elements of instantiated service components to define an aggregated service according to the aggregation of the instantiated service components.

Abstract: A method, system or computer usable program product for managing jobs scheduled for execution on a target system in which some jobs may spawn additional jobs scheduled for execution on the target system including intercepting jobs scheduled for execution in the target system, determining whether there is resource sufficiency in the target system for executing jobs, responsive to an affirmative determination of resource sufficiency, releasing previously intercepted jobs for execution in the target system, computing a limit of a number of jobs which can be concurrently scheduled by an external system to the target system, and transmitting the computed limit to the external system.

Abstract: Method and system for providing a mechanism for determining an optimal workload distribution, from a plurality of candidate workload distributions, each of which has been determined to optimize a particular aspect of a workload-scheduling problem. More particularly, the preferred embodiment determines a workload distribution based on resource selection policies. From this workload distribution, the preferred embodiment optionally determines a workload distribution based on job priorities. From either or both of the above parameters, the preferred embodiment determines a workload distribution based on a total prioritized weight parameter. The preferred embodiment also determines a workload distribution which attempts to match the previously determined candidate workload distributions to a goal distribution. Similarly, the preferred embodiment calculates a further workload distribution which attempts to maximize job throughput.

Abstract: The present invention proposes a scheduler, which is used to submit execution of jobs according to a predefined plan. Each job is defined by a corresponding descriptor. The descriptor specifies the resources to be used by the jobs (through their properties). In addition, for each resource the descriptor can also specify one or more relationships with other resources (defined by their properties as well). When the job must be submitted, the scheduler identifies the actual resources that possess the desired properties and that satisfy the desired relationships. For this purpose, the scheduler accesses a repository with stores information about the available resources and their relationships.

Abstract: A solution is proposed for facilitating the selection of execution servers to be used in a scheduler for submitting the execution of jobs. Each job is defined by a corresponding descriptor. The descriptor specifies the execution servers to be used by the jobs in a formal way (through their properties); in addition, the descriptor may also include the definition of formal relationships to be satisfied by the execution server with other resources of the system (in turn defined in a formal way through their properties). A query is created according to the descriptor for selecting (concrete) execution servers having the desired properties and satisfying the desired relationships with the resources of the system. This query is then run on a central database, wherein all the concrete execution servers, resources and relationships are defined. In this way, it is possible to obtain a list of concrete execution servers eligible to execute the job in a single transaction.

Abstract: A method in a data processing system for managing jobs. A change to a job receiving that is un-instantiated. A reservation for the job is created. Instantiated jobs for an instance of the job are monitored corresponding to the reservation, and applying the change to the instance of the job responsive to identifying the instantiated job.

Abstract: The invention provides methods for determining the susceptibility of cancer patients to developing adverse reactions if treated with a telomerase inhibitor drug by measurement of telomere length in appropriate cells of the patient prior to initiation of the telomerase inhibitor treatment.

Abstract: Methods and apparatus are provided for evaluating potential resource capacity in a system where there is elasticity and competition between a plurality of containers. A dynamic potential capacity is determined for at least one container in a plurality of containers competing for a total capacity of a larger container. A current utilization by each of the plurality of competing containers is obtained, and an equilibrium capacity is determined for each of the competing containers. The equilibrium capacity indicates a capacity that the corresponding container is entitled to. The dynamic potential capacity is determined based on the total capacity, a comparison of one or more of the current utilizations to one or more of the corresponding equilibrium capacities and a relative resource weight of each of the plurality of competing containers. The dynamic potential capacity is optionally recalculated when the set of plurality of containers is changed or after the assignment of each work element.

Abstract: A method for scheduling execution of a work unit in a data processing system, wherein the execution of the work unit involves the execution of at least one program, the method comprising: providing a first collection of pieces of information necessary to execute the work unit, said first collection of pieces of information being arranged in at least one pre-defined, re-usable program profile corresponding to the at least one program to be executed; receiving, in a request for scheduling execution of the work unit, a second collection of pieces of information necessary to execute the work unit; determining execution information for the execution of the work unit based on the first and second collections of pieces of information, and scheduling the execution of the work unit based on the determined execution information.

Abstract: A technique for monitoring computers connected to a hardware switch. The switch is used to selectively connect a single set of peripheral units to the central unit of a selected one of the computers. In the proposed solution, status information of each non-selected computer is transmitted from the corresponding central unit to the switch. For this purpose, it is preferably exploited a corresponding bi-directional input port—such as of the USE type. The switch routes the status information of the different non-selected computers to the central unit of the selected computer. The central unit of the selected computer aggregates the status information with its output information, and then transmits this aggregated information to the switch for its display on a monitor. For example, the output information is shown in a main area of the screen, while the status information is shown in a reserved strip on top of it.

Abstract: A method (300) and a corresponding system for allocating resources in a hierarchical data processing system are proposed. The system includes a plurality of nodes that are arranged in a tree. Each leaf-node, or client, controls corresponding local resources, while each intermediate node, or domain manager, controls global resources that are visible to all its dependent nodes; the global resources defined on a root node, or master domain manager, are then visible to all the nodes of the system. Whenever a job, being submitted (306) on a generic client, requests a set of resources for its execution, the request is sent (309,318,327) through the tree to the master domain manager. The master domain manager allocates (339) the corresponding global resources as soon as they are all available; this event enables (345) its child node (in a path to the client) to perform the same operations, and so on down to the client itself.

Abstract: Mechanisms for performing an inventory scan of target data processing systems for ascertaining the presence therein of prerequisite resources are provided. The prerequisite resources are resources necessary for the execution, by the target data processing systems, of predetermined activities. The mechanisms may send to a target data processing systems a request for performing a selected activity of the predetermined activities and associate with the request at least one signature of at least one prerequisite resource different from the prerequisite resources required for performing the selected activity. The signature may include information allowing the target data processing system to locate where the prerequisite resource is to be searched for. Upon receiving, from the target data processing systems a result of the search of the prerequisite resource, the mechanisms may further update information to indicate the presence of the prerequisite resource in the target data processing system.

Abstract: The present invention proposes a method and a corresponding system for scheduling invocation of web services from a central point of control. A scheduler accesses a workload database, which associates an execution agent and a descriptor with each submitted job. The descriptor identifies a desired web service, an address of a corresponding WSDL document, and the actual content of a request message to be passed to the web service. Whenever the job is submitted for execution, the scheduler sends the job's descriptor to the associated agent. In response thereto, the agent downloads the WSDL document that specifies the structure of the messages supported by the web service. The scheduler builds a request message for the web service embedding the desired content into the structure specified in the WSDL document. The agent sends the request message to an endpoint implementing the web service, so as to cause its invocation.