An efficient algorithm for hexagon/triangle placement by extending the application of the sequence pair representation

The Y architecture has recently received much attention due to its many potential advantages. To fully utilize the virtues of Y architecture, a non-Manhattan hexagon/triangle placement (HTP for short) paradigm suitable for the Y architecture was proposed recently. This paper extend the application of sequence pair (SP for short) representation to HTP problem and present a new efficient HTP packing algorithm in BBL mode, based on the SP representation and FAST-SP algorithm together with some packing rules. Two benchmarks transformed from MCNC ami33 and ami49 are developed. Experimental results show that we have obtained the best results ever reported in the literature with less runtime. In addition, two coordinate systems adapting to the Y architecture are first presented

[1]  Jing Li,et al.  A packing algorithm for non-Manhattan hexagon/triangle placement design by using an adaptive O-tree representation , 2004, Proceedings. 41st Design Automation Conference, 2004..

[2]  H. Murata,et al.  Rectangle-packing-based module placement , 1995, Proceedings of IEEE International Conference on Computer Aided Design (ICCAD).

[3]  Chung-Kuan Cheng,et al.  The Y-architecture: yet another on-chip interconnect solution , 2003, Proceedings of the ASP-DAC Asia and South Pacific Design Automation Conference, 2003..

[4]  Martin D. F. Wong,et al.  FAST-SP: a fast algorithm for block placement based on sequence pair , 2001, ASP-DAC '01.

[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]  Juebang Yu,et al.  A non-Manhattan hexagon/triangle placement paradigm , 2004, 2004 International Conference on Communications, Circuits and Systems (IEEE Cat. No.04EX914).

[7]  Andrew B. Kahng,et al.  The Y architecture for on-chip interconnect: analysis and methodology , 2005, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[8]  Cheng-Kok Koh,et al.  Manhattan or non-Manhattan?: a study of alternative VLSI routing architectures , 2000, ACM Great Lakes Symposium on VLSI.

[9]  Andrew B. Kahng,et al.  Estimation of wirelength reduction for λ-geometry vs. manhattan placement and routing , 2003, SLIP '03.

[10]  Chung-Kuan Cheng,et al.  Estimation of Wirelength Reduction for λ-Geometry vs . Manhattan Placement and Routing , 2003 .