A Connectivity-Based Legalization Scheme for Standard Cell Placement

作     者：Antonios N. Dadaliaris Panagiotis Oikonomou Maria G. Koziri Evangelia Nerantzaki Thanasis Loukopoulos Georgios I. Stamoulis 

作者机构：Department of Computer Science University of Thessaly Lamia Greece Department of Electrical and Computer Engineering University of Thessaly Volos Greece Department of Computer Science and Biomedical Informatics University of Thessaly Lamia Greece 

出 版 物：《Circuits and Systems》 (电路与系统（英文）)

年 卷 期：2017年第8卷第8期

页      面：191-201页

学科分类：1002[医学-临床医学] 100214[医学-肿瘤学] 10[医学] 

主　　题：Legalization Standard Cell Placement Heuristics Interconnect Wirelength 

摘      要：Standard cell placement algorithms have been at the forefront of academic research concerning the physical design stages of VLSI design flows. The penultimate step of a standard cell placement procedure is legalization. In this step the manufacturability of the design is directly settled, and the quality of the solution, in terms of wirelength, congestion, timing and power consumption is indirectly defined. Since the heavy lifting regarding processing is performed by global placers, fast legalization solutions are protruded in state-of-the-art design flows. In this paper we propose and evaluate a legalization scheme that surpasses in execution speed two of the most widely used legalizers, without not only corrupting the quality of the final solution in terms of interconnection wirelength but improving it in the process.