Nostradamus: a floorplanner of uncertain designs

Floorplanning is an early phase in chip planning. It provides information on approximate area, delay, power, and other performance measures. Careful floorplanning is, thus, of extreme importance. In many applications, while a good floorplan is needed, the information about all modules is not available, or even worse, part of the provided information is inaccurate. Examples of such applications are designing a huge system where the floorplan is needed early in the design process, but not all the modules have been designed. Another example is the field of reconfigurable computing where it is not known what modules will be needed on the reconfigurable chip as the program is being executed. Floorplanning with uncertainty is the problem of obtaining a good floorplan when the information about module dimensions is not complete. In this paper, the floorplanning problem with uncertainty is formulated. Correlation between input characteristics and output characteristics is studied. Also, it is established that traditional floorplanners are incapable of efficiently handling uncertainty. An effective method for dealing with uncertain data is proposed. Experiments show that, for example, with up to 30% input uncertainty an area estimate with less than 7% error can be obtained.

[1]  D. F. Wong,et al.  Simulated Annealing for VLSI Design , 1988 .

[2]  Ernest S. Kuh,et al.  Simultaneous Floor Planning and Global Routing for Hierarchical Building-Block Layout , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[3]  Malgorzata Marek-Sadowska,et al.  Floorplanning with pin assignment , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[4]  Thomas Lengauer,et al.  A robust framework for hierarchical floorplanning with integrated global wiring , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[5]  Martin D. F. Wong,et al.  Efficient Floorplan Area Optimization , 1989, 26th ACM/IEEE Design Automation Conference.

[6]  Majid Sarrafzadeh,et al.  An Introduction To VLSI Physical Design , 1996 .

[7]  J. Ben Rosen,et al.  An analytical approach to floorplan design and optimization , 1990, 27th ACM/IEEE Design Automation Conference.

[8]  Ikuo Harada,et al.  CHAMP: Chip Floor Plan for Hierarchical VLSI Layout Design , 1985, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[9]  Majid Sarrafzadeh.  Transforming an arbitrary floorplan into a sliceable one , 1993, ICCAD.

[10]  Carl Sechen,et al.  IMPROVED SIMULATED ANNEALING ALGORIHM FOR ROW-BASED PLACEMENT. , 1987 .

[11]  Majid Sarrafzadeh,et al.  A unified approach to floorplan sizing and enumeration , 1993, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[12]  Majid Sarrafzadeh,et al.  Floor-Planning by Graph Dualization: 2-Concave Rectilinear Modules , 1993, SIAM J. Comput..

[13]  Thomas Lengauer,et al.  Combinatorial algorithms for integrated circuit layout , 1990, Applicable theory in computer science.

[14]  Ting-Chi Wang,et al.  An optimal algorithm for floorplan area optimization , 1990, 27th ACM/IEEE Design Automation Conference.

[15]  P. A. Subrahmanyam,et al.  A Note on Clustering Modules for Floorplanning , 1989, 26th ACM/IEEE Design Automation Conference.

[16]  Naveed A. Sherwani,et al.  Algorithms for VLSI Physical Design Automation , 1999, Springer US.

[17]  Ting-Chi Wang,et al.  A graph theoretic technique to speed up floorplan area optimization , 1992, [1992] Proceedings 29th ACM/IEEE Design Automation Conference.

[18]  Edwin Kinnen,et al.  Rectangular duals of planar graphs , 1985, Networks.

[19]  Sartaj Sahni,et al.  A linear algorithm to find a rectangular dual of a planar triangulated graph , 1986, 23rd ACM/IEEE Design Automation Conference.

[20]  Majid Sarrafzadeh,et al.  Sliceable Floorplanning by Graph Dualization , 1995, SIAM J. Discret. Math..