Multiobjective search in VLSI design

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

Multiobjective search in VLSI design

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

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

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 language	English (US)
Title of host publication	Proceedings of the IEEE International Conference on VLSI Design
Editors	Anon
Publisher	Publ by IEEE
Pages	395-400
Number of pages	6
ISBN (Print)	0818649909
State	Published - 1994
Event	Proceedings of the 7th International Conference on VLSI Design - Calcutta, India Duration: Jan 5 1994 → Jan 8 1994

Other

Other	Proceedings of the 7th International Conference on VLSI Design
City	Calcutta, India
Period	1/5/94 → 1/8/94

All Science Journal Classification (ASJC) codes

Engineering(all)

Cite this

@inproceedings{aa9ae5d76a7f4c34879aecae748db73c,

title = "Multiobjective search in VLSI design",

abstract = "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.",

author = "Pallab Dasgupta and Prasenjit Mitra and Chakrabarti, {P. P.} and DeSarkar, {S. C.}",

year = "1994",

language = "English (US)",

isbn = "0818649909",

pages = "395--400",

editor = "Anon",

booktitle = "Proceedings of the IEEE International Conference on VLSI Design",

publisher = "Publ by IEEE",

note = "Proceedings of the 7th International Conference on VLSI Design ; Conference date: 05-01-1994 Through 08-01-1994",

}

TY - GEN

T1 - Multiobjective search in VLSI design

AU - Dasgupta, Pallab

AU - Mitra, Prasenjit

AU - Chakrabarti, P. P.

AU - DeSarkar, S. C.

PY - 1994

Y1 - 1994

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0027969353&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0027969353&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0027969353

SN - 0818649909

SP - 395

EP - 400

BT - Proceedings of the IEEE International Conference on VLSI Design

A2 - Anon, null

PB - Publ by IEEE

T2 - Proceedings of the 7th International Conference on VLSI Design

Y2 - 5 January 1994 through 8 January 1994

ER -

Multiobjective search in VLSI design

Abstract

Other

All Science Journal Classification (ASJC) codes

Other files and links

Fingerprint

Cite this