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 |
|---|---|
| Title of host publication | Proceedings of the IEEE International Conference on VLSI Design |
| Editors | Anon |
| Place of Publication | Los Alamitos, CA, United States |
| Publisher | Publ by IEEE |
| Pages | 395-400 |
| Number of pages | 6 |
| ISBN (Print) | 0818649909 |
| Publication status | Published - 1994 |
| Externally published | Yes |
| Event | Proceedings of the 7th International Conference on VLSI Design - Calcutta, India Duration: 5 Jan 1994 → 8 Jan 1994 |
Other
| Other | Proceedings of the 7th International Conference on VLSI Design |
|---|---|
| City | Calcutta, India |
| Period | 5/1/94 → 8/1/94 |
Fingerprint
ASJC Scopus subject areas
- Engineering(all)
Cite this
Multiobjective search in VLSI design. / Dasgupta, Pallab; Mitra, Prasenjit; Chakrabarti, P. P.; DeSarkar, S. C.
Proceedings of the IEEE International Conference on VLSI Design. ed. / Anon. Los Alamitos, CA, United States : Publ by IEEE, 1994. p. 395-400.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
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
CY - Los Alamitos, CA, United States
ER -