Abstract: A generic mechanism and model are provided to capture and store configuration profiles for resource monitors such that monitors can be flexibly deployed, configured, modified, and removed using appropriate sets of parameters and values. As an integral part of resource provisioning, this generic mechanism will require only a generic set of workflows and a generic data model to provision monitors. The provisioning system of the present invention captures and stores response parameters and values from monitors created during initial deployment such that these parameters can be used for later modification and removal of these monitors.

Abstract: A method for managing a web service client update without recompiling or redeploying of the client code includes the following steps or acts of: receiving a request for the web service from a subscribed client; transmitting the request to the web service; receiving notification of the web service update from a service provider or registry or some other means; parsing the notification and retrieving parameters describing the web service update; marshalling the parameters; determining whether the new web service update is compatible with the current web service invoked by the client application; updating the local service proxy instance with the marshaled parameters if the new web service update is compatible with the current web service invoked by the client application; and transmitting a notification if the web service update is not compatible with the current web service invoked by the client application.

Abstract: A generic mechanism and model are provided to capture and store configuration profiles for resource monitors such that monitors can be flexibly deployed, configured, modified, and removed using appropriate sets of parameters and values. As an integral part of resource provisioning, this generic mechanism will require only a generic set of workflows and a generic data model to provision monitors. The provisioning system of the present invention captures and stores response parameters and values from monitors created during initial deployment such that these parameters can be used for later modification and removal of these monitors.

Abstract: A method for hosting versioned web services includes steps of: receiving a request from a service requester, the request comprising version metadata; parsing the request; extracting the version metadata from the parsing step; and locating a target implementation version using the version metadata. If the target implementation version is located, the method proceeds by dynamically routing the versioned request to the target implementation version.

Abstract: A system and method which allows complex tasks to be scheduled and/or coordinated on one or more computer systems by focusing the level of autonomy to each phase of a plan. The phases include computational components and may spawn target phases such that the phases are dependent on the target phases. The phases may begin execution upon completion of the target phases. Each phase may determine further execution, including succeeding phases, in an event-driven manner.

Abstract: A method (and structure) in a computer network of controlling the admittance of requests to at least one processing component, includes differentiating the type of received requests based on the message content in each request. Each request is admitted only if the differentiated type meets at least one criterion for admission.

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 method (and structure) in a computer network of controlling the admittance of requests to at least one processing component, includes differentiating the type of received requests based on the message content in each request. Each request is admitted only if the differentiated type meets at least one criterion for admission.

Abstract: A system and method which allows complex tasks to be scheduled and/or coordinated on one or more computer systems by focusing the level of autonomy to each phase of a plan. The phases include computational components and may spawn target phases such that the phases are dependent on the target phases. The phases may begin execution upon completion of the target phases. Each phase may determine further execution, including succeeding phases, in an event-driven manner.

Abstract: The invention provides the mechanism, hereinafter referred to as Flexible Dynamic Partitioning (FDP), to allocate and reallocate resources among scheduling schemes of many types for multicomputing environments. Resources can include, but are not limited to, processors, disks and communications connections. Partitioning of resources can be initiated by both application and system triggers. Once dynamic partitioning is triggered, FDP allows a partition to invoke a set of resource allocation functions associated with its partition. The reallocation function performs a set of resource matchings and determine the necessary resource movement among partitions.

Abstract: A system and method whereby a gang scheduling entity assembles a schedule of application tasks to be run on a plurality of distributed parallel processors for pre-set time intervals. The scheduling information, including an ordered set of applications and the length of the time interval, are provided to each of the node level schedulers for the relevant processors, and the node level schedulers assure that the tasks of the applications are executed, with context switching between tasks being controlled at the node level. Tasks from multiple applications can be scheduled simultaneously, with time sharing and space sharing being utilized in the schedule. The inventive system is dynamically scalable, with the gang scheduling entity restructuring the matrix schedule should dynamic re-partitioning result in addition or deletion of processors.

Abstract: A method of scheduling jobs to be executed by a resource in a computer system wherein the jobs are grouped in “classes.” The job classes vying for the resource's attention are arranged in a hierarchy. Each job class has a time-function value that controls when the job class is selected by the resource if processing time becomes available. Within a particular level of the hierarchy, scheduling priorities are defined by one or more time-based functions, each of which may be constant or dynamically varying. When constant time-based functions are used, each job class has a schedule value that remains fixed with time. When dynamic time-based functions are used, job class “time-function values” are modified to alter the timing by which the job class(es) acquire the resource.