Sait, Sadiq M. and El-Maleh, Aiman H. and Al-Abaji, RH (2003) GENERAL ITERATIVE HEURISTICS FOR VLSI MULTIOBJECTIVE PARTITIONING. In: IEEE International Symposium on Circuits and Systems'', Bangkok, Thailand.
![[img]](http://eprints.kfupm.edu.sa/style/images/fileicons/application_pdf.png)
| PDF 739Kb |
Abstract
The problem of partitioning appears in several areas ranging from VLSI parallel programming, to molecular biology. The intrest in finding an optimal partition especally in VLSI has been a hot issue in recent years. IN VLSI circuit partitioning with multiple objectives which include power, delay and area, in addition to minimum cut is in vogue. In this paper, we engineer two iteratives heuristics for the optimization of VLSI netlist bi-Partitioning. Theses heuristics are based on Genetic Algorithms (GA's) and Tabu Search (TS) and incorporate fuzzy rules in order to handle the multi-obejective cost function. Both heuristics are applied to ISCAS-85/89 benchmark circuits and experimental results are reported and compared.
| Item Type: | Conference or Workshop Item (Other) |
|---|---|
| Date: | 01 May 2003 |
| Subjects: | Computer |
| Divisions: | College Of Computer Sciences and Engineering > Computer Engineering Dept |
| Creators: | Sait, Sadiq M. and El-Maleh, Aiman H. and Al-Abaji, RH |
| Email: | sadiq@kfupm.edu.sa, aimane@kfupm.edu.sa, raslan@kfupm.edu.sa |
| ID Code: | 100 |
| Deposited By: | AbdulRahman |
| Deposited On: | 25 Feb 2008 10:00 |
| Last Modified: | 12 Apr 2011 13:06 |
Repository Staff Only: item control page