Abstract: Disclosed is a novel system and method for managing requests for an additional virtual machine. The method begins with operating at least one virtual machine accessing at least one computer resource associated with at least one physical machine within a computing cluster. One or more non-deterministic virtual machine requests for the computer resource are received. An over-utilization of the computer resource as a probability distribution function is modeled. In one example, the probability distribution function is a Beta distribution function to represent a one of a plurality of probability distribution functions. Next, an additional virtual machine on the physical machine associated with the computer resource is added in response to a probability of a utilization of the computer resource being greater than a probalistic bound on the over-utilization of the computer resource. Otherwise, the additional virtual machine is not added.

Abstract: A method, information processing system, and computer program product provide on-demand information captured from wireless devices. An information request is received from an electronic device. At least one wireless communication device is identified from a set of wireless communication devices that is available to satisfy the information request. The information request is sent to the at least one wireless communication device in response to identifying the at least one wireless communication device. A set of information is received from the at least one wireless communication device that satisfies the information request. The set of information that has been received is sent to the electronic device. The information request comprises a request for a set of information of at least one information type and from a given geographical location.

Abstract: A system detection method and apparatus. The throughput and response time of the system are acquired, where the throughput reflects the number of requests from outside the system that has been processed by the system. The response time reflects time required by the system to process requests from outside the system. The system performance characteristic parameter based on the throughput and response time is obtained and is used to describe congestion condition of the system to determine whether there is a bottleneck in the system. Also provided are a method and device for flow control. The system detection method and apparatus allow detecting a bottleneck and flow control in a simple and effective way to ensure that requests are processed in time.

Abstract: Methods and systems for determining a real-time performance model of systems that process multi-class workloads. The methods can include collecting measurement data, selecting a series of prior time windows, processing the measurement data to compute a set of constraints based on the measurement data from the series of prior time windows, augmenting the set of constraints to a measurement model to obtain an augmented measurement model and running a modified extended Kalman filter with the augmented measurement model to obtain a state estimate.

Abstract: A technique is provided for creating virtual units in a computing environment. A virtual system definition is received by a processor that is utilized to create the virtual units for a virtual system. Relationship constraints between the virtual units in the virtual system are received by the processor. The relationship constraints between the virtual units include a communication link requirement between the virtual units and/or a location requirement between the virtual units. The virtual units in the virtual system are deployed by the processor according to the relationship constraints between virtual units.

Abstract: Coordinating tasks of performance management and application placement management in a dynamic fashion by: estimating capacity needs for various service classes of service requests; computing desired capacities of at least one application for said service requests; deciding whether the desired capacities are satisfied by a current application placement; making no change to current application placement if the desired capacities are satisfied; determining a new application placement based on the desired capacities and a projected load if the desired capacities are not satisfied; computing corresponding capacity constraints for all pairs of service classes and servers; and computing an optimal allocation of capacities among the service classes so as to optimize a quality of service.

Abstract: A method, information processing system, and computer program product provide on-demand information captured from wireless devices. An information request is received from an electronic device. At least one wireless communication device is identified from a set of wireless communication devices that is available to satisfy the information request. The information request is sent to the at least one wireless communication device in response to identifying the at least one wireless communication device. A set of information is received from the at least one wireless communication device that satisfies the information request. The set of information that has been received is sent to the electronic device. The information request comprises a request for a set of information of at least one information type and from a given geographical location.

Abstract: A method and system for distributing requests to multiple back-end servers in client-server environments. A front-end load balancer is used to send requests to multiple back-end servers. In appropriate cases, the load balancer will send requests to the servers based on affinity requirements, while maintaining load balance among servers.

Abstract: A method, system and computer program product for distributing intermediate data of a multistage computer application to a plurality of computers. In one embodiment, a data manager calculates data usage demand of generated intermediate data. A computer manager calculates a computer usage, which is the sum of all data usage demand of each stored intermediate data at the computer. A scheduler selects a target computer from the plurality of computers for storage of the generated intermediate data at such that a variance of the computer usage demand across the plurality of computers is minimized.

Abstract: A method, system and computer program product for distributing intermediate data of a multistage computer application to a plurality of computers. In one embodiment, a data manager calculates data usage demand of generated intermediate data. A computer manager calculates a computer usage, which is the sum of all data usage demand of each stored intermediate data at the computer. A scheduler selects a target computer from the plurality of computers for storage of the generated intermediate data at such that a variance of the computer usage demand across the plurality of computers is minimized.

Abstract: Methods and systems for determining a real-time performance model of systems that process multi-class workloads. The methods can include collecting measurement data, selecting a series of prior time windows, processing the measurement data to compute a set of constraints based on the measurement data from the series of prior time windows, augmenting the set of constraints to a measurement model to obtain an augmented measurement model and running a modified extended Kalman filter with the augmented measurement model to obtain a state estimate.

Abstract: Coordinating tasks of performance management and application placement management in a dynamic fashion by: estimating capacity needs for various service classes of service requests; computing desired capacities of at least one application for said service requests; deciding whether the desired capacities are satisfied by a current application placement; making no change to current application placement if the desired capacities are satisfied; determining a new application placement based on the desired capacities and a projected load if the desired capacities are not satisfied; computing corresponding capacity constraints for all pairs of service classes and servers; and computing an optimal allocation of capacities among the service classes so as to optimize a quality of service.

Abstract: A method, system and apparatus for on-demand application resource allocation. In accordance with the method of the invention, an anticipated workload can be compared to a measured capacity for an application cluster in one or more server computing nodes in a server farm. If the measured capacity warrants a re-configuration of the application clusters, a new placement can be computed for application server instances in individual ones of the server computing nodes. Subsequently, the new placement can be applied to the server computing nodes in the server farm. In this regard, the applying step can include starting and stopping selected ones of the application server instances in different ones of the server computing nodes to effectuate the new placement.

Abstract: A method of dynamic performance balancing in a distributed computer system including collecting average service time statistics for application requests distributed from multiple application servers and collecting application server CPU utilization statistics from multiple hosts where each host is associated with at least one of the application servers. In addition, the method includes periodically calculating scaled routing weights from the average service time and CPU utilization statistics and distributing server requests to the application servers in accordance with the scaled routing weights. Also provided is a distributed computer system configured to accomplish dynamic performance balancing as described above, and an article of manufacture for use in programming a distributed computer system containing instructions to accomplish dynamic performance balancing of server requests as described above.

Abstract: Apparatus, systems and methods for service and/or business for coordinating tasks of performance management and application placement management in a dynamic fashion. An example process is dynamic in the face of fluctuations in the request load to the distributed computer system and the periodic adjustments to the placement of applications onto servers in said distributed computer system. There are two opposite functional flows in said process: a demand estimation function and a capacity adjustment function. The coordination system involves two subsystems: a demand estimator and a capacity adjuster, along with appropriate interfaces to of the performance manager and the application placement manager.

Abstract: The present invention provides a method, system, and computer program product for supporting a large number of intermittently used application clusters without consuming all the resources needed to run server processes for all the application clusters all the time. A method in accordance with the present invention comprises: holding an application request for a dormant application cluster in a holding zone; changing a status of the dormant application cluster to active; changing a status of an unused active application cluster to dormant; stopping server processes for the newly dormant application cluster; starting server processes for the newly active application cluster; and directing the application request held in the holding zone to the server processes for the newly active application cluster.

Abstract: Apparatus, systems and methods for service and/or business for coordinating tasks of performance management and application placement management in a dynamic fashion. An example process is dynamic in the face of fluctuations in the request load to the distributed computer system and the periodic adjustments to the placement of applications onto servers in said distributed computer system. There are two opposite functional flows in said process: a demand estimation function and a capacity adjustment function. The coordination system involves two subsystems: a demand estimator and a capacity adjuster, along with appropriate interfaces to of the performance manager and the application placement manager.

Abstract: A performance management system and method for cluster-based web services comprising a gateway for receiving a user request, assigning the user request to a class, queuing the user request based on said class, and dispatching the user request to one of a plurality of server resources based on the assigned class and control parameters. The control parameters are continuously updated by a global resource manager which tracks and evaluates system performance.

Abstract: Data communication between a data sender and at least one data recipient is facilitated when the data recipient is associated with a telephone number that can not be used to access the user with a telephone call. An invention receives the telephone number associated with the data destination (data recipient) and receives an indication that data is to be communicated. The invention uses the telephone number to determine at least one characteristic of data destination/recipient. The invention also receives at least one characteristic of the data to be communicated that enable the data to be communicated to the data receiver/recipient.

Abstract: Data communication between a data sender and at least one data recipient is facilitated when the data recipient is associated with a telephone number that can not be used to access the user with a telephone call. An invention receives the telephone number associated with the data destination (data recipient) and receives an indication that data is to be communicated. The invention uses the telephone number to determine at least one characteristic of data destination/recipient. The invention also receives at least one characteristic of the data to be communicated that enable the data to be communicated to the data receiver/recipient.