AN EFFICIENT ALGORITHM FOR VLSI NETWORK PARTITIONING PROBLEM USING A COST FUNCTION WITH BALANCING FACTOR
SCIE
SCOPUS
- Title
- AN EFFICIENT ALGORITHM FOR VLSI NETWORK PARTITIONING PROBLEM USING A COST FUNCTION WITH BALANCING FACTOR
- Authors
- PARK, CI; PARK, YB
- Date Issued
- 1993-11
- Publisher
- IEEE
- Abstract
- This paper presents an efficient algorithm for network partitioning problem, which improves Fiduccia and Mattheyses' (F-M's) algorithm [1]. We have noticed that the main problem of F-M's algorithm is that the cell move operation is largely influenced by the balancing constraint. In order to handle this kind of inherent limitation in F-M's algorithm, a cost function similar to the penalty function used in [121 is adopted which reflects balance degree of a partition as well as its cutset size. The weighting factor R is introduced in the cost function to determine the relative importances of the two factors: cutset size and balance degree. Using this cost function, we propose an iterative improvement algorithm which has the time complexity of O (b (m + c2)), where b is the number of blocks, m is the size of network, and c is the number of cells. It is proven that the proposed algorithm guarantees to find a balanced partition if the value of R satisfies a certain condition. Experimental results show that the proposed algorithm outperforms F-M's algorithm in most cases.
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/22021
- DOI
- 10.1109/43.248079
- ISSN
- 0278-0070
- Article Type
- Article
- Citation
- IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, vol. 12, no. 11, page. 1686 - 1694, 1993-11
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.