Supercharge Your Innovation With Domain-Expert AI Agents!

Hypergraph division method supporting interconnection constraints

A technology of graph division and resource constraints, which is applied in the fields of instruments, computing, and electrical digital data processing, etc., can solve the problems of performance degradation and cost increase, and achieve the effect of eliminating illegal line networks, reducing cost and ensuring performance

Active Publication Date: 2021-01-05
S2C
View PDF6 Cites 4 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0006] But for the actual FPGA, there may be no interconnection resources between the two. If there are connections between such paths during division, it is impossible to directly Using TDM, it will be transferred from other FPGAs with interconnect resources during the routing stage, which will increase the cost and reduce performance

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Hypergraph division method supporting interconnection constraints
  • Hypergraph division method supporting interconnection constraints
  • Hypergraph division method supporting interconnection constraints

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0045] See figure 1 , figure 1 It is a schematic flowchart of a method for partitioning a hypergraph supporting interconnection constraints provided by an embodiment of the present invention. This embodiment provides a method for partitioning a hypergraph supporting interconnection constraints. The hypergraph partitioning method includes steps 1 to 4, wherein:

[0046] Step 1. Traverse all nets.

[0047] Step 1.1. Obtain the divided hypergraph.

[0048] Specifically, see figure 2 , figure 2 It is a hypergraph after multi-level division, and the hypergraph can be a hypergraph obtained after the improvement is completed, or a hypergraph obtained during the multi-level improvement process.

[0049] Step 1.2, traverse all the nets in the hypergraph.

[0050]Specifically, there are generally multiple nets in each hypergraph, and each net has at least one node at each end.

[0051] For example, see image 3 , the lines between FPGAs represent the interconnection resources...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses a hypergraph division method supporting interconnection constraints. The method comprises the following steps: 1, traversing all nets; 2, finding out all illegal nets from allthe nets; 3, selecting an illegal net needing to be processed currently from all the illegal nets as a first to-be-processed net based on a first preset sequence, and determining a movement scheme ofa node group at one end of the first to-be-processed net according to movement characteristics of nodes in the node group of the first to-be-processed net; and 4, according to the mode in the step 3,traversing all the illegal nets to obtain a final division scheme. According to the method, the constraints of interconnection resources are considered in the division stage, and the division across the wire net is changed through the movement of a plurality of nodes, so that the wire net is moved, and an illegal wire net is eliminated; in the moving process, gain calculation is considered, that is, the increase situation of the cutting cost caused by movement is judged in advance, and the movement with the maximum gain is selected to be executed, so that the increase of the cutting cost is small, and the performance is guaranteed.

Description

technical field [0001] The invention belongs to the technical field of integrated circuits, and in particular relates to a hypergraph division method supporting interconnect constraints. Background technique [0002] FPGA (Field Programmable Gate Array) is a field programmable gate array, which belongs to a semi-custom circuit in an application-specific integrated circuit. Using FPGA for hardware simulation allows designers to design complex VLSI ( VLSI, Very Large Scale Integration) for functional verification. The FPGA hardware structure includes different types of resources, generally including look-up tables (LUT, Look-Up-Table), flip-flops, digital processing units (DSP, Digital Signal Processing), block storage (Block RAM, BRAM), etc. The designed circuit is often large in scale, so that a single FPGA cannot accommodate the entire circuit design, so the circuit needs to be split into multiple parts and put into different FPGAs, and each part needs to meet the resource...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
IPC IPC(8): G06F30/331
CPCG06F30/331
Inventor 林铠鹏何析逸
Owner S2C
Features
  • R&D
  • Intellectual Property
  • Life Sciences
  • Materials
  • Tech Scout
Why Patsnap Eureka
  • Unparalleled Data Quality
  • Higher Quality Content
  • 60% Fewer Hallucinations
Social media
Patsnap Eureka Blog
Learn More