Feasible two-way circuit partitioning with complex resource constraints

We study in this paper the feasibility problem for two-way circuit partitioning subject to complex resource constraints. We first prove that the problem is in general NP-complete. We then consider two special cases of the problem, and present polynomial-time algorithms for them. Finally we give a ba...

Full description

Saved in:
Bibliographic Details
Published inProceedings of the ASP-DAC 2000 : Asia and South Pacific Design Automation Conference, 2000 : January 25-28, 2000, Yokohama, Japan pp. 435 - 440
Main Authors Hsun-Cheng Lee, Ting-Chi Wang
Format Conference Proceeding
LanguageEnglish
Published IEEE 2000
Subjects
Area measurement
Circuit simulation
Constraint optimization
Cost function
Iterative algorithms
Iterative methods
Partitioning algorithms
Polynomials
Simulated annealing
Very large scale integration
Online AccessGet full text
ISBN0780359739
9780780359734
DOI10.1109/ASPDAC.2000.835139

Cover

More Information
Summary:We study in this paper the feasibility problem for two-way circuit partitioning subject to complex resource constraints. We first prove that the problem is in general NP-complete. We then consider two special cases of the problem, and present polynomial-time algorithms for them. Finally we give a backtracking algorithm to solve the general case. To reduce the run time and the storage space of the backtracking algorithm, an incremental flow computation technique is employed. For each algorithm presented in this paper, the corresponding experimental results are also given to support its efficiency. To the best of our knowledge, this paper is the first one to address the feasibility problem for two-way circuit partitioning with complex resource constraints.
ISBN:0780359739
9780780359734
DOI:10.1109/ASPDAC.2000.835139