Routability-Driven Legalization Algorithm with Minimum Total Movement for Supporting Agricultural Machinery Design

摘要

Agricultural mechanization impacts on agricultural productivity and society development far-reaching. The emergence of ASIC (Application Specific Integrated Circuit) provides possibility for full intelligence and automation of agricultural products. Placement is a key step in the physical design of ASIC. Legalization is core task of the detailed placement after global distribution of generous standard cells. It removes cells overlap, aligns them to the sites and places them to their final position. A congestion-length driven legalization algorithm with minimum total movement is presented in this paper. The algorithm takes the total wire-length and congestion as objective and considers the site constraint to legalize cells with minimum movement. It contains series of phases to place cells to their optimal site, like formation, Inter-Row cells distribution and Intra-Row cells overlap elimination. But at the same time, it keeps global placement result and optimizes total wire-length at most. On the ISPD 2011 and DAC 2012 Contest Benchmark Suite, with the official valuation protocol, the routability-driven legalization algorithm outperforms original wirelength-driven algorithm almost every contestant.