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

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 ha...

Full description

Saved in:
Bibliographic Details
Main Authors: Yong-Hyuk Kim, Yourim Yoon
Format: Article
Language:English
Published: Wiley 2015-01-01
Series:Discrete Dynamics in Nature and Society
Online Access:http://dx.doi.org/10.1155/2015/162050
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1832566723937566720
author Yong-Hyuk Kim
Yourim Yoon
author_facet Yong-Hyuk Kim
Yourim Yoon
author_sort Yong-Hyuk Kim
collection DOAJ
description 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.
format Article
id doaj-art-eabf18701ab0491881515a2fcf4d1c52
institution Kabale University
issn 1026-0226
1607-887X
language English
publishDate 2015-01-01
publisher Wiley
record_format Article
series Discrete Dynamics in Nature and Society
spelling doaj-art-eabf18701ab0491881515a2fcf4d1c522025-02-03T01:03:30ZengWileyDiscrete Dynamics in Nature and Society1026-02261607-887X2015-01-01201510.1155/2015/162050162050Accounting for Recent Changes of Gain in Dealing with Ties in Iterative Methods for Circuit PartitioningYong-Hyuk Kim0Yourim Yoon1Department of Computer Science & Engineering, Kwangwoon University, 20 Kwangwoon-ro, Nowon-gu, Seoul 139-701, Republic of KoreaDepartment of Computer Engineering, College of Information Technology, Gachon University, 1342 Seongnamdaero, Sujeong-gu, Seongnam-si, Gyeonggi-do 461-701, Republic of KoreaIn 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.http://dx.doi.org/10.1155/2015/162050
spellingShingle Yong-Hyuk Kim
Yourim Yoon
Accounting for Recent Changes of Gain in Dealing with Ties in Iterative Methods for Circuit Partitioning
Discrete Dynamics in Nature and Society
title Accounting for Recent Changes of Gain in Dealing with Ties in Iterative Methods for Circuit Partitioning
title_full Accounting for Recent Changes of Gain in Dealing with Ties in Iterative Methods for Circuit Partitioning
title_fullStr Accounting for Recent Changes of Gain in Dealing with Ties in Iterative Methods for Circuit Partitioning
title_full_unstemmed Accounting for Recent Changes of Gain in Dealing with Ties in Iterative Methods for Circuit Partitioning
title_short Accounting for Recent Changes of Gain in Dealing with Ties in Iterative Methods for Circuit Partitioning
title_sort accounting for recent changes of gain in dealing with ties in iterative methods for circuit partitioning
url http://dx.doi.org/10.1155/2015/162050
work_keys_str_mv AT yonghyukkim accountingforrecentchangesofgainindealingwithtiesiniterativemethodsforcircuitpartitioning
AT yourimyoon accountingforrecentchangesofgainindealingwithtiesiniterativemethodsforcircuitpartitioning