Patent application number | Description | Published |
20100192153 | SELECTING EXECUTING REQUESTS TO PREEMPT - Requests that are executing when an application is determined to be in an overload condition are preempted. To select the executing requests to preempt, a value for each executing request is determined. Then, executing requests are selected for preemption based on the values. | 07-29-2010 |
20100254260 | LOCATION DETERMINATION FOR PLACING A NEW CAPACITY POINT IN A WIRELESS NETWORK - A location for placing a new capacity point in a wireless network is determined based on a wireless contention of the network and capacities for capacity points in the network. Each capacity point is a network device interfacing the network with a second network. The capacities are calculated as a function of the wireless contention. | 10-07-2010 |
20100278072 | SELECTING WIRELESS MESH NODE LOCATIONS - Locations for deploying mesh nodes in a wireless network are determined based on a Terminal Steiner tree (TST). The TST that is formulated from an input graph and client locations in the wireless network is determined. The input graph includes signal strength values for pairs of mesh node-to-client location and mesh node-to-mesh node links and mesh node locations for deploying the mesh nodes are selected from the Steiner nodes in the TST. | 11-04-2010 |
20110004884 | Performance degradation based at least on computing application priority and in a relative manner that is known and predictable beforehand - A model is constructed to determine performance of each computing application based on allocation of resources (including at least one hardware resource) to the computing applications. How the allocation of the resources to the computing applications affects the performance is unknown beforehand. The resources are allocated to the computing applications based at least on the model. Where the resources are overloaded as allocated to the computing applications, performance degradation of each computing application is performed based at least on priorities of the computing applications relative to one another and on the model. Performance degradation reduces usage of the resources by the computing applications so that the resources are no longer overloaded. How the priorities of the computing applications affect the performance degradation in a relative manner to one another is known and predictable beforehand. | 01-06-2011 |
20110145449 | Differentiated Storage QoS - A system includes disk storage to provide differentiated storage QoS for a plurality of IO classes. Each IO class has a plurality of applications to it. A QoS controller collects IO statistics for each application and each class. The QoS controller adaptively determines an IO class assignment for each application based at least in part on the collected IO statistics. | 06-16-2011 |
20110252166 | System and Methods for Allocating Shared Storage Resources - A system and method for allocating resources on a shared storage system are disclosed. The system | 10-13-2011 |
20110302337 | PATH SELECTION FOR APPLICATION COMMANDS - Systems and methods for path selection for application commands are described. To this end, information associated with at least one application command that were processed at least one port of a target device is received. For a subsequent application command, a set of ports of the target device is determined. In one implementation, the set of ports is determined based on information associated with the subsequent application command. Once the set of ports is determined, the subsequent application command is directed to a port selected from the set of ports. | 12-08-2011 |
20120030511 | EFFICIENT FAILURE RECOVERY IN A DISTRIBUTED DATA STORAGE SYSTEM - A method is provided for efficiently recovering information in a distributed storage system where a list of values that should be stored on a storage device is maintained. A first convergence round is scheduled to be performed on the list of values to bring each value to an At Maximum Redundancy (AMR) state. A second convergence round is scheduled to be performed on the list by selecting a wait time interval from a predefined range of wait time intervals between starts of convergence rounds. | 02-02-2012 |
20130097319 | SOFTWARE APPLICATION PLACEMENT USING COMPUTING RESOURCE CONTAINERS - 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, or that the first software application is to be separated from the second software application during execution of the first and second software applications. A target computing resource container is selected based on the placement rule and a computing resource container that is associated with the first software application. The second software application is associated with the target computing resource container, and the placement rule may be provided to the target computing resource container. | 04-18-2013 |
20130097464 | SOFTWARE APPLICATION PLACEMENT BASED ON FAILURE CORRELATION - Embodiments associate software applications with computing resources based on failure correlation information and an anti-affinity rule. An anti-affinity rule indicates that a first software application is to be separated from a second software application during execution. A management device determines failure correlations between a first computing resource that is associated with the first software application and a plurality of computing resources other than the first computing resource. The management device selects the computing resource that corresponds to the lowest failure correlation and associates the second software application with the selected computing resource based on the anti-affinity rule. | 04-18-2013 |
20140331227 | SOFTWARE APPLICATION PLACEMENT USING COMPUTING RESOURCE CONTAINERS - 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. | 11-06-2014 |
Patent application number | Description | Published |
20090112900 | Collaborative Compression - Provided are, among other things, systems, methods and techniques for collaborative compression, in which is obtained a collection of files, with individual ones of the files including a set of ordered data elements (e.g., bit positions), and with individual ones of the data elements having different values in different ones of the files, but with the set of ordered data elements being common across the files. The data elements are partitioned into an identified set of bins based on statistics for the values of the data elements across the collection of files, and a received file is compressed based on the bins of data elements. | 04-30-2009 |
20100083262 | Scheduling Requesters Of A Shared Storage Resource - To schedule workloads of requesters of a shared storage resource, a scheduler specifies relative fairness for the requesters of the shared storage resource. In response to the workloads of the requesters, the scheduler modifies performance of the scheduler to deviate from the specified relative fairness to improve input/output (I/O) efficiency in processing the workloads at the shared storage resource. | 04-01-2010 |
20100106681 | Identifying Files Associated With A Workflow - To determine files associated with one or more workflows, a trace of accesses of files in at least one server is received. The files are grouped into at least one set of files, where the files in the set are accessed together more than a predetermined number of times in the trace. Files associated with the particular workflow are identified based on the at least one set. | 04-29-2010 |
20110231582 | TREND DETERMINATION AND IDENTIFICATION - A system comprises a processor and an alert module coupled to the processor. The processor the processor monitors performance data; determines a subset of the performance data, the subset correlated with a measure of underperformance; determines a trend of the subset, the trend correlated with the measure; and identifies an occurrence of the trend. The alert module outputs an alert based on the identification. | 09-22-2011 |