Combining the ant system algorithm and simulated annealing for 3D/2D fixed-outline floorplanning

Three dimensional integrated circuits (3D ICs) can alleviate the problem of interconnection, a critical problem in the nanoscale era, and are also promising for heterogeneous integration. This paper proposes a two-phase method combining the ant system algorithm (AS) and simulated annealing (SA) to handle 3D IC floorplanning with fixed-outline constraints. In the first AS phase, the floorplans are constructed by sequentially packing the block one by one, and the AS is used to explore the appropriate packing order and device layer assignment for the blocks. When packing a block, a proper position including the coordinates and the appropriate layer in the partially constructed floorplan should be chosen from all possible positions. While packing the blocks, a probability layer assignment strategy is proposed to determine the device layer assignment of unpacked blocks. After the AS phase, the SA phase is used to perform further optimization. The proposed method can also be easily applied to 2D floorplanning problems. Compared with the state of the art 3D/2D fixed-outline floorplanner, the experimental results demonstrate the effectiveness of the proposed method. The ant system algorithm and simulated annealing were combined to solve 3D/2D fixed-outline floorplanning problem.In the AS phase, a floorplan construction method is proposed, in which the blocks are greedily packed into the chip area one by one.During block packing, a probability layer assignment strategy is proposed to determine the layer assignment of the unpacked blocks.We define the pheromone in AS using the packing order of block b, and the pheromone update rule also adapts to handle the 3D floorplanning problem.We combine the area of a block with the connection degree (CD) between blocks as the heuristic information. Three dimensional integrated circuits (3D ICs) can alleviate the problem of interconnection, a critical problem in the nanoscale era, and are also promising for heterogeneous integration. This paper proposes a two-phase method combining the ant system algorithm (AS) and simulated annealing (SA) to handle 3D IC floorplanning with fixed-outline constraints. In the first AS phase, the floorplans are constructed by sequentially packing the block one by one, and the AS is used to explore the appropriate packing order and device layer assignment for the blocks. When packing a block, a proper position including the coordinates and the appropriate layer in the partially constructed floorplan should be chosen from all possible positions. While packing the blocks, a probability layer assignment strategy is proposed to determine the device layer assignment of unpacked blocks. After the AS phase, the SA phase is used to perform further optimization. The proposed method can also be easily applied to 2D floorplanning problems. Compared with the state of the art 3D/2D fixed-outline floorplanner, the experimental results demonstrate the effectiveness of the proposed method.

[1]  Chris C. N. Chu,et al.  DeFer: Deferred Decision Making Enabled Fixed-Outline Floorplanning Algorithm , 2010, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[2]  P. Zarkesh-Ha,et al.  A global interconnect design window for a three-dimensional system-on-a-chip , 2001, Proceedings of the IEEE 2001 International Interconnect Technology Conference (Cat. No.01EX461).

[3]  Hai Zhou,et al.  3D-STAF: scalable temperature and leakage aware floorplanning for three-dimensional integrated circuits , 2007, ICCAD 2007.

[4]  Chaomin Luo,et al.  Large-scale fixed-outline floorplanning design using convex optimization techniques , 2008, 2008 Asia and South Pacific Design Automation Conference.

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

[6]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[7]  Martin D. F. Wong,et al.  Floorplanning for 3-D VLSI design , 2005, Proceedings of the ASP-DAC 2005. Asia and South Pacific Design Automation Conference, 2005..

[8]  Yoji Kajitani,et al.  The 3 D-Packing by Meta Data Structure and Packing Heuristics , 2000 .

[9]  Yangdong Deng,et al.  Interconnect characteristics of 2.5-D system integration scheme , 2001, ISPD '01.

[10]  Marco Dorigo,et al.  Ant system for Job-shop Scheduling , 1994 .

[11]  Vittorio Maniezzo,et al.  The Ant System Applied to the Quadratic Assignment Problem , 1999, IEEE Trans. Knowl. Data Eng..

[12]  Sung Kyu Lim,et al.  Multiobjective Microarchitectural Floorplanning for 2-D and 3-D ICs , 2007, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[13]  Ian O'Connor,et al.  3D-IC floorplanning: Applying meta-optimization to improve performance , 2011, 2011 IEEE/IFIP 19th International Conference on VLSI and System-on-Chip.

[14]  José Ignacio Hidalgo,et al.  A combination of evolutionary algorithm and mathematical programming for the 3d thermal-aware floorplanning problem , 2011, GECCO '11.

[15]  Yao-Wen Chang,et al.  Modern floorplanning based on B/sup */-tree and fast simulated annealing , 2006, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[16]  Evangeline F. Y. Young,et al.  Fixed-outline thermal-aware 3D floorplanning , 2010, 2010 15th Asia and South Pacific Design Automation Conference (ASP-DAC).

[17]  Georg Sigl,et al.  GORDIAN: VLSI placement by quadratic programming and slicing optimization , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[18]  Takeshi Yoshimura,et al.  Multi-layer floorplanning for stacked ICs: Configuration number and fixed-outline constraints , 2010, Integr..

[19]  Kaustav Banerjee,et al.  Multiple Si layer ICs: motivation, performance analysis, and design implications , 2000, Proceedings 37th Design Automation Conference.

[20]  Takeshi Yoshimura,et al.  Fixed-Outline Floorplanning: Block-Position Enumeration and a New Method for Calculating Area Costs , 2008, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[21]  Andrew B. Kahng,et al.  Classical floorplanning harmful? , 2000, ISPD '00.

[22]  Harikrishnan Ramiah,et al.  Hierarchical congregated ant system for bottom-up VLSI placements , 2013, Eng. Appl. Artif. Intell..

[23]  Rong Luo,et al.  A floorplanning algorithm for novel three-dimensional nano integrated circuits , 2010, 2010 53rd IEEE International Midwest Symposium on Circuits and Systems.

[24]  Sung Kyu Lim,et al.  Multi-layer floorplanning for reliable system-on-package , 2004, 2004 IEEE International Symposium on Circuits and Systems (IEEE Cat. No.04CH37512).

[25]  Martin D. F. Wong,et al.  Fast evaluation of sequence pair in block placement by longestcommon subsequence computation , 2001, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[26]  Sheqin Dong,et al.  3D CBL: an efficient algorithm for general 3D packing problems , 2005, 48th Midwest Symposium on Circuits and Systems, 2005..

[27]  Harikrishnan Ramiah,et al.  Variable-Order Ant System for VLSI multiobjective floorplanning , 2013, Appl. Soft Comput..

[28]  Jason Cong,et al.  A thermal-driven floorplanning algorithm for 3D ICs , 2004, ICCAD 2004.

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

[30]  Ning Xu,et al.  A Fast Algorithm for VLSI Building Block Placement , 2006, The Proceedings of the Multiconference on "Computational Engineering in Systems Applications".