KFUPM ePrints

ENHANCING PERFORMANCE OF ITERATIVE HEURISTICS FOR VLSI NETLIST PARTITIONING

Sait, Sadiq M. and El-Maleh, Aiman H. and Al-Abaji, RH (2003) ENHANCING PERFORMANCE OF ITERATIVE HEURISTICS FOR VLSI NETLIST PARTITIONING. In: IEEE International Symposium on Circuits and Systems, Sharjah, UAE.

[img]
Preview
PDF
308Kb

Abstract

ABSTRACT In this paper we, present a new heuristic called PowerFM which is a modification of the well-known Fidducia Mattheyeses algorithm for VLSI netlist partitioning. PowerFM considers the minimization of power consumption due to the nets cut. The advantages of using PowerFM as an initial solution generator for other iterative algorithms, in panicular Genetic Algorithm (GA) and Tabu Search (TS), for multiobjective optimization is investigated. A series of experiments are conducted on ISCAS-85/89 benchmark circuits to evaluate the efficiency of the PawerFM algorithm. Results suggest that this heuristic would provide a good starting solution for multiobjective optimization using iterative algorithms.



Item Type:Conference or Workshop Item (Other)
Date:December 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:94
Deposited By:AbdulRahman
Deposited On:25 Feb 2008 09:10
Last Modified:12 Apr 2011 13:06

Repository Staff Only: item control page