Multiobjective search in VLSI design

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

[1]  Rajiv Jain,et al.  Experience with the ADAM Synthesis System , 1989, 26th ACM/IEEE Design Automation Conference.

[2]  David N. Deutsch.  A “DOGLEG” channel router , 1976, DAC 1976.

[3]  Pierre G. Paulin,et al.  Force-directed scheduling for the behavioral synthesis of ASICs , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[4]  M.C. McFarland.  Using Bottom-Up Design Techniques in the Synthesis of Digital Hardware from Abstract Behavioral Descriptions , 1986, 23rd ACM/IEEE Design Automation Conference.

[5]  Alice C. Parker,et al.  Predicting system-level area and delay for pipelined and nonpipelined designs , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[6]  Chelsea C. White,et al.  Multiobjective A* , 1991, JACM.

[7]  S. Sitharama Iyengar,et al.  A general greedy channel routing algorithm , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[8]  A. Kumar,et al.  A novel integrated scheduling and allocation algorithm for data path synthesis , 1991, [1991] Proceedings. Fourth CSI/IEEE International Symposium on VLSI Design.