Rack arrangement method, electronic equipment, storage medium and program product

Through the automatic computer rack layout solution in complex computer room scenarios, the problems of low efficiency and low fault tolerance in the existing technology are solved, and the rack layout automation in complex scenarios is realized, and the work efficiency and resource utilization rate are improved. .

CN118982122APending Publication Date: 2024-11-19CHINA UNITED NETWORK COMM GRP CO LTD +1
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202411194819.6
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-08-28
Publication Date
2024-11-19

AI Technical Summary

Technical Problem

The prior art is difficult to automatically arrange the computer racks in complex computer rooms in the case of complex computer rooms, resulting in low efficiency and low fault tolerance, and the inability to effectively utilize the computer room space.

Method used

By determining the rack placement area in the computer room, combining rack parameters and preset layout algorithms, the automatic computer rack layout scheme includes determining the number and location of free racks that can be placed, adapting to rack layout in complex scenarios need.

Benefits of technology

It improves work efficiency and fault tolerance, and can automatically calculate the optimal rack layout plan in complex scenarios without manual judgment, maximizing the potential of the computer room space and helping decision makers optimize resource planning.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118982122A_ABST
    Figure CN118982122A_ABST
Patent Text Reader

Abstract

The invention provides a rack arrangement method, electronic equipment, a storage medium and a program product, relates to the technical field of computers, and is used for efficiently calculating rack arrangement positions in a complex scene. The method comprises the following steps: determining a rack placement area in a machine room; determining a rack arrangement scheme according to the position information of the rack placement area, the position information of a first object existing in the machine room, the rack parameters and a preset arrangement algorithm; wherein the preset arrangement algorithm is used for determining the maximum number of idle racks which can be placed in the rack placement area and the positions where the idle racks can be placed.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the field of computer technology, and in particular to a rack arrangement method, an electronic device, a storage medium, and a program product. Background Art

[0002] Idle space calculation in computer room management is an important part of ensuring efficient use and optimization of data center resources. With the continuous increase in business and equipment, it is necessary to simplify the equipment belonging to multiple computer rooms into a small number of computer rooms. It is particularly important to reasonably allocate and efficiently use computer room space.

[0003] Among them, by automatically calculating the number and location of racks that can be placed in the computer room, the expansion potential of the computer room space can be counted to better control costs, efficiently manage equipment, and help decision makers plan and optimize resources.

[0004] However, the relevant technology can only automatically calculate the number and location of racks that can be placed in an empty computer room. For complex scenarios where there are already objects in the computer room, the computer room is often first 3D modeled and displayed in the data center management system. Designers manually judge and place idle racks based on the current layout of the racks in the computer room, which is inefficient and has a low fault tolerance rate. Summary of the invention

[0005] The present application provides a rack arrangement method, electronic equipment, storage medium and program product, which are used to automatically and efficiently calculate rack arrangement positions in complex scenarios.

[0006] In a first aspect, the present application provides a rack arrangement method, comprising: determining a rack placement area in a computer room; determining a rack arrangement plan based on location information of the rack placement area, location information of a first object in the computer room, rack parameters, and a preset arrangement algorithm; wherein the rack arrangement plan is used to indicate the maximum number of idle racks that can be placed in the rack placement area, and the locations where the idle racks can be placed.

[0007] It is understandable that the rack arrangement method provided by the present application can determine the existing spatial layout of the computer room when there are other objects in the computer room, and then, based on the existing layout space, automatically calculate the placement positions and maximum placement number of standard idle racks based on the preset arrangement algorithm. In this way, the rack arrangement method provided by the present application can automatically calculate the optimal rack arrangement scheme in a complex computer room scenario where there are other objects, without the need for personnel to judge the placement of racks, thereby improving work efficiency and fault tolerance.

[0008] In a possible implementation, the rack arrangement plan includes at least one of the following: a maximum number of idle racks that can be placed in each row of racks in the rack placement area, and positions where the idle racks can be placed; a maximum number of idle racks that can be placed between rows in the rack placement area, and positions where the idle racks can be placed; a maximum number of idle racks that can be placed between the first row and the last row in the rack placement area and the wall, respectively, and positions where the idle racks can be placed.

[0009] Another possible implementation method is to determine the rack arrangement plan based on the position information of the rack placement area, the position information of the first object already existing in the computer room, the rack parameters and the preset arrangement algorithm, including: determining the position information of the second object existing in the rack placement area based on the intersection of the position information of the rack placement area and the position information of the first object; sorting the second objects based on the position information of the second objects to determine the number of rack rows existing in the rack placement area; determining the rack arrangement plan based on the position information of the rack placement area, the position information of the second object, the number of rack rows, the rack parameters and the preset arrangement algorithm.

[0010] Another possible implementation manner is to aggregate adjacent racks for each row of racks in the rack placement area when the distance between adjacent racks is less than a preset threshold.

[0011] Another possible implementation method is to determine an initial area, where the distance between the boundary of the initial area and the wall of the computer room is greater than or equal to a first preset distance; and perform recursive judgment based on the position information of the initial area, the position information of the racks in the computer room, and the position information of non-rack objects in the computer room to determine the rack placement area.

[0012] Another possible implementation manner is to determine whether the initial area includes all racks in the computer room based on the location information of the initial area and the location information of the racks in the computer room; if the initial area includes all racks in the computer room, determine whether the initial area intersects with the non-rack objects based on the location information of the initial area and the location information of the non-rack objects in the computer room; if the initial area intersects with the non-rack objects, adjust the boundary of the initial area to obtain a rack placement area that does not intersect with the non-rack objects.

[0013] Another possible implementation manner is, when the initial area does not include all racks in the computer room, adjusting the boundary of the initial area to obtain a second area including all racks in the computer room; determining whether the second area intersects with the non-rack object based on position information of the second area and position information of the non-rack object in the computer room; and when the second area intersects with the non-rack object, adjusting the boundary of the second area to obtain a rack placement area that does not intersect with the non-rack object.

[0014] In a second aspect, the present application provides a rack arrangement device, including: a determination module, used to determine a rack placement area in a computer room; determine a rack arrangement plan based on location information of the rack placement area, location information of a first object in the computer room, rack parameters and a preset arrangement algorithm; wherein the rack arrangement plan is used to indicate the maximum number of idle racks that can be placed in the rack placement area, and the locations where the idle racks can be placed.

[0015] In a possible implementation, the rack arrangement plan includes at least one of the following: a maximum number of idle racks that can be placed in each row of racks in the rack placement area, and positions where the idle racks can be placed; a maximum number of idle racks that can be placed between rows in the rack placement area, and positions where the idle racks can be placed; a maximum number of idle racks that can be placed between the first row and the last row in the rack placement area and the wall, respectively, and positions where the idle racks can be placed.

[0016] Another possible implementation method is to determine the module, which is specifically used to determine the position information of a second object in the rack placement area based on the intersection of the position information of the rack placement area and the position information of the first object; sort the second objects according to the position information of the second objects to determine the number of rack rows in the rack placement area; and determine the rack arrangement plan according to the position information of the rack placement area, the position information of the second object, the number of rack rows, rack parameters and a preset arrangement algorithm.

[0017] In another possible implementation, the rack arrangement device further includes: a processing module, configured to aggregate adjacent racks for each row of racks in the rack placement area when a distance between adjacent racks is less than a preset threshold.

[0018] Another possible implementation method is to determine a module that is specifically used to determine an initial area, where the distance between the boundary of the initial area and the wall of the computer room is greater than or equal to a first preset distance; and to perform recursive judgment based on location information of the initial area, location information of racks in the computer room, and location information of non-rack objects in the computer room to determine the rack placement area.

[0019] Another possible implementation manner is a determination module, which is specifically used to determine whether the initial area includes all racks in the computer room based on location information of the initial area and location information of racks in the computer room; when the initial area includes all racks in the computer room, determine whether the initial area intersects with the non-rack objects based on the location information of the initial area and location information of non-rack objects in the computer room; when the initial area intersects with the non-rack objects, adjust the boundary of the initial area to obtain a rack placement area that does not intersect with the non-rack objects.

[0020] In another possible implementation manner, the determination module is specifically configured to adjust the boundary of the initial area to obtain a second area including all the racks in the computer room when the initial area does not include all the racks in the computer room; determine whether the second area intersects with the non-rack object based on position information of the second area and position information of the non-rack object in the computer room; and when the second area intersects with the non-rack object, adjust the boundary of the second area to obtain a rack placement area that does not intersect with the non-rack object.

[0021] In a third aspect, the present application provides an electronic device, comprising: a processor and a memory; the memory stores instructions executable by the processor; when the processor is configured to execute the instructions, the electronic device implements the method of the first aspect above.

[0022] In a fourth aspect, the present application provides a computer-readable storage medium, which includes: computer software instructions; when the computer software instructions are executed in an electronic device, the electronic device implements the method of the first aspect above.

[0023] In a fifth aspect, the present application provides a computer program product, which includes a computer program; when the computer program runs in an electronic device, the electronic device implements the method of the first aspect.

[0024] The beneficial effects of the second to fifth aspects mentioned above refer to the corresponding description of the first aspect and will not be repeated here. BRIEF DESCRIPTION OF THE DRAWINGS

[0025] Figure 1 A schematic diagram of a process flow of a rack arrangement method provided in this application;

[0026] Figure 2 A schematic diagram of a flow chart for determining an available area provided for this application;

[0027] Figure 3 A schematic diagram of a process for determining the location information of an existing object provided by this application;

[0028] Figure 4 A schematic diagram of cabinets provided for this application;

[0029] Figure 5 A schematic diagram of idle rack calculation provided for this application;

[0030] Figure 6 A row spacing schematic diagram provided for this application;

[0031] Figure 7 A schematic diagram of rack aggregation provided for this application;

[0032] Figure 8A schematic diagram of a post-aggregation rack provided for this application;

[0033] Fig. 9 A schematic diagram of the composition of a rack arrangement device provided in this application;

[0034] Fig.10 A schematic diagram of the composition of an electronic device provided in this application. DETAILED DESCRIPTION

[0035] A rack arrangement method provided by the present application will be described in detail below with reference to the accompanying drawings.

[0036] The term "and / or" in this article is merely a description of the association relationship of associated objects, indicating that three relationships may exist. For example, A and / or B can mean: A exists alone, A and B exist at the same time, and B exists alone.

[0037] The terms "first" and "second" and the like in the specification and drawings of this application are used to distinguish different objects, or to distinguish different processing of the same object, rather than to describe a specific order of objects.

[0038] In addition, the terms "including" and "having" and any variations thereof mentioned in the description of the present application are intended to cover non-exclusive inclusions. For example, a process, method, system, product or device that includes a series of steps or units is not limited to the listed steps or units, but may optionally include other steps or units that are not listed, or may optionally include other steps or units that are inherent to these processes, methods, products or devices.

[0039] It should be noted that, in the embodiments of the present application, words such as "exemplary" or "for example" are used to indicate examples, illustrations or descriptions. Any embodiment or design described as "exemplary" or "for example" in the embodiments of the present application should not be interpreted as being more preferred or more advantageous than other embodiments or designs. Specifically, the use of words such as "exemplary" or "for example" is intended to present related concepts in a specific way.

[0040] In order to facilitate the clear description of the technical solutions of the embodiments of the present application, in the embodiments of the present application, the words "first", "second", etc. are used to distinguish the same items or similar items with basically the same functions and effects. Those skilled in the art can understand that the words "first", "second", etc. are not limiting the quantity and execution order.

[0041] In the description of the present application, unless otherwise specified, “plurality” means two or more.

[0042] Calculating the position of free racks in computer room management is an important part of ensuring efficient utilization and optimization of data center resources. Computer rooms usually contain multiple racks, each of which contains several U (unit height) for installing servers, storage devices and network devices. As business needs grow, the number of equipment in computer rooms continues to increase, and how to reasonably allocate and utilize rack space becomes particularly important. By automatically calculating the maximum number and position of racks that can be placed in a computer room, the potential of computer room space can be expanded to better control costs and efficiently manage equipment.

[0043] At present, the automatic placement of cabinets in the computer room scenario focuses on the planning scheme before the computer room is used, and does not consider the impact of existing objects in the computer room on the layout and position of the entire computer room rack. The home decoration industry also has similar methods for completing the placement of indoor items, but the applicable scenario is how to better place various furniture to reduce decoration costs and improve the aesthetics of the room. The computer room scenario focuses on the utilization of space, so it is not applicable.

[0044] In the prior art, the layout of the computer room is more of a 3D display to the administrator. The administrator manually determines and draws the free racks according to the location, which is labor-intensive and inefficient. In addition, many computer rooms are large and have many devices. In addition to the racks, there are other obstructions such as air-conditioning cabinets, power cabinets, and columns. The scenes are numerous and complex, making it difficult to make manual judgments. In addition, there are also indoor object layout methods based on machine learning, but they require many training samples and consider how to redistribute objects such as furniture in an unlayed room, rather than calculating based on the current status of the indoor space.

[0045] In response to the above technical problems, the present application provides a rack arrangement method, the idea of ​​which is to: determine the rack placement area in the computer room; determine the rack arrangement plan according to the position information of the rack placement area, the position information of the first object in the computer room, the rack parameters and the preset arrangement algorithm; wherein the preset arrangement algorithm is used to determine the maximum number of idle racks that can be placed in the rack placement area, and the positions where the idle racks can be placed. It can be understood that the rack arrangement method provided by the present application can determine the existing spatial layout of the computer room when there are other objects in the computer room, and then, based on the existing layout space, automatically calculate the placement position and maximum number of standard idle racks based on the preset arrangement algorithm. In this way, the optimal rack arrangement plan can be automatically calculated in a complex computer room scenario where other objects exist, without the need for personnel to judge the placement of racks, thereby improving work efficiency and fault tolerance.

[0046] The embodiments provided in this application are described in detail below in conjunction with the accompanying drawings.

[0047] The rack arrangement method provided in this application can be applied to electronic equipment.

[0048] Exemplarily, the electronic device may be a server, such as a server cluster consisting of multiple servers, or a single server, or a computer, or a processor or processing chip in a server or computer.

[0049] Exemplarily, the electronic device may be a terminal, such as a mobile phone, a tablet computer, a wearable device, a vehicle-mounted device, an augmented reality (AR) / virtual reality (VR) device, a laptop computer, an ultra-mobile personal computer (UMPC), a netbook, a personal digital assistant (PDA), etc.

[0050] It should be noted that the embodiments of the present application do not limit the specific device form of the electronic device.

[0051] See also Figure 1 , is a flowchart of a rack arrangement method provided in an embodiment of the present application. Figure 1 As shown, the rack arrangement method provided in the present application specifically includes the following steps S201 to S202.

[0052] S201. Determine a rack placement area in a computer room.

[0053] The rack placement area is an area in the computer room that can be used to place racks.

[0054] Exemplarily, the specific implementation of the above step S201 can refer to the following steps S2011-S2012, which will not be repeated here.

[0055] S202: Determine a rack arrangement plan according to the position information of the rack placement area, the position information of the first object in the computer room, rack parameters, and a preset arrangement algorithm.

[0056] The rack arrangement plan is used to indicate the maximum number of idle racks that can be placed in the rack placement area and the locations where the idle racks can be placed.

[0057] In some embodiments, the first object refers to an object already existing in the machine room.

[0058] For example, the first object may be a cabinet, an air conditioner, a power cabinet, or a column. The specific object may vary depending on the specific conditions of the computer room, and is not limited thereto.

[0059] In some embodiments, the rack arrangement scheme may include at least one of the following:

[0060] The maximum number of free racks that can be placed in each row of racks in the rack placement area, and the locations where the free racks can be placed;

[0061] The maximum number of free racks that can be placed between rows in the rack placement area, and the locations where the free racks can be placed;

[0062] The maximum number of free racks that can be placed between the first row and the last row of the rack placement area and the wall, as well as the locations where the free racks can be placed.

[0063] The rack arrangement scheme provided by the present application can determine the rack placement area in the computer room based on the existing space layout, thereby maximizing the spatial potential of the computer room. At the same time, the preset arrangement algorithm automatically calculates the placement positions and maximum placement numbers of idle racks in the computer room, so as to better control costs and help decision makers to reasonably plan and optimize the space resources in the computer room. In summary, the rack arrangement scheme provided by the embodiment of the present application can automatically calculate the optimal rack arrangement scheme in a complex computer room scenario with other objects, without the need for personnel to judge the placement of racks, thereby improving work efficiency and fault tolerance.

[0064] In some embodiments, Figure 2 As shown, the above step S201 can be implemented as the following steps S2011-S2012.

[0065] S2011. Determine an initial area, where the distance between the boundary of the initial area and the wall of the computer room is greater than or equal to a first preset distance.

[0066] It should be noted that the above preset distance can be changed according to different conditions of the equipment room. For example, the first preset distance can be 1 meter.

[0067] It is understandable that a gap needs to be left between the rack and the wall to facilitate the administrator to manage and view the equipment status, and to provide better heat dissipation and ventilation. Therefore, before placing the rack, the embodiment of the present application determines the initial area that can accommodate the rack based on the first preset distance, and then determines the area where the idle rack can be placed within the initial area (i.e., the rack placement area).

[0068] S2012: Perform recursive judgment based on the location information of the initial area, the location information of the racks in the computer room, and the location information of the non-rack objects in the computer room to determine the rack placement area.

[0069] Recursion refers to breaking down a complex problem into several sub-problems that are similar to the original problem but smaller in scale. In the process of solving these sub-problems, the recursive function will continue to call itself until the termination condition is reached. Recursive judgment refers to making conditional judgments during the recursive process to determine whether the recursion should continue. In recursive judgment, each recursive call will determine the next action based on the current condition or state. This includes deciding whether to make more recursive calls or whether to return a value as a result.

[0070] Exemplarily, in an embodiment of the present application, the process of determining the rack placement area according to the location information of the initial area, the location information of the racks in the computer room, and the location information of the non-rack objects in the computer room can be divided into multiple sub-problems (for example, whether the initial area includes all the racks in the computer room; and / or whether the initial area intersects with the non-rack objects, etc.), and recursive judgment is performed, for example, it can be implemented as the following steps a1-a6.

[0071] It can be understood that determining the rack placement area based on the initial area can maximize the use of the available space in the computer room and reduce redundant and idle areas. At the same time, the initial area takes into account the space between the rack and the wall, which is conducive to air circulation in the computer room, improves the heat dissipation efficiency of the rack, and reduces the risk of overheating.

[0072] Exemplarily, the above step S2012 may be specifically implemented as follows:

[0073] Step a1: Determine whether the initial area includes all racks in the computer room based on the location information of the initial area and the location information of racks in the computer room.

[0074] Exemplarily, if yes, execute the following step a2; if no, execute the following step a4.

[0075] Step a2: when the initial area includes all racks in the computer room, determine whether the initial area intersects with the non-rack objects according to the position information of the initial area and the position information of the non-rack objects in the computer room.

[0076] Exemplarily, if yes, execute the following step a3; if no, directly output the initial area as the rack placement area.

[0077] Step a3: When the initial area intersects with the non-rack object, adjust the boundary of the initial area to obtain a rack placement area that does not intersect with the non-rack object.

[0078] Exemplarily, the above adjustment of the boundary of the initial area to obtain a rack placement area that does not intersect with non-rack objects includes: moving a first boundary in the initial area that intersects with the non-rack objects inward until the first boundary does not intersect with the non-rack objects, and the distance between the first boundary and the non-rack objects is greater than or equal to 0.5 meters. It is understandable that leaving a gap of 0.5 meters between the boundary and the rack is convenient for management and viewing, and also for heat dissipation.

[0079] Step a4: When the initial area does not include all racks in the computer room, adjust the boundary of the initial area to obtain a second area including all racks in the computer room.

[0080] Exemplarily, adjusting the boundary of the initial region to obtain the second region including all racks in the computer room includes: moving the boundary of the initial region outward until all racks in the computer room are included. For example, moving the boundary of the initial region outward to the extreme value of the rack to include as many racks as possible.

[0081] Step a5: Determine whether the second area intersects with the non-rack object based on the location information of the second area and the location information of the non-rack object in the computer room.

[0082] Exemplarily, if yes, execute the following step a6; if no, directly output the second area as the rack placement area.

[0083] Step a6: When the second area intersects with the non-rack object, adjust the boundary of the second area to obtain a rack placement area that does not intersect with the non-rack object.

[0084] Exemplarily, adjusting the boundary of the second area to obtain a rack placement area that does not intersect with the non-rack object includes: moving the second boundary in the second area that intersects with the non-rack object inward until the second boundary does not intersect with the non-rack object, and the distance between the second boundary and the non-rack object is greater than or equal to 0.5 meters. It is understandable that leaving a gap of 0.5 meters between the boundary and the non-rack object is convenient for management and viewing, and also for heat dissipation.

[0085] For ease of understanding, the methods provided in the above steps a1-a6 are described below in the form of examples.

[0086] Exemplarily, the first preset distance is set to 1 meter, and the initial area can be determined according to the first preset distance. The initial area and the position information of the first object in the computer room are judged. If the initial area already contains all racks, it is recursively judged whether the boundary of the initial area intersects with other non-rack objects. If it intersects, the boundary intersecting with the non-rack object is moved inward until it does not intersect with the non-rack object, and a 0.5-meter gap is left between the boundary of the rack placement area and the non-rack object. If there is no intersection with the non-rack object, the initial area is directly output as the rack placement area. If there is a rack outside the initial area, the boundary of the initial area is moved outward to include all racks as much as possible, and then it is judged whether the boundary of the area containing all racks intersects with other non-rack objects. If it does not intersect, the rack placement area is output. If it intersects, the boundary intersecting with the non-rack object is moved inward until it does not intersect with the non-rack object, and a 0.5-meter gap is left. Then continue to judge. If there is no intersection with the non-rack object, the rack placement area is output.

[0087] It is understandable that the embodiment of the present application determines the rack placement area in the computer room through recursive judgment. In this way, the remaining space resources in the computer room can be efficiently utilized on the basis of the existing space layout, so that the rack arrangement scheme of the present application can be adapted to various complex scenarios.

[0088] In some embodiments, Figure 3 As shown, the above step S202 can be implemented as the following steps S2021-S2023:

[0089] S2021. Determine the position information of a second object in the rack placement area according to the intersection of the position information of the rack placement area and the position information of the first object.

[0090] It can be understood that the second object represents all objects existing in the rack placement area of ​​the computer room.

[0091] Exemplarily, the location information of the rack placement area may be represented by a scope, and the location information of the first object may be represented by cabinets.

[0092] After the scope is determined based on the above step S201, the scope is converted to a closed loop (LinearRing) type in the topology operation function library (JTSTopology Suite, JTS) framework. JTS's LinearRing is a subclass of Geometry, which requires that the coordinates of the object are ordered and connected end to end. For example, [(x1, y1), (x2, y2), (x3, y3), (x4, y4), (x1, y1)].

[0093] It can be understood that since the first object refers to all objects already existing in the computer room, the embodiment of the present application performs an intersection operation based on the position information of the rack placement area and the position information of the first object, and determines the position information of the second object in the rack placement area based on the intersection of the two.

[0094] It should be noted that the JTS framework can also be replaced by other open source frameworks, such as turf, JSTS, etc., as long as they can support basic graphic formats.

[0095] S2022. Sort the second objects according to the position information of the second objects, and determine the number of rack rows existing in the rack placement area.

[0096] The rack row refers to racks placed in a row. For example, the row can be a horizontal row or a vertical row, which is not limited in the present embodiment.

[0097] In some embodiments, the above step S2022 can be implemented as follows: sort the second objects in the available area according to the y coordinate or the x coordinate according to the direction to obtain a two-dimensional cabinets array, and determine the number of rack rows in the rack placement area according to the two-dimensional cabinets array.

[0098] For example, taking the y coordinate sorting as an example, if the difference between the y coordinates of the center point of object 1 and the y coordinates of the center point of object 2 is less than the threshold value of 0.6 meters, it is determined that object 1 and object 2 are in the same row, and the y coordinate difference between object 3 and object 2 is continued to be determined... until the y coordinates of the center points between object n and object n+1 are greater than 0.6 meters, then a new row is calculated starting from object n+1 until all second objects are processed, and a two-dimensional array cabinets is obtained. At this time, the cabinets have been sorted in ascending order by row, and each row is sorted in ascending order according to the x coordinate to obtain the final cabinets. Figure 4 A common cabinets diagram is shown, and the corresponding cabinets are [[rack 1, rack 2, rack 3], [rack 4, rack 6, rack 5, rack 7, rack 9, rack 8], [rack 10, rack 12, rack 11]], and it can be seen that there are 3 rows of racks in the rack placement area.

[0099] S2023: Determine a rack arrangement plan according to the position information of the rack placement area, the position information of the second object, the number of rack rows, rack parameters, and a preset arrangement algorithm.

[0100] Exemplarily, the rack parameter includes at least one of the following: a rack placement direction (direction), a rack depth (depth), and a rack width (width).

[0101] The placement direction of the rack may be horizontal or vertical. For example, the placement direction of the rack may be determined based on the orientations of most racks in a computer room.

[0102] For example, the depth can be set to 0.6 meters, the width can be set to 0.6 meters, and the space can be set to 1 meter.

[0103] In some embodiments, when the preset arrangement algorithm includes: traversing each row of racks in the rack placement area, determining the maximum number of idle racks that can be placed in each row, and the positions where the idle racks can be placed, the above-mentioned step S2023 can be implemented as: according to the position information of the rack placement area, the position information of the second object, the number of rack rows, and the rack parameters, traversing each row of racks in the rack placement area in turn, calculating the maximum number of idle racks that can be placed in each row except the second object, and the positions where the racks can be placed.

[0104] For example, Figure 5 A schematic diagram of free rack calculation is shown. Taking the case of horizontal placement as the direction, traverse each row of racks in the rack placement area. Starting from the first row, first find the first existing rack position in the first row, take the first rack position as the origin, and calculate the available free rack positions to the left. If the available free rack position intersects or is external to the scope, reset the position to calculate the available free rack position to the right from the first existing rack position. If the available free position intersects with the existing rack position in the first row, reset the position to calculate the available free rack position to the right from the existing rack position until the available free rack position intersects or is external to the scope, and end the rack placement position calculation for the first row. Add the calculated maximum number and position of available free racks to the result set. According to the method for the first row, calculate the maximum number of available free racks and the positions of available racks in each row, excluding the second object.

[0105] The result set represents a set of available rack positions in the rack arrangement area.

[0106] In some embodiments, when the preset arrangement algorithm includes: determining the maximum number of idle racks that can be placed between rows, and the locations where the idle racks can be placed, the above-mentioned step S2023 can be implemented as: determining the maximum number of idle racks that can be placed between rows in the rack placement area, excluding the second object, and the locations where the idle racks can be placed, based on the position information of the rack placement area, the position information of the second object, the number of rack rows, and the rack parameters.

[0107] It should be noted that the rack sizes in the computer room may be different, so we use the minimum vertical distance in the calculation. Figure 6 As shown, calculate the minimum vertical distance between rows (distance), and calculate the number of rows of free racks that can be placed by distance (distanceSpaceCount). If distanceSpaceCount is greater than 0, it means that an additional row of free racks can be placed between this row of racks and the next row of racks. Initialize distanceSpaceCount rows of racks, calculate the positions where free racks can be placed starting from the inscribed position on the left side of scope, and add them to the result set.

[0108] In some embodiments, when the preset arrangement algorithm includes: determining the maximum number of idle racks that can be placed between the first row and the last row and the wall respectively, and the positions where the idle racks can be placed, the above-mentioned step S2023 can be implemented as: determining, according to the position information of the rack placement area, the position information of the second object, the number of rack rows, and the rack parameters, the maximum number of idle racks that can be placed between the first row and the last row and the wall respectively in the rack placement area, excluding the second object, and the positions where the idle racks can be placed.

[0109] For example, Figure 6 As shown, the minimum vertical distance (distance) between the first row of existing racks and the last row of existing racks and the rack placement area is calculated, and the number of free rack rows (distanceSpaceCount) that can be placed by distance is calculated. If distanceSpaceCount is greater than 0, it means that an additional row of free racks can be placed between the first row of racks and the last row of racks and the rack placement area. Initialize distanceSpaceCount rows of racks, calculate the positions where free racks can be placed starting from the inscribed position on the left side of scope, and add them to the result set.

[0110] It should be noted that the calculation of the placement of an entire row of free racks always starts from one end of the scope to accommodate as many free racks as possible. For the calculation of the free positions available for each row of racks, the algorithm will try to fill the gaps between racks. This may result in misalignment of the cabinets, which is caused by the characteristics of the greedy algorithm.

[0111] It is understandable that the embodiment of the present application increases the installation density of racks in the space by calculating the positions and maximum number of idle racks that can be placed, thereby increasing the number of devices in the computer room and reducing the number of computer rooms, which helps to centralize monitoring and management and improve the overall management effect of the computer room. At the same time, the determination of the rack arrangement plan eliminates the errors that may occur in manual calculation and planning, and improves the accuracy of the plan.

[0112] In some embodiments, before the above step S2023, the method further includes: for each row of racks in the rack placement area, when the distance between adjacent racks is less than a preset threshold, aggregating adjacent racks.

[0113] For example, the cabinets are aggregated, and when the distance between the cabinets is less than a preset threshold, they are automatically aggregated into the smallest bounding rectangle. The preset threshold can be adjusted according to actual conditions. For example, the preset threshold is 0.3 meters.

[0114] For example, Figure 7 The rack aggregation diagram shows several common aggregation scenarios. After aggregation, the three racks become one rack. Figure 4 The result after rack aggregation is as follows Figure 8 As shown, the aggregated cabinets are [[Rack 1], [Rack 2, Rack 3], [Rack 4]].

[0115] It can be understood that by aggregation processing, the scattered graphics are merged, and the number of existing rack positions in each row is reduced accordingly, which reduces the difficulty of calculating the number of idle rack positions that can be placed, helps to improve the work efficiency of rack layout calculation, and avoids calculation errors caused by different sizes of existing racks.

[0116] It can be seen that the above mainly introduces the solution provided by the embodiment of the present application from the perspective of the method. In order to achieve the above functions, the embodiment of the present application provides a hardware structure and / or software module corresponding to each function. It should be easily appreciated by those skilled in the art that, in combination with the modules and algorithm steps of each example described in the embodiment disclosed herein, the embodiment of the present application can be implemented in the form of hardware or a combination of hardware and computer software. Whether a function is executed in the form of hardware or computer software driving hardware depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to exceed the scope of the present invention.

[0117] The embodiment of the present application can divide the rack arrangement device into functional modules according to the above method example. For example, each functional module can be divided according to each function, or two or more functions can be integrated into one processing module. The above integrated module can be implemented in the form of hardware or in the form of software functional modules. Optionally, the division of modules in the embodiment of the present application is schematic and is only a logical function division. There may be other division methods in actual implementation.

[0118] In some embodiments, the present application further provides a rack arrangement device, which may include one or more functional modules for implementing the rack arrangement method of the above method embodiment.

[0119] For example, Fig. 9 A schematic diagram of the composition of a rack arrangement device provided in an embodiment of the present application. Fig. 9 As shown, the rack arrangement device 800 includes: a determination module 801. In some other embodiments, the rack arrangement device 800 further includes a processing module 802.

[0120] The determination module 801 is used to determine the rack placement area in the computer room; determine the rack arrangement plan according to the position information of the rack placement area, the position information of the first object in the computer room, the rack parameters and the preset arrangement algorithm; wherein the preset arrangement algorithm is used to determine the maximum number of idle racks that can be placed in the rack placement area, and the positions where the idle racks can be placed.

[0121] In some embodiments, the rack arrangement plan includes at least one of the following: the maximum number of idle racks that can be placed in each row of racks in the rack placement area, and the locations where the idle racks can be placed; the maximum number of idle racks that can be placed between rows in the rack placement area, and the locations where the idle racks can be placed; the maximum number of idle racks that can be placed between the first row and the last row in the rack placement area and the wall, respectively, and the locations where the idle racks can be placed.

[0122] In other embodiments, the determination module 801 is specifically used to determine the position information of a second object in the rack placement area according to the intersection of the position information of the rack placement area and the position information of the first object; sort the second objects according to the position information of the second objects to determine the number of rack rows in the rack placement area; determine the rack arrangement plan according to the position information of the rack placement area, the position information of the second object, the number of rack rows, rack parameters and a preset arrangement algorithm.

[0123] In some other embodiments, the processing module 802 is used to aggregate adjacent racks for each row of racks in the rack placement area when the distance between adjacent racks is less than a preset threshold.

[0124] In some other embodiments, the determination module 801 is specifically used to determine an initial area, where the distance between the boundary of the initial area and the wall of the computer room is greater than or equal to a first preset distance; recursive judgment is performed based on the position information of the initial area, the position information of the racks in the computer room, and the position information of non-rack objects in the computer room to determine the rack placement area.

[0125] In some other embodiments, the determination module 801 is specifically used to determine whether the initial area includes all racks in the computer room according to the location information of the initial area and the location information of the racks in the computer room; if the initial area includes all racks in the computer room, determine whether the initial area intersects with the non-rack object according to the location information of the initial area and the location information of the non-rack object in the computer room; if the initial area intersects with the non-rack object, adjust the boundary of the second area to obtain a rack placement area that does not intersect with the non-rack object.

[0126] In some other embodiments, the determination module 801 is specifically configured to adjust the boundary of the initial area to obtain a second area including all racks in the computer room when the initial area does not include all racks in the computer room; determine whether the second area intersects with the non-rack object according to the position information of the second area and the position information of the non-rack object in the computer room; and adjust the boundary of the initial area to obtain a rack placement area that does not intersect with the non-rack object when the second area intersects with the non-rack object.

[0127] In the case of implementing the functions of the above-mentioned integrated modules in the form of hardware, the embodiment of the present invention provides a possible structural diagram of the electronic device involved in the above-mentioned embodiment. Fig.10 As shown, the electronic device 900 includes: a processor 902 , a communication interface 903 , and a bus 904 . Optionally, the electronic device 900 may further include a memory 901 .

[0128] The processor 902 may be a processor that implements or executes various exemplary logic blocks, modules, and circuits described in conjunction with the disclosure of the present application. The processor 902 may be a central processing unit, a general-purpose processor, a digital signal processor, an application-specific integrated circuit, a field programmable gate array, or other programmable logic devices, transistor logic devices, hardware components, or any combination thereof. It may implement or execute various exemplary logic blocks, modules, and circuits described in conjunction with the disclosure of the present application. The processor 902 may also be a combination that implements computing functions, such as a combination of one or more microprocessors, a combination of a DSP and a microprocessor, and the like.

[0129] The communication interface 903 is used to connect with other devices via a communication network, such as Ethernet, wireless access network, wireless local area network (WLAN), etc.

[0130] The memory 901 may be a read-only memory (ROM) or other types of static storage devices that can store static information and instructions, a random access memory (RAM) or other types of dynamic storage devices that can store information and instructions, or an electrically erasable programmable read-only memory (EEPROM), a disk storage medium or other magnetic storage device, or any other medium that can be used to carry or store desired program code in the form of instructions or data structures and can be accessed by a computer, but is not limited thereto.

[0131] As a possible implementation, the memory 901 may exist independently of the processor 902, and the memory 901 may be connected to the processor 902 via a bus 904, and is used to store instructions or program codes. When the processor 902 calls and executes the instructions or program codes stored in the memory 901, the rack arrangement method provided in the embodiment of the present invention can be implemented.

[0132] In another possible implementation, the memory 901 may also be integrated with the processor 902 .

[0133] The bus 904 may be an extended industry standard architecture (EISA) bus, etc. The bus 904 may be divided into an address bus, a data bus, a control bus, etc. For ease of representation, Fig.10 Only one thick line is used in the diagram, but this does not mean that there is only one bus or only one type of bus.

[0134] Through the description of the above implementation methods, technical personnel in the relevant field can clearly understand that for the convenience and simplicity of description, only the division of the above-mentioned functional modules is used as an example. In actual applications, the above-mentioned functions can be assigned to different functional modules as needed, that is, the internal structure of the service calling device can be divided into different functional modules to complete all or part of the functions described above.

[0135] The embodiment of the present application also provides a computer-readable storage medium. All or part of the processes in the above method embodiments can be completed by computer instructions to instruct the relevant hardware, and the program can be stored in the above computer-readable storage medium. When the program is executed, it may include the processes of the above method embodiments. The computer-readable storage medium can be the memory or memory of any of the above embodiments. The above computer-readable storage medium can also be an external storage device of the above service calling device, such as a plug-in hard disk, a smart memory card (smart media card, SMC), a secure digital (secure digital, SD) card, a flash card (flash card), etc. equipped on the above service calling device. Further, the above computer-readable storage medium can also include both the internal storage unit of the above service calling device and an external storage device. The above computer-readable storage medium is used to store the above computer program and other programs and data required by the above service calling device. The above computer-readable storage medium can also be used to temporarily store data that has been output or is to be output.

[0136] An embodiment of the present application further provides a computer program product, which includes a computer program. When the computer program product is run on a computer, the computer is enabled to execute any rack arrangement method provided in the above embodiments.

[0137] The above are only specific implementations of the present application, but the protection scope of the present application is not limited thereto. Any changes or substitutions within the technical scope disclosed in the present application should be included in the protection scope of the present application. Therefore, the protection scope of the present application should be based on the protection scope of the claims.

Claims

1. A rack arrangement method, characterized in that: The method comprises: Determine the rack placement area in the computer room; A rack arrangement scheme is determined according to the position information of the rack placement area, the position information of the first object in the computer room, rack parameters and a preset arrangement algorithm; wherein the rack arrangement scheme is used to indicate the maximum number of idle racks that can be placed in the rack placement area, and the positions where the idle racks can be placed.

2. The method according to claim 1, characterized in that The rack arrangement scheme includes at least one of the following: The maximum number of idle racks that can be placed in each row of racks in the rack placement area, and the positions where the idle racks can be placed; The maximum number of idle racks that can be placed between rows in the rack placement area, and the positions where the idle racks can be placed; The maximum number of idle racks that can be placed between the first row and the last row in the rack placement area and the wall, and the positions where the idle racks can be placed.

3. The method according to claim 1, characterized in that The determining of the rack arrangement scheme according to the position information of the rack placement area, the position information of the first object already existing in the machine room, rack parameters and a preset arrangement algorithm includes: Determine the position information of a second object in the rack placement area according to the intersection of the position information of the rack placement area and the position information of the first object; Sort the second objects according to the position information of the second objects, and determine the number of rack rows existing in the rack placement area; The rack arrangement scheme is determined according to the position information of the rack placement area, the position information of the second object, the number of the rack rows, the rack parameters and the preset arrangement algorithm.

4. The method according to claim 3, characterized in that Before determining the rack arrangement scheme according to the position information of the rack placement area, the position information of the second object, the number of rack rows, the rack parameters and the preset arrangement algorithm, the method further includes: For each row of racks in the rack placement area, when the distance between adjacent racks is less than a preset threshold, the adjacent racks are aggregated.

5. The method according to claim 1, characterized in that Determining the rack placement area in the computer room includes: Determine an initial area, where the distance between the boundary of the initial area and the wall of the computer room is greater than or equal to a first preset distance; According to the position information of the initial area, the position information of the racks in the computer room, and the position information of the non-rack objects in the computer room, a recursive judgment is performed to determine the rack placement area.

6. The method according to claim 5, characterized in that The recursive judgment is performed according to the position information of the initial area, the position information of the racks in the computer room, and the position information of the non-rack objects in the computer room to determine the rack placement area, including: Determining whether the initial area includes all racks in the computer room according to the location information of the initial area and the location information of the racks in the computer room; In the case where the initial area includes all racks in the computer room, determining whether the initial area intersects with the non-rack object according to the position information of the initial area and the position information of the non-rack object in the computer room; In the case where the initial area intersects with the non-rack object, the boundary of the initial area is adjusted to obtain the rack placement area that does not intersect with the non-rack object.

7. The method according to claim 6, characterized in that The method further comprises: In the case that the initial area does not include all racks in the machine room, adjusting the boundary of the initial area to obtain a second area including all racks in the machine room; Determining whether the second area intersects with the non-rack object according to the location information of the second area and the location information of the non-rack object in the computer room; In the case where the second area intersects with the non-rack object, a boundary of the second area is adjusted to obtain the rack placement area that does not intersect with the non-rack object.

8. An electronic device, characterized in that: It comprises a processor and a memory, wherein the processor is coupled to the memory; the memory is used to store computer instructions, and the computer instructions are loaded and executed by the processor to enable the computer device to implement the rack arrangement method according to any one of claims 1 to 7.

9. A computer-readable storage medium, characterized in that: The computer-readable storage medium includes computer-executable instructions. When the computer-executable instructions are executed on a computer, the computer is enabled to execute the rack arrangement method according to any one of claims 1 to 7.

10. A computer program product, characterized in that The computer program product comprises a computer program, and when the computer program is run on an electronic device, the electronic device executes the rack arrangement method according to any one of claims 1 to 7.