Patent application number | Description | Published |
20080216088 | Coordinating service performance and application placement management - 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. This results in application placement process reacting quicker to demand fluctuations, performance guarantees are better met by rearranging the resources to be allocated to the various classes of service, and the management system works in an unsupervised mode, thus reducing manual administration costs and human errors. | 09-04-2008 |
20080282267 | Dynamic Application Instance Placement in Data Center Environments - Techniques are disclosed for determining placements of application instances on computing resources in a computing system such that the application instances can be executed thereon. By way of example, a method for determining an application instance placement in a set of machines under one or more resource constraints includes the following steps. An estimate is computed of a value of the first metric that can be achieved by a current application instance placement and a current application load distribution. A new application instance placement and a new application load distribution are determined, wherein the new application instance placement and the new load distribution optimize the first metric. | 11-13-2008 |
20090157855 | DECENTRALIZED APPLICATION PLACEMENT FOR WEB APPLICATION MIDDLEWARE - A decentralized process to ensure the dynamic placement of applications on servers under two types of simultaneous resource requirements, those that are dependent on the loads placed on the applications and those that are independent. The demand (load) for applications changes over time and the goal is to satisfy all the demand while changing the solution (assignment of applications to servers) as little as possible. | 06-18-2009 |
20090254660 | SYSTEMS AND METHODS FOR COORDINATED MANAGEMENT OF POWER USAGE AND RUNTIME PERFORMANCE IN PERFORMANCE-MANAGED COMPUTING ENVIRONMENTS - Systems and methods are provided for dynamically controlling application placement and server resource allocation in a distributed system wherein a performance manager and power manager collaborate during run-time execution of data processing tasks to coordinate management and control of workload placement and server usage and dynamically determine a tradeoff between performance level and power usage that meets power and performance objectives | 10-08-2009 |
20090254909 | Methods and Apparatus for Power-aware Workload Allocation in Performance-managed Computing Environments - An exemplary method of allocating a workload among a set of computing devices includes obtaining at least one efficiency model for each device. The method also includes, for each of a set of allocations of the workload among the devices, determining, for each device, the power consumption for the device to perform the workload allocated to the device by the allocation, the power consumption being determined based on the at least one efficiency model for each device; and determining a total power consumption of the devices. The method also includes selecting an allocation of the workload among the devices based at least in part on the total power consumption of the devices for each allocation. The method also includes implementing the selected allocation of the workload among the devices. | 10-08-2009 |
20110173245 | DISTRIBUTION OF INTERMEDIATE DATA IN A MULTISTAGE COMPUTER APPLICATION - 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. | 07-14-2011 |
20110173410 | EXECUTION OF DATAFLOW JOBS - A method, system and computer program product for storing data in memory. An example system includes at least one multistage application configured to generate intermediate data in a generating stage of the application and consume the intermediate data in a subsequent consuming stage of the application. A runtime profiler is configured to monitor the application's execution and dynamically allocate memory to the application from an in-memory data grid. | 07-14-2011 |
20120173734 | Dynamic Application Placement Under Service and Memory Constraints - An optimization problem models the dynamic placement of applications on servers under two types of simultaneous resource requirements, those that are dependent on the loads placed on the applications and those that are independent. The demand (load) for applications changes over time and the goal is to satisfy all the demand while changing the solution (assignment of applications to servers) as little as possible. | 07-05-2012 |
20120278578 | COST-AWARE REPLICATION OF INTERMEDIATE DATA IN DATAFLOWS - Described herein are methods, systems, apparatuses and products for cost-aware replication of intermediate data in dataflows. An aspect provides receiving at least one measurement indicative of a reliability cost associated with executing a dataflow; computing a degree of replication of at least one intermediate data set in the dataflow based on the reliability cost; and communicating at least one replication factor to at least one component of a system responsible for replication of the at least one intermediate data set in the dataflow; wherein the at least one intermediate data set is replicated according to the replication factor. Other embodiments are disclosed. | 11-01-2012 |
20130031035 | LEARNING ADMISSION POLICY FOR OPTIMIZING QUALITY OF SERVICE OF COMPUTING RESOURCES NETWORKS - A system for learning admission policy for optimizing quality of service of computer resources networks is provided herein. The system includes a statistical data extractor configured to extract historical data of deployment requests issued to an admission unit of a computer resources network. The system further includes a Markov decision process simulator configured to generate a simulation model based on the extracted historical data and resources specifications of the computer resources network, in terms of a Markov decision process. The system further includes a value function generator configured to determine a value function for deployment requests admissions. The system further includes a machine learning unit configured to train a classifier based on the simulation model and the value function, to yield an admission policy usable for processing incoming deployment requests. | 01-31-2013 |
20130198740 | INTEGRATED VIRTUAL INFRASTRUCTURE SYSTEM - 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. | 08-01-2013 |
20130219066 | HOST SYSTEM ADMISSION CONTROL - Systems and methods for admission control to a physical host system are provided herein. One aspect provides for receiving at least one resource request at an admission control component of a distributed computing system, the at least one resource request comprised of at least one system type; processing the at least one resource request utilizing at least one physical host accessible to the distributed computing system; specifying a number of resource request slots to be reserved for at least one system type based on at least one future reservation threshold accessible to the admission control component; and blocking resource requests from entering the system through the admission control component based on a number of available resource request slots and the at least one future reservation threshold. Other embodiments and aspects are also described herein. | 08-22-2013 |
20140280951 | SOFTWARE PRODUCT INSTANCE PLACEMENT - A system, method and computer program product for detecting data omissions between intermittently-connected devices. An example system includes physical computing resources available for utilization. A placement server communicates with a client. The client seeks to use a portion of the computer resources to execute the software product instances. The placement server receives resource utilization parameters from the client and assigns the portion of the computer resources to the software product instances based on the resource utilization parameters and the physical computing resources available for utilization. The resource utilization parameters include specification of a hierarchal arrangement of the software product instances. | 09-18-2014 |
20140280965 | SOFTWARE PRODUCT INSTANCE PLACEMENT - A system, method and computer program product for detecting data omissions between intermittently-connected devices. An example system includes physical computing resources available for utilization. A placement server communicates with a client. The client seeks to use a portion of the computer resources to execute the software product instances. The placement server receives resource utilization parameters from the client and assigns the portion of the computer resources to the software product instances based on the resource utilization parameters and the physical computing resources available for utilization. The resource utilization parameters include specification of a hierarchal arrangement of the software product instances. | 09-18-2014 |