# Patent

## Title
System and method for predicting cooling performance of arrangements of equipment in a data center

## Abstract

A system and method for evaluating equipment in an improper cluster in a data center, the equipment including a plurality of equipment racks, and at least one cooling provider. In one aspect, the method includes receiving data regarding each of the plurality of equipment racks and the at least one cooling provider, the data including a layout of the improper cluster of equipment racks and the at least one cooling provider, storing the received data, identifying at least one gap in the layout, determining cooling performance of at least one of the plurality of equipment racks based, at least in part, on characteristics of the at least one gap, and displaying the layout of the data center, wherein the layout includes an indication of the cooling performance of the at least one of the plurality of equipment racks.

## Background
BACKGROUND
1. Field of the Invention
At least one embodiment in accordance with the present invention relates generally to systems and methods for data center management and design, and more specifically, to systems and methods for predicting cooling performance of arrangements of equipment in a data center, including improper clusters of equipment in a data center.
2. Discussion of Related Art
In response to the increasing demands of information-based economies, information technology networks continue to proliferate across the globe. One manifestation of this growth is the centralized network data center. A centralized network data center typically consists of various information technology equipment, collocated in a structure that provides network connectivity, electrical power and cooling capacity. Often the equipment is housed of specialized enclosures termed “racks” which integrate these connectivity, power and cooling elements. In some data center configurations, these rows are organized into hot and cold aisles to decrease the cost associated with cooling the information technology equipment. These characteristics make data centers a cost effective way to deliver the computing power required by many software applications.
Various processes and software applications, such as the InfrastruXure® Central product available from American Power Conversion Corporation of West Kingston, R.I., have been developed to aid data center personnel in designing and maintaining efficient and effective data centers configurations. These tools often guide data center personnel through activities such as designing the data center structure, positioning equipment within the data center prior to installation and repositioning equipment after construction and installation are complete. Thus, conventional tool sets provide data center personnel with a standardized and predictable design methodology.
SUMMARY OF THE INVENTION
A first aspect of the invention is directed to a computer-implemented method for evaluating equipment in an improper cluster in a data center, the equipment including a plurality of equipment racks, and at least one rack-based cooling provider. The method includes receiving data regarding each of the plurality of equipment racks and the at least one cooling provider, the data including a layout of the improper cluster of equipment racks and the at least one cooling provider, storing the received data, identifying at least one gap in the layout, determining cooling performance of at least one of the plurality of equipment racks based, at least in part, on characteristics of the at least one gap, and displaying the layout of the data center, wherein the layout includes an indication of the cooling performance of the at least one of the plurality of equipment racks.
In the method, determining cooling performance of the at least one of the plurality of equipment racks may include determining capture index for the at least one of the plurality of equipment racks, and the method may further include determining capture index for each of the plurality of equipment racks based, at least in part, on characteristics of the at least one gap. In the method, determining capture index may include determining airflow through the at least one gap, and determining airflow may include determining airflow out of an aisle of the improper cluster through the at least one gap, and determining airflow into the aisle through the at least one gap. Further, determining cooling performance of the at least one of the plurality of equipment racks may include determining a value for capture index for the at least one of the plurality of equipment racks with each gap in the layout modeled as a blank panel. The method may further include determining a corrector value based on characteristics of the at least one gap, and applying the corrector value to the value for capture index for the at least one of the plurality of equipment racks. The method may also include positioning the equipment in the data center in accordance with the layout.
Another aspect of the invention is directed to a system for evaluating equipment in an improper cluster in a data center, the equipment including a plurality of equipment racks, and at least one rack-based cooling provider. The system includes an interface, and a controller configured to receive data regarding each of the plurality of equipment racks and the at least one cooling provider, the data including a layout of the improper cluster of equipment racks and the at least one cooling provider, store the received data in the system, identify at least one gap in the layout, and determine cooling performance of at least one of the plurality of equipment racks based, at least in part, on characteristics of the at least one gap.
The system may further include a display coupled to the controller, and the controller may be further configured to display the layout of the data center, wherein the layout includes an indication of the cooling performance of the at least one of the plurality of equipment racks. The controller may be further configured to determine capture index for the at least one of the plurality of equipment racks based, at least in part, on characteristics of the at least one gap. In the system, the controller may be configured to determine airflow out of an aisle of the improper cluster through the at least one gap, and determine airflow into the aisle through the at least one gap. The controller may be further configured to determine a value for capture index for the at least one of the plurality of equipment racks with each gap in the layout modeled as a blank panel. Further, the controller may be configured to determine a corrector value based on characteristics of the at least one gap, and apply the corrector value to the value for capture index for the at least one of the plurality of equipment racks.
Another aspect of the invention is directed to a computer readable medium having stored thereon sequences of instruction including instructions that will cause a processor to receive data regarding a layout of an improper cluster of equipment racks and at least one cooling provider, store the received data, identify at least one gap in the layout, and determine cooling performance of at least one of the plurality of equipment racks based, at least in part, on characteristics of the at least one gap.
The sequences of instruction may further include instructions that will cause the processor to display the layout of the data center on a display associated with the processor, wherein the layout includes an indication of the cooling performance of the at least one of the plurality of equipment racks. The medium may also include instructions that will cause the processor to determine capture index for the at least one of the plurality of equipment racks based, at least in part, on characteristics of the at least one gap. The sequences of instruction may further include instructions that will cause the processor to determine airflow through the at least one gap, including airflow out of an aisle of the improper cluster through the at least one gap, and determine airflow into the aisle through the at least one gap. The sequences of instruction may also include instructions that will cause the processor to determine a value for capture index for the at least one of the plurality of equipment racks with each gap in the layout modeled as a blank panel, and the sequences of instruction may further include instructions that will cause the processor to determine a corrector value based on characteristics of the at least one gap, and apply the corrector value to the value for capture index for the at least one of the plurality of equipment racks.



BRIEF DESCRIPTION OF DRAWINGS
The accompanying drawings are not intended to be drawn to scale. In the drawings, each identical or nearly identical component that is illustrated in various figures is represented by a like numeral. For purposes of clarity, not every component may be labeled in every drawing. In the drawings:
FIG. 1 shows an example computer system with which various aspects in accord with the present invention may be implemented;
FIG. 2 illustrates an example distributed system including an embodiment;
FIG. 3 shows a layout of an improper cluster of data equipment racks and coolers; and
FIG. 4 shows a flowchart of a process for determining cooling characteristics in accordance with one embodiment.



DETAILED DESCRIPTION
At least some embodiments in accordance with the present invention relate to systems and processes through which a user may design data center configurations. These systems may facilitate this design activity by allowing the user to create models of data center configurations from which performance metrics may be determined. Both the systems and the user may employ these performance metrics to determine alternative data center configurations that meet various design objectives. Further, in at least one embodiment, a system will provide an initial layout of data center equipment and conduct a cooling analysis on the layout in real time.
As described in U.S. patent application Ser. No. 12/019,109, titled “System and Method for Evaluating Equipment Rack Cooling”, filed Jan. 24, 2008 (referred to herein as “the '109 Application”), and in U.S. patent application Ser. No. 11/342,300, titled “Methods and Systems for Managing Facility Power and Cooling” filed Jan. 27, 2006 (referred to herein as “the '300 application”), both of which are assigned to the assignee of the present application, and both of which are hereby incorporated herein by reference in their entirety, typical equipment racks in modern data centers draw cooling air in the front of the rack and exhaust air out the rear of the rack. The equipment racks, and in-row coolers are typically arranged in rows in an alternating front/back arrangement creating alternating hot and cool aisles in a data center with the front of each row of racks facing the cool aisle and the rear of each row of racks facing the hot aisle. Adjacent rows of equipment racks separated by a cool aisle may be referred to as a cool aisle cluster, and adjacent rows of equipment racks separated by a hot aisle may be referred to as a hot aisle cluster. As readily apparent to one of ordinary skill in the art, a row of equipment racks may be part of one hot aisle cluster and one cool aisle cluster. In descriptions and claims herein, equipment in racks, or the racks themselves, may be referred to as cooling consumers, and in-row cooling units and/or computer room air conditioners (CRACs) may be referred to as cooling providers. In the referenced applications, tools are provided for analyzing the cooling performance of a cluster of racks in a data center. In these tools, multiple analyses may be performed on different layouts to attempt to optimize the cooling performance of the data center.
In typical prior methods and systems for designing and analyzing the layout of clusters in a data center, the methods and systems are either limited for use with simple clusters having two equal-length rows and no gaps or openings in the rows, or if not limited to simple clusters, involve the use of complex algorithms that typically cannot be performed in real-time. In data centers, there are many equipment groupings that have unequal row length or contain gaps and are not proper clusters easily analyzed by prior techniques. For at least one embodiment, an improper cluster is defined herein as including a two-row grouping of racks, and potentially coolers, around a common cool or hot aisle in which there are gaps in the rows or unequal-length rows. A single row may constitute an improper cluster. A continuous break between equipment in a row greater than three feet may constitute a break in the row and the row may be divided into multiple proper and improper clusters, or considered to be one improper cluster.
In at least one embodiment, a method is provided for predicting the cooling performance of an improper cluster in a data center in real-time. The method may be incorporated in a system having capabilities for predicting the cooling performance of proper clusters and for performing other design and analysis functions of equipment in a data center.
The aspects disclosed herein in accordance with the present invention, are not limited in their application to the details of construction and the arrangement of components set forth in the following description or illustrated in the drawings. These aspects are capable of assuming other embodiments and of being practiced or of being carried out in various ways. Examples of specific implementations are provided herein for illustrative purposes only and are not intended to be limiting. In particular, acts, elements and features discussed in connection with any one or more embodiments are not intended to be excluded from a similar role in any other embodiments.
For example, according to one embodiment of the present invention, a computer system is configured to perform any of the functions described herein, including but not limited to, configuring, modeling and presenting information regarding specific data center configurations. Further, computer systems in embodiments of the data center may be used to automatically measure environmental parameters in a data center, and control equipment, such as chillers or coolers to optimize performance. Moreover, the systems described herein may be configured to include or exclude any of the functions discussed herein. Thus the invention is not limited to a specific function or set of functions. Also, the phraseology and terminology used herein is for the purpose of description and should not be regarded as limiting. The use herein of “including,” “comprising,” “having,” “containing,” “involving,” and variations thereof is meant to encompass the items listed thereafter and equivalents thereof as well as additional items.
Computer System
Various aspects and functions described herein in accordance with the present invention may be implemented as hardware or software on one or more computer systems. There are many examples of computer systems currently in use. These examples include, among others, network appliances, personal computers, workstations, mainframes, networked clients, servers, media servers, application servers, database servers and web servers. Other examples of computer systems may include mobile computing devices, such as cellular phones and personal digital assistants, and network equipment, such as load balancers, routers and switches. Further, aspects in accordance with the present invention may be located on a single computer system or may be distributed among a plurality of computer systems connected to one or more communications networks.
For example, various aspects and functions may be distributed among one or more computer systems configured to provide a service to one or more client computers, or to perform an overall task as part of a distributed system. Additionally, aspects may be performed on a client-server or multi-tier system that includes components distributed among one or more server systems that perform various functions. Thus, the invention is not limited to executing on any particular system or group of systems. Further, aspects may be implemented in software, hardware or firmware, or any combination thereof. Thus, aspects in accordance with the present invention may be implemented within methods, acts, systems, system elements and components using a variety of hardware and software configurations, and the invention is not limited to any particular distributed architecture, network, or communication protocol.
FIG. 1 shows a block diagram of a distributed computer system 100, in which various aspects and functions in accord with the present invention may be practiced. Distributed computer system 100 may include one more computer systems. For example, as illustrated, distributed computer system 100 includes computer systems 102, 104 and 106. As shown, computer systems 102, 104 and 106 are interconnected by, and may exchange data through, communication network 108. Network 108 may include any communication network through which computer systems may exchange data. To exchange data using network 108, computer systems 102, 104 and 106 and network 108 may use various methods, protocols and standards, including, among others, token ring, ethernet, wireless ethernet, Bluetooth, TCP/IP, UDP, Http, FTP, SNMP, SMS, MMS, SS7, Json, Soap, and Corba. To ensure data transfer is secure, computer systems 102, 104 and 106 may transmit data via network 108 using a variety of security measures including TSL, SSL or VPN among other security techniques. While distributed computer system 100 illustrates three networked computer systems, distributed computer system 100 may include any number of computer systems and computing devices, networked using any medium and communication protocol.
Various aspects and functions in accordance with the present invention may be implemented as specialized hardware or software executing in one or more computer systems including computer system 102 shown in FIG. 1. As depicted, computer system 102 includes processor 110, memory 112, bus 114, interface 116 and storage 118. Processor 110 may perform a series of instructions that result in manipulated data. Processor 110 may be a commercially available processor such as an Intel Pentium, Motorola PowerPC, SGI MIPS, Sun UltraSPARC, or Hewlett-Packard PA-RISC processor, but may be any type of processor or controller as many other processors and controllers are available. Processor 110 is connected to other system elements, including one or more memory devices 112, by bus 114.
Memory 112 may be used for storing programs and data during operation of computer system 102. Thus, memory 112 may be a relatively high performance, volatile, random access memory such as a dynamic random access memory (DRAM) or static memory (SRAM). However, memory 112 may include any device for storing data, such as a disk drive or other non-volatile storage device. Various embodiments in accordance with the present invention may organize memory 112 into particularized and, in some cases, unique structures to perform the aspects and functions disclosed herein.
Components of computer system 102 may be coupled by an interconnection element such as bus 114. Bus 114 may include one or more physical busses, for example, busses between components that are integrated within a same machine, but may include any communication coupling between system elements including specialized or standard computing bus technologies such as IDE, SCSI, PCI and InfiniBand. Thus, bus 114 enables communications, for example, data and instructions, to be exchanged between system components of computer system 102.
Computer system 102 also includes one or more interface devices 116 such as input devices, output devices and combination input/output devices. Interface devices may receive input or provide output. More particularly, output devices may render information for external presentation. Input devices may accept information from external sources. Examples of interface devices include keyboards, mouse devices, trackballs, microphones, touch screens, printing devices, display screens, speakers, network interface cards, etc. Interface devices allow computer system 102 to exchange information and communicate with external entities, such as users and other systems.
Storage system 118 may include a computer readable and writeable nonvolatile storage medium in which instructions are stored that define a program to be executed by the processor. Storage system 118 also may include information that is recorded, on or in, the medium, and this information may be processed by the program. More specifically, the information may be stored in one or more data structures specifically configured to conserve storage space or increase data exchange performance. The instructions may be persistently stored as encoded signals, and the instructions may cause a processor to perform any of the functions described herein. The medium may, for example, be optical disk, magnetic disk or flash memory, among others. In operation, the processor or some other controller may cause data to be read from the nonvolatile recording medium into another memory, such as memory 112, that allows for faster access to the information by the processor than does the storage medium included in storage system 118. The memory may be located in storage system 118 or in memory 112, however, processor 110 may manipulate the data within the memory 112, and then copies the data to the medium associated with storage system 118 after processing is completed. A variety of components may manage data movement between the medium and integrated circuit memory element and the invention is not limited thereto. Further, the invention is not limited to a particular memory system or storage system.
Although computer system 102 is shown by way of example as one type of computer system upon which various aspects and functions in accordance with the present invention may be practiced, aspects of the invention are not limited to being implemented on the computer system as shown in FIG. 1. Various aspects and functions in accord with the present invention may be practiced on one or more computers having a different architectures or components than that shown in FIG. 1. For instance, computer system 102 may include specially-programmed, special-purpose hardware, such as for example, an application-specific integrated circuit (ASIC) tailored to perform a particular operation disclosed herein. While another embodiment may perform the same function using several general-purpose computing devices running MAC OS System X with Motorola PowerPC processors and several specialized computing devices running proprietary hardware and operating systems.
Computer system 102 may be a computer system including an operating system that manages at least a portion of the hardware elements included in computer system 102. Usually, a processor or controller, such as processor 110, executes an operating system which may be, for example, a Windows-based operating system, such as, Windows NT, Windows 2000 (Windows ME), Windows XP or Windows Vista operating systems, available from the Microsoft Corporation, a MAC OS System X operating system available from Apple Computer, one of many Linux-based operating system distributions, for example, the Enterprise Linux operating system available from Red Hat Inc., a Solaris operating system available from Sun Microsystems, or a UNIX operating system available from various sources. Many other operating systems may be used, and embodiments are not limited to any particular implementation.
The processor and operating system together define a computer platform for which application programs in high-level programming languages may be written. These component applications may be executable, intermediate, for example, C−, bytecode or interpreted code which communicates over a communication network, for example, the Internet, using a communication protocol, for example, TCP/IP. Similarly, aspects in accord with the present invention may be implemented using an object-oriented programming language, such as .Net, SmallTalk, Java, C++, Ada, or C# (C-Sharp). Other object-oriented programming languages may also be used. Alternatively, functional, scripting, or logical programming languages may be used.
Additionally, various aspects and functions in accordance with the present invention may be implemented in a non-programmed environment, for example, documents created in HTML, XML or other format that, when viewed in a window of a browser program, render aspects of a graphical-user interface or perform other functions. Further, various embodiments in accord with the present invention may be implemented as programmed or non-programmed elements, or any combination thereof. For example, a web page may be implemented using HTML while a data object called from within the web page may be written in C++. Thus, the invention is not limited to a specific programming language and any suitable programming language could also be used. Further, in at least one embodiment, the tool may be implemented using VBA Excel.
A computer system included within an embodiment may perform additional functions outside the scope of the invention. For instance, aspects of the system may be implemented using an existing commercial product, such as, for example, Database Management Systems such as SQL Server available from Microsoft of Seattle Wash., Oracle Database from Oracle of Redwood Shores, Calif., and MySQL from MySQL AB of Uppsala, Sweden or integration software such as Web Sphere middleware from IBM of Armonk, N.Y. However, a computer system running, for example, SQL Server may be able to support both aspects in accord with the present invention and databases for sundry applications not within the scope of the invention.
Example System Architecture
FIG. 2 presents a context diagram including physical and logical elements of distributed system 200. As shown, distributed system 200 is specially configured in accordance with the present invention. The system structure and content recited with regard to FIG. 2 is for exemplary purposes only and is not intended to limit the invention to the specific structure shown in FIG. 2. As will be apparent to one of ordinary skill in the art, many variant system structures can be architected without deviating from the scope of the present invention. The particular arrangement presented in FIG. 2 was chosen to promote clarity.
Information may flow between the elements, components and subsystems depicted in FIG. 2 using any technique. Such techniques include, for example, passing the information over the network via TCP/IP, passing the information between modules in memory and passing the information by writing to a file, database, or some other non-volatile storage device. Other techniques and protocols may be used without departing from the scope of the invention.
Referring to FIG. 2, system 200 includes user 202, interface 204, data center design and management system 206, communications network 208 and data center database 210. System 200 may allow user 202, such as a data center architect or other data center personnel, to interact with interface 204 to create or modify a model of one or more data center configurations. According to one embodiment, interface 204 may include aspects of the floor editor and the rack editor as disclosed in Patent Cooperation Treaty Application No. PCT/US08/63675, entitled METHODS AND SYSTEMS FOR MANAGING FACILITY POWER AND COOLING, filed on May 15, 2008, which is incorporated herein by reference in its entirety and is hereinafter referred to as PCT/US08/63675. In other embodiments, interface 204 may be implemented with specialized facilities that enable user 202 to design, in a drag and drop fashion, a model that includes a representation of the physical layout of a data center or any subset thereof. This layout may include representations of data center structural components as well as data center equipment. The features of interface 204, as may be found in various embodiments in accordance with the present invention, are discussed further below. In at least one embodiment, information regarding a data center is entered into system 200 through the interface, and assessments and recommendations for the data center are provided to the user. Further, in at least one embodiment, optimization processes may be performed to optimize cooling performance and energy usage of the data center.
As shown in FIG. 2, data center design and management system 206 presents data design interface 204 to user 202. According to one embodiment, data center design and management system 206 may include the data center design and management system as disclosed in PCT/US08/63675. In this embodiment, design interface 204 may incorporate functionality of the input module, the display module and the builder module included in PCT/US08/63675 and may use the database module to store and retrieve data.
As illustrated, data center design and management system 206 may exchange information with data center database 210 via network 208. This information may include any information required to support the features and functions of data center design and management system 206. For example, in one embodiment, data center database 210 may include at least some portion of the data stored in the data center equipment database described in PCT/US08/63675. In another embodiment, this information may include any information required to support interface 204, such as, among other data, the physical layout of one or more data center model configurations, the production and distribution characteristics of the cooling providers included in the model configurations, the consumption characteristics of the cooling consumers in the model configurations, and a listing of equipment racks and cooling providers to be included in a cluster.
In one embodiment, data center database 210 may store types of cooling providers, the amount of cool air provided by each type of cooling provider, and a temperature of cool air provided by the cooling provider. Thus, for example, data center database 210 includes records of a particular type of CRAC unit that is rated to deliver airflow at the rate of 5,600 cfm at a temperature of 68 degrees Fahrenheit. In addition, the data center database 210 may store one or more cooling metrics, such as inlet and outlet temperatures of the CRACs and inlet and outlet temperatures of one or more equipment racks. The temperatures may be periodically measured and input into the system, or in other embodiments, the temperatures may be continuously monitored using devices coupled to the system 200.
Data center database 210 may take the form of any logical construction capable of storing information on a computer readable medium including, among other structures, flat files, indexed files, hierarchical databases, relational databases or object oriented databases. The data may be modeled using unique and foreign key relationships and indexes. The unique and foreign key relationships and indexes may be established between the various fields and tables to ensure both data integrity and data interchange performance.
The computer systems shown in FIG. 2, which include data center design and management system 206, network 208 and data center equipment database 210, each may include one or more computer systems. As discussed above with regard to FIG. 1, computer systems may have one or more processors or controllers, memory and interface devices. The particular configuration of system 200 depicted in FIG. 2 is used for illustration purposes only and embodiments of the invention may be practiced in other contexts. Thus, embodiments of the invention are not limited to a specific number of users or systems.
In at least one embodiment, which will now be described, a tool is provided that predicts cooling performance for an improper hot aisle cluster in real time and displays results of the prediction along with a model of the improper cluster. FIG. 3 shows a model of an improper cluster of racks 300. The improper cluster includes two rows of racks A and B separated by a hot aisle 302. Each row includes racks R and coolers C. Row A includes 6 racks and 3 coolers and Row B includes 4 racks and 1 cooler. Row B also includes two gaps 304 and 306. In one embodiment, the racks are standard nineteen inch equipment racks having an overall width of 24 inches and the coolers have a width of 12 inches. However, embodiments of the invention may be used with racks and coolers of other sizes. Gap 304 is approximately two feet wide and gap 306, representing a difference in lengths of the Rows A and B, is approximately 4 feet wide. As shown in FIG. 3, in accordance with some embodiments, the results of the prediction of cooling performance may be displayed directly on the racks in the model. In FIG. 3, the results are shown as capture index (in percentage) on each of the racks in the model.
In embodiments of the invention, different performance metrics can be used to evaluate the cooling performance of an improper cluster. In one embodiment, the performance metric is capture index. Capture index, and methods of determining capture index are described in greater detail in the '109 and '300 applications referenced above. The cold-aisle capture index for a rack is defined in at least some embodiments as the fraction of air ingested by the rack which originates from local cooling resources (e.g., perforated floor tiles or local coolers). The hot-aisle capture index is defined as the fraction of air exhausted by a rack which is captured by local extracts (e.g., local coolers or return vents). CI therefore varies between 0 and 100% with better cooling performance generally indicated by greater CI values. In a cold-aisle analysis, high CI's ensure that the bulk of the air ingested by a rack comes from local cooling resources rather than being drawn from the room environment or from air which may have already been heated by electronics equipment. In this case, rack inlet temperatures will closely track the perforated-tile airflow temperatures and, assuming these temperatures are within the desired range, acceptable cooling will be achieved. In a hot-aisle analysis, high CI's ensure that rack exhaust is captured locally and there is little heating of the surrounding room environment.
While good (high) CI values typically imply good cooling performance; low CI values do not necessarily imply unacceptable cooling performance. For example, in a rack in a raised-floor environment which draws most of its airflow from the surrounding room environment rather than from the perforated tiles, the rack's cold-aisle CI will be low; however, if the surrounding room environment is sufficiently cool, the rack's inlet temperature may still be acceptable. In this case, the rack's cooling needs are met by the external room environment rather than perforated tiles within the rack's cluster. If this process is repeated many times across the data center, facility cooling will be complex and may be unpredictable. High CI values lead to inherently scalable cluster layouts and more predictable room environments.
In one embodiment, a tool operable on one or more computer systems described above determines capture index for racks of an improper cluster. In doing so, the improper cluster is first analyzed as a proper cluster, with all gaps and any row-length mismatches filled with blanking panels (or “dummy” racks with zero airflow). The capture index is determined for each of the racks in the proper cluster using any of a number of techniques for determining the CI, including the algebraic, neural network and PDA-CFD techniques described in the '109 and '300 applications referenced above.
Once the CI is determined for the proper cluster, a corrector model is applied to the results to correct for the negative effects created by gaps in the improper cluster. Gaps in the rows of an improper cluster provide an opening to allow air to escape from the aisle between the two rows in a cluster having a negative effect on the capture index. The corrector model determines the percentage of reduction of the CI for each rack in the improper cluster. The final CI for a rack i in an improper cluster can be expressed as follows using equation (1):

CIigap=CIiblank·(1−Correctori)  Equation (1)

where,

CIiblank is the “benchmark” CI value for rack i when all the gaps and row length mismatches in the cluster are replaced by blanking panels.
Correctori is the percentage reduction (expressed as a decimal value) of the CI of rack i.
In equations discussed herein, rack locations are designated as Ai and Bj. The designation A or B indicates which row the rack is contained in and the subscript i or j indicates the slot in the row containing the rack, which may be counted from left or right. For example, in the cluster of FIG. 3, Row A includes 6 racks and 3 coolers for a total of 9 objects or 30 6-inch slots and Row B includes 4 racks, one cooler and two gaps for a totally of 7 objects or 30 6-inch slots.
The CI corrector is related to the distance between the rack of interest and all the gaps in the improper cluster where each 6-inch “slot” (in an open “gap section” like 304 or 306 of FIG. 3) is typically considered one gap. In one embodiment, the percentage reduction of the CI value of a certain rack at location Ai can be adequately represented as follows:




  
    
      
        
          Corrector
          Ai
        
        =
        
          X
          ·
          
            
              
                
                  
                    
                      
                        ∑
                        j
                        
                          all
                          ⁢
                          
                            
                          
                          ⁢
                          gaps
                          ⁢
                          
                            
                          
                          ⁢
                          i
                          ⁢
                          
                            
                          
                          ⁢
                          n
                          ⁢
                          
                            
                          
                          ⁢
                          row
                          ⁢
                          
                            
                          
                          ⁢
                          A
                        
                      
                      ⁢
                      
                        
                      
                      ⁢
                      
                        e
                        
                          
                            
                              -
                              Y
                            
                            ·
                            Δ
                          
                          ⁢
                          
                            
                          
                          ⁢
                          
                            x
                            ⁡
                            
                              (
                              
                                i
                                ,
                                j
                              
                              )
                            
                          
                        
                      
                    
                    +
                  
                
              
              
                
                  
                    Z
                    ·
                    
                      
                        ∑
                        j
                        
                          all
                          ⁢
                          
                            
                          
                          ⁢
                          gaps
                          ⁢
                          
                            
                          
                          ⁢
                          i
                          ⁢
                          
                            
                          
                          ⁢
                          n
                          ⁢
                          
                            
                          
                          ⁢
                          row
                          ⁢
                          
                            
                          
                          ⁢
                          B
                        
                      
                      ⁢
                      
                        
                      
                      ⁢
                      
                        e
                        
                          
                            
                              -
                              Y
                            
                            ·
                            Δ
                          
                          ⁢
                          
                            
                          
                          ⁢
                          
                            x
                            ⁡
                            
                              (
                              
                                i
                                ,
                                j
                              
                              )
                            
                          
                        
                      
                    
                  
                
              
            
            
              
                
                  
                    
                      
                        ∑
                        j
                        
                          all
                          ⁢
                          
                            
                          
                          ⁢
                          objects
                          ⁢
                          
                            
                          
                          ⁢
                          i
                          ⁢
                          
                            
                          
                          ⁢
                          n
                          ⁢
                          
                            
                          
                          ⁢
                          row
                          ⁢
                          
                            
                          
                          ⁢
                          A
                        
                      
                      ⁢
                      
                        
                      
                      ⁢
                      
                        e
                        
                          
                            
                              -
                              Y
                            
                            ·
                            Δ
                          
                          ⁢
                          
                            
                          
                          ⁢
                          
                            x
                            ⁡
                            
                              (
                              
                                i
                                ,
                                j
                              
                              )
                            
                          
                        
                      
                    
                    +
                  
                
              
              
                
                  
                    Z
                    ·
                    
                      
                        ∑
                        j
                        
                          all
                          ⁢
                          
                            
                          
                          ⁢
                          objects
                          ⁢
                          
                            
                          
                          ⁢
                          i
                          ⁢
                          
                            
                          
                          ⁢
                          n
                          ⁢
                          
                            
                          
                          ⁢
                          row
                          ⁢
                          
                            
                          
                          ⁢
                          B
                        
                      
                      ⁢
                      
                        
                      
                      ⁢
                      
                        e
                        
                          
                            
                              -
                              Y
                            
                            ·
                            Δ
                          
                          ⁢
                          
                            
                          
                          ⁢
                          
                            x
                            ⁡
                            
                              (
                              
                                i
                                ,
                                j
                              
                              )
                            
                          
                        
                      
                    
                  
                
              
            
          
        
      
    
    
      
        Equation
        ⁢
        
          
        
        ⁢
        
          (
          2
          )
        
      
    
  




where,
CorrectorAi is the percentage reduction (expressed as a decimal value) of the CI of rack i in Row A
X, Y, and Z are empirical constants
Δx(i,j) is the horizontal distance between locations (slots) i and j.
In equation (2), the numerator is equal to zero when there are no gaps and hence the CorrectorAi becomes zero. In this case, the cluster is a proper cluster and no correction is needed. The closer a gap is to a rack, the larger the Corrector for that rack and hence the lower the CI of the rack. The empirical constants X, Y and Z can be determined by comparing the calculations for a large number of layouts to corresponding “benchmark” cases typically created by CFD simulation. The constants in the model are then adjusted to give the best overall agreement with the benchmark cases based on various metrics including CI.
The Corrector described herein can be applied to any type of improper cluster, which might include hot aisle improper clusters with row-based coolers and cold aisle improper clusters with row-based coolers and/or perforated tiles.
In one example, for hot aisle improper clusters with row-based coolers, constants X and Y are fixed for all cluster configurations, but constant Z varies with aisle width as shown in the table below. For a single-row improper cluster, Z is 2.







TABLE 1







Constants vs. Aisle Width for Hot Aisle Clusters with Row-Based


Coolers










Hot Aisle Width (ft)














Constant
3
4
5
6

















X
1
1
1
1



Y
0.073
0.073
0.073
0.073



Z
3
2.33
1.67
1










In one example, for cold aisle improper clusters with row-based coolers, constants X and Y are fixed for all cluster configurations, but the constant Z varies with aisle width as shown in the table below. For a single row improper cluster, Z is 2.







TABLE 2







Constants vs. Aisle Width for Cold Aisle Clusters with Row-Based


Coolers










Cold Aisle




Width (ft)











Constant
4
6















X
1
1



Y
0.123
0.123



Z
3
1










In one example, for cold aisle improper clusters with perforated tiles, constants X and Y are fixed for all cluster configurations, but constant Z varies with aisle width as shown in the table below. For a single row improper cluster, Z is 0.18.







TABLE 3







Constants vs. Aisle Width for Cold Aisle Clusters with Perforated Tiles










Cold Aisle




Width (ft)











Constant
4
6















X
1
1



Y
2.8
2.8



Z
0.1
0.05










In one example, for cold aisle improper clusters with both row-based coolers and perforated tiles, the calculation of constant X can be expressed as follows using equation (3):

X=α·XPT+(1−α)·XIR  Equation (3)

where, XPT is the constant X used in the cold-aisle-cluster-with-perforated-tiles applications for the same cold aisle width; XIR is the constant X used in the cold aisle cluster-with-row-based-coolers applications for the same cold aisle width; and α is the fraction of supply airflow delivered by the perforated tiles. Constants Y and Z are be determined in a similar manner.
It is noted that the effect of the presence of gaps on cooling performance is greater for layouts with row-based coolers than for raised floor applications due to the strong horizontal airflow patterns associated with row-based coolers.
FIG. 4 provides a flow chart of a process 400 for determining the CI for equipment racks of an improper cluster using the corrector model described above in accordance with one embodiment. First at stage 402 of the process 400, information regarding the layout for the improper cluster is loaded into the tool. The information may include power consumption values for each of the racks, cooling capacities of each of the coolers and location of the racks and coolers in the layout. At least some of the information may have previously been stored in a database contained in a computer system implementing the tool transmitted to the computer system via a network or loaded into the system by a user. At stage 404, gaps are identified in the improper cluster, and the gaps (including mismatches at the end of a row) are covered in the layout with blanking panels or replaced with racks having no airflow. The CI for each rack in the improper cluster is then determined (stage 406) using one of a number of techniques as discussed above. As part of stage 406, the Corrector for each rack is determined and applied to the CI. At stage 408, the model is then displayed (and may be printed) with the corrected CI for each of the racks. At stage 410, the process ends. In some embodiments, the displayed model may provide additional indications for out of tolerance CI values, such as warning labels or through the use of color codes. Further, in some embodiments, when an out of tolerance condition is indicated, a user may be prompted to rearrange the racks to find a more satisfactory solution.
In another embodiment, a tool for determining CI for equipment racks in improper hot aisle clusters utilizes an embedded algebraic model. This embedded algebraic model may be included within existing algebraic models (or similar models) for proper clusters or may be implemented as a stand alone tool. One example of an algebraic model with which the embedded algebraic model may be used is described in the '109 and '300 applications referenced above.
In the embedded algebraic model of one embodiment, airflow which passes through gaps is explicitly estimated in order to account for the unfavorable effects of gaps on the CI of each rack. In general, there are two types of airflows through any given gap: an inflow, Qgap in, and an outflow, Qgap out. Both “in” and “out” airflows may be simultaneously present in the same gap. The model of airflows used in at least one embodiment of the tool need not have a direct, accurate physical interpretation for the tool to be effective. In other words, if the “in” term computed by the tool is, for example, 375 cfm; it does not mean that the actual inflow through the gap must be 375 cfm for the tool to be effective. Rather, the use of the “in” and “out” flow terms allow for more degrees of freedom in the tool with which the tool may be “tuned.” The inflow, Qgap in, is determined by the cooler airflow rate as well as the distance between all the coolers and the gap. It has been found that the airflow rate which comes in through a gap i in row A into a hot aisle can be adequately represented as shown in Equation (4) below:




  
    
      
        
          
            (
            
              Q
              Ai
            
            )
          
          
            gap
            ⁢
            
              
            
            ⁢
            i
            ⁢
            
              
            
            ⁢
            n
          
        
        =
        
          
            
              ∑
              
                
                  all
                  ⁢
                  
                    
                  
                  ⁢
                  j
                
                ≠
                i
              
              
                all
                ⁢
                
                  
                
                ⁢
                coolers
                ⁢
                
                  
                
                ⁢
                j
                ⁢
                
                  
                
                ⁢
                i
                ⁢
                
                  
                
                ⁢
                n
                ⁢
                
                  
                
                ⁢
                Row
                ⁢
                
                  
                
                ⁢
                A
              
            
            ⁢
            
              
            
            ⁢
            
              
                
                  (
                  
                    Q
                    Aj
                  
                  )
                
                
                  cap
                  ⁢
                  
                    
                  
                  ⁢
                  self
                
              
              ·
              
                X
                1
              
              ·
              
                e
                
                  
                    
                      -
                      
                        Y
                        1
                      
                    
                    ·
                    Δ
                  
                  ⁢
                  
                    
                  
                  ⁢
                  
                    x
                    ⁡
                    
                      (
                      
                        i
                        ,
                        j
                      
                      )
                    
                  
                
              
            
          
          +
          
            
              X
              3
            
            ·
            
              
                ∑
                
                  
                    all
                    ⁢
                    
                      
                    
                    ⁢
                    j
                  
                  ≠
                  i
                
                
                  all
                  ⁢
                  
                    
                  
                  ⁢
                  coolers
                  ⁢
                  
                    
                  
                  ⁢
                  j
                  ⁢
                  
                    
                  
                  ⁢
                  i
                  ⁢
                  
                    
                  
                  ⁢
                  n
                  ⁢
                  
                    
                  
                  ⁢
                  Row
                  ⁢
                  
                    
                  
                  ⁢
                  B
                
              
              ⁢
              
                
              
              ⁢
              
                
                  
                    (
                    
                      Q
                      Bj
                    
                    )
                  
                  
                    cap
                    ⁢
                    
                      
                    
                    ⁢
                    self
                  
                
                ·
                
                  X
                  1
                
                ·
                
                  e
                  
                    
                      
                        -
                        
                          Y
                          1
                        
                      
                      ·
                      Δ
                    
                    ⁢
                    
                      
                    
                    ⁢
                    
                      x
                      ⁡
                      
                        (
                        
                          i
                          ,
                          j
                        
                        )
                      
                    
                  
                
              
            
          
        
      
    
    
      
        Equation
        ⁢
        
          
        
        ⁢
        
          (
          4
          )
        
      
    
  




where,
(QAi)gap in is the airflow rate that comes in through the gap at location Ai 
(QAj)cap self is the airflow rate captured by the cooler at location Aj 
(QBj)cap self is the airflow rate captured by the cooler at location Bj 
Δx(i,j) is the horizontal distance between locations (slots) i and j
X1 and Y1 are empirical constants and X3 is the empirical “coupling” constant accounting for effects from the opposite row.
Similarly, the outflow, Qgap out can be determined by the rack airflow rate as well as the distance between all the racks and the gap. It has been found that the airflow rate which leaves the hot aisle through a gap i in row A can be adequately represented as:




  
    
      
        
          
            (
            
              Q
              Ai
            
            )
          
          
            gap
            ⁢
            
              
            
            ⁢
            out
          
        
        =
        
          
            
              ∑
              
                
                  all
                  ⁢
                  
                    
                  
                  ⁢
                  j
                
                ≠
                i
              
              
                all
                ⁢
                
                  
                
                ⁢
                rack
                ⁢
                
                  
                
                ⁢
                j
                ⁢
                
                  
                
                ⁢
                i
                ⁢
                
                  
                
                ⁢
                n
                ⁢
                
                  
                
                ⁢
                Row
                ⁢
                
                  
                
                ⁢
                A
              
            
            ⁢
            
              
            
            ⁢
            
              
                
                  (
                  
                    Q
                    Aj
                  
                  )
                
                
                  sup
                  ⁢
                  
                    
                  
                  ⁢
                  self
                
              
              ·
              
                X
                2
              
              ·
              
                e
                
                  
                    
                      -
                      
                        Y
                        2
                      
                    
                    ·
                    Δ
                  
                  ⁢
                  
                    
                  
                  ⁢
                  
                    x
                    ⁡
                    
                      (
                      
                        i
                        ,
                        j
                      
                      )
                    
                  
                
              
            
          
          +
          
            
              Y
              3
            
            ·
            
              
                ∑
                
                  
                    all
                    ⁢
                    
                      
                    
                    ⁢
                    j
                  
                  ≠
                  i
                
                
                  all
                  ⁢
                  
                    
                  
                  ⁢
                  rack
                  ⁢
                  
                    
                  
                  ⁢
                  j
                  ⁢
                  
                    
                  
                  ⁢
                  i
                  ⁢
                  
                    
                  
                  ⁢
                  n
                  ⁢
                  
                    
                  
                  ⁢
                  Row
                  ⁢
                  
                    
                  
                  ⁢
                  B
                
              
              ⁢
              
                
              
              ⁢
              
                
                  
                    (
                    
                      Q
                      Bj
                    
                    )
                  
                  
                    sup
                    ⁢
                    
                      
                    
                    ⁢
                    self
                  
                
                ·
                
                  X
                  2
                
                ·
                
                  e
                  
                    
                      
                        -
                        
                          Y
                          2
                        
                      
                      ·
                      Δ
                    
                    ⁢
                    
                      
                    
                    ⁢
                    
                      x
                      ⁡
                      
                        (
                        
                          i
                          ,
                          j
                        
                        )
                      
                    
                  
                
              
            
          
        
      
    
    
      
        Equation
        ⁢
        
          
        
        ⁢
        
          (
          5
          )
        
      
    
  




where,
(QAi)gap out is the airflow rate that leaves through the gap at location Ai 
(QAj)sup self is the airflow rate supplied by the rack at location Aj 
(QBj)sup self is the airflow rate supplied by the rack at location Bj 
Δx(i,j) is the horizontal distance between locations (slots) i and j
X2 and Y2 are empirical constants and Y3 is the empirical “coupling” constant accounting for effects from the opposite row. The constants are, again, determined by comparing the calculations for a large number of layouts to corresponding “benchmark” cases typically created by CFD simulation. The constants in the model are then adjusted to give the best overall agreement with the benchmark cases based on various metrics including CI.
When calculating the net airflow that can be supplied to a particular location Ai using the current hot-aisle algebraic calculator, the tool accounts for the airflow which escapes the hot aisle through all the gaps. To accomplish this, two extra terms are subtracted from the equation to calculate the (QAj)cap net (from the '109 Application referenced above) one for row A and one for Row B as shown by Equation (6) below:




  
    
      
        
          
            (
            
              Q
              Ai
            
            )
          
          
            cap
            ⁢
            
              
            
            ⁢
            net
          
        
        =
        
          
            
              (
              
                Q
                Ai
              
              )
            
            
              cap
              ⁢
              
                
              
              ⁢
              self
            
          
          +
          
            
              ∑
              
                
                  
                    
                      
                        all
                        ⁢
                        
                          
                        
                        ⁢
                        j
                      
                      ≠
                      i
                    
                  
                
                
                  
                    
                      and
                      ⁢
                      
                        
                      
                      ⁢
                      j
                      ⁢
                      
                        
                      
                      ⁢
                      is
                      ⁢
                      
                        
                      
                      ⁢
                      not
                      ⁢
                      
                        
                      
                      ⁢
                      a
                      ⁢
                      
                        
                      
                      ⁢
                      gap
                    
                  
                
              
            
            ⁢
            
              
            
            ⁢
            
              
                
                  (
                  
                    Q
                    Aj
                  
                  )
                
                
                  cap
                  ⁢
                  
                    
                  
                  ⁢
                  self
                
              
              ·
              A
              ·
              
                e
                
                  
                    -
                    B
                  
                  ⁢
                  
                    
                  
                  ⁢
                  Δ
                  ⁢
                  
                    
                  
                  ⁢
                  
                    x
                    ⁡
                    
                      (
                      
                        i
                        ,
                        j
                      
                      )
                    
                  
                
              
            
          
          -
          
            
              ∑
              
                
                  
                    
                      
                        all
                        ⁢
                        
                          
                        
                        ⁢
                        j
                      
                      ≠
                      i
                    
                  
                
                
                  
                    
                      and
                      ⁢
                      
                        
                      
                      ⁢
                      j
                      ⁢
                      
                        
                      
                      ⁢
                      is
                      ⁢
                      
                        
                      
                      ⁢
                      a
                      ⁢
                      
                        
                      
                      ⁢
                      gap
                    
                  
                
              
            
            ⁢
            
              
            
            ⁢
            
              
                
                  (
                  
                    Q
                    Aj
                  
                  )
                
                
                  gap
                  ⁢
                  
                    
                  
                  ⁢
                  out
                
              
              ·
              
                X
                4
              
              ·
              
                e
                
                  
                    
                      -
                      
                        Y
                        4
                      
                    
                    ·
                    Δ
                  
                  ⁢
                  
                    
                  
                  ⁢
                  
                    x
                    ⁡
                    
                      (
                      
                        i
                        ,
                        j
                      
                      )
                    
                  
                
              
            
          
          +
          
            C
            ·
            
              {
              
                
                  
                    (
                    
                      Q
                      Bi
                    
                    )
                  
                  
                    cap
                    ⁢
                    
                      
                    
                    ⁢
                    self
                  
                
                +
                
                  
                    ∑
                    
                      
                        
                          
                            
                              all
                              ⁢
                              
                                
                              
                              ⁢
                              j
                            
                            ≠
                            i
                          
                        
                      
                      
                        
                          
                            and
                            ⁢
                            
                              
                            
                            ⁢
                            j
                            ⁢
                            
                              
                            
                            ⁢
                            is
                            ⁢
                            
                              
                            
                            ⁢
                            not
                            ⁢
                            
                              
                            
                            ⁢
                            a
                            ⁢
                            
                              
                            
                            ⁢
                            gap
                          
                        
                      
                    
                  
                  ⁢
                  
                    
                  
                  ⁢
                  
                    
                      
                        (
                        
                          Q
                          Bj
                        
                        )
                      
                      
                        cap
                        ⁢
                        
                          
                        
                        ⁢
                        self
                      
                    
                    ·
                    A
                    ·
                    
                      e
                      
                        
                          -
                          B
                        
                        ⁢
                        
                          
                        
                        ⁢
                        Δ
                        ⁢
                        
                          
                        
                        ⁢
                        
                          x
                          ⁡
                          
                            (
                            
                              i
                              ,
                              j
                            
                            )
                          
                        
                      
                    
                  
                
                -
                
                  
                    ∑
                    
                      
                        
                          
                            
                              all
                              ⁢
                              
                                
                              
                              ⁢
                              j
                            
                            ≠
                            i
                          
                        
                      
                      
                        
                          
                            and
                            ⁢
                            
                              
                            
                            ⁢
                            j
                            ⁢
                            
                              
                            
                            ⁢
                            is
                            ⁢
                            
                              
                            
                            ⁢
                            a
                            ⁢
                            
                              
                            
                            ⁢
                            gap
                          
                        
                      
                    
                  
                  ⁢
                  
                    
                  
                  ⁢
                  
                    
                      
                        (
                        
                          Q
                          Bj
                        
                        )
                      
                      
                        gap
                        ⁢
                        
                          
                        
                        ⁢
                        out
                      
                    
                    ·
                    
                      X
                      4
                    
                    ·
                    
                      e
                      
                        
                          
                            -
                            
                              Y
                              4
                            
                          
                          ·
                          Δ
                        
                        ⁢
                        
                          
                        
                        ⁢
                        
                          x
                          ⁡
                          
                            (
                            
                              i
                              ,
                              j
                            
                            )
                          
                        
                      
                    
                  
                
              
              }
            
          
        
      
    
    
      
        Equation
        ⁢
        
          
        
        ⁢
        
          (
          6
          )
        
      
    
  




where,
(QAi)cap net is the net maximum airflow that can be captured at location Ai including contributions from all coolers in the cluster
(QAj)cap self is the airflow captured by the cooler at location Aj 
(QBj)cap self is the airflow captured by the cooler at location Bj 
(QAj)gap out is the airflow rate that leaves through the gap at location Aj 
(QBj)gap out is the airflow rate that leaves through the gap at location Bj 
Δx(i,j) is the horizontal distance between locations (slots) i and j
A, B, X4, and Y4 are empirical constants
C is an empirical “coupling” constant accounting for effects from the opposite row
Similarly, the airflow which enters the hot aisle through gaps can also be accounted for by adding two extra terms, Qgap in one for row A and one for row B, when calculating the (QAj)sup net as shown by Equation (7) below:




  
    
      
        
          
            (
            
              Q
              Ai
            
            )
          
          
            sup
            ⁢
            
              
            
            ⁢
            net
          
        
        =
        
          
            
              (
              
                Q
                Ai
              
              )
            
            
              sup
              ⁢
              
                
              
              ⁢
              self
            
          
          +
          
            
              ∑
              
                
                  
                    
                      
                        all
                        ⁢
                        
                          
                        
                        ⁢
                        j
                      
                      ≠
                      i
                    
                  
                
                
                  
                    
                      and
                      ⁢
                      
                        
                      
                      ⁢
                      j
                      ⁢
                      
                        
                      
                      ⁢
                      is
                      ⁢
                      
                        
                      
                      ⁢
                      not
                      ⁢
                      
                        
                      
                      ⁢
                      a
                      ⁢
                      
                        
                      
                      ⁢
                      gap
                    
                  
                
              
            
            ⁢
            
              
            
            ⁢
            
              
                
                  (
                  
                    Q
                    Aj
                  
                  )
                
                
                  sup
                  ⁢
                  
                    
                  
                  ⁢
                  self
                
              
              ·
              E
              ·
              
                e
                
                  
                    -
                    F
                  
                  ⁢
                  
                    
                  
                  ⁢
                  Δ
                  ⁢
                  
                    
                  
                  ⁢
                  
                    x
                    ⁡
                    
                      (
                      
                        i
                        ,
                        j
                      
                      )
                    
                  
                
              
            
          
          +
          
            
              ∑
              
                
                  
                    
                      
                        all
                        ⁢
                        
                          
                        
                        ⁢
                        j
                      
                      ≠
                      i
                    
                  
                
                
                  
                    
                      and
                      ⁢
                      
                        
                      
                      ⁢
                      j
                      ⁢
                      
                        
                      
                      ⁢
                      is
                      ⁢
                      
                        
                      
                      ⁢
                      a
                      ⁢
                      
                        
                      
                      ⁢
                      gap
                    
                  
                
              
            
            ⁢
            
              
            
            ⁢
            
              
                
                  (
                  
                    Q
                    Aj
                  
                  )
                
                
                  gap
                  ⁢
                  
                    
                  
                  ⁢
                  i
                  ⁢
                  
                    
                  
                  ⁢
                  n
                
              
              ·
              
                X
                5
              
              ·
              
                e
                
                  
                    
                      -
                      
                        Y
                        5
                      
                    
                    ·
                    Δ
                  
                  ⁢
                  
                    
                  
                  ⁢
                  
                    x
                    ⁡
                    
                      (
                      
                        i
                        ,
                        j
                      
                      )
                    
                  
                
              
            
          
          +
          
            D
            ·
            
              {
              
                
                  
                    (
                    
                      Q
                      Bi
                    
                    )
                  
                  
                    sup
                    ⁢
                    
                      
                    
                    ⁢
                    self
                  
                
                +
                
                  
                    ∑
                    
                      
                        
                          
                            
                              all
                              ⁢
                              
                                
                              
                              ⁢
                              j
                            
                            ≠
                            i
                          
                        
                      
                      
                        
                          
                            and
                            ⁢
                            
                              
                            
                            ⁢
                            j
                            ⁢
                            
                              
                            
                            ⁢
                            is
                            ⁢
                            
                              
                            
                            ⁢
                            not
                            ⁢
                            
                              
                            
                            ⁢
                            a
                            ⁢
                            
                              
                            
                            ⁢
                            gap
                          
                        
                      
                    
                  
                  ⁢
                  
                    
                  
                  ⁢
                  
                    
                      
                        (
                        
                          Q
                          Bj
                        
                        )
                      
                      
                        sup
                        ⁢
                        
                          
                        
                        ⁢
                        self
                      
                    
                    ·
                    E
                    ·
                    
                      e
                      
                        
                          -
                          F
                        
                        ⁢
                        
                          
                        
                        ⁢
                        Δ
                        ⁢
                        
                          
                        
                        ⁢
                        
                          x
                          ⁡
                          
                            (
                            
                              i
                              ,
                              j
                            
                            )
                          
                        
                      
                    
                  
                
                +
                
                  
                    ∑
                    
                      
                        
                          
                            
                              all
                              ⁢
                              
                                
                              
                              ⁢
                              j
                            
                            ≠
                            i
                          
                        
                      
                      
                        
                          
                            and
                            ⁢
                            
                              
                            
                            ⁢
                            j
                            ⁢
                            
                              
                            
                            ⁢
                            is
                            ⁢
                            
                              
                            
                            ⁢
                            a
                            ⁢
                            
                              
                            
                            ⁢
                            gap
                          
                        
                      
                    
                  
                  ⁢
                  
                    
                  
                  ⁢
                  
                    
                      
                        (
                        
                          Q
                          Bj
                        
                        )
                      
                      
                        gap
                        ⁢
                        
                          
                        
                        ⁢
                        i
                        ⁢
                        
                          
                        
                        ⁢
                        n
                      
                    
                    ·
                    
                      X
                      5
                    
                    ·
                    
                      e
                      
                        
                          
                            -
                            
                              Y
                              5
                            
                          
                          ·
                          Δ
                        
                        ⁢
                        
                          
                        
                        ⁢
                        
                          x
                          ⁡
                          
                            (
                            
                              i
                              ,
                              j
                            
                            )
                          
                        
                      
                    
                  
                
              
              }
            
          
        
      
    
    
      
        Equation
        ⁢
        
          
        
        ⁢
        
          (
          7
          )
        
      
    
  




where,
(QAi)sup net is the net maximum airflow that can be supplied to location Ai including contributions from all racks in the cluster
(QAj)sup self is the airflow supplied by the rack at location Aj 
(QBj)sup self is the airflow supplied by the rack at location Bj 
(QAj)gap in is the airflow rate that comes in through the gap at location Aj 
(QBj)gap in is the airflow rate that comes in through the gap at location Bj 
Δx(i,j) is the horizontal distance between locations (slots) i and j
E, F, X5, and Y5 are empirical constants
D is an empirical “coupling” constant accounting for effects from the opposite row
All the empirical constants can be determined by comparing the calculations for a large number of layouts to corresponding “benchmark” cases typically created by CFD simulation. The constants in the model are then adjusted to give the best overall agreement with the benchmark cases based on various metrics including CI.
In one example, empirical constants are determined as shown in the following table:







TABLE 4





Constants of Imbedded Model for Hot Aisle Clusters




















X1
1.000
Y1
12.736



X2
1.000
Y2
2.486



X3
10.517
Y3
0.018



X4
1.000
Y4
0.019



X5
1.000
Y5
8.548










The CI is then equal to the ratio of net airflow captured and net airflow supplied at any location expressed as a percentage with values capped at 100%.
In the embodiments above, an embedded algebraic model is provided for determining capture index for equipment racks in the hot aisle of an improper cluster of racks. As readily understood by one of ordinary skill in the art, analogous models may be created for determining the capture index for equipment racks in other layouts including cold aisles with row-based coolers, cold aisles with perforated tiles, and cold aisles with both row-based coolers and perforated tiles.
Using the algebraic method described above, the CI for racks in an improper cluster may be determined. The results of the analysis can then be used to layout equipment in a data center as described above or to rearrange the layout to ensure that specified cooling requirements are met.
In one embodiment, calculations are typically performed for every 6-inch slot along both rows of a cluster so that the tool may be used with standard-width equipment racks; results are averaged over the actual entire rack width before being presented.
In methods of at least one embodiment of the invention, after successful modeling of an improper cluster, the results of the model may be used as part of a system to order equipment, ship equipment and install equipment in a data center.
In at least some embodiments of the invention discussed herein, the performance of assessments and calculations in real-time refers to processes that are completed in a matter of a few seconds or less rather than several minutes or longer as can happen with complex calculations, such as those involving typical CFD calculations.
Having thus described several aspects of at least one embodiment of this invention, it is to be appreciated various alterations, modifications, and improvements will readily occur to those skilled in the art. Such alterations, modifications, and improvements are intended to be part of this disclosure, and are intended to be within the spirit and scope of the invention. Accordingly, the foregoing description and drawings are by way of example only.

## Claims

1. A computer-implemented method for evaluating equipment in an improper cluster in a data center, the equipment including a plurality of equipment racks, and at least one cooling provider, the method comprising:
receiving, by a computer system, data regarding each of the plurality of equipment racks and the at least one cooling provider, the data including a layout of the improper cluster of equipment racks and the at least one cooling provider;
storing the received data;
identifying at least one gap in the layout;
determining a performance metric for the at least one of the plurality of equipment racks;
determining a corrector value based on characteristics of the at least one gap;
applying the corrector value to the performance metric for the at least one of the plurality of equipment racks;
determining, by the computer system, cooling performance of at least one of the plurality of equipment racks based, at least in part, on the corrector value and the characteristics of the at least one gap; and
displaying the layout of the data center, wherein the layout includes an indication of the cooling performance of the at least one of the plurality of equipment racks.

2. The computer-implemented method of claim 1, wherein determining the performance metric includes determining a capture index for the at least one of the plurality of equipment racks.

3. The computer-implemented method of claim 2, further comprising determining the capture index for each of the plurality of equipment racks based, at least in part, on characteristics of the at least one gap.

4. The computer-implemented method of claim 3, wherein determining capture index includes determining airflow through the at least one gap.

5. The computer-implemented method of claim 4, wherein determining airflow includes determining airflow out of an aisle of the improper cluster through the at least one gap, and determining airflow into the aisle through the at least one gap.

6. The computer-implemented method of claim 1, wherein determining the performance metric includes determining a value for capture index for the at least one of the plurality of equipment racks with each gap in the layout modeled as a blank panel.

7. The computer-implemented method of claim 6, further comprising applying the corrector value to the value for capture index for the at least one of the plurality of equipment racks.

8. The computer-implemented method of claim 7, further comprising positioning the equipment in the data center in accordance with the layout.

9. The computer-implemented method of claim 4, further comprising positioning the equipment in the data center in accordance with the layout.

10. A system for evaluating equipment in an improper cluster in a data center, the equipment including a plurality of equipment racks, and at least one cooling provider, the system comprising:
an interface; and
a controller configured to:
receive data regarding each of the plurality of equipment racks and the at least one cooling provider, the data including a layout of the improper cluster of equipment racks and the at least one cooling provider;
store the received data in the system;
identify at least one gap in the layout;
determine a performance metric for the at least one of the plurality of equipment racks;
determine a corrector value based on characteristics of the at least one gap;
apply the corrector value to the performance metric for the at least one of the plurality of equipment racks; and
determine cooling performance of at least one of the plurality of equipment racks based, at least in part, on the corrector value and the characteristics of the at least one gap.

11. The system of claim 10, further comprising a display coupled to the controller, and wherein the controller is further configured to display the layout of the data center, wherein the layout includes an indication of the cooling performance of the at least one of the plurality of equipment racks.

12. The system of claim 11, wherein the controller is configured to determine the performance metric for the at least one of the plurality of equipment racks by determining a capture index for the at least one of the plurality of equipment racks.

13. The system of claim 12, wherein the controller is further configured to determine the capture index for each of the plurality of equipment racks based, at least in part, on characteristics of the at least one gap.

14. The system of claim 13, wherein the controller is configured to determine airflow through the at least one gap.

15. The system of claim 14, wherein the controller is further configured to determine airflow out of an aisle of the improper cluster through the at least one gap, and determine airflow into the aisle through the at least one gap.

16. The system of claim 10, wherein the controller is configured to determine the performance metric by determining a value for capture index for the at least one of the plurality of equipment racks with each gap in the layout modeled as a blank panel.

17. The system of claim 16, wherein the controller is further configured to apply the corrector value to the value for capture index for the at least one of the plurality of equipment racks.

18. A non-transitory computer readable medium having stored thereon sequences of instructions including instructions that will cause a processor to:
receive data regarding a layout of an improper cluster of equipment racks and at least one cooling provider;
store the received data;
identify at least one gap in the layout;
determine a performance metric for the at least one of the plurality of equipment racks;
determine a corrector value based on characteristics of the at least one gap;
apply the corrector value to the performance metric for the at least one of the plurality of equipment racks; and
determine cooling performance of at least one of the plurality of equipment racks based, at least in part, on the corrector value and the characteristics of the at least one gap.

19. The non-transitory computer readable medium of claim 18, wherein the sequences of instruction further include instructions that will cause the processor to:
display the layout of the data center on a display associated with the processor, wherein the layout includes an indication of the cooling performance of the at least one of the plurality of equipment racks.

20. The non-transitory computer readable medium of claim 19, wherein the sequences of instruction further include instructions that will cause the processor to determine the performance metric by determining a capture index for the at least one of the plurality of equipment racks.