Flow-Based Partitioning and Position Constraints in VLSI Placement

Provided by: edaa
Topic: Hardware
Format: PDF
In this paper, the authors present a new quadratic, partitioning-based placement algorithm which is able to handle non-convex and overlapping position constraints to subsets of cells, the movebounds. Their new Flow-Based Partitioning (FBP) combines a global MinCostFlow model for computing directions with extremely fast and highly parallelizable local realization steps. Despite its global view, the size of the MinCostFlow instance is only linear in the number of partitioning regions and does not depend on the number of cells.

Find By Topic