Abstract:
Exemplary methods, apparatuses, and systems determine a miss-rate at various amounts of memory allocation for each of a plurality of workloads running within a computer. A value representing an estimated change in miss-rate for each of the workloads based upon an increase in a current allocation of memory to the workload is determined. The workload with a value representing a greatest improvement in hit rate is selected. Additional memory is allocated to the selected workload.
Abstract:
Embodiments associate software applications with computing resource containers based on placement rules. A placement rule indicates that a first software application is to be co-located with a second software application during execution of the first and second software applications and second placement rule indicates that the first software application is to be separated from the second software application when the second placement rule is violated by enforcing the first placement rule. The placement rule also indicates that the first software application is to be separated from the second software application during execution of the first and second software applications and the second placement rule indicates the first software application is to be co-located with the second software application when the second placement rule is violated by enforcing the first placement rule.
Abstract:
A universal resource management system and method for performing resource management operations for different computing environments uses a universal snapshot of the different computing environments to perform a resource management analysis to produce at least one recommended action for the different computing environments. The universal snapshot is created using state information collected from the different computing environments. The recommended action is then implemented in at least one of the different computing environments.
Abstract:
Systems and techniques are described for allocating data store queues to virtual machines. A described technique includes allocating a respective queue to each of a plurality of threads, wherein the queue is configured to queue data requests from the respective thread and for a first data store, determining, for each of a plurality of threads, a respective maximum quantity of pending requests for the thread, wherein a quantity of pending requests sent from the respective queue to the first data store is equal to the maximum quantity of pending requests determined for the thread, determining, for each of the threads, a respective current quantity of operations per second, determining, for each of one or more first threads in the plurality of threads, a respective updated quantity of pending requests, and adjusting, for each first thread, the quantity of pending requests of the first thread sent to the first data store.
Abstract:
Embodiments associate software applications with computing resource containers based on a placement rule and a selected failure correlation. A placement rule indicates that a first software application is to be co-located with a second software application during execution of the first and second software applications. The placement rule also indicates that the first software application is to be separated from the second software application during execution of the first and second software applications. Failure correlations are determined for a plurality of computing resources associated with the first software application. A computing resource with a lowest failure correlation is selected from the plurality of computing resources, and the second software application is associated with the selected computing resource despite the association violating the placement rule.
Abstract:
A system and method for performing customized remote resource allocation analyzes on distributed computer systems utilizes a snapshot of a distributed computer system, which is received at a remote resource allocation module, to perform a resource allocation analysis using a resource allocation algorithm. The resource allocation algorithm is selected from a plurality of resource allocation algorithms based on at least one user-provided parameter associated with the distributed computer system.
Abstract:
A system and method for performing a hypothetical power management analysis on a distributed computer system uses chronologically consecutive snapshots of the distributed computer system. The snapshots are used to extract demands of clients running in the distributed computer system for a resource for different time intervals, which are then stitched together to produce a workload trace. The snapshots and the workload trace are used to construct modeling scenarios for the distributed computer system. The modeling scenarios are used to perform analyses to simulate the operation of the distributed computer system during which the power management module is enabled to compute potential power savings.
Abstract:
A universal resource management system and method for performing resource management operations for different computing environments uses a universal snapshot of the different computing environments to perform a resource management analysis to produce at least one recommended action for the different computing environments. The universal snapshot is created using state information collected from the different computing environments. The recommended action is then implemented in at least one of the different computing environments.
Abstract:
A system and method for performing a hypothetical power management analysis on a distributed computer system uses chronologically consecutive snapshots of the distributed computer system. The snapshots are used to extract demands of clients running in the distributed computer system for a resource for different time intervals, which are then stitched together to produce a workload trace. The snapshots and the workload trace are used to construct modeling scenarios for the distributed computer system. The modeling scenarios are used to perform analyzes to simulate the operation of the distributed computer system during which the power management module is enabled to compute potential power savings.
Abstract:
Systems and techniques are described for allocating data store queues to virtual machines. A described technique includes allocating a respective queue to each of a plurality of threads, wherein the queue is configured to queue data requests from the respective thread and for a first data store, determining, for each of a plurality of threads, a respective maximum quantity of pending requests for the thread, wherein a quantity of pending requests sent from the respective queue to the first data store is equal to the maximum quantity of pending requests determined for the thread, determining, for each of the threads, a respective current quantity of operations per second, determining, for each of one or more first threads in the plurality of threads, a respective updated quantity of pending requests, and adjusting, for each first thread, the quantity of pending requests of the first thread sent to the first data store.