Enhancing performance of iterative heuristics for VLSI netlist partitioning

Sadiq M. Sait, Aimn H. El-Maleh, Raslan H. Al-Abnji

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Scopus citations

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.

Original languageEnglish
Title of host publicationICECS 2003 - Proceedings of the 2003 10th IEEE International Conference on Electronics, Circuits and Systems
Pages507-510
Number of pages4
DOIs
StatePublished - 2003

Publication series

NameProceedings of the IEEE International Conference on Electronics, Circuits, and Systems
Volume2

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Enhancing performance of iterative heuristics for VLSI netlist partitioning'. Together they form a unique fingerprint.

Cite this