Accounting for Recent Changes of Gain in Dealing with Ties in Iterative Methods for Circuit Partitioning

Abstract EN

In iterative methods for partitioning circuits, there is often a choice among severalmodules which will all produce the largest available reduction in cut size if they are movedbetween subsets in the partition.

This choice, which is usually made by popping modules offa stack, has been shown to have a considerable impact on performance.

By considering themost recent change in the potential reduction in cut size associated with moving each modulebetween subsets, the performance of this LIFO (last-in first-out) approach can be significantlyimproved.