Patent application number | Description | Published |
20090300134 | LINEAR PROGRAMMING FORMULATION OF RESOURCES IN A DATA CENTER - An exemplary method for performing work in a data center includes receiving a request for resources in a data center, solving a linear programming formulation that accounts for the request and at least some of the resources in the data center and performing work the request based at least in part on the solving of the linear programming formulation. Such a method can include a linear programming formulation that accounts for multi-core chips and DRAM systems. Various other method, devices, systems, etc., are also disclosed. | 12-03-2009 |
20090327580 | OPTIMIZATION OF NON-VOLATILE SOLID-STATE MEMORY BY MOVING DATA BASED ON DATA GENERATION AND MEMORY WEAR - An exemplary method includes writing data to locations in non-volatile solid-state memory and deciding whether to move data written to one location in the memory to another location in the memory based on generation of the data and wear of the other location. Such a method may be used for non-volatile random access memory (NVRAM). Various other methods, devices, systems, etc., are also disclosed. | 12-31-2009 |
20100058347 | DATA CENTER PROGRAMMING MODEL - An exemplary method includes hosting a service at a data center, the service relying on at least one software component developed according to a programming model and the data center comprising a corresponding programming model abstraction layer that abstracts resources of the data center; receiving a request for the service; and in response to the request, assigning at least some of the resources of the data center to the service to allow for fulfilling the request wherein the programming model abstraction layer performs the assigning based in part on reference to a resource class in the at least one software component, the resource class modifiable to account for changes in one or more resources of the data center. Various other devices, systems and methods are also described. | 03-04-2010 |
20100318454 | Function and Constraint Based Service Agreements - An exemplary matching module includes instructions for receipt of information about sellable resources for running web-based services; for a solver for minimizing or maximizing a function subject to constraints; and for output of cost information for purchasing or buying sellable resources for running web-based services where the cost information is based at least in part on minimizing or maximizing the function. An exemplary matching module may be configured to receive information in a domain-specific language. Other methods, devices and systems are also disclosed. | 12-16-2010 |
20110247001 | Resource Management In Computing Scenarios - This patent application pertains to urgency-based resource management in computing scenarios. One implementation can identify processes competing for resources on a system. The implementation can evaluate an urgency of individual competing processes. The implementation can also objectively allocate the resources among the competing processes in a manner that reduces a total of the urgencies of the competing processes. | 10-06-2011 |
20130216234 | DATA CENTER WITH FREE-SPACE OPTICAL COMMUNICATIONS - A data center for executing a data processing application includes processing units, sub-units or servers. Each of the processing units, sub-units or servers can execute a part or all of the data processing application. The processing units, sub-units or servers are electrical disjoint with respect to data communications, but can communicate with each other over free space optical links. | 08-22-2013 |
20140143593 | MEMORY SEGMENT REMAPPING TO ADDRESS FRAGMENTATION - The techniques discussed herein identify failed segments of memory in a memory region. The techniques may then manage the failed segments of memory by logically clustering the failed segments of memory at an outlying portion of the memory region using a remapping process. The remapping process may include creating and storing remapping metadata defining segment remapping entries for the memory region. Accordingly, the failure clustering logically eliminates or reduces the memory fragmentation so that a system can allocate larger portions of contiguous memory for object storage. | 05-22-2014 |
20140348510 | DATA CENTER WITH FREE-SPACE OPTICAL COMMUNICATIONS - A data center for executing a data processing application includes processing units, sub-units or servers. Each of the processing units, sub-units or servers can execute a part or all of the data processing application. The processing units, sub-units or servers are electrical disjoint with respect to data communications, but can communicate with each other over free space optical links. | 11-27-2014 |