阅读说明：本技术 配对图形的插入方法、设备和存储介质 (Insertion method, device and storage medium of pairing graph ) 是由 张兴洲 于 2020-04-17 设计创作，主要内容包括：本申请公开了一种配对图形的插入方法、设备和存储介质,包括：在集成电路版图插入第一配对图形；沿插入方向,在距离第一配对图形预定距离的位置插入第二配对图形,第二配对图形是与第一配对图形在形状上匹配的图形；当第一配对图形和第二配对图形中存在任一配对图形不满足配对图形插入标准时,沿移动方向移动第一配对图形和第二配对图形,直至第一配对图形和第二配对图形满足配对图形插入标准。本申请通过在集成电路版图中插入在形状上相互匹配的第一配对图形和第二配对图形,通过移动第一配对图形和第二配对图形以满足配对图形标准,在实现了在集成电路版图中自动插入配对图形的基础上,降低了配对图形的插入错误几率。(The application discloses a method, equipment and storage medium for inserting pairing graphs, which comprise the following steps: inserting a first pairing graph into an integrated circuit layout; inserting a second mating pattern at a position spaced apart from the first mating pattern by a predetermined distance along an insertion direction, the second mating pattern being a pattern that matches the first mating pattern in shape; and when any one of the first pairing graph and the second pairing graph does not meet the pairing graph insertion standard, moving the first pairing graph and the second pairing graph along the moving direction until the first pairing graph and the second pairing graph meet the pairing graph insertion standard. According to the method and the device, the first pairing graph and the second pairing graph which are matched in shape are inserted into the integrated circuit layout, and the first pairing graph and the second pairing graph are moved to meet the pairing graph standard, so that the insertion error probability of the pairing graph is reduced on the basis of automatically inserting the pairing graph into the integrated circuit layout.)

1. A method for inserting a mating pattern, comprising:

inserting a first pairing graph into an integrated circuit layout;

inserting a second mating pattern at a position spaced apart from the first mating pattern by a predetermined distance in an insertion direction, the second mating pattern being a pattern that matches in shape the first mating pattern;

when any one of the first paired graph and the second paired graph does not meet the paired graph insertion standard, moving the first paired graph and the second paired graph along a moving direction until the first paired graph and the second paired graph meet the paired graph insertion standard;

wherein the pairing graph insertion criterion comprises that the pairing graph does not have an overlapping area with other pairing graphs and the distance between the pairing graph and the scribing mark is larger than a distance threshold value, and the moving direction is perpendicular to the insertion direction.

2. The method of claim 1, wherein the moving the first and second mating patterns in a moving direction until the first and second mating patterns satisfy the mating pattern insertion criterion comprises:

detecting whether the second pairing graph meets the pairing graph standard;

when the second pairing graph does not meet the pairing graph standard, moving the second pairing graph along the moving direction until the second pairing graph meets the pairing graph standard;

moving the first paired graph by a first distance along the moving direction, and detecting whether the first paired graph meets the paired graph standard, wherein the first distance is the moving distance of the second paired graph;

when the first pairing graph does not meet the pairing graph standard, moving the first pairing graph along the moving direction until the first pairing graph meets the pairing graph standard;

moving the second pairing graph by a second distance along the moving direction, and detecting whether the second pairing graph meets the pairing graph standard, wherein the second distance is the moving distance of the first pairing graph;

repeating the steps until the first pairing graph and the second pairing graph meet the pairing graph insertion standard.

3. The method of claim 2, wherein the detecting whether the second pairing pattern meets the pairing pattern criteria comprises:

detecting whether the second pairing graph has an overlapping area with other graphs;

calculating a first distance between the second pairing pattern and a scribing mark at the closest distance in the moving direction;

detecting whether the first spacing is less than a distance threshold;

determining that the second mating graph does not satisfy the mating graph criterion when the second mating graph has an overlap region with the other graph and/or when the first separation is less than the distance threshold.

4. The method of claim 3, wherein the second mating pattern is determined to satisfy the mating pattern criterion when the second mating pattern does not have an overlap region with the other patterns and the first separation distance is greater than the distance threshold.

5. The method of claim 4, wherein said moving the second mating pattern in the moving direction until the second mating pattern meets the mating pattern criteria comprises:

moving the second pairing graph for a unit distance along the moving direction, and detecting whether the second pairing graph meets the pairing graph standard;

and when the second pairing graph does not meet the pairing graph standard, repeating the steps until the second pairing graph meets the pairing graph standard.

6. The method of claim 2, wherein the detecting whether the first pairing graph satisfies the pairing graph criterion comprises:

detecting whether the first pairing graph has an overlapping area with other graphs;

calculating a second distance between the first pairing pattern and the scribing mark at the closest distance in the moving direction;

detecting whether the second distance is less than a distance threshold;

determining that the first pairing graph does not satisfy the pairing graph criteria when the first pairing graph has an overlap region with the other graphs, and/or when the second spacing is less than the distance threshold.

7. The method of claim 6, wherein the first paired graph is determined to satisfy the paired graph criterion when the first paired graph has no overlap region with the other graphs and the second distance is greater than the distance threshold.

8. The method of claim 7, wherein moving the first mating pattern in the moving direction until the first mating pattern meets the mating pattern criteria comprises:

moving the first pairing graph for a unit distance along the moving direction, and detecting whether the first pairing graph meets the pairing graph standard;

when the first pairing graph does not meet the pairing graph standard, repeating the steps until the first pairing graph meets the pairing graph standard.

9. A computer device comprising a processor and a memory, wherein at least one instruction or program is stored in the memory, and wherein the instruction or program is loaded and executed by the processor to implement the method of inserting a pairing graph according to any one of claims 1 to 8.

10. A computer-readable storage medium, in which at least one instruction or program is stored, which is loaded and executed by a processor to implement the method of inserting a pairing figure according to any one of claims 1 to 8.

Technical Field

The present application relates to the field of integrated circuit manufacturing technologies, and in particular, to a method, an apparatus, and a storage medium for inserting a pairing pattern in integrated circuit layout design.

Background

Referring to fig. 1, a schematic diagram of a pairing pattern in an integrated circuit layout is shown. As shown in fig. 1, a mating pattern 121 is provided on the exposure unit (shot)111, and a mating pattern 122 is provided on the exposure unit 112, wherein the mating pattern 121 and the mating pattern 122 are a pattern pair that can be pieced together into one finished image. When it is determined that the mating pattern 121 and the mating pattern 122 can be stitched, it is determined that the exposure units 111 and 112 are accurately exposed.

Disclosure of Invention

The application provides a method, equipment and storage medium for inserting a pairing graph, which can solve the problems of low efficiency and high error rate caused by inserting the graph in an integrated circuit layout in a manual mode in the related art.

In one aspect, an embodiment of the present application provides a method for inserting a pairing graph, including:

inserting a first pairing graph into an integrated circuit layout;

inserting a second mating pattern at a position spaced apart from the first mating pattern by a predetermined distance in an insertion direction, the second mating pattern being a pattern that matches in shape the first mating pattern;

when any one of the first paired graph and the second paired graph does not meet the paired graph insertion standard, moving the first paired graph and the second paired graph along a moving direction until the first paired graph and the second paired graph meet the paired graph insertion standard;

wherein the pairing graph insertion criterion comprises that the pairing graph does not have an overlapping area with other pairing graphs and the distance between the pairing graph and the scribing mark is larger than a distance threshold value, and the moving direction is perpendicular to the insertion direction.

Optionally, the moving the first pairing graph and the second pairing graph along the moving direction until the first pairing graph and the second pairing graph meet the pairing graph insertion criterion includes:

detecting whether the second pairing graph meets the pairing graph standard;

when the second pairing graph does not meet the pairing graph standard, moving the second pairing graph along the moving direction until the second pairing graph meets the pairing graph standard;

moving the first paired graph by a first distance along the moving direction, and detecting whether the first paired graph meets the paired graph standard, wherein the first distance is the moving distance of the second paired graph;

when the first pairing graph does not meet the pairing graph standard, moving the first pairing graph along the moving direction until the first pairing graph meets the pairing graph standard;

moving the second pairing graph by a second distance along the moving direction, and detecting whether the second pairing graph meets the pairing graph standard, wherein the second distance is the moving distance of the first pairing graph;

repeating the steps until the first pairing graph and the second pairing graph meet the pairing graph insertion standard.

Optionally, the detecting whether the second pairing graph meets the pairing graph criterion includes:

detecting whether the second pairing graph has an overlapping area with other graphs;

calculating a first distance between the second pairing pattern and a scribing mark at the closest distance in the moving direction;

detecting whether the first spacing is less than a distance threshold;

determining that the second mating graph does not satisfy the mating graph criterion when the second mating graph has an overlap region with the other graph and/or when the first separation is less than the distance threshold.

Optionally, when the second pairing graph does not have an overlapping area with the other graphs and the first distance is greater than the distance threshold, determining that the second pairing graph satisfies the pairing graph criterion.

Optionally, the moving the second pairing graph along the moving direction until the second pairing graph meets the pairing graph criterion includes:

moving the second pairing graph for a unit distance along the moving direction, and detecting whether the second pairing graph meets the pairing graph standard;

and when the second pairing graph does not meet the pairing graph standard, repeating the steps until the second pairing graph meets the pairing graph standard.

Optionally, the detecting whether the first pairing graph meets the pairing graph criterion includes:

detecting whether the first pairing graph has an overlapping area with other graphs;

calculating a second distance between the first pairing pattern and the scribing mark at the closest distance in the moving direction;

detecting whether the second distance is less than a distance threshold;

determining that the first pairing graph does not satisfy the pairing graph criteria when the first pairing graph has an overlap region with the other graphs, and/or when the second spacing is less than the distance threshold.

Optionally, when the first pairing graph does not have an overlapping area with the other graphs and the second distance is greater than the distance threshold, determining that the first pairing graph satisfies the pairing graph criterion.

Optionally, the moving the first pairing graph along the moving direction until the first pairing graph meets the pairing graph criterion includes:

moving the first pairing graph for a unit distance along the moving direction, and detecting whether the first pairing graph meets the pairing graph standard;

when the first pairing graph does not meet the pairing graph standard, repeating the steps until the first pairing graph meets the pairing graph standard.

In another aspect, an embodiment of the present application provides a computer device, where the computer device includes a processor and a memory, where the memory stores at least one instruction or program, and the instruction or program is loaded and executed by the processor to implement the method for inserting a pairing graph as described in any one of the above.

In another aspect, an embodiment of the present application provides a computer-readable storage medium, where at least one instruction or program is stored in the storage medium, and the instruction or program is loaded and executed by a processor to implement the method for inserting the pairing graph as described in any one of the above.

The technical scheme at least comprises the following advantages:

by inserting the first pairing graph and the second pairing graph which are matched in shape into the integrated circuit layout and moving the first pairing graph and the second pairing graph to meet the pairing graph standard, the problems of low efficiency and high error rate caused by inserting the graphs into the integrated circuit layout in a manual mode are solved on the basis of realizing automatic insertion of the pairing graphs into the integrated circuit layout, the insertion efficiency of the pairing graphs is improved, and the insertion error probability is reduced.

Drawings

In order to more clearly illustrate the detailed description of the present application or the technical solutions in the prior art, the drawings needed to be used in the detailed description of the present application or the prior art description will be briefly introduced below, and it is obvious that the drawings in the following description are some embodiments of the present application, and other drawings can be obtained by those skilled in the art without creative efforts.

FIG. 1 is a schematic diagram of a mating pattern in an integrated circuit layout;

FIG. 2 is a schematic diagram of the insertion of a mating pattern into an exposure unit by manual means;

FIG. 3 is a flowchart of a method for inserting a pairing graph according to an exemplary embodiment of the present application;

FIG. 4 is a schematic illustration of inserting a first mate pattern and a second mate pattern in an integrated circuit layout in an exemplary embodiment of the present application;

FIG. 5 is a flowchart of a method for inserting a pairing graph according to an exemplary embodiment of the present application;

FIG. 6 is a diagram illustrating moving a second mating graph in a direction of movement until the second mating graph meets a mating graph criterion in an exemplary embodiment of the present application;

FIG. 7 is a schematic illustration of a first pairing graph being moved a first distance in a moving direction in an exemplary embodiment of the present application;

FIG. 8 is a schematic illustration of moving a first mating graph in a direction of movement until the first mating graph meets a mating graph criterion in an exemplary embodiment of the present application;

FIG. 9 is a schematic illustration of moving a second pairing graph a second distance in a moving direction in an exemplary embodiment of the present application;

FIG. 10 is a schematic diagram of a computer device provided in an exemplary embodiment of the present application.

Detailed Description

The technical solutions in the present application will be described clearly and completely with reference to the accompanying drawings, and it is obvious that the described embodiments are some, but not all embodiments of the present application. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.

In the description of the present application, it should be noted that the terms "center", "upper", "lower", "left", "right", "vertical", "horizontal", "inner", "outer", and the like indicate orientations or positional relationships based on the orientations or positional relationships shown in the drawings, and are only for convenience of description and simplicity of description, and do not indicate or imply that the device or element being referred to must have a particular orientation, be constructed and operated in a particular orientation, and thus, should not be construed as limiting the present application. Furthermore, the terms "first," "second," and "third" are used for descriptive purposes only and are not to be construed as indicating or implying relative importance.

In the description of the present application, it is to be noted that, unless otherwise explicitly specified or limited, the terms "mounted," "connected," and "connected" are to be construed broadly, e.g., as meaning either a fixed connection, a removable connection, or an integral connection; the connection can be mechanical connection or electrical connection; the two elements may be directly connected or indirectly connected through an intermediate medium, or may be communicated with each other inside the two elements, or may be wirelessly connected or wired connected. The specific meaning of the above terms in the present application can be understood in a specific case by those of ordinary skill in the art.

In addition, the technical features mentioned in the different embodiments of the present application described below may be combined with each other as long as they do not conflict with each other.

Referring to fig. 3, which shows a flowchart of a pairing graph insertion method provided by an exemplary embodiment of the present application, the method being executable by a computer device, the method including:

step 301 inserts a first mating pattern into an integrated circuit layout.

Step 302, inserting a second mating pattern at a predetermined distance from the first mating pattern along the insertion direction, the second mating pattern being a pattern matching the first mating pattern in shape.

Referring to fig. 4, a schematic diagram of inserting a first mate pattern 421 and a second mate pattern 422 in an integrated circuit layout is shown. As shown in fig. 4, a first dummy pattern 421 may be inserted into a first edge region of the exposure unit 411, a second dummy pattern 422 may be inserted into a second edge region of the exposure unit 411, which is opposite to the first edge region, an insertion position of the second dummy pattern 422, and a position spaced apart from the first dummy pattern 421 by a predetermined distance along the insertion direction 401.

For example, the position of the pairing graph may be defined by a reference point of the pairing graph and a parameter of the pairing graph, for example, the pairing graph is a rectangle, the reference point of the pairing graph may be a coordinate of a center point of the pairing graph, the parameter of the pairing graph is a length and a width of the rectangle, the computer device determines a coordinate (x1, y1) of the first edge region as an insertion position of the first pairing graph 421, moves the center point of the first pairing graph 421 to the coordinate (x1, y1), and if the predetermined distance is D1, determines (x1, y1+ D1) of the second edge region as an insertion position of the second pairing graph 422, and moves the center point of the second pairing graph 422 to the coordinate (x2, y1+ D1), where x1 and x2 may be equal or may not be equal.

For example, the predetermined distance may correspond to the length of the exposure unit in the insertion direction 401, for example, if the computer device determines that the inserted region is located at the edge of the exposure unit 411, the predetermined distance D1 corresponding to the exposure unit 411 is called, and D1 is less than or equal to the length of the exposure unit 411 in the insertion direction 401.

Step 303, when any one of the first pairing graph and the second pairing graph does not meet the pairing graph insertion standard, moving the first pairing graph and the second pairing graph along the moving direction until the first pairing graph and the second pairing graph meet the pairing graph insertion standard.

Wherein the pairing graph insertion criterion comprises that the pairing graph does not have an overlapping area with other pairing graphs and the distance between the pairing graph and the scribing mark is larger than a distance threshold value.

Illustratively, the computer device detects whether the first mating pattern 421 has an overlapping area with another pattern (device pattern or another mating pattern) at the insertion position, and detects whether the second distance W2 between the first mating pattern 421 and the scribe mark of the exposure unit 411 in the moving direction 402 (as shown in fig. 4) is greater than a distance threshold, determines that the first mating pattern 421 does not satisfy the mating pattern insertion criterion if the first mating pattern 421 satisfies any of the above conditions, and determines that the first mating pattern 421 satisfies the mating pattern insertion criterion if the first mating pattern 421 does not satisfy the above conditions; the method for determining whether the second matching pattern 422 meets the matching pattern insertion criterion by the computer device is the same as the method for determining the first matching pattern 421, and is not repeated herein. Wherein the moving direction 402 is perpendicular to the inserting direction 401.

To sum up, in the embodiment of the present application, the first pairing graph and the second pairing graph which are matched in shape are inserted into the integrated circuit layout, and the first pairing graph and the second pairing graph are moved to meet the pairing graph standard, so that on the basis of automatically inserting the pairing graph into the integrated circuit layout, the problems of low efficiency and high error rate caused by manually inserting the graph into the integrated circuit layout are solved, the insertion efficiency of the pairing graph is improved, and the insertion error probability is reduced.

Referring to fig. 5, which illustrates a pairing graph insertion method provided in an exemplary embodiment of the present application, where the method may be executed by a computer device, and the method may be an alternative embodiment mode of the embodiment in fig. 3, where the method includes:

step 501, a first mating pattern is inserted into an integrated circuit layout.

Illustratively, referring to FIG. 4, a computer device detects a region of an integrated circuit layout into which a first mating pattern may be inserted, thereby determining the region into which the first mating pattern is inserted. For example, the computer device detects that the edge region of the exposure unit 411 has an insertable region, determines the edge region of the exposure unit 411 as an insertion region, the edge region including a first edge region and a second edge region that are opposite.

Step 502, insert a second mating pattern at a predetermined distance from the first mating pattern along the insertion direction.

The method for inserting the first pairing graph 421 and the second pairing graph 422 into the computer device can refer to the above embodiments, and is not described herein again.

Step 503, detecting whether the second pairing graph meets the pairing graph standard.

The computer device detects whether the second pairing graph 422 meets the pairing graph criteria and proceeds to step 504a when the second pairing graph 422 meets the pairing graph criteria and to step 504b when the second pairing graph 422 does not meet the pairing graph criteria.

For example, referring to fig. 4, in the embodiment of the present application, "detecting whether the second pairing graph satisfies the pairing graph criterion" includes but is not limited to: detecting whether the second pairing pattern 422 has an overlapping area with other patterns; calculating a first separation W1 between the second mating pattern 422 and the nearest-spaced scribe mark along the moving direction 402; detecting whether the second distance W1 is less than a distance threshold; determining that the second mating pattern 422 does not satisfy the mating pattern criterion when the second mating pattern 422 has an overlap region with other patterns and/or when the first separation W1 is less than a distance threshold; when the second mating pattern 422 has no overlapping area with other patterns and the first separation W1 is greater than the distance threshold, it is determined that the second mating pattern 422 satisfies the mating pattern criterion.

In step 504a, it is detected whether the first pairing graph meets the pairing graph criterion.

When the first pairing graph meets the pairing graph criteria, the insertion is ended, and when the first pairing graph does not meet the pairing graph criteria, step 506 is entered.

For example, referring to fig. 4, in the embodiment of the present application, "detecting whether the first pairing graph satisfies the pairing graph criterion" includes, but is not limited to: detecting whether the first pair pattern 421 has an overlapping area with other patterns; calculating a second distance W2 between the first pairing pattern 421 and the scribe mark at the closest distance along the moving direction 402; detecting whether the second distance W2 is less than a distance threshold; determining that the second mating pattern does not meet the mating pattern criterion when the first mating pattern 422 has an overlap region with other patterns and/or when the first separation W1 is less than a distance threshold; when the first paired pattern 421 has no overlapping area with other patterns and the second distance W2 is greater than the distance threshold, it is determined that the first paired pattern 421 satisfies the paired pattern criterion.

And 504b, moving the second pairing graph along the moving direction until the second pairing graph meets the pairing graph standard.

Referring to FIG. 6, a schematic diagram of moving the second mating graph 422 along the moving direction 402 is shown. For example, as shown in fig. 6, in the embodiment of the present application, "moving the second pairing graph along the moving direction until the second pairing graph satisfies the pairing graph criterion" includes but is not limited to: moving the second matching pattern 422 by a unit distance (step) along the moving direction 402, and detecting whether the second matching pattern 422 meets the matching pattern standard (please refer to the above-mentioned method for detecting whether the second matching pattern 422 meets the matching pattern standard, which is not described herein again); when the second pairing graph 422 meets the pairing graph criteria, movement is ended; when the second matching pattern 422 does not satisfy the matching pattern criterion, the above steps are repeated until the second matching pattern 422 satisfies the matching pattern criterion (in fig. 6, the second matching pattern 422 is moved by N1 unit distances to satisfy the matching pattern criterion).

Step 505, moving the first pairing graph by a first distance along the moving direction, and detecting whether the first pairing graph meets the pairing graph standard.

Referring to fig. 7, a schematic diagram of moving the first pairing graph 421 by a first distance (N1 cell distances) along the moving direction 402 is shown.

Wherein the first distance is the moving distance of the second matching pattern 422 in step 504 b. Referring to fig. 7, a schematic diagram of moving the first mating pattern 421 a first distance (N1 unit distances) along the moving direction 402 is shown. As shown in fig. 7, after the first pairing graph 421 is moved corresponding to the second pairing graph 422, it is detected whether the first pairing graph 421 meets the pairing graph standard (please refer to the above-mentioned manner for detecting whether the first pairing graph 421 meets the pairing graph standard, which is not described herein again), and when the first pairing graph 421 meets the pairing graph standard, the movement is ended; when the first pairing graph 421 does not meet the pairing graph criteria, step 506 is entered.

Step 506, the first pairing graph is moved along the moving direction until the first pairing graph meets the pairing graph standard.

Referring to FIG. 8, a schematic diagram of moving the first pairing graph 421 in the moving direction 402 is shown. For example, as shown in fig. 8, in the embodiment of the present application, "moving the first pairing graph in the moving direction until the first pairing graph satisfies the pairing graph criterion" includes but is not limited to: moving the first pairing graph 421 by a unit distance along the moving direction 402, and detecting whether the first pairing graph 421 meets the pairing graph standard (please refer to the above description for the way of detecting whether the first pairing graph 421 meets the pairing graph standard, which is not described herein again); when the first pairing graph 421 satisfies the pairing graph criterion, the movement is ended; when the first pair 421 does not satisfy the pair criterion, the above steps are repeated until the first pair 421 satisfies the pair criterion (in fig. 8, the first pair 421 moves N2 unit distances to satisfy the pair criterion).

Step 507, moving the second pairing graph by a second distance along the moving direction, and detecting whether the second pairing graph meets the pairing graph standard.

And the second distance is the moving distance of the first pairing graph. Referring to fig. 9, a schematic diagram of moving the second mating pattern 422 a second distance (N2 unit distances) along the moving direction 402 is shown. As shown in fig. 9, after the second pairing graph 422 is moved corresponding to the first pairing graph 421, it is detected whether the second pairing graph 422 meets the pairing graph standard (please refer to the above-mentioned manner for detecting whether the second pairing graph 422 meets the pairing graph standard, which is not described herein), and when the second pairing graph 422 meets the pairing graph standard, the movement is ended; when the second pairing graph 422 does not meet the pairing graph criteria, step 504b is entered.

The computer device repeats the above steps until the first pairing graph 421 and the second pairing graph 422 both satisfy the pairing graph standard, thereby ending the movement and completing the insertion of the pairing graph.

Referring to FIG. 10, a block diagram of a computer device provided by an exemplary embodiment of the present application is shown. The computer device includes: a processor 1001 and a memory 1002.

The processor 1001 may be a Central Processing Unit (CPU), a Network Processor (NP), or a combination of a CPU and an NP. The processor 1001 may further include a hardware chip. The hardware chip may be an application-specific integrated circuit (ASIC), a Programmable Logic Device (PLD), or a combination thereof. The PLD may be a complex 10 programmable logic device (CPLD), a field-programmable gate array (FPGA), a General Array Logic (GAL), or any combination thereof.

The memory 1002 is connected to the processor 1001 through a bus or other means, and at least one instruction, at least one program, a code set, or a set of instructions is stored in the memory 1002, and is loaded and executed by the processor 1001 to implement the insertion method of the pairing graph provided in the above embodiments. The memory 1002 may be a volatile memory (volatile memory), a non-volatile memory (non-volatile memory), or a combination thereof. The volatile memory may be a random-access memory (RAM), such as a Static Random Access Memory (SRAM) or a Dynamic Random Access Memory (DRAM). The nonvolatile memory may be a Read Only Memory (ROM), such as a Programmable Read Only Memory (PROM), an Erasable Programmable Read Only Memory (EPROM), and an electrically erasable programmable read-only memory (EEPROM). The nonvolatile memory may also be a flash memory (flash memory), a magnetic memory such as a magnetic tape (magnetic tape), a floppy disk (floppy disk), and a hard disk. The non-volatile memory may also be an optical disc.

The present application further provides a computer-readable storage medium having at least one instruction, at least one program, a set of codes, or a set of instructions stored therein, which is loaded and executed by the processor to implement the method for inserting a pairing graph according to any of the above embodiments.

The present application further provides a computer program product, which when running on a computer, causes the computer to execute the method for inserting the pairing graph provided by the above method embodiments.

It should be understood that the above examples are only for clarity of illustration and are not intended to limit the embodiments. Other variations and modifications will be apparent to persons skilled in the art in light of the above description. And are neither required nor exhaustive of all embodiments. And obvious variations or modifications of this invention are intended to be covered by the scope of the invention as expressed herein.