DeepAI AI Chat
Log In Sign Up

A Fast Optimal Double Row Legalization Algorithm

by   Stefan Hougardy, et al.
University of Bonn

In Placement Legalization, it is often assumed that (almost) all standard cells possess the same height and can therefore be aligned in cell rows, which can then be treated independently. However, this is no longer true for recent technologies, where a substantial number of cells of double- or even arbitrary multiple-row height is to be expected. Due to interdependencies between the cell placements within several rows, the legalization task becomes considerably harder. In this paper, we show how to optimize quadratic cell movement for pairs of adjacent rows comprising cells of single- as well as double-row height with a fixed left-to-right ordering in time ๐’ช(nยทlog(n)), whereby n denotes the number of cells involved. Opposed to prior works, we thereby do not artificially bound the maximum cell movement and can guarantee to find an optimum solution. Experimental results show an average percental decrease of over 26% in the total quadratic movement when compared to a legalization approach that fixes cells of more than single-row height after Global Placement.


page 1

page 2

page 3

page 4

โˆ™ 05/28/2018

Multiple-Lithography-Compliant Verification for Standard Cell Library Development Flow

Starting from 22-nm, a standard cell must be designed to be full lithogr...
โˆ™ 03/28/2021

StreamTable: An Area Proportional Visualization for Tables with Flowing Streams

Let M be an rร— c table with each cell weighted by a nonzero positive num...
โˆ™ 03/16/2021

On Linear Solution of "Cherry Pickup II". Max Weight of Two Disjoint Paths in Node-Weighted Gridlike DAG

"Minimum Falling Path Sum" (MFPS) is classic question in programming - "...
โˆ™ 02/02/2023

Physical Zero-Knowledge Proof for Five Cells

Five Cells is a pencil puzzle consisting of a rectangular grid, with som...
โˆ™ 12/23/2022

Scalable and Secure Row-Swap: Efficient and Safe Row Hammer Mitigation in Memory Systems

As Dynamic Random Access Memories (DRAM) scale, they are becoming increa...
โˆ™ 03/02/2022

Embedding K3,3 and K5 on the Double Torus

The Kuratowski graphs K_3,3 and K_5 characterize planarity. Counting dis...
โˆ™ 10/14/2017

A graphical, scalable and intuitive method for the placement and the connection of biological cells

We introduce a graphical method originating from the computer graphics d...