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

Yong-Hyuk Kim and Yourim Yoon

Discrete Dynamics in Nature and Society, 2015, vol. 2015, 1-8

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.

Date: 2015
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/DDNS/2015/162050.pdf (application/pdf)
http://downloads.hindawi.com/journals/DDNS/2015/162050.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnddns:162050

DOI: 10.1155/2015/162050

Access Statistics for this article

More articles in Discrete Dynamics in Nature and Society from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().