Multiobjective search in VLSI design

Pallab Dasgupta, Prasenjit Mitra, P. P. Chakrabarti, S. C. DeSarkar

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Scopus citations


Many optimization problems in VLSI design involve multiple, conflicting and non-commensurate objectives. The multiobjective approach, which models each objective by a scalar-valued criterion and attempts to find all non-dominated solutions, is a natural and efficient alternative to the conventional practice of combining all objectives into a single optimization criterion. In this paper we illustrate the multiobjective search approach MObj by applying it on two well known problems in VLSI, namely the Scheduling problem in high level synthesis and the Channel Routing problem in layout synthesis. The efficiency of MOBj and its linear space version SMObj is demonstrated by comparing their performances with multiobjective generalizations of the single objective strategies A and DFBB.

Original languageEnglish (US)
Title of host publicationProceedings of the IEEE International Conference on VLSI Design
Editors Anon
PublisherPubl by IEEE
Number of pages6
ISBN (Print)0818649909
StatePublished - 1994
EventProceedings of the 7th International Conference on VLSI Design - Calcutta, India
Duration: Jan 5 1994Jan 8 1994


OtherProceedings of the 7th International Conference on VLSI Design
CityCalcutta, India

All Science Journal Classification (ASJC) codes

  • General Engineering


Dive into the research topics of 'Multiobjective search in VLSI design'. Together they form a unique fingerprint.

Cite this