-
21 резерв мощности на покрытие несбалансированности нагрузок разного вида
резерв мощности на покрытие несбалансированности нагрузок разного вида
-
[Интент]Stranded capacity
Stranded capacity is capacity that cannot be utilized by IT loads due to the design or configuration of the system. The presence of stranded capacity indicates an imbalance between two or more of the following capacities:A specific IT device requires sufficient capacity of all of the five above elements. Yet these elements are almost never available in an exact balance of capacity to match a specific IT load. Invariably, there are locations with rack space but without available cooling, or spaces with available power but with no available rack space. Capacity of one type that cannot be used because one of the other four capacities listed above has been used to its maximum capacity is called stranded capacity. Stranded capacity is undesirable and can seriously limit the performance of a data center. Unfortunately, most data centers have significant stranded capacity issues, including the following common examples:
- An air conditioner has sufficient capacity but inadequate air distribution to the IT load
- A PDU has sufficient capacity but no available breaker positions
- Floor space is available but there is no remaining power
- Air conditioners are in the wrong location
- Some PDUs are overloaded while others are lightly loaded
- Some areas are overheated while others are cold
Depending on the situation and the architecture of the power and cooling system, it might be impossible to utilize stranded capacity or it might be that only minor investments are needed to free stranded capacity so that it can be effectively used. By definition, utilizing stranded capacity comes at a cost. It is often necessary to take down part of the installation or install new power and cooling components.
Stranded capacity is a very frustrating capacity management problem for data center operators because it is very hard to explain to users or management that a data center with 1 MW of installed power and cooling capacity can’t cool the new blade servers when it is only operating at 200 kW of total load.
An effective capacity management system not only identifies and highlights stranded capacity, but also helps customers avoid creating it in the first place.
[APC]Тематики
EN
Русско-английский словарь нормативно-технической терминологии > резерв мощности на покрытие несбалансированности нагрузок разного вида
- 1
- 2
См. также в других словарях:
Maximum parsimony — Maximum parsimony, often simply referred to as parsimony, is a non parametric statistical method commonly used in computational phylogenetics for estimating phylogenies. Under maximum parsimony, the preferred phylogenetic tree is the tree that… … Wikipedia
Maximum likelihood sequence estimation — (MLSE) is a mathematical algorithm to extract useful data out of a noisy data stream. Contents 1 Theory 2 Background 3 References 4 Further reading … Wikipedia
Maximum Ride — Maximum Ride: The Angel Experiment Maximum Ride: School s Out Forever Maximum Ride: Saving the World and Other Extreme Sports Maximum Ride: The Final Warning MAX: A Maximum Ride Novel Fang: A Maximum Ride Novel Angel: A Maximum Ride Novel… … Wikipedia
Maximum Boy — Author(s) Dan Greenburg Illustrator Greg Swearingen … Wikipedia
Maximum flow problem — An example of a flow network with a maximum flow. The source is s, and the sink t. The numbers denote flow and capacity. In optimization theory, the maximum flow problem is to find a feasible flow through a single source, single sink flow network … Wikipedia
Maximum cut — A maximum cut. For a graph, a maximum cut is a cut whose size is at least the size of any other cut. The problem of finding a maximum cut in a graph is known as the max cut problem. The problem can be stated simply as follows. One wants a subset… … Wikipedia
Maximum parsimony (phylogenetics) — Parsimony is a non parametric statistical method commonly used in computational phylogenetics for estimating phylogenies. Under parsimony, the preferred phylogenetic tree is the tree that requires the least evolutionary change to explain some… … Wikipedia
Maximum coverage problem — The maximum coverage problem is a classical question in computer science and computational complexity theory. It is a problem that is widely taught in approximation algorithms. As input you are given several sets and a number k. The sets may have … Wikipedia
Maximum satisfiability problem — In computational complexity theory, the Maximum Satisfiability problem (MAX SAT) is the problem of determining the maximum number of clauses, of a given Boolean formula, that can be satisfied by some assignment. It is an FNP generalization of SAT … Wikipedia
Maximum subarray problem — In computer science, the maximum subarray problem is the task of finding the contiguous subarray within a one dimensional array of numbers (containing at least one positive number) which has the largest sum. For example, for the sequence of… … Wikipedia
Maximum likelihood — In statistics, maximum likelihood estimation (MLE) is a method of estimating the parameters of a statistical model. When applied to a data set and given a statistical model, maximum likelihood estimation provides estimates for the model s… … Wikipedia