A fast placement approach for large scale modules based on less flexibility first principles

Conventional simulated annealing (SA) based placement could be very time consuming as the design complexity increases. In this paper, we present a new approach for large scale building blocks based on less flexibility first (LFF) principles. Since the resource constraints at the beginning, middle, or end of the packing process varies a lot, we divide the packing process into several continuous stages and apply different heuristic packing strategies which implies the LFF principles. Experiment results show that our approach could generate an optimized placement much quicker than SA based approaches. Also, the placement result could be used as an initial solution for SA-based algorithms. In another experiment, we start such a SA process with lower temperature and get similar solution quality but shorter execution time than SA begins with random initial solutions

[1]  Igor L. Markov,et al.  Fixed-outline floorplanning: enabling hierarchical design , 2003, IEEE Trans. Very Large Scale Integr. Syst..

[2]  Jun Gu,et al.  VLSI block placement using less flexibility first principles , 2001, Proceedings of the ASP-DAC 2001. Asia and South Pacific Design Automation Conference 2001 (Cat. No.01EX455).

[3]  Yao-Wen Chang,et al.  TCG: a transitive closure graph-based representation for non-slicing floorplans , 2001, DAC '01.

[4]  Yoji Kajitani,et al.  VLSI module placement based on rectangle-packing by the sequence-pair , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[5]  Chak-Kuen Wong,et al.  An effective quasi-human based heuristic for solving the rectangle packing problem , 2002, Eur. J. Oper. Res..

[6]  Chak-Kuen Wong,et al.  An effective quasi-human based heuristic for solving rectangle packing problem , 1998, IEEE. APCCAS 1998. 1998 IEEE Asia-Pacific Conference on Circuits and Systems. Microelectronics and Integrating Systems. Proceedings (Cat. No.98EX242).

[7]  Yao-Wen Chang,et al.  TCG-S: orthogonal coupling of P*-admissible representations for general floorplans , 2004, Proceedings 2002 Design Automation Conference (IEEE Cat. No.02CH37324).

[8]  Yoji Kajitani,et al.  Module placement on BSG-structure and IC layout applications , 1996, ICCAD 1996.

[9]  C. L. Liu,et al.  A New Algorithm for Floorplan Design , 1986, DAC 1986.

[10]  R. Otten Automatic Floorplan Design , 1982, DAC 1982.