Abstract: New peptidomimetic inhibitors of retroviral proteases are in particular for human immunodeficiency virus (HIV) protease. These inhibitors include as the core structure a new diamiriodiol isostere of the dipeptide Phe-Pro having four stereogenic centers. The inhibitors have been shown to inhibit HIV-protease and can therefore be usefully employed as antivirals for post-exposure prophylaxis and as a therapy for viral infections by a retrovirus, in particular HIV. The syntheses processes of the isosteres and inhibitors are also described.

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: Exemplary embodiments of the present invention provide a solution that comprises the capability to dispatch jobs to target system according to the declared resource consumption by providing a way for automatically calculating the resource consumption at a target processing system. The algorithmic solution provided can also be utilized by standalone reporting tools to calculate resource consumption offline and show resource impact based upon database query results in the event that data samples are available. The solution provided by exemplary embodiments of the present invention is obtained by reducing the resource consumption problem to an optimization problem involving a set of linear equations.

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 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.

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.

Abstract: A method of performing an inventory scan of target data processing systems (115) for ascertaining the presence therein of prerequisite resources, wherein the prerequisite resources are resources necessary for the execution, by the target data processing systems, of predetermined activities. The method comprising: upon sending (525) to a target data processing system a request of performing an selected activity of the predetermined activities, associating (515,520) to the request at least one signature of at least one prerequisite resource different from the prerequisite resources required for performing the selected activity, wherein the signature includes information allowing the target data processing system locating where the prerequisite resource is to be searched. Upon receiving from the target data processing system a result of the search of the prerequisite resource, updating (560) information of presence of the prerequisite resource in the target data processing system.

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 solution (400) 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 (415). 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 (421) 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 (424) 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 process for the epoxidation of 17-oxo-15,16-methylene steroids, in particular of drospirenone precursors, comprising the use of sulfoxonium ylides, in particular of dimethylsulfoxonium methyl ylide. The process allows to prepare in good yields 17-spiro epoxides, which can be easily transformed into 17-spironolacto-steroids.

Abstract: A workload scheduler supporting an efficient distribution and balancing of the workload is proposed. The scheduler maintains (383-386) a profile for each job; the profile (build using statistics of previous executions of the job) defines an estimated usage of different resources of the system by the job. The scheduler tends to select (318-342) the jobs with complementary resource requirements (according to a combination of their attributes); this process can be carried out using either a heuristic approach (318-334) or an optimization approach (335-342). As a result, the jobs that will be submitted are very likely to consume different resources of the system; in this way, any contention for the different resources is strongly reduced.

Abstract: The patent describes new peptidomimetic inhibitors of retroviral proteases, in particular of human immunodeficiency virus (HIV) protease. These inhibitors comprise as the core structure a new diaminodiol isostere of the dipeptide Phe-Pro having four stereogenic centres. The inhibitors of the invention have been shown to inhibit HIV protease and can therefore be usefully employed as antivirals for post-exposure prophylaxis and as a therapy for viral infections by a retrovirus, in particular HIV. The syntheses processes of the isosteres and inhibitors are also described.

Abstract: A solution for allowing a scheduler (205) to interact with a provisioner (250) is proposed. Particularly, the scheduler submits different jobs for execution according to a predefined plan (225); for this purpose, each job requires a workstation with specific characteristics. In the proposed solution, the available workstations are partitioned into pools (each one associated with a corresponding category of jobs). Whenever a submitted job cannot be executed because no workstation (with the required characteristics) is available in the respective pool, the scheduler sends a corresponding request to the provisioner. In response thereto, the provisioner allocates further workstations to the pool (for example, according to user defined policies, a probability of breaching the time constraints of the jobs, or their priorities). In this way, additional resources can be allocated on-demand according to the contingent needs of the jobs that must be executed.

Abstract: A solution is proposed in a scheduler for updating a control file (220) storing a workload plan (defining a sequence of jobs to be executed during a production day). A handler (225) has exclusive write access to the control file (for updating information relating to the state of the jobs during execution of the plan). A planner (215) that needs to write a new plan into the control file (for the next production day) notifies the handler. In response thereto, the handler makes a copy (320) of the control file for use by the planner and starts logging (335) any update that it performs on the (original) control file. Once the planner completes its work, the handler applies the logged updates to the copy of the control file (as updated by the planner). The handler can now restart working on the copy of the control file, which then replaces its original version.

Abstract: A distributed data processing system comprising a plurality of communicating computers including at least one message originator computer and at least one message destination computer, the message originator computer originating messages to be delivered to the message destination computer, at least one manager computer responsible of managing communications between the computers, wherein the manager computer is adapted to receive the messages originated by the originator computer and to dispatch the messages to the message destination computer, and at least one backup computer adapted to take over the role of the manager computer in case of failure thereof, wherein the backup computer is adapted to receive the messages originated by the originator computer and, in case of failure of the manager computer, to dispatch the messages to the message destination computer.

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 (265) 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 (305), in a request for scheduling execution of the work unit, a second collection (250) of pieces of information necessary to execute the work unit; determining execution information (260) 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 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 present invention proposes a scheduler (205), which is used to submit execution of jobs according to a predefined plan. Each job is defined by a corresponding descriptor (210). The descriptor specifies the resources (115) 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 (240) with stores information about the available resources and their relationships.

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: The present invention proposes a method and a corresponding system for scheduling invocation of web services from a central point of control. For this purpose, a scheduler (205) accesses a workload database (220), which associates an execution agent (210) and a descriptor (240) with each job to be submitted. In the proposed solution, the descriptor identifies a desired web service (255) and the address of the corresponding WSDL document (245), which specify the structure of the messages supported by the web service (for example, conforming to the SOAP specification); the descriptor also includes the actual content of a request message to be passed to the web service. Whenever the job is submitted for execution (according to a predefined plan), the scheduler sends its descriptor to the associated agent.