CN110955946A - Computer room wiring optimization method and system - Google Patents
Computer room wiring optimization method and system Download PDFInfo
- Publication number
- CN110955946A CN110955946A CN201911035081.8A CN201911035081A CN110955946A CN 110955946 A CN110955946 A CN 110955946A CN 201911035081 A CN201911035081 A CN 201911035081A CN 110955946 A CN110955946 A CN 110955946A
- Authority
- CN
- China
- Prior art keywords
- machine room
- line
- room wiring
- shape
- optimization method
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 62
- 238000005457 optimization Methods 0.000 title claims abstract description 40
- 238000012545 processing Methods 0.000 claims description 4
- 230000011218 segmentation Effects 0.000 claims description 4
- 238000010586 diagram Methods 0.000 description 6
- 230000002093 peripheral effect Effects 0.000 description 5
- 238000004891 communication Methods 0.000 description 2
- 230000009191 jumping Effects 0.000 description 2
- 230000001133 acceleration Effects 0.000 description 1
- 230000003044 adaptive effect Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 238000003066 decision tree Methods 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
- 238000012850 discrimination method Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000012804 iterative process Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012216 screening Methods 0.000 description 1
- 238000012795 verification Methods 0.000 description 1
Images
Landscapes
- Design And Manufacture Of Integrated Circuits (AREA)
Abstract
The invention provides a machine room wiring optimization method and a system, wherein the method comprises the step of carrying out wire-combining treatment on similar wires, and further comprises the following steps: optimizing the line by using a line crossing judgment method; and generating the optimized machine room wiring layout. The invention provides a machine room wiring optimization method and a machine room wiring optimization system, which adjust and improve programs aiming at differences between machine room wiring and integrated circuit wiring on the basis of FOCR, so that the machine room wiring optimization method is simpler and more efficient, and then the speed of obtaining an optimal solution is improved again.
Description
Technical Field
The invention relates to the technical field of communication machine room wiring, in particular to a machine room wiring optimization method and a system.
Background
When calculating the route of the channel wiring, the requirement of non-crossability is applied to the route. The conventional algorithm requires that one or more candidate lines are generated in advance and then whether the lines cross the preamble lines is determined. The method has the disadvantages that when the candidate line is generated, too many factors need to be considered, so that the complexity of the algorithm for generating the candidate line is high; second, even if all candidate lines fail to satisfy the requirement, it cannot be concluded that there is no line that satisfies the requirement. That is, the old algorithm can only make verification decisions for known line crossability, but cannot make presence decisions for non-crossable connectible lines.
The fast optimal channel wiring algorithm FOCR is provided after the branch limit method is optimized by Wuzu who has the university of double-denier, and the main content is that an initial wiring scheme is calculated by utilizing a certain fast wiring algorithm, then the initial scheme is optimized by using the branch limit method, and finally the optimal algorithm is approached. The method has the disadvantages that when the branch limit is selected, the proper limit is difficult to select at one time, so that the time consumption of the whole iterative process is difficult to optimize, and the speed of obtaining the optimal solution is difficult to improve.
Disclosure of Invention
In order to solve the technical problems, the invention provides a machine room wiring optimization method and a system, which are improved in two aspects on the basis of FOCR, and firstly, aiming at the difference between the machine room wiring and the integrated circuit wiring, the program is adjusted and improved, so that the machine room wiring optimization method and the system are simpler and more efficient; secondly, the speed of obtaining the optimal solution is improved again.
The invention aims at providing a machine room wiring optimization method, which comprises the step of carrying out wire-combining treatment on similar wires and is characterized by further comprising the following steps of:
step 1: optimizing the line by using a line crossing judgment method;
step 2: and generating the optimized machine room wiring layout.
Preferably, the line crossing judging method includes the steps of:
step 11: constructing a set of initial shapes;
step 12: according to the actual influence of the preorder line on the shape, carrying out shape segmentation or edge combination;
step 13: the non-cross-connectibility of the subsequent access point is judged by using the combined or divided shape set.
Preferably in any of the above solutions, said step 11 comprises identifying outlet slot edge lines and cabinet entrances for a given cabinet, trunking layout.
In any of the above embodiments, preferably, the slot edge line is abstracted as (B)1，B2，B3，…，Bm) Wherein m is the total number of edges.
In any of the above embodiments, it is preferable that (B) is2、B3、…、Bm) Is covered by B1Are surrounded and have no surrounding relationship with each other.
In any of the above embodiments, preferably, the cabinet entrance is abstracted to a point (P) on the trunk line edge1，P2，P3，…，Pn) And n is the total number of the cabinet inlets.
In any of the above aspects, it is preferable that each of the points P is a point PnOccur on a plurality of edges or occur multiple times on one edge.
In any of the above solutions, it is preferred that said step 11 further comprises constructing a total set C of all shapes.
In any of the above solutions, it is preferable that, in the initial stage, the elements in the total set C have only the shape S, which is all the edges and the inner area enclosed by the edges.
In any of the above-described aspects, it is preferable that the method of determining the non-cross-connectibility is to connect two points P requiring the connectionk、PqGo through the set C to find out if there is any shape StSo that P isk、PqAre connected without crossing, where k is the starting point number, q is the end point number, and t is the number of possible shapes.
On any one of the aboveIt is preferable if there is no shape StAnd if so, the connecting line between the two points is necessarily crossed with other connecting lines, a prompt that the connection cannot be performed is given, and the set C is not processed.
In any of the above embodiments it is preferred if any shape S is presenttThen a strip at S is generatedtInternal for point PkAnd PqPath L of point connections.
In any of the above embodiments, it is preferable that when the point P iskAnd PqThe point is located on the same bar BmWhen on the edge line, point PkAnd PqAfter the points are connected by the path L, the original shape S is formedtIs cut out to form a new shape SuHandle SuAnd adding a shape aggregate C, wherein u is the number of the newly added shape.
In any of the above embodiments, it is preferable that when the point P iskAnd PqThe points are located on two different side lines Bp、BqTime, point PkAnd PqAfter the points are connected by the path L, the original shape S is changed without changing the number of the shapes in the set CtThe number of the middle borderlines, two different borderlines will be connected into one borderline by the path L.
A second object of the present invention is to provide a machine room wiring optimization system, including a wire-combining module for performing wire-combining processing on similar wires, including the following modules:
an optimization module: the method is used for optimizing the line by using a line crossing judgment method;
a generation module: and generating the optimized machine room layout.
Preferably, the line crossing judging method includes the steps of:
step 11: constructing a set of initial shapes;
step 12: according to the actual influence of the preorder line on the shape, carrying out shape segmentation or edge combination;
step 13: the non-cross-connectibility of the subsequent access point is judged by using the combined or divided shape set.
Preferably in any of the above solutions, said step 11 comprises identifying outlet slot edge lines and cabinet entrances for a given cabinet, trunking layout.
In any of the above embodiments, preferably, the slot edge line is abstracted as (B)1，B2，B3，…，Bm) Wherein m is the total number of edges.
In any of the above embodiments, it is preferable that (B) is2、B3、…、Bm) Is covered by B1Are surrounded and have no surrounding relationship with each other.
In any of the above embodiments, preferably, the cabinet entrance is abstracted to a point (P) on the trunk line edge1，P2，P3，…，Pn) And n is the total number of the cabinet inlets.
In any of the above aspects, it is preferable that each of the points P is a point PnOccur on a plurality of edges or occur multiple times on one edge.
In any of the above solutions, it is preferred that said step 11 further comprises constructing a total set C of all shapes.
In any of the above solutions, it is preferable that, in the initial stage, the elements in the total set C have only the shape S, which is all the edges and the inner area enclosed by the edges.
In any of the above-described aspects, it is preferable that the method of determining the non-cross-connectibility is to connect two points P requiring the connectionk、PqGo through the set C to find out if there is any shape StSo that P isk、PqAre connected without crossing, where k is the starting point number, q is the end point number, and t is the number of possible shapes.
In any of the above solutions it is preferred if no shape S is presenttAnd if so, the connecting line between the two points is necessarily crossed with other connecting lines, a prompt that the connection cannot be performed is given, and the set C is not processed.
In any of the above embodiments it is preferred if any shape S is presenttThen a strip at S is generatedtInternal for point PkAnd PqPath L of point connections.
In any of the above embodiments, it is preferable that when the point P iskAnd PqThe point is located on the same bar BmWhen on the edge line, point PkAnd PqAfter the points are connected by the path L, the original shape S is formedtIs cut out to form a new shape SuHandle SuAnd adding a shape aggregate C, wherein u is the number of the newly added shape.
In any of the above embodiments, it is preferable that when the point P iskAnd PqThe points are located on two different side lines Bp、BqTime, point PkAnd PqAfter the points are connected by the path L, the original shape S is changed without changing the number of the shapes in the set CtThe number of the middle borderlines, two different borderlines will be connected into one borderline by the path L.
The invention provides a method and a system for optimizing machine room wiring, which combine topological knowledge and utilize a shape set formed by cutting a wiring channel by a preorder line to judge whether theoretical non-crossed connectivity exists between two points under the condition of only knowing coordinates of two access points.
Drawings
Fig. 1 is a flow chart of a preferred embodiment of a machine room wiring optimization method according to the present invention.
Fig. 1A is a flowchart of a line crossing determination method according to the embodiment shown in fig. 1 of the machine room wiring optimization method according to the present invention.
Fig. 2 is a block diagram of a preferred embodiment of the machine room wiring optimization system according to the present invention.
Fig. 3 is a flow chart of another preferred embodiment of the machine room wiring optimization method according to the present invention.
Fig. 3A is a schematic diagram of an initial shape of the embodiment shown in fig. 3 of the machine room wiring optimization method according to the present invention.
Fig. 3B is a schematic diagram of an initial edge of the embodiment shown in fig. 3 of the machine room wiring optimization method according to the present invention.
Fig. 3C is a schematic diagram of generating a new shape according to the embodiment shown in fig. 3 in the computer room wiring optimization method according to the present invention.
Fig. 3D is a schematic diagram of generating a new edge according to the embodiment shown in fig. 3 in the computer room wiring optimization method according to the present invention.
Fig. 4 is a schematic diagram of shapes, connecting lines and points on a plane of an embodiment of the machine room wiring optimization method according to the invention.
Detailed Description
The invention is further illustrated with reference to the figures and the specific examples.
Example one
As shown in fig. 1 and 2, step 100 is performed, and the wire-combining module 200 performs wire-combining processing on similar wires.
In step 110, the optimization module 210 optimizes the line by using a line crossing decision method. The method for judging the line crossing comprises the following steps: step 111 is performed to build a set of initial shapes. For a given cabinet, trunking layout, identifying outlet trunking sidelines and cabinet entrances, the trunking sidelines are abstracted as (B)1，B2，B3，…，Bm) Wherein m is the total number of edges, (B)2、B3、…、Bm) Quilt B1Surrounded without any surrounding relation among each other; the cabinet entrance is abstracted as a point (P) on the slot edge line1，P2，P3，…，Pn) Where n is the total number of cabinet entries, and each point PnOccur on a plurality of edges or occur multiple times on one edge. Step 112 is executed to construct a total set C of all shapes, and in the initial stage, the elements in the total set C only have shape S, and the shape S is all edges and the inner area enclosed by the edges. Step 113 is executed to determine whether there is a connection to be processed. If there are no links to be processed, step 119 is executed, and all links are processed. If there is a connection to be processed, i.e. there is an access point to be determined, step 114 is executed to traverse the set C and determine whether there is any shape StSo that P isk、PqThere can be no cross-connection, where k is the starting point number, q is the end point number, and t is the number of possible shapes. If there is no arbitrary shapeStThen P isk、PqThe connection between the two lines is necessarily crossed with other lines, a prompt that the connection is impossible is given, the set C is not processed, and meanwhile, the step 113 is executed to judge whether the connection needing to be processed exists again. If any shape S existstThen P isk、PqBelong to the same StStep 115 is executed to generate a strip located at StInternal for point PkAnd PqThe path L of the connection. Go to step 116, determine point PkAnd PqWhether they are located on the same edge line. If point PkAnd PqIn the same bar BmOn the edge line, step 117 and step 113 are sequentially executed, point PkAnd PqAfter the points are connected by the path L, the original shape S is formedtIs cut out to form a new shape SuHandle SuAnd adding a shape total set C, and judging whether a connecting line needing to be processed exists again, wherein u is the number of the newly added shape, and the size is usually the number of elements in the shape total set C plus 1. If point PkAnd PqThe points are located on two different side lines Bp、BqStep 118 and step 113 are executed in sequence, point PkAnd PqAfter the points are connected by the path L, the original shape S is changed without changing the number of the shapes in the set CtThe number of the middle borderlines, two different borderlines will be connected into one borderline by the path L.
Step 120 is executed, and the generating module 220 generates the optimized machine room wiring layout.
Example two
Conventional routing algorithms fall into two categories: one type is single-wire routing, such as the maze routing algorithm (MazeRunningRouter), the Line-explorer algorithm (Line-ProbeRouter). The other is channel routing (ChannelRouter).
The single-wire wiring algorithm only inspects one wire each time, solves the problem of wiring one wire and then processes the next wire, so that the superiority of the result is seriously dependent on the sequence of wiring, and if the wires in the sequence are improperly placed, the effect of subsequent wiring can be greatly influenced.
The channel wiring algorithm is different, and the specific wiring mode of each wire is determined according to the correlation among all wires in the whole channel by taking all wires in the whole channel as consideration, so that the success rate and the coverage rate of wiring are improved, and the wiring quality is generally higher. In combination with the actual demands faced by us, we consider that channel wiring is more adaptive to the current situation, and therefore, we decide to develop our own wiring algorithm on the basis of the channel wiring algorithm.
The channel routing algorithm was originally proposed by Hashimoto-Stevens, and its application (left algorithm) to unconstrained net sets ensured that the best solution was obtained, but the result was often unsatisfactory for constrained net sets. Kernighan et al later applied branch and bound methods to solve the optimal routing problem of the loop-free constraint set on this basis, but the algorithm execution process was long. Wada generalizes the branch-and-bound method to the curved trunk routing, proposes a solution to solve the 100% routing of the strap constraint set, and Wada introduces the acceleration of the two branch-and-bound processes at a main section of the article. Wuzu of the university of Redding proposes a fast optimal channel routing algorithm FOCR (FastOptimalChannelRouter) after optimizing the branch bound method. FOCR optimizes branch-bound methods in two ways: firstly, the time for searching on a decision tree and reaching an optimal solution is shortened; and secondly, the time for verifying the optimality of the solution is shortened.
The invention is improved in two aspects on the basis of FOCR. Firstly, aiming at the difference between the machine room wiring and the integrated circuit wiring, the program is adjusted and improved, so that the machine room wiring and the integrated circuit wiring are simpler and more efficient; secondly, the speed of obtaining the optimal solution is improved again. These measures are mainly reflected in the following aspects:
1. similar wires are wired before the branch-and-bound process begins. Therefore, the calculation amount of routing is greatly reduced, and the execution efficiency of the program is improved. The similar wiring means a wiring having the same line type and having a terminal close to the starting point and the terminal.
And (3) line combination: there are often thousands of pairs of wires between cabinets. The connections are from terminal to terminal. And for the connecting lines of which the terminals at the head end and the tail end belong to the same cabinet respectively, if the wire types of the terminals are the same, the same line can be shared. The number that can be used depends on the number of cores available per wire of such wire.
2. First, local optimization is performed. And calculating the optimal wiring mode of the beam line in each channel by adopting a shortest path method, and calculating the optimal wiring layer number and channel number. Local area optimization: the cabinets in the same channel are considered, and the cabinets can be connected with each other. These connections are then first connected. During wiring, screening and optimization are carried out according to factors such as the space left in the local channel after wiring, the space reserved at the outlet of each channel for steering and the like. And then the local scheme after the local optimization is taken as a candidate and is used when waiting for global optimization.
3. And then carrying out global optimization. An initial wiring scheme is obtained by using the FOCR, and then a more optimal solution is sought on the scheme by using a dynamic programming mode. In the dynamic programming process, the local optimal solution obtained in the last step is used as a threshold value, a large number of branches which do not need to be calculated are eliminated, and the running efficiency of the program is greatly improved. Global optimization: it is first calculated which pairs of cabinets have connectable space between them and then connected. If the connection is not possible, then see if more opportunities are made available for connection by adjusting the existing line around another channel. If the connection is not available, then whether the connection can be performed or not is determined by adjusting the wiring layers. If not, a new layer is opened alone.
EXAMPLE III
The invention provides an algorithm for judging whether a connecting line which does not cross the existing line exists between two access points. The method is characterized in that the channel is divided into shapes by tracking the preorder line, and the coordinates of two access points are only needed to judge whether theoretical non-cross connectivity exists between the two access points. The brief steps are as follows: step 1, constructing a set of initial shapes; step 2, according to the substantial influence of the preorder lines on the shape, carrying out shape segmentation or edge combination; and 3, utilizing the combined or segmented shape set as a judgment basis for the non-cross connectivity of the subsequent access points. The flow chart of the method is shown in fig. 3, and by combining with the knowledge of topology, and utilizing the shape set formed by cutting the wiring channel by the preorder line, whether theoretical non-cross connectivity exists between two points can be judged under the condition of only knowing the coordinates of two access points.
Step 1, constructing an initial shape. As shown in fig. 3A, for a given cabinet, trunking layout, the sidelines of the outlet slots are identified, and the entrances to the cabinet. The cabinet entrance is abstracted as a point on the line of the wire slot: p1, P2, P3, … …, Pn. The slot edge lines are abstracted as B1, B2, … …, Bm.
Wherein, B2，……BmQuilt B1Are surrounded without any surrounding relationship with each other. We call B1Is an outer side line, and the other side lines are inner side lines. For each point PnIt may occur on multiple edges, or multiple times on a single edge. In this case, we call this edge pass this point multiple times. All edges and their surrounding inner area, we call the shape S.
And 2, constructing a total set of all shapes. As shown in FIG. 3B, all shapes on a plane are referred to as a set C. In the initial phase, this set C has only one element: s1I.e. the shape enclosed by all the side lines in step 1.
And 3, judging whether an access point needing to be judged to be connected exists or not. And if the connection line needing to be processed exists, jumping to the step 4. If all links have been processed, the algorithm terminates.
And 4, judging no cross connectability. For two points that need to be wired: pk, Pq, traversing the set C, if any shape St exists in the set C, and Pk, Pq belong to St, then Pk, Pq can be connected without cross connection, and jumping to step 5. Otherwise, the connecting line between the two points is crossed with other connecting lines, a prompt that the connection cannot be performed is given, the set C is not processed, and the step 3 is skipped.
And 5, connecting two connectable points. Given two connectable points Pk, Pq, the shape St they lie in, and a path L inside St connecting Pk, Pq, then there are two possible situations: 1. the two points are positioned on the same Bm edge line, and the step 6 is skipped; 2. these two points are located on two different edges Bp, Bq, and step 7 is skipped.
And 6, connecting two points on the same edge line. As shown in fig. 3C, two points on the same borderline are connected by a path L, and then a part of the original shape St is cut out to form a new shape Su. Add Su to the shape ensemble C. Jump to step 3.
And 7, connecting two points of different edge lines. As shown in fig. 3D, when two points on different edges are connected by the path L, the number of the shapes in the set C is not changed, but the number of the edges in the original shape St is changed. Two different edges will be connected by path L to form one edge. Jump to step 3.
Example four
In the prior art, a sectional discrimination method is adopted for the judgment of the crossed line. The basic idea is to divide the trunking into a plurality of sections, and the line passing through each section is determined. When a new line is added, each section through which the new line passes is found according to the trend of the new line, and whether the new line crosses the original line or not is judged at the intersection of each section and the next section.
The biggest problems brought by such a local area-based algorithm are: if a route to be determined is not generated in advance, the intersection determination cannot be performed. Even if the generating line is determined to have a crossover, it is not possible to determine whether there are other lines that do not cross.
In the technical scheme of the invention, the cabinet, the cable and the wire groove are abstracted into points, lines and shapes based on the topological principle, and the judgment on whether the communication possibility of the uncrossed lines exists can be realized only under the condition of knowing the line end points by maintaining and maintaining a set of topological models in the connection process. As shown in fig. 4, the idea of this topological algorithm is briefly summarized as follows:
first, there are some shapes on the plane. Each shape is made up of a plurality of edges. Each edge is composed of a plurality of points.
Two, each shape has two types of edges, one called the "peripheral edge" and one called the "internal orifice edge". Each shape can have at most one peripheral edge, can have no internal aperture edge, or can have multiple internal aperture edges. Such as: only one peripheral edge is in a shape corresponding to a circle; the shape of one peripheral edge and one inner hole edge correspond to the circular ring; the shapes of two inner hole edges of one peripheral edge correspond to the 8-shaped ring.
And thirdly, the area between the sides is called the inside of the shape, and the area outside the sides is called the outside of the shape.
All points which can be connected with each other through points inside the shape are called as connectable points; if the connected lines must contain points outside the shape, we call these points non-connectable.
Fifthly, any points in the same shape can be connected; while any points in the two shapes are not connectable.
And sixthly, connecting two points on the boundary of a certain shape each time, one of the following two situations can occur: if the two points connected are on the same edge, the shape will split into two shapes that are not connected to each other. If two points are connected with different edges, the two edges are merged into one edge.
And seventhly, by tracking the shapes which are split or changed after each connection, we can know which points are on each side of each shape at present, and therefore know which points can be connected.
Therefore, when we have maintained data for all shapes on this plane, it is simple to determine whether two points can be connected, which is equivalent to determining: whether the two points belong to the same shape.
For a better understanding of the present invention, the foregoing detailed description has been given in conjunction with specific embodiments thereof, but not with the intention of limiting the invention thereto. Any simple modifications of the above embodiments according to the technical essence of the present invention still fall within the scope of the technical solution of the present invention. In the present specification, each embodiment is described with emphasis on differences from other embodiments, and the same or similar parts between the respective embodiments may be referred to each other. For the system embodiment, since it basically corresponds to the method embodiment, the description is relatively simple, and for the relevant points, reference may be made to the partial description of the method embodiment.
Claims (10)
1. A machine room wiring optimization method comprises the step of carrying out wire-combining processing on similar wires, and is characterized by further comprising the following steps of:
step 1: optimizing the line by using a line crossing judgment method;
step 2: and generating the optimized machine room wiring layout.
2. The machine room wiring optimization method according to claim 1, wherein the line crossing judgment method comprises the steps of:
step 11: constructing a set of initial shapes;
step 12: according to the actual influence of the preorder line on the shape, carrying out shape segmentation or edge combination;
step 13: the non-cross-connectibility of the subsequent access point is judged by using the combined or divided shape set.
3. The machine room wiring optimization method of claim 2, wherein the step 11 comprises identifying an outlet slot edge line and a cabinet entrance for a given cabinet, trunking layout.
4. The machine room wiring optimization method of claim 3, wherein the slot edge line is abstracted as (B)1，B2，B3，…，Bm) Wherein m is the total number of edges.
5. The machine room wiring optimization method of claim 4, wherein (B) is2、B3、…、Bm) Is covered by B1Are surrounded and have no surrounding relationship with each other.
6. Machine room wiring optimization method according to claim 3, characterized in thatCharacterized in that the cabinet entrance is abstracted as a point (P) on the trunk line side line1，P2，P3，…，Pn) And n is the total number of the cabinet inlets.
7. Machine room wiring optimization method according to claim 6, characterized in that each point PnOccur on a plurality of edges or occur multiple times on one edge.
8. The machine room wiring optimization method of claim 3, wherein the step 11 further comprises constructing a total set C of all shapes.
9. The machine room wiring optimization method of claim 8, wherein in an initial stage, the elements in the total set C only have a shape S, and the shape S is all edges and an inner area surrounded by the edges.
10. A machine room wiring optimization system comprising a wirebound module for wirebound processing of similar wires, further comprising the following modules:
an optimization module: the method is used for optimizing the line by using a line crossing judgment method;
a generation module: and generating the optimized machine room layout.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911035081.8A CN110955946B (en) | 2019-10-29 | 2019-10-29 | Machine room wiring optimization method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911035081.8A CN110955946B (en) | 2019-10-29 | 2019-10-29 | Machine room wiring optimization method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110955946A true CN110955946A (en) | 2020-04-03 |
| CN110955946B CN110955946B (en) | 2024-06-21 |
Family
ID=69976482
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911035081.8A Active CN110955946B (en) | 2019-10-29 | 2019-10-29 | Machine room wiring optimization method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110955946B (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5119313A (en) * | 1987-08-04 | 1992-06-02 | Texas Instruments Incorporated | Comprehensive logic circuit layout system |
| US7315826B1 (en) * | 1999-05-27 | 2008-01-01 | Accenture, Llp | Comparatively analyzing vendors of components required for a web-based architecture |
| WO2014097585A1 (en) * | 2012-12-18 | 2014-06-26 | 株式会社デンソー | Pressure sensor and method for manufacturing same |
| CN105205203A (en) * | 2015-08-14 | 2015-12-30 | 国网技术学院 | Boundless crossed line distribution method of power distribution feeder line single line diagram |
| CN208581429U (en) * | 2018-07-17 | 2019-03-05 | 华为技术有限公司 | Power distribution unit and cabinet |
| CN109460564A (en) * | 2018-09-07 | 2019-03-12 | 国电南瑞科技股份有限公司 | A kind of electric network current diagram wiring method |
-
2019
- 2019-10-29 CN CN201911035081.8A patent/CN110955946B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5119313A (en) * | 1987-08-04 | 1992-06-02 | Texas Instruments Incorporated | Comprehensive logic circuit layout system |
| US7315826B1 (en) * | 1999-05-27 | 2008-01-01 | Accenture, Llp | Comparatively analyzing vendors of components required for a web-based architecture |
| WO2014097585A1 (en) * | 2012-12-18 | 2014-06-26 | 株式会社デンソー | Pressure sensor and method for manufacturing same |
| CN105205203A (en) * | 2015-08-14 | 2015-12-30 | 国网技术学院 | Boundless crossed line distribution method of power distribution feeder line single line diagram |
| CN208581429U (en) * | 2018-07-17 | 2019-03-05 | 华为技术有限公司 | Power distribution unit and cabinet |
| CN109460564A (en) * | 2018-09-07 | 2019-03-12 | 国电南瑞科技股份有限公司 | A kind of electric network current diagram wiring method |
Non-Patent Citations (3)
| Title |
|---|
| D.STAEPELAERE .ETC: "SURF：Rubber-band routing system for multichip modules", 《IEEE DESIGN & TEST OF COMPUTERS》, vol. 10, no. 4, 31 December 1993 (1993-12-31), pages 18 - 26 * |
| 吴祖增: "快速最优通道布线算法", 半导体学报, no. 04, 8 April 1984 (1984-04-08), pages 1 - 8 * |
| 戚捷: "通信机房设备与接地系统研究", 《中国优秀硕士学位论文全文数据库》, 31 March 2009 (2009-03-31), pages 042 - 239 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110955946B (en) | 2024-06-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US5491641A (en) | Towards optical steiner tree routing in the presence of rectilinear obstacles | |
| US5717600A (en) | Method for designing an interconnection route in an LSI | |
| WO2017215378A1 (en) | Software-defined network, node, path calculation method and device, and storage medium | |
| CN112560389B (en) | Detailed wiring method based on track distribution | |
| CN112528592B (en) | Multi-stage optimization-based X-structure wiring method considering wiring resource relaxation | |
| CN114595652B (en) | Dominant frequency evaluation method for hardware simulation platform | |
| US7134112B1 (en) | Incremental routing in integrated circuit design | |
| CN108880894A (en) | Network bandwidth planning method, device, equipment and storage medium | |
| CN110955946A (en) | Computer room wiring optimization method and system | |
| CN109933857B (en) | Clock tree trunk topology generation method and system for sensing integrated circuit layout information | |
| CN104462726B (en) | Wiring method for the field programmable gate array of antifuse | |
| CN103858441B (en) | A kind of path calculation method and device of ASON networks | |
| CN116882359A (en) | Propagation type segmentation method and device, electronic equipment and medium | |
| Wang et al. | Performance-driven interconnect global routing | |
| CN115297048B (en) | Routing path generation method and device based on optical fiber network | |
| EP3961472A2 (en) | System and method for generating connectivity models in network synthesis | |
| CN111062180B (en) | FPGA wiring method and device | |
| US20070204245A1 (en) | Method for accelerating the RC extraction in integrated circuit designs | |
| US6408426B1 (en) | Method for determining locations of interconnect repeater farms during physical design of integrated circuits | |
| CN114970442A (en) | Multilayer global wiring method considering bus perception | |
| CN103812701B (en) | A kind of intersection conflict preprocess method based on traffic flow parameters in network-on-chip | |
| Sepúlveda et al. | An evolutive approach for designing thermal and performance-aware heterogeneous 3D-NoCs | |
| Xu et al. | A traffic-robust routing algorithm for network-on-chip systems | |
| CN114050966B (en) | Method, device and equipment for generating service template and storage medium | |
| CN114422424B (en) | Route calculation method and device of transmission network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |