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