A method, system, terminal, and medium for filling metal patterns in a distributed chip layout.

By dividing the chip layout into rectangular grids and using a Master-Worker architecture for distributed computing, the limitations of memory and computing resources and the difficulties of cross-boundary collaborative processing in dummy filling of ultra-large-scale chip layouts are solved, achieving efficient and accurate metal pattern filling and improving processing efficiency and filling quality.

CN123116998APending Publication Date: 2026-11-17HUAXINCHENG (HANGZHOU) TECH CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202611613023.9
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2026-10-19
Publication Date
2026-11-17

AI Technical Summary

Technical Problem

Existing technologies suffer from limitations in memory and computing resources, excessive processing time, and difficulties in collaborative processing across blank areas at processing boundaries when handling dummy filling of ultra-large-scale chip layouts.

Method used

A distributed chip layout metal pattern filling method is adopted, which uniformly divides the chip layout into multiple rectangular grids. Using a Master-Worker architecture distributed computing system, grid tasks are distributed to idle Worker nodes through the Master node to fill the internal and boundary areas with metal patterns, and the boundary areas are matched and merged to finally generate a complete dummy-filled chip layout file.

Benefits of technology

It improves the processing efficiency, accuracy, scalability, and consistency of fill quality for ultra-large-scale metal graphic filling, and solves the performance bottleneck of single-machine serial processing and the difficulty of collaborative processing across boundary blank areas.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN123116998A_ABST
    Figure CN123116998A_ABST
Patent Text Reader

Abstract

This invention provides a distributed chip layout metal pattern filling method, system, terminal, and medium. The chip layout is uniformly divided into multiple rectangular grids. A Master node distributes grid tasks to idle Worker nodes to fill blank areas within complete regions of the grids with metal patterns, and uploads the internal region filling pattern data and boundary region data to the Master node. The Master node performs boundary region matching and merging to obtain merged blank areas spanning multiple grids and distributes them to idle Worker nodes. These Worker nodes fill the merged blank areas and upload the results to the Master node. The Master node obtains the final chip layout file with dummy fill patterns based on the two types of fill pattern data. This invention improves the processing efficiency, accuracy, scalability, and consistency of fill quality for ultra-large-scale layout metal pattern filling.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This invention relates to the field of semiconductor manufacturing technology, and in particular to a method, system, terminal, and medium for filling metal patterns in a distributed chip layout. Background Technology

[0002] As semiconductor process nodes continue to shrink, the scale and complexity of integrated circuits are growing exponentially. A single chip can have a layout area of ​​hundreds of square millimeters, containing billions of transistors and interconnects. In the back-end processes of chip manufacturing, chemical mechanical polishing (CMP) is a critical step to ensure wafer surface planarization. However, due to the uneven distribution of metal pattern density in different areas of the layout, the polishing rate of high-density areas is lower than that of low-density areas during CMP, leading to defects such as pitting and erosion, which severely affect chip reliability and yield. Therefore, how to make the metal pattern density more uniform across different areas of the layout has become an important problem that needs to be solved in the later stages of chip physical design.

[0003] To address the aforementioned issues, dummy filling technology was developed. This technology involves regularly adding non-functional dummy elements to the blank areas of the layout (i.e., areas without functional circuits and interconnects). By precisely controlling the fill density and pattern, the metal density distribution across the entire layout can be made more uniform, thereby improving the consistency of the CMP process.

[0004] Existing dummy filling processes typically employ a standalone, serial processing model. The basic steps include: first, identifying blank areas across the entire layout; second, performing fillability analysis on these blank areas based on design rules (such as minimum spacing, pattern size, etc.); and third, generating and placing dummy patterns that conform to these rules. However, this traditional method exposes serious performance bottlenecks when dealing with modern very large-scale chip layouts.

[0005] First, there are limitations in memory and computing resources. Loading entire gigabit or even terabit-level layout data into memory for analysis places extremely high demands on the memory capacity and computing power of a single server, which is costly and often impractical.

[0006] Secondly, the processing time is too long. Serial processing requires traversing every corner of the layout. For massive amounts of data, the filling process may take hours or even days, severely slowing down the chip design cycle (Time-to-Market).

[0007] Third, regional collaborative processing is difficult. Blank areas on the layout often cross artificially defined processing boundaries (such as module boundaries). In serial or simple parallel processing, blank areas that cross boundaries are either incorrectly segmented and processed, resulting in discontinuous filling graphics or violations of design rules; or complex preprocessing and postprocessing are required to merge the areas, increasing the complexity of the algorithm.

[0008] It is evident that existing technologies, when handling dummy filling of ultra-large-scale maps, are limited by the carrying capacity of single-machine resources and lack a collaborative processing mechanism for cross-boundary blank areas, making it difficult to simultaneously meet the requirements of efficiency, accuracy, and scalability. Summary of the Invention

[0009] In view of the shortcomings of the prior art described above, the purpose of this invention is to provide a distributed chip layout metal pattern filling method, system, terminal and medium to solve the technical problems of limited memory and computing resources, excessive processing time and difficulty in collaborative processing across blank areas of processing boundaries in the existing single-machine serial processing of ultra-large-scale chip layout dummy filling.

[0010] To achieve the above and other related objectives, this invention provides a distributed chip layout metal pattern filling method. The method includes: uniformly dividing the chip layout into multiple rectangular grids in a planar space based on the input chip layout data to be processed, and obtaining task descriptions for all rectangular grids; in a Master-Worker architecture distributed computing system, the Master node distributes the grid tasks to one or more worker nodes that are idle; the worker nodes that receive the grid tasks perform metal pattern filling on the blank areas of the complete internal regions of the grid to obtain internal region filling pattern data, and transmit the internal region filling pattern data and the boundary region data of the blank areas of the incomplete boundary regions of the grid to the Master node; the Master node performs boundary region matching and merging to obtain a complete merged blank area spanning multiple grids, and distributes it as a complete region task to the idle worker nodes; the worker nodes that receive the complete region task perform metal pattern filling on the merged blank area to obtain merged region filling pattern data and transmit it to the Master node; the Master node obtains the final chip layout file with dummy filling pattern based on the internal region filling pattern data and the merged region filling pattern data.

[0011] In one embodiment of the present invention, the task description of uniformly dividing the chip layout into multiple rectangular grids in planar space according to the input chip layout data to be processed, and obtaining all rectangular grids, includes: acquiring the input chip layout data to be processed; uniformly dividing the entire layout into row and column arranged rectangular grids in planar space according to a preset grid size, and obtaining the task description of all rectangular grids; wherein, the task description of the rectangular grid includes: grid identifier, the geometric coordinate range of the grid, and the layout data fragment index corresponding to the grid.

[0012] In one embodiment of the present invention, the distributed computing system using the Master-Worker architecture distributes grid tasks to one or more worker nodes that are in an idle state by the Master node, which includes: the Master node putting the task description of each rectangular grid into the task queue and distributing the corresponding grid tasks to the worker nodes that are in an idle state.

[0013] In one embodiment of the present invention, the Worker node receiving the mesh task reads the layout data within the mesh boundary range of the corresponding mesh and identifies all blank areas inside the mesh through geometric operations; the Worker node classifies each blank area into a blank area of ​​an internal complete region or a blank area of ​​an incomplete boundary region by boundary judgment; the Worker node directly performs metal graphic filling on the blank areas of the internal complete region locally to obtain the internal region filling graphic data; the Worker node encapsulates the boundary region data of the blank areas of the incomplete boundary region of the mesh and transmits it to the Master node, and then transmits the internal region filling graphic data to the Master node; wherein, the boundary region data of the blank areas of the incomplete boundary region includes: the geometric information of the region, the mesh identifier, and the boundary marker touched.

[0014] In one embodiment of the present invention, the Worker node classifies each blank area into a blank area of ​​complete internal region or a blank area of ​​incomplete boundary region by boundary judgment. The blank areas are classified as follows: if all the boundaries of the blank area are located inside the current grid, that is, they do not touch any of the four boundaries of the grid, then they are classified as blank areas of complete internal region; if the boundary of the blank area touches or intersects with one or more boundaries of the current grid, then they are classified as blank areas of incomplete boundary region.

[0015] In one embodiment of the present invention, the step of obtaining a complete merged blank area spanning multiple grids by performing boundary region matching and merging by the Master node, and distributing it as a complete area task to the idle Worker node includes: checking whether the blank area of ​​the newly received incomplete boundary area is spatially adjacent to the existing area in the boundary area pool to be merged and belongs to the same physical blank area; if so, the blank area is successfully matched; geometrically merging the successfully matched blank areas to form a complete merged blank area spanning multiple grids, and distributing it as a complete area task to the idle Worker node.

[0016] In one embodiment of the present invention, obtaining the final chip layout file with dummy fill graphics through the Master node based on the internal region fill graphic data and the merged region fill graphic data includes: the Master node integrating and splicing the internal region fill graphic data and the merged region fill graphic data according to the coordinate system of the original layout to obtain the final chip layout file with dummy fill graphics.

[0017] To achieve the above and other related objectives, this invention provides a distributed chip layout metal pattern filling system. The system includes: a data input module, used to uniformly divide the chip layout into multiple rectangular grids in a planar space based on input chip layout data to be processed, and obtain task descriptions for all rectangular grids; a task distribution module, used by the Master node to distribute grid tasks to one or more idle Worker nodes in a Master-Worker architecture distributed computing system; and a region classification and filling module, used by the Worker node receiving the grid task to perform metal pattern filling on the blank areas of the complete internal region of the grid to obtain internal region filling graphic data, and to classify the internal region filling graphic data... The module transmits boundary region data, including incomplete grid boundary areas and blank areas, to the Master node; the boundary region merging module, used by the Master node to match and merge boundary regions to obtain a complete merged blank area spanning multiple grids, and distributes it as a complete area task to idle Worker nodes; the merged area filling module, used by the Worker nodes that receive the complete area task to fill the merged blank area with metal patterns to obtain merged area filled graphic data, which is then transmitted to the Master node; and the data integration and layout generation module, used by the Master node to obtain the final chip layout file with dummy fill patterns based on the internal area filled graphic data and the merged area filled graphic data.

[0018] To achieve the above and other related objectives, the present invention provides an electronic terminal, comprising: one or more memories and one or more processors; the one or more memories are used to store a computer program; the one or more processors are connected to the memories and are used to run the computer program to execute the distributed chip layout metal pattern filling method.

[0019] To achieve the above and other related objectives, the present invention provides a computer-readable storage medium having a computer program stored thereon, the computer program executing the distributed chip layout metal pattern filling method.

[0020] As described above, this invention provides a distributed chip layout metal pattern filling method, system, terminal, and medium, which offers the following advantages: The invention uniformly divides the chip layout into multiple rectangular grids; the Master node distributes grid tasks to idle Worker nodes; the Worker nodes fill the blank areas within the complete regions of the grids with metal patterns and upload the internal region filling pattern data and boundary region data to the Master node; the Master node performs boundary region matching and merging to obtain merged blank areas spanning multiple grids and distributes them to idle Worker nodes; the Worker nodes fill the merged blank areas and upload the data to the Master node; the Master node obtains the final chip layout file with dummy fill patterns based on the two types of fill pattern data. This invention improves the processing efficiency, accuracy, scalability, and consistency of fill quality for ultra-large-scale layout metal pattern filling. Attached Figure Description

[0021] Figure 1 The diagram shown is a flowchart illustrating a distributed chip layout metal pattern filling method according to an embodiment of the present invention.

[0022] Figure 2 The diagram shown is a flowchart illustrating a distributed chip layout metal pattern filling method according to an embodiment of the present invention.

[0023] Figure 3 The diagram shown is a schematic representation of a distributed chip layout metal pattern filling system according to an embodiment of the present invention.

[0024] Figure 4 The diagram shown is a structural schematic of an electronic terminal according to an embodiment of the present invention. Detailed Implementation

[0025] The following specific examples illustrate the implementation of the present invention. Those skilled in the art can easily understand other advantages and effects of the present invention from the content disclosed in this specification. The present invention can also be implemented or applied through other different specific embodiments, and various details in this specification can also be modified or changed based on different viewpoints and applications without departing from the spirit of the present invention. It should be noted that, unless otherwise specified, the following embodiments and features described therein can be combined with each other.

[0026] It should be noted that in the following description, reference is made to the accompanying drawings, which illustrate several embodiments of the present invention. It should be understood that other embodiments may also be used, and changes in mechanical composition, structure, electrical system, and operation may be made without departing from the spirit and scope of the invention. The following detailed description should not be considered limiting, and the scope of the embodiments of the invention is defined only by the claims of the published patents. The terminology used herein is for the purpose of describing particular embodiments only and is not intended to limit the invention. Spatially related terms, such as “upper,” “lower,” “left,” “right,” “below,” “below,” “lower part,” “above,” “upper part,” etc., may be used herein to illustrate the relationship between one element or feature shown in the figures and another element or feature.

[0027] Throughout this specification, when it is said that a part is "connected" to another part, this includes not only "direct connection" but also "indirect connection" by placing other elements in between. Furthermore, when it is said that a part "includes" a certain constituent element, unless otherwise stated otherwise, this does not exclude other constituent elements, but rather means that other constituent elements may also be included.

[0028] The terms "first," "second," and "third," etc., used herein are for the purpose of describing various parts, components, regions, layers, and / or segments, but are not limiting. These terms are used only to distinguish one part, component, region, layer, or segment from others. Therefore, the "first part," "component," "region," "layer," or "segment" described below may refer to a "second part," "component," "region," "layer," or "segment" without departing from the scope of this invention.

[0029] Furthermore, as used herein, the singular forms “a,” “an,” and “the” are intended to include the plural forms as well, unless the context indicates otherwise. It should be further understood that the terms “comprising,” “including,” indicate the presence of the stated feature, operation, element, component, item, kind, and / or group, but do not preclude the presence, occurrence, or addition of one or more other features, operations, elements, components, items, kinds, and / or groups. The terms “or” and “and / or” as used herein are interpreted as inclusive, or mean any one or any combination thereof. Thus, “A, B, or C” or “A, B, and / or C” means “any one of: A; B; C; A and B; A and C; B and C; A, B, and C.” Exceptions to this definition arise only when combinations of elements, functions, or operations are inherently mutually exclusive in some manner.

[0030] This invention provides a distributed chip layout metal pattern filling method. The chip layout is uniformly divided into multiple rectangular grids. A Master node distributes grid tasks to idle Worker nodes. Worker nodes fill blank areas within complete regions of their grids with metal patterns, and upload the internal region filling data and boundary region data to the Master node. The Master node performs boundary region matching and merging to obtain merged blank areas spanning multiple grids, and distributes these merged blank areas to idle Worker nodes. These Worker nodes fill the merged blank areas and upload the data to the Master node. The Master node obtains the final chip layout file with dummy fill patterns based on the two types of fill data. This invention improves the processing efficiency, accuracy, scalability, and consistency of fill quality for ultra-large-scale layout metal pattern filling.

[0031] The present invention will now be described in detail with reference to the accompanying drawings, so that those skilled in the art can readily implement it. The present invention can be embodied in many different forms and is not limited to the embodiments described herein.

[0032] like Figure 1 This is a flowchart illustrating a distributed chip layout metal pattern filling method according to an embodiment of the present invention.

[0033] The method includes:

[0034] Step S1: Based on the input chip layout data to be processed, the chip layout is uniformly divided into multiple rectangular grids in the planar space to obtain the task description of all rectangular grids.

[0035] In one embodiment, step S1 includes: acquiring input chip layout data to be processed; dividing the entire layout into rectangular grids arranged in rows and columns in a planar space according to a preset grid size, and obtaining task descriptions for all rectangular grids; wherein, the task description of the rectangular grid includes: grid identifier, the geometric coordinate range of the grid, and the layout data fragment index corresponding to the grid.

[0036] Specifically, the process acquires the input chip layout data to be processed. This layout data is a very large-scale chip layout data to be filled with metal patterns, with a data volume reaching gigabits or even terabits. It includes the geometric data of the functional circuit patterns and interconnect wires in the layout. The entire layout is uniformly divided into M×N rectangular grids, each grid serving as a basic processing unit and assigned a unique grid identifier (Grid ID). The grid size setting needs to balance parallel granularity and communication overhead, and is usually determined based on the number and performance of worker nodes in the computing cluster. The smaller the grid size, the finer the parallel granularity and the lower the processing load of a single grid, but the communication overhead between grids and the number of cross-grid boundary regions increase accordingly. The larger the grid size, the coarser the parallel granularity and the lower the communication overhead, but the processing load of a single grid increases accordingly. Therefore, in practical applications, the grid size is usually set in conjunction with the number and performance of worker nodes in the cluster to achieve a balance between parallel granularity and communication overhead. The task description of the rectangular grid includes: grid identifier, the geometric coordinate range of the grid, and the layout data fragment index corresponding to the grid. In the task description of the rectangular grid, the grid identifier is used to uniquely identify each grid, the geometric coordinate range of the grid is used to limit the position and coverage of the grid in the layout plane space, and the layout data fragment index is used to identify the layout data fragment corresponding to the grid. After receiving the grid task, the Worker node can read the layout data within the corresponding grid boundary range according to the grid identifier and the layout data fragment index, so as to carry out subsequent blank area identification and filling processing locally.

[0037] In this way, each rectangular grid has an independent task description, and the grid tasks are independent of each other, so they can be distributed to different Worker nodes for parallel processing. At the same time, the coordinate range and piece index carried in the grid task description ensures that each Worker node can accurately read the layout data within its respective grid boundary. In one implementation, the geometric coordinate range of the grid is described using coordinate values ​​in the layout coordinate system. The geometric coordinate ranges of adjacent grids are interconnected and do not overlap, thus ensuring that the entire layout is completely covered, and that the processing range of each grid does not conflict with each other.

[0038] Step S2: In a Master-Worker architecture distributed computing system, the Master node distributes the grid tasks to one or more Worker nodes that are in an idle state.

[0039] In detail, in a Master-Worker distributed computing system, the Master node places the task descriptions of each rectangular grid into a task queue and distributes the corresponding grid tasks to one or more worker nodes that are in an idle state. Through this dynamic scheduling method, computing tasks can be evenly distributed across worker nodes, avoiding situations where some nodes become idle too early while others remain busy for extended periods, thereby improving the overall resource utilization of the cluster. A worker node can receive and process multiple grid tasks sequentially. The correspondence between grid tasks and worker nodes is determined by the Master node based on the idle state during distribution. After a worker node completes its current grid task, it can continue to receive the next grid task from the task queue until all grid tasks have been distributed.

[0040] In one embodiment, such as Figure 2 Step S2 includes: the Master node puts the task description of each rectangular grid into the task queue and distributes the corresponding grid tasks to the Worker nodes that are in an idle state.

[0041] The Master node dynamically distributes tasks based on the real-time status of each Worker node, ensuring an even distribution of computational tasks across all Worker nodes. This prevents some nodes from becoming idle prematurely while others remain busy for extended periods, thereby improving the overall resource utilization of the cluster. Each grid task in the task queue is retrieved sequentially and assigned to an idle Worker node. Once a Worker node completes its current grid task, it can continue receiving the next grid task from the queue until all grid tasks have been distributed.

[0042] Through dynamic task distribution, even if the processing load of each grid is different, grid tasks in the task queue can be continuously allocated to the first idle worker node, thereby achieving overall load balancing.

[0043] Specifically, the task queue stores the task descriptions of each rectangular grid, with each task description corresponding to a grid independently. When distributing tasks, the Master node provides the grid identifier, the grid's geometric coordinate range, and the layout data fragment index from the task description to the selected Worker node. The Worker node then processes the task based on this information. The distribution phase does not require the transmission of the entire grid's layout data, thus reducing the communication overhead during the distribution process.

[0044] Step S3: The Worker node that receives the mesh task fills the blank areas of the complete internal region of the mesh with metal graphics to obtain the internal region filling graphic data, and transmits the internal region filling graphic data and the boundary region data of the blank areas of the incomplete boundary region of the mesh to the Master node.

[0045] In detail, this step is executed by the Worker node that receives the mesh task. The Worker node reads the layout data within the mesh boundary range of the corresponding mesh and identifies all blank areas within the mesh through geometric operations (such as Boolean difference operations). For each blank area, boundary judgment is performed, classifying it into blank areas with complete internal regions or blank areas with incomplete boundaries. For blank areas with complete internal regions, metal graphic filling is performed locally, and the filling process strictly follows the preset Design Rule Check (DRC) rules to obtain the internal region filling graphic data. For blank areas with incomplete boundaries, filling is not performed temporarily, and the boundary region data of the area is encapsulated and transmitted to the Master node. Subsequently, the internal region filling graphic data is transmitted to the Master node.

[0046] In one embodiment, such as Figure 2 Step S3 includes the following sub-steps:

[0047] First, local blank area extraction. Worker nodes read the layout data within the grid boundary of the grid they are responsible for and identify all blank areas within that grid through geometric operations (such as Boolean difference). In one implementation, a Boolean difference operation is performed between the layout area within the grid boundary and the area occupied by the actual circuit pattern. After removing the area occupied by the actual circuit pattern, the remaining area is the blank area within the grid. These blank areas are defined by the actual circuit patterns (such as metal lines, vias, devices, etc.) within the grid.

[0048] Second, blank area classification. The Worker node performs boundary judgment on each identified blank area and classifies it as a blank area with complete internal area or a blank area with incomplete boundary.

[0049] Third, internal area filling. For blank areas within the complete internal area, the Worker node directly fills the metal graphic locally. The filling process strictly adheres to the preset Design Rule Check (DRC) rules, including the minimum size of the dummy graphic, minimum spacing, and minimum spacing with the functional graphic, to generate internal area filling graphic data.

[0050] Fourth, boundary region data upload. For blank areas with incomplete boundaries, the Worker node does not fill them immediately. Instead, it encapsulates the boundary region data of that area and transmits it to the Master node. Subsequently, the internal region filling graphic data is transmitted to the Master node. The boundary region data for blank areas with incomplete boundaries includes: the region's geometric information (such as the set of polygon vertex coordinates), the mesh identifier, and the boundary markers it touches (such as left, top, right, and bottom). The boundary markers indicate which boundary(s) the blank area touches or intersects with, providing a basis for the Master node to perform boundary region matching.

[0051] Through the above processing, the blank areas within the grid are divided into two processing paths: the blank areas of the complete internal area are filled directly on the Worker node without occupying cross-node communication resources; the blank areas of the incomplete boundary area are not filled for the time being, and their boundary area data is uploaded to the Master node, waiting to be merged with the adjacent areas of other grids for unified processing, thereby ensuring that the blank areas across grids are not divided and filled.

[0052] In one embodiment, such as Figure 2 The Worker node classifies each blank area by boundary judgment: if all boundaries of the blank area are inside the current grid, that is, it does not touch any of the four boundaries of the grid, it is classified as a blank area of ​​complete internal area; if the boundary of the blank area touches or intersects with one or more boundaries of the current grid, it is classified as a blank area of ​​incomplete boundary area.

[0053] This classification uses whether a blank area touches the grid boundary as the criterion to distinguish between internally complete areas and areas with incomplete boundaries. Through this criterion, Worker nodes can determine locally which blank areas can be filled independently and which require cross-grid merging by the Master node. For blank areas within an internally complete area, since they are entirely within a single grid and do not involve collaboration with other grids, they can be filled directly by the Worker node locally without additional cross-node communication. For blank areas with incomplete boundaries, since they may only be part of the same physical blank area spanning multiple grids, direct local filling would result in discontinuous fill patterns or violations of design rules at grid boundaries; therefore, they need to be uploaded to the Master node for unified processing. This classification is the foundation for achieving efficient parallel processing and correct merging.

[0054] In practical processing, the contact status between the blank area and the mesh boundary can be determined by comparing the geometric boundary of the blank area with the boundary coordinate range of the mesh. If the boundary of the blank area intersects or overlaps with the mesh boundary, it is determined that the blank area is in contact with or intersects with the corresponding mesh boundary. Through this classification judgment, the Worker node can determine the processing method of the blank area within its own mesh without interacting with other nodes, reducing unnecessary cross-node communication.

[0055] Step S4: The Master node performs boundary region matching and merging to obtain a complete merged blank area spanning multiple grids, and distributes it as a complete area task to the idle Worker nodes.

[0056] In one embodiment, such as Figure 2 Step S4 includes the following sub-steps:

[0057] First, region matching. The Master node continuously collects blank region data from incomplete boundary regions uploaded by various Worker nodes and maintains a global pool of boundary regions to be merged. The Master node checks whether the blank region of a newly received incomplete boundary region is spatially adjacent to an existing region in the pool of boundary regions to be merged and belongs to the same physical blank region. If so, the blank region is successfully matched. The criteria for judgment include: whether the region polygons can be seamlessly connected at the boundary and whether the grids to which they belong are adjacent.

[0058] Second, region merging. The successfully matched blank regions are geometrically merged to form a complete merged blank region spanning multiple grids.

[0059] Third, integrity determination and assignment. When the merged region becomes a complete closed polygon (i.e., its boundary no longer touches any mesh boundary, or all touching boundaries have been merged), the region is considered to have been merged. The Master node treats the merged blank region as a complete region task and redistributes it to an idle Worker node, which may be different from the Worker node that originally processed the relevant mesh.

[0060] During region matching, if a newly received incomplete region can seamlessly connect with an existing region in the pool at the boundary, and their respective grids are adjacent, then they can be considered different segments of the same physical blank region. After geometric merging, these segments are restored into a complete merged blank region spanning multiple grids. Only when the region is determined to have been completely merged (i.e., formed into a complete closed polygon) will the Master node redistribute it as a complete region task to avoid incomplete regions being prematurely filled.

[0061] In one implementation, the boundary region pool to be merged continuously receives boundary region data from different Worker nodes. As matching and merging proceed, the same physical blank area that was originally scattered in multiple grids is gradually restored into a whole. This merging process is only performed on the Master node, and each Worker node does not need to be aware of the blank area information of other grids, thereby reducing the coupling between nodes.

[0062] In one implementation, such as Figure 2 If a newly received incomplete boundary region does not find a matching region in the boundary region pool to be merged, it is added to the pool and awaits matching with subsequent uploaded adjacent regions. Since incomplete boundary regions are scattered across different grids, if each Worker node processes them independently, it will be difficult to detect other fragments belonging to the same physical blank area in other grids. By having the Master node uniformly collect all boundary region data and perform matching and merging, scattered fragments can be restored to complete blank areas before being filled as a whole, without increasing coupling between nodes. This avoids problems such as discontinuous filling patterns or violations of design rules caused by segmented filling.

[0063] Step S5: The Worker node that receives the complete area task performs metal graphic filling on the merged blank area to obtain the merged area filling graphic data and transmits it to the Master node.

[0064] In detail, this step is executed by the Worker node that receives the complete area task. The Worker node performs metallic graphic filling on the merged blank area, obtains the merged area fill graphic data, and transmits it to the Master node. The metallic graphic filling process performed on the merged blank area is the same as the filling process performed on the blank area of ​​the internal complete area, and also strictly follows the preset DRC rules, including the minimum size of the dummy graphic, the minimum spacing, and the minimum spacing with the functional graphic, so as to ensure that the blank area spanning multiple grids is filled as a whole, avoiding problems such as discontinuous fill graphics or violations of design rules at grid boundaries.

[0065] In one implementation, when filling merged blank areas, the merged blank areas are treated as a whole for rule checks and dummy graphic generation to ensure that the filled graphic remains coherent in areas that cross grid boundaries and that the fill density is consistent with the surrounding areas.

[0066] Step S6: Obtain the final chip layout file with dummy fill graphics by using the Master node based on the internal region fill graphics data and the merged region fill graphics data.

[0067] In one embodiment, such as Figure 2The Master node integrates and stitches together the internal region fill graphic data and the merged region fill graphic data according to the coordinate system of the original layout to obtain the final chip layout file with dummy fill graphics.

[0068] Specifically, the Master node collects the fill result data returned by all Worker nodes, including internal region fill graphic data obtained from filling blank areas within complete internal regions, and merged region fill graphic data obtained from merging blank areas. Following the coordinate system of the original layout, it integrates and stitches together all the scattered dummy fill graphic data to generate the final, complete chip layout file with dummy fill graphics, and outputs it. Since both the internal region fill graphic data and the merged region fill graphic data are generated in the coordinate system of the original layout, the Master node can stitch them back to their corresponding spatial positions on the layout based on the coordinate positions of each data point. The stitched chip layout file maintains the same coordinate system as the input layout.

[0069] In one implementation, when the Master node integrates the two types of fill graphic data, it splices them according to the coordinate positions of the two types of data in the original layout coordinate system to ensure that the position of each fill graphic in the final layout file is accurate.

[0070] Similar to the principles of the above embodiments, the present invention provides a distributed chip layout metal pattern filling system.

[0071] The following specific embodiments are provided in conjunction with the accompanying drawings:

[0072] like Figure 3 This diagram illustrates the structure of a distributed chip layout metal pattern filling system according to an embodiment of the present invention. The system includes:

[0073] Data input module 1 is used to divide the chip layout into multiple rectangular grids in a planar space according to the input chip layout data to be processed, and obtain the task description of all rectangular grids;

[0074] Task distribution module 2 is used in a Master-Worker architecture distributed computing system to distribute grid tasks from the Master node to one or more worker nodes that are in an idle state.

[0075] The region classification and filling module 3 is used to fill the blank areas of the complete internal region of the mesh with metal graphics by the Worker node that receives the mesh task, obtain the internal region filling graphic data, and transmit the internal region filling graphic data and the boundary region data of the blank areas of the incomplete boundary region of the mesh to the Master node.

[0076] Boundary region merging module 4 is used by the Master node to match and merge boundary regions to obtain a complete merged blank region spanning multiple grids, and distribute it as a complete region task to the idle Worker nodes.

[0077] The merged area filling module 5 is used by the Worker node that receives the complete area task to fill the merged blank area with metal graphics, obtain the merged area filling graphic data, and transmit it to the Master node.

[0078] The data integration and layout generation module 6 is used to obtain the final chip layout file with dummy fill graphics by using the Master node based on the internal region fill graphic data and the merged region fill graphic data.

[0079] Since the implementation principle of the distributed chip layout metal pattern filling system has been described in the previous embodiments, it will not be repeated here.

[0080] The distributed chip layout metal pattern filling method provided in this invention can be implemented on the electronic terminal side or the server side. Regarding the hardware structure of the electronic terminal, please refer to... Figure 4 This is a schematic diagram of an optional hardware structure of an electronic terminal 1000 provided in an embodiment of the present invention. The electronic terminal 1000 can be a mobile phone, computer device, tablet device, personal digital processing device, factory back-end processing device, etc. The electronic terminal 1000 includes: at least one processor 1001, a memory 1002, at least one network interface 10010, and a user interface 1009. The various components in the device are coupled together through a bus system 1005. It is understood that the bus system 1005 is used to realize the connection and communication between these components. In addition to a data bus, the bus system 1005 also includes a power bus, a control bus, and a status signal bus. However, for clarity, in... Figure 4 The general will label all buses as bus systems.

[0081] The user interface 1009 may include a monitor, keyboard, mouse, trackball, clicker, button, touchpad, or touch screen.

[0082] It is understood that memory 1002 can be volatile memory or non-volatile memory, or both. Non-volatile memory can be read-only memory (ROM) or programmable read-only memory (PROM), which serves as an external cache. By way of example, but not limitation, many forms of RAM are available, such as static random access memory (SRAM) and synchronous static random access memory (SSRAM). The memories described in the embodiments of this invention are intended to include, but are not limited to, these and any other suitable categories of memory.

[0083] In this embodiment of the invention, the memory 1002 is used to store various types of data to support the operation of the electronic terminal 1000. Examples of this data include: any executable program for operation on the electronic terminal 1000, such as the operating system 10021 and application program 10022; the operating system 10021 contains various system programs, such as the framework layer, core library layer, driver layer, etc., for implementing various basic services and handling hardware-based tasks. The application program 10022 may contain various applications, such as a media player, browser, etc., for implementing various application services. The implementation of the distributed chip layout metal pattern filling method provided in this embodiment of the invention can be included in the application program 10022.

[0084] The methods disclosed in the above embodiments of the present invention can be applied to or implemented by the processor 1001. The processor 1001 may be an integrated circuit chip with signal processing capabilities. In the implementation process, each step of the above method can be completed by the integrated logic circuit of the hardware in the processor 1001 or by instructions in the form of software. The processor 1001 may be a general-purpose processor, a digital signal processor (DSP), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. The processor 1001 can implement or execute the methods, steps, and logic block diagrams disclosed in the embodiments of the present invention. The general-purpose processor 1001 may be a microprocessor or any conventional processor, etc. The steps of the accessory optimization method provided in the embodiments of the present invention can be directly reflected as being executed by a hardware decoding processor, or being executed by a combination of hardware and software modules in the decoding processor. The software module may be located in a storage medium, which is located in a memory. The processor reads the information in the memory and combines it with its hardware to complete the steps of the aforementioned method.

[0085] In an exemplary embodiment, the electronic terminal 1000 may be used by one or more application-specific integrated circuits (ASICs), DSPs, programmable logic devices (PLDs), or complex programmable logic devices (CPLDs) to execute the aforementioned method.

[0086] Those skilled in the art will understand that all or part of the steps of the above-described method embodiments can be implemented using computer program-related hardware. The aforementioned computer program can be stored in a computer-readable storage medium. When executed, the program performs the steps of the above-described method embodiments; and the aforementioned storage medium includes various media capable of storing program code, such as ROM, RAM, magnetic disks, or optical disks.

[0087] In the embodiments provided in this application, the computer-readable and writable storage medium may include read-only memory, random access memory, EEPROM, CD-ROM or other optical disc storage devices, disk storage devices or other magnetic storage devices, flash memory, USB flash drive, portable hard drive, or any other medium capable of storing desired program code in the form of instructions or data structures and accessible by a computer. Additionally, any connection may be appropriately referred to as a computer-readable medium. For example, if instructions are transmitted from a website, server, or other remote source using coaxial cable, fiber optic cable, twisted pair, digital subscriber line (DSL), or wireless technologies such as infrared, radio, and microwave, then the coaxial cable, fiber optic cable, twisted pair, DSL, or wireless technologies such as infrared, radio, and microwave are included in the definition of medium. However, it should be understood that computer-readable and writable storage media and data storage media do not include connections, carrier waves, signals, or other transient media, but are intended for non-transient, tangible storage media. The disks and optical discs used in the application include compact optical discs (CDs), laser optical discs, optical discs, digital multifunction optical discs (DVDs), floppy disks, and Blu-ray discs, where disks typically copy data magnetically, while optical discs use lasers to copy data optically.

[0088] Compared with the prior art, the present invention has the following advantages:

[0089] First, it boasts high processing efficiency and scalability. By meshing the layout and utilizing a distributed system for parallel processing, the computational load can be distributed across multiple computing nodes. The processing time is approximately inversely proportional to the number of worker nodes, enabling linear acceleration. It can adapt to chip designs of varying scales, from tens of millions of gates to hundreds of billions of gates, breaking through the limitations of single-machine memory and computing power.

[0090] Secondly, it offers excellent global optimization. By specifically handling and merging blank areas that cross grid boundaries through the Master node, it ensures that regardless of where the blank area is located on the layout, it can be treated as a whole for metal graphic fill rule checks and optimizations. This avoids problems such as abrupt changes in fill density or violations of design rules at the boundaries that may occur with traditional partitioning methods, thus guaranteeing global consistency in fill quality.

[0091] Third, resource utilization and load balancing optimization. The Master-Worker dynamic task scheduling mode can evenly distribute computing tasks to each worker node, avoiding situations where some nodes are idle too early while others are busy for a long time, thus improving the resource utilization of the entire cluster.

[0092] Fourth, it reduces hardware costs and accelerates the design cycle. Instead of investing in a single, expensive, top-of-the-line server, clusters of ordinary commercial servers can be used to complete the metal graphic filling task for ultra-large-scale layouts, lowering the hardware barrier. Simultaneously, it can reduce processing times from tens of hours to several hours or even less, accelerating chip design iteration speed.

[0093] Fifth, it has strong versatility. The "divide and conquer-coordinated" core idea of ​​this application is not only applicable to metal graphic filling, but its architecture can also be applied to other large-scale layout processing tasks that require global traversal and optimization, such as antenna effect repair and decoupling capacitor filling in voltage drop analysis.

[0094] In summary, the distributed chip layout metal pattern filling method, system, terminal, and medium of this invention uniformly divide the chip layout into multiple rectangular grids; the Master node distributes grid tasks to idle Worker nodes; the Worker nodes fill the blank areas of the complete regions within the grids with metal patterns, and upload the internal region filling pattern data and boundary region data to the Master node; the Master node performs boundary region matching and merging to obtain merged blank areas spanning multiple grids and distributes them to idle Worker nodes; the Worker nodes fill the merged blank areas and upload them to the Master node; the Master node obtains the final chip layout file with dummy filling patterns based on the two types of filling pattern data. This invention improves the processing efficiency, accuracy, scalability, and consistency of filling quality for ultra-large-scale layout metal pattern filling. Therefore, this invention effectively overcomes the various shortcomings of the prior art and has high industrial application value.

[0095] The above embodiments are merely illustrative of the principles and effects of the present invention and are not intended to limit the invention. Any person skilled in the art can modify or alter the above embodiments without departing from the spirit and scope of the present invention. Therefore, all equivalent modifications or alterations made by those skilled in the art without departing from the spirit and technical concept disclosed in the present invention should still be covered by the claims of the present invention.

Claims

1. A method for filling metal patterns in a distributed chip layout, characterized in that, The method includes: Based on the input chip layout data to be processed, the chip layout is uniformly divided into multiple rectangular grids in planar space, and the task descriptions of all rectangular grids are obtained. In a Master-Worker architecture distributed computing system, the Master node distributes grid tasks to one or more Worker nodes that are in an idle state. The Worker node that receives the mesh task fills the blank areas of the complete internal region of the mesh with metal graphics to obtain the internal region filling graphic data, and transmits the internal region filling graphic data and the boundary region data of the blank areas of the incomplete boundary region of the mesh to the Master node. The Master node performs boundary region matching and merging to obtain a complete merged blank area spanning multiple grids, and distributes it as a complete area task to the idle Worker nodes. The Worker node that receives the complete area task performs metal graphic filling on the merged blank area to obtain the merged area filling graphic data and transmits it to the Master node. The final chip layout file with dummy fill graphics is obtained by using the Master node based on the internal region fill graphic data and the merged region fill graphic data.

2. The method for filling metal patterns in a distributed chip layout according to claim 1, characterized in that, The task description for dividing the chip layout data into multiple rectangular grids in a planar space based on the input chip layout data to be processed, and obtaining all the rectangular grids, includes: Obtain the input chip layout data to be processed; Based on the preset grid size, the entire layout is uniformly divided into rows and columns of rectangular grids in the planar space, and the task descriptions of all rectangular grids are obtained. The task description of the rectangular grid includes: grid identifier, the geometric coordinate range of the grid, and the layout data fragment index corresponding to the grid.

3. The method for filling metal patterns in a distributed chip layout according to claim 2, characterized in that, The distribution of grid tasks from the Master node to one or more worker nodes that are in an idle state in the Master-Worker architecture distributed computing system includes: The Master node puts the task descriptions of each rectangular grid into the task queue and distributes the corresponding grid tasks to the worker nodes that are in an idle state.

4. The method for filling metal patterns in a distributed chip layout according to claim 3, characterized in that, The Worker node receiving the mesh task reads the layout data within the mesh boundary range of the corresponding mesh and identifies all blank areas within the mesh through geometric operations. The Worker node classifies each blank area into a blank area with a complete internal region or a blank area with an incomplete boundary region based on boundary judgment. The Worker node directly performs metal graphic filling on the blank areas with complete internal regions locally to obtain the internal region filling graphic data. The Worker node encapsulates the boundary region data of the blank areas with incomplete boundary regions of the mesh and transmits it to the Master node, and then transmits the internal region filling graphic data to the Master node. The boundary region data of the blank areas with incomplete boundary regions includes: the geometric information of the region, the mesh identifier, and the boundary markers touched.

5. The method for filling metal patterns in a distributed chip layout according to claim 4, characterized in that, The worker node performs boundary checks on each blank area and categorizes it into blank areas with complete internal regions or blank areas with incomplete boundaries. The blank areas include: If all boundaries of the blank area are inside the current grid, that is, it does not touch any of the four boundaries of the grid, then it is classified as a blank area of ​​the internal complete area. If the boundary of the blank area touches or intersects with one or more boundaries of the current grid, it is classified as a blank area with incomplete boundaries.

6. The method for filling metal patterns in a distributed chip layout according to claim 1, characterized in that, The process of obtaining a complete merged blank area spanning multiple grids by boundary region matching and merging by the Master node, and distributing it as a complete area task to idle Worker nodes includes: Check whether the blank area of ​​the newly received incomplete boundary region is spatially adjacent to the existing region in the boundary region pool to be merged and belongs to the same physical blank area. If so, the blank area is successfully matched. The successfully matched blank areas are geometrically merged to form a complete merged blank area spanning multiple grids, and this merged blank area is distributed as a complete area task to the idle Worker nodes.

7. The method for filling metal patterns in a distributed chip layout according to claim 1, characterized in that, The process of obtaining the final chip layout file with dummy fill graphics through the Master node based on internal region fill graphics data and merged region fill graphics data includes: The Master node integrates and stitches together the internal region fill graphic data and the merged region fill graphic data according to the coordinate system of the original layout to obtain the final chip layout file with dummy fill graphics.

8. A distributed chip layout metal pattern filling system, characterized in that, The system includes: The data input module is used to divide the chip layout into multiple rectangular grids in a planar space evenly based on the input chip layout data to be processed, and obtain the task description of all rectangular grids; The task distribution module is used in a Master-Worker architecture distributed computing system to distribute grid tasks from the Master node to one or more Worker nodes that are idle. The region classification and filling module is used by the Worker node that receives the mesh task to fill the blank areas of the complete internal region of the mesh with metal graphics to obtain the internal region filling graphic data, and transmit the internal region filling graphic data and the boundary region data of the blank areas of the incomplete boundary region of the mesh to the Master node. The boundary region merging module is used by the Master node to match and merge boundary regions to obtain a complete merged blank region spanning multiple grids, and then distributes it as a complete region task to the idle Worker nodes. The merged region filling module is used by the Worker node that receives the complete region task to fill the merged blank region with metal graphics, obtain the merged region filling graphic data, and transmit it to the Master node. The data integration and layout generation module is used to obtain the final chip layout file with dummy fill graphics by using the Master node based on the internal region fill graphic data and the merged region fill graphic data.

9. An electronic terminal, characterized in that, include: One or more memories and one or more processors; The one or more memories are used to store computer programs; The one or more processors are connected to the memory and are used to run the computer program to perform the method as described in any one of claims 1 to 7.

10. A computer-readable storage medium having a computer program stored thereon, characterized in that, The computer program performs the method as described in any one of claims 1 to 7.