CN114880983A - H-shaped clock tree trunk node coordinate selection method and system based on clustering - Google Patents
H-shaped clock tree trunk node coordinate selection method and system based on clustering Download PDFInfo
- Publication number
- CN114880983A CN114880983A CN202210487931.3A CN202210487931A CN114880983A CN 114880983 A CN114880983 A CN 114880983A CN 202210487931 A CN202210487931 A CN 202210487931A CN 114880983 A CN114880983 A CN 114880983A
- Authority
- CN
- China
- Prior art keywords
- trunk
- clock tree
- coordinates
- node
- shaped clock
- 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.)
- Pending
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/30—Circuit design
- G06F30/39—Circuit design at the physical level
- G06F30/396—Clock trees
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F18/00—Pattern recognition
- G06F18/20—Analysing
- G06F18/23—Clustering techniques
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- Evolutionary Computation (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computer Hardware Design (AREA)
- Bioinformatics & Computational Biology (AREA)
- Computer Vision & Pattern Recognition (AREA)
- Evolutionary Biology (AREA)
- Bioinformatics & Cheminformatics (AREA)
- Artificial Intelligence (AREA)
- Life Sciences & Earth Sciences (AREA)
- Geometry (AREA)
- Design And Manufacture Of Integrated Circuits (AREA)
Abstract
The invention discloses a method and a system for selecting coordinates of trunk nodes of an H-shaped clock tree based on clustering, wherein the method comprises the following steps: 1) acquiring all triggers in a given area in the layout finished design, setting the number N of trunk nodes of the H-shaped clock tree and initializing the coordinates of each trunk node to enable each trunk node to correspond to a cluster; 2) distributing each trigger to a cluster corresponding to one main node and calculating a cost value; 3) calculating the coordinates of the central point of the cluster corresponding to each main node; 4) judging whether a preset ending condition is reached, if the preset ending condition is reached, taking the central point coordinate of the cluster corresponding to each main node as the main node coordinate of the selected H-shaped clock tree, ending and exiting; otherwise, jumping to execute step 2). The invention adopts a clustering method in machine learning to automatically select the coordinates of the trunk nodes of the H-shaped clock tree, and provides an efficient method for quickly constructing the H-shaped clock tree of the integrated circuit.
Description
Technical Field
The invention belongs to a clock tree design technology of a super-large-scale integrated circuit, and particularly relates to a method and a system for selecting coordinates of trunk nodes of an H-shaped clock tree based on clustering.
Background
In digital integrated circuit design, the clock signal is the reference for data transmission, which is decisive for the function, performance and stability of synchronous digital systems, so the characteristics of the clock signal and the layout of the clock tree are particularly important. At present, the mainstream clock Tree structures of digital integrated circuits include H-trees (H-Trees), X-trees (X-Trees), balanced trees (balanced-Trees) and clock grids (clock meshes). H-Tree is named because its physical form is similar to the letter H. The method is mainly characterized in that drivers of each stage are physically connected through an H-shaped metal network, and are gradually enlarged from a clock root node and cover all leaf nodes. The H-Tree is theoretically equal in distance from the root node to each leaf node, and therefore has the advantage of small clock skew, and is widely used in the field of current physical design. In order to quickly construct an H-shaped clock tree, an Electronic Design Automation (EDA) tool usually requires a physical designer to specify the coordinates of a trunk node of the H-shaped clock tree, and there is no method for automatically selecting the coordinates of the trunk node at present, so that the efficiency of selecting the coordinates of the trunk node is low.
Disclosure of Invention
The technical problems to be solved by the invention are as follows: the invention adopts a clustering method to automatically select the coordinates of the trunk nodes of the H-shaped clock tree, avoids manual designation of the coordinates of the trunk nodes of the H-shaped clock tree, can accelerate the construction of the H-shaped clock tree, has the advantages of high automation, high flexibility and good self-adaptability, and can quickly and efficiently help to construct the H-shaped clock tree in a given area.
In order to solve the technical problems, the invention adopts the technical scheme that:
a clustering-based H-shaped clock tree trunk node coordinate selection method comprises the following steps:
1) acquiring all triggers in a given area in the layout finished design, setting the number N of trunk nodes of the H-shaped clock tree and initializing the coordinates of each trunk node to enable each trunk node to correspond to a cluster;
2) distributing each trigger to a cluster corresponding to one main node and calculating a cost value;
3) calculating the coordinates of the central point of the cluster corresponding to each main node;
4) judging whether a preset ending condition is reached, if the preset ending condition is reached, taking the central point coordinate of the cluster corresponding to each main node as the main node coordinate of the selected H-shaped clock tree, ending and exiting; otherwise, jumping to execute step 2).
Optionally, the given area in step 1) is a rectangular area with a length l and a width h.
Optionally, the setting of the number N of trunk nodes of the H-shaped clock tree and initializing coordinates of the N trunk nodes in step 1) includes:
1.1) using the vector (C) 1 ,C 2 ,…,C N ) Representing N H-shaped clock tree trunk nodes, each with coordinates of (mu) x (C k ),μ y (C k ) Is represented by (a) wherein k ∈ [1, N)](ii) a M trunk nodes are arranged in the x direction and N trunk nodes are arranged in the y direction in a given area determined as a rectangular area, and N is equal to m x N and the trunk nodes C k Is represented by the sequence number k of (i-1) × m + j, wherein i ∈ [1, m ∈],j∈[1,n]；
1.2) dividing the length and width of a given area into N +1 equal parts, wherein each part has the length of l/(N +1) and the width of h/(N + 1);
1.3) passing of μ x (C k )＝l/(N+1)*j,μ y (C k ) Initializing the coordinates (μ) of any k-th trunk node (h/(N +1) × i) x (C k ),μ y (C k ))。
Optionally, in step 2), assigning each trigger to a cluster corresponding to one backbone node and calculating the cost value means finding a backbone node closest to the geometric distance of each trigger, and taking the closest geometric distance as the cost value of the trigger.
Optionally, the geometric distance is a manhattan distance, and the computational function expression of the cost value is:
cost＝min k∈[1,N] |x-μ x (C k )|+|y-μ y (C k )|，
in the above formula, cost represents the cost value, and min represents the value in k ∈ [1, N ∈]Taking the minimum value in the range, wherein k is the serial number of the trunk node, and (x, y) are the coordinates of the trigger (mu) x (C k ),μ y (C k ) Is an arbitrary k-th backbone node C k The coordinates of (c).
Optionally, the function expression for calculating the coordinates of the center point of the cluster corresponding to each backbone node in step 3) is as follows:
in the above formula, (. mu.) x (C k ),μ y (C k ) Is an arbitrary k-th backbone node C k (x) of (C) i ,y i ) M is the number of flip-flops in the kth cluster, which is the coordinate of any ith flip-flop.
Optionally, the end condition preset in step 4) means that the cost value of each trigger is not changed any more.
Optionally, the preset end condition in step 4) means that the number of iterations of step 2) and step 3) exceeds a set value.
In addition, the invention also provides a system for selecting the coordinates of the trunk nodes of the H-shaped clock tree based on clustering, which comprises a microprocessor and a memory which are connected with each other, wherein the microprocessor is programmed or configured to execute the steps of the method for selecting the coordinates of the trunk nodes of the H-shaped clock tree based on clustering.
Furthermore, the present invention also provides a computer-readable storage medium having stored therein a computer program for being programmed or configured by a microprocessor to carry out the steps of the cluster-based H-shaped clock tree trunk node coordinate selection method.
Compared with the prior art, the invention has the following advantages:
1. the invention does not need to manually appoint the coordinates of the trunk nodes of the H-shaped clock tree, and can effectively avoid the randomness of manual appointing.
2. The method automatically acquires the coordinates of the trunk nodes of the H-shaped clock tree according to the specific distribution of the triggers after the layout, can quickly and efficiently generate the H-shaped clock tree, has the advantages of high automation, high flexibility and good self-adaptability, and provides an efficient method for quickly constructing the H-shaped clock tree of the integrated circuit.
Drawings
FIG. 1 is a schematic flow chart of a method according to an embodiment of the present invention.
Fig. 2 is a schematic diagram of an H-shaped clock tree with 4 trunk nodes according to an embodiment of the present invention.
Fig. 3 is a schematic diagram of an initialized coordinate of a rectangular area having 4 trunk nodes according to an embodiment of the present invention.
Fig. 4 is a schematic diagram illustrating 4 triggers allocated to 4 backbone node clusters according to an embodiment of the present invention.
Detailed Description
The first embodiment is as follows:
as shown in fig. 1, the method for selecting coordinates of a trunk node of an H-shaped clock tree based on clustering in this embodiment includes:
1) acquiring all triggers in a given area in the layout finished design, setting the number N of trunk nodes of the H-shaped clock tree and initializing the coordinates of each trunk node to enable each trunk node to correspond to a cluster;
2) traversing all triggers to take out one trigger as a current trigger, distributing the current trigger to a cluster corresponding to a main node and calculating a cost value;
3) calculating the coordinates of the central point of the cluster corresponding to each main node;
4) judging whether all triggers are traversed or not, if so, taking the central point coordinate of the cluster corresponding to each main node as the main node coordinate of the selected H-shaped clock tree, ending and exiting; otherwise, jumping to execute step 2).
In the present embodiment, the given region in step 1) is a rectangular region having a length l and a width h. The rectangular area may be a rectangular area or a square area.
In this embodiment, the setting of the number N of trunk nodes of the H-shaped clock tree and the initializing coordinates of the N trunk nodes in step 1) includes:
1.1) using the vector (C) 1 ,C 2 ,…,C N ) Representing N H-shaped clock tree trunk nodes, each with coordinates of (mu) x (C k ),μ y (C k ) Is represented by (a) wherein k ∈ [1, N)](ii) a M trunk nodes are arranged in the x direction and N trunk nodes are arranged in the y direction in a given area determined as a rectangular area, and N is equal to m x N and the trunk nodes C k Is expressed as (i-1) × m + j, where i ∈ [1, m ∈],j∈[1,n]；
1.2) dividing the length and width of a given area into N +1 equal parts, wherein each part has the length of l/(N +1) and the width of h/(N + 1);
1.3) passing of μ x (C k )＝l/(N+1)*j,μ y (C k ) Initializing the coordinates (μ) of any k-th trunk node (h/(N +1) × i) x (C k ),μ y (C k )). In this embodiment, the value N of the number of trunk nodes of the H-shaped clock tree is set to 4, a schematic diagram of the set H-shaped clock tree having 4 trunk nodes is shown in fig. 2, and coordinates of the initialized 4 trunk nodes are shown in fig. 3.
In this embodiment, allocating each trigger to a cluster corresponding to one trunk node in step 2) and calculating the cost value means finding a trunk node closest to the geometric distance of each trigger, and taking the closest geometric distance as the cost value of the trigger.
Wherein the geometric distance can select the required distance calculation mode according to the requirement. For example, as an optional implementation manner, in this embodiment, the geometric distance is a manhattan distance, and the calculation function expression of the cost value is:
cost＝min k∈[1,N] |x-μ x (C k )|+|y-μ y (C k )|，
in the above formula, cost represents the cost value, and min represents the value in k ∈ [1, N ∈]Taking the minimum value in the range, wherein k is the serial number of the trunk node, and (x, y) are the coordinates of the trigger (mu) x (C k ),μ y (C k ) Is an arbitrary k-th backbone node C k The coordinates of (a).
In this embodiment, the function expression for calculating the coordinates of the center point of the cluster corresponding to each trunk node in step 3) is as follows:
in the above formula, (. mu.) x (C k ),μ y (C k ) Is an arbitrary k-th backbone node C k (x) of (C) i ,y i ) M is the number of flip-flops in the kth cluster, which is the coordinate of any ith flip-flop. As shown in FIG. 4, four flip-flops FF1, FF2, FF3, and FF4 within a given region are assigned to the backbone node C according to Manhattan distance, respectively 1 、C 2 、C 3 And C 4 In the corresponding cluster.
The end condition preset in step 4) may be selected as needed, for example, as an optional implementation manner, the end condition preset in step 4) in this embodiment means that the cost value of each trigger is not changed any more. And if the cost value of each trigger is found to be changed, namely the cost value is different from the result obtained by executing the step 2) in the previous time, skipping and repeatedly executing the step 2) -the step 3) until the cost values of all the triggers are not changed any more, and taking the final central point coordinate of each cluster as the trunk node coordinate of the H-shaped clock tree.
In summary, in the clustering-based method for selecting coordinates of trunks nodes of an H-shaped clock tree in this embodiment, for constructing an H-shaped clock tree in a rectangular region after layout is completed, coordinates of the trunks nodes of the H-shaped clock tree are automatically obtained by a clustering method, so that the H-shaped clock tree can be quickly and efficiently constructed, manual specification of the coordinates of the trunks nodes of the H-shaped clock tree is avoided, and the clustering-based method has the advantages of high automation, high flexibility and good adaptability, and can quickly and efficiently help to construct the H-shaped clock tree in a given region.
In addition, the present embodiment further provides a system for selecting coordinates of a trunk node of an H-shaped clock tree based on clustering, which includes a microprocessor and a memory connected to each other, where the microprocessor is programmed or configured to execute the steps of the method for selecting coordinates of a trunk node of an H-shaped clock tree based on clustering.
Furthermore, the present embodiment also provides a computer-readable storage medium, in which a computer program is stored, the computer program being programmed or configured by a microprocessor to perform the steps of the aforementioned clustering-based H-shaped clock tree trunk node coordinate selection method.
Example two:
this embodiment is substantially the same as the first embodiment, and the main difference is that the ending condition preset in step 4) is different. In this embodiment, the preset end condition in step 4) means that the number of iterations in step 2) and step 3) exceeds a set value, and the effect similar to that of embodiment one can be achieved by taking the value of the set value.
In addition, the embodiment further provides a system for selecting coordinates of the trunks nodes of the H-shaped clock tree based on clustering, which comprises a microprocessor and a memory, which are connected with each other, wherein the microprocessor is programmed or configured to execute the steps of the method for selecting coordinates of the trunks nodes of the H-shaped clock tree based on clustering.
Furthermore, the present embodiment also provides a computer-readable storage medium, in which a computer program is stored, the computer program being programmed or configured by a microprocessor to perform the steps of the aforementioned clustering-based H-shaped clock tree trunk node coordinate selection method.
As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-readable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein. The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks. These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks. These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
The above description is only a preferred embodiment of the present invention, and the protection scope of the present invention is not limited to the above embodiments, and all technical solutions belonging to the idea of the present invention belong to the protection scope of the present invention. It should be noted that modifications and embellishments within the scope of the invention may occur to those skilled in the art without departing from the principle of the invention, and are considered to be within the scope of the invention.
Claims (10)
1. A clustering-based H-shaped clock tree trunk node coordinate selection method is characterized by comprising the following steps:
1) acquiring all triggers in a given area in the layout finished design, setting the number N of trunk nodes of the H-shaped clock tree and initializing the coordinates of each trunk node to enable each trunk node to correspond to a cluster;
2) distributing each trigger to a cluster corresponding to one main node and calculating a cost value;
3) calculating the coordinates of the central point of the cluster corresponding to each main node;
4) judging whether a preset ending condition is reached, if the preset ending condition is reached, taking the central point coordinate of the cluster corresponding to each trunk node as the trunk node coordinate of the selected H-shaped clock tree, ending and exiting; otherwise, jumping to execute step 2).
2. The method for selecting coordinates of a trunk node of a cluster-based H-shaped clock tree according to claim 1, wherein the given area in step 1) is a rectangular area with a length l and a width H.
3. The method for selecting coordinates of trunk nodes of an H-shaped clock tree based on clustering according to claim 2, wherein the step 1) of setting the number N of trunk nodes of the H-shaped clock tree and initializing the coordinates of the N trunk nodes comprises:
1.1) using the vector (C) 1 ,C 2 ,…,C N ) Representing N H-shaped clock tree trunk nodes, each with coordinates of (mu) x (C k ),μ y (C k ) Is represented by (a) wherein k ∈ [1, N)](ii) a M trunk nodes are arranged in the x direction and N trunk nodes are arranged in the y direction in a given area determined as a rectangular area, and N is equal to m x N and the trunk nodes C k The sequence number k of (a) is represented by (i-1).)m + j, where i ∈ [1, m ]],j∈[1,n]；
1.2) dividing the length and width of a given area into N +1 equal parts, wherein each part has the length of l/(N +1) and the width of h/(N + 1);
1.3) passing of μ x (C k )＝l/(N+1)*j,μ y (C k ) Initializing the coordinates (μ) of any k-th trunk node (h/(N +1) × i) x (C k ),μ y (C k ))。
4. The method for selecting coordinates of trunk nodes of an H-shaped clock tree based on clustering according to claim 1, wherein the step 2) of assigning each trigger to a cluster corresponding to a trunk node and calculating the cost value means that the trunk node closest to the geometric distance of each trigger is found, and the closest geometric distance is used as the cost value of the trigger.
5. The method of claim 4, wherein the geometric distance is a Manhattan distance, and the cost value is calculated as a function of:
cost＝min k∈[1,N] |x-μ x (C k )|+|y-μ y (C k )|，
in the above formula, cost represents the cost value, and min represents the value in k ∈ [1, N ∈]Taking the minimum value in the range, wherein k is the serial number of the trunk node, and (x, y) are the coordinates of the trigger (mu) x (C k ),μ y (C k ) Is an arbitrary k-th backbone node C k The coordinates of (a).
6. The method for selecting coordinates of H-shaped clock tree trunk nodes based on clustering according to claim 1, wherein the function expression for calculating the coordinates of the center point of the cluster corresponding to each trunk node in step 3) is as follows:
the upper typeOf (u) x (C k ),μ y (C k ) Is an arbitrary k-th backbone node C k (x) of (C) i ,y i ) M is the number of flip-flops in the kth cluster, which is the coordinate of any ith flip-flop.
7. The method for selecting coordinates of trunk nodes of H-shaped cluster-based clock tree according to claim 1, wherein the end condition preset in step 4) means that the cost value of each trigger is not changed.
8. The method for selecting coordinates of a trunk node of an H-shaped clock tree based on clustering according to claim 1, wherein the preset termination condition in step 4) means that the number of iterations of step 2) and step 3) exceeds a set value.
9. A cluster-based H-clock tree trunk node coordinate selection system comprising a microprocessor and a memory connected to each other, characterized in that the microprocessor is programmed or configured to perform the steps of the cluster-based H-clock tree trunk node coordinate selection method according to any one of claims 1 to 8.
10. A computer-readable storage medium, in which a computer program is stored which is adapted to be programmed or configured by a microprocessor to carry out the steps of the cluster-based H-clock tree trunk node coordinate selection method according to any one of claims 1 to 8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210487931.3A CN114880983A (en) | 2022-05-06 | 2022-05-06 | H-shaped clock tree trunk node coordinate selection method and system based on clustering |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210487931.3A CN114880983A (en) | 2022-05-06 | 2022-05-06 | H-shaped clock tree trunk node coordinate selection method and system based on clustering |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN114880983A true CN114880983A (en) | 2022-08-09 |
Family
ID=82673519
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210487931.3A Pending CN114880983A (en) | 2022-05-06 | 2022-05-06 | H-shaped clock tree trunk node coordinate selection method and system based on clustering |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114880983A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115964984A (en) * | 2023-03-16 | 2023-04-14 | 瀚博半导体(上海)有限公司 | Method and device for balanced winding of digital chip layout |
-
2022
- 2022-05-06 CN CN202210487931.3A patent/CN114880983A/en active Pending
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115964984A (en) * | 2023-03-16 | 2023-04-14 | 瀚博半导体(上海)有限公司 | Method and device for balanced winding of digital chip layout |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP3333735B1 (en) | Method and computer program for determining a placement of at least one circuit for a reconfigurable logic device | |
| TWI678617B (en) | "system, computer-implemented method, and apparatus for accessing data in multi-dimensional tensors using adders" | |
| CN110516789B (en) | Method and device for processing instruction set in convolutional network accelerator and related equipment | |
| US8429588B2 (en) | Method and mechanism for extraction and recognition of polygons in an IC design | |
| CN110096823B (en) | Digital integrated circuit wiring method based on binary coding and terminal equipment | |
| CN111915011B (en) | Single-amplitude quantum computing simulation method | |
| CN111931939B (en) | Single-amplitude quantum computing simulation method | |
| CN114970439A (en) | Automatic wiring method, device, computer equipment and storage medium | |
| CN114880983A (en) | H-shaped clock tree trunk node coordinate selection method and system based on clustering | |
| CN116822422A (en) | Analysis optimization method of digital logic circuit and related equipment | |
| CN108513658A (en) | A kind of transaction methods and device | |
| US20190197767A1 (en) | Surface extrction method, apparatus, and non-transitory computer readable storage medium thereof | |
| CN110955380B (en) | Access data generation method, storage medium, computer device and apparatus | |
| CN116911224A (en) | Method for optimizing digital logic circuit, computer device and storage medium | |
| CN111339371B (en) | Data processing method and device | |
| CN116366538A (en) | Path updating and equivalent path planning method and related device under dynamic network | |
| JP3215351B2 (en) | Arrangement method | |
| US8762917B2 (en) | Automatically modifying a circuit layout to perform electromagnetic simulation | |
| CN108921950B (en) | Method for three-dimensional fracture simulation and related device | |
| US20080098343A1 (en) | System and method for text based placement engine for custom circuit design | |
| JP2007213243A (en) | Numerical analysis mesh generation device, numerical analysis mesh generation method and numerical analysis mesh generation program | |
| US12124788B2 (en) | Handling engineering change orders for integrated circuits in a design | |
| US20230195992A1 (en) | Handling Engineering Change Orders for Integrated Circuits in a Design | |
| CN118113660B (en) | FPGA delay optimization method, device, equipment, storage medium and program product | |
| CN118363252B (en) | Method, apparatus and medium for layout processing |
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 |