학술논문
Accounting for Recent Changes of Gain in Dealing with Ties in Iterative Methods for Circuit Partitioning.
Document Type
Article
Author
Source
Subject
*INTEGRATED circuits
*ITERATIVE methods (Mathematics)
*MODULES (Algebra)
*SET theory
*ALGORITHMS
*PARTITIONS (Mathematics)
*
*
*
*
*
Language
ISSN
1026-0226
Abstract
In iterative methods for partitioning circuits, there is often a choice among several modules which will all produce the largest available reduction in cut size if they are moved between subsets in the partition. This choice, which is usually made by popping modules off a stack, has been shown to have a considerable impact on performance. By considering the most recent change in the potential reduction in cut size associated with moving each module between subsets, the performance of this LIFO (last-in first-out) approach can be significantly improved. [ABSTRACT FROM AUTHOR]