AnEfficient Algorithm forHexagon/Triangle Placement by Extending theApplication oftheSequence PairRepresentation*

TheY architecture hasrecently received muchatten- tion duetoits manypotential advantages. Tofully utilize thevirtues ofY architecture, anon-Manhattan Hexa- gon/Triangle Placement (HTPforshort) paradigm suitable fortheY architecture wasproposed recently. Thispaperextend theapplication ofsequence pair (SP forshort) representation toHTPproblem andpresent a newefficient HTP packing algorithm inBBL mode, basedontheSPrepresentation andFAST-SPalgorithm together withsomepacking rules. Two benchmarks transformed fromMCNC ami33andami49aredevel- oped. Experimental results showthat wehaveobtained thebestresults everreported intheliterature withless runtime. Inaddition, twocoordinate systems adapting to theYarchitecture arefirst presented.

[1]  H. Murata,et al.  Rectangle-packing-based module placement , 1995, ICCAD 1995.

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