Abstract: A method, apparatus, architecture and computer program product for populating a service request is disclosed. A service request is modeled to determine the steps involved. The data is missing from a service request for each step of the request is assessed. The data sources for the modeled request are identified. The relevant data is extracted from the identified data sources. The service request is populated with the extracted data. A service request is executed by executing at least one process step acting on the populated service request.

Abstract: A method, system, and computer readable storage medium for determining a change schedule having multiple approvers with scheduling constraints. The constraints associated with each approver are analyzed to identify a set of candidate change schedules for each time period of a number of time periods. Weights for each approver over each of the time periods are assigned to each possible change schedule. Each approver is then asked to input preferences for each of the candidate change schedules. These preferences are then weighted for each candidate change schedule. A best change schedule is selected based on the weighted preferences of each approver for each of time periods.

Abstract: Disclosed are methods, systems and computer program products for generating a change approval plan for a computing system. The computing system has at least one component and at least two user groups, and each user group has an approver. A request to change at least one said component is received. It is determined which components are affected by the change request. An initial set of approvals to be obtained from at least one of said approvers is determined based on dependencies of the affected components with other components, and based on the approvers required for each affected and dependent component. The initial set of approvals is rearranged into sub-groups such that components falling within each sub-group are dependent only upon components within a respective same group.

Abstract: Disclosed are methods, systems and computer program products for generating a change approval plan for a computing system. The computing system has at least one component and at least two user groups, and each user group has an approver. A request to change at least one said component is received. It is determined which components are affected by the change request. An initial set of approvals to be obtained from at least one of said approvers is determined based on dependencies of the affected components with other components, and based on the approvers required for each affected and dependent component. The initial set of approvals is rearranged into sub-groups such that components falling within each sub-group are dependent only upon components within a respective same group.

Abstract: Disclosed are methods, systems and computer program products for generating a change approval plan for a computing system. The computing system has at least one component and at least two user groups, and each user group has an approver. A request to change at least one said component is received. It is determined which components are affected by the change request. An initial set of approvals to be obtained from at least one of said approvers is determined based on dependencies of the affected components with other components, and based on the approvers required for each affected and dependent component. The initial set of approvals is rearranged into sub-groups such that components falling within each sub-group are dependent only upon components within a respective same group.

Abstract: Disclosed are methods, systems and computer program products for generating a change approval plan for a computing system. The computing system has at least one component and at least two user groups, and each user group has an approver. A request to change at least one said component is received. It is determined which components are affected by the change request. An initial set of approvals to be obtained from at least one of said approvers is determined based on dependencies of the affected components with other components, and based on the approvers required for each affected and dependent component. The initial set of approvals is rearranged into sub-groups such that components falling within each sub-group are dependent only upon components within a respective same group.

Abstract: There is disclosed a method, system and computer program product for intelligently determining a change schedule when multiple approvers with possibly conflicting objectives and goals are involved. The scheduling first identifies the scheduling constraints associated with each approver by analyzing the current priorities of the services managed by the approver, taking into account the other services dependent on these services as well as any policies governing the priorities and change schedules for that service. Following this, the constraints associated with each approver are analyzed to identify a set of possible change schedules. For each possible change schedule, the approvers themselves are prioritized based on the relative importance, during the change period, of the service they manage. From these priorities, normalized weights for each approver and for each possible change schedule are calculated.

Abstract: A method, apparatus, architecture and computer program product for populating a service request is disclosed. A service request is modeled to determine the steps involved. The data is missing from a service request for each step of the request is assessed. The data sources for the modeled request are identified. The relevant data is extracted from the identified data sources. The service request is populated with the extracted data. A service request is executed by executing at least one process step acting on the populated service request.

Abstract: The number of instances of an application running in a computing environment are controlled by monitoring the current load on the application, and altering the current number of instances of the application based on results of the monitoring. The load may be monitored by monitoring the current number of instances of the application running in the computing environment. Where a maximum, minimum and/or initial number on startup, of instances of the application are specified, the altering is done based on comparing the current number to one or more of the specified numbers of instances.

Abstract: Resources are checkpointed in order to save the state of the resources. The resources can then be brought back to the same running state, during a restart procedure, by making use of the saved state. The determination of when to take a checkpoint or when to restart a resource is made by an entity, such as a cluster manager, external to the entity initiating or taking the checkpoint or performing the restart. The decision to checkpoint/restart a resource is provided by the cluster manager to a resource manager associated with the resource. This communication is facilitated by interfaces to the cluster manager provided by the resource manager.

Abstract: A system and method for dynamic scheduling and allocation of resources to parallel applications during the course of their execution. By establishing well-defined interactions between an executing job and the parallel system, the system and method support dynamic reconfiguration of processor partitions, dynamic distribution and redistribution of data, communication among cooperating applications, and various other monitoring actions. The interactions occur only at specific points in the execution of the program where the aforementioned operations can be performed efficiently.

Abstract: A system and method for dynamic scheduling and allocation of resources to parallel applications during the course of their execution. By establishing well-defined interactions between an executing job and the parallel system, the system and method support dynamic reconfiguration of processor partitions, dynamic distribution and redistribution of data, communication among cooperating applications, and various other monitoring actions. The interactions occur only at specific points in the execution of the program where the aforementioned operations can be performed efficiently.