A method and system for computing a balanced cost of segmentation

Abstract

The application relates to the technical field of circuit partitioning, and specifically discloses a partitioned balance cost calculation method and system. The application first acquires driving node arrival time and load node requirement time, establishes a key degree formula to amplify the key degree of a specific node, constructs a graph G and a balance cost formula, calculates and sorts the key degree and stores the key degree into a queue, creates a set Tree to execute a routing algorithm, and acquires a final routing path through node processing and iterative optimization. The application establishes a key degree formula, which is preferentially processed in routing, guarantees circuit performance, and comprehensively considers total routing and key node cost in the balance cost formula, so that the application adapts to different scenes and balances the relationship between the total routing and the key node cost. The application processes nodes according to the key degree, preferentially processes key nodes, accelerates routing path generation, avoids local optimization through an iterative optimization mechanism, improves circuit reliability and efficiency, effectively solves the defects of traditional methods in the background technology, and improves the accuracy of partition cost calculation and the quality of circuit design.

Images