SAAP produces k-way spatially continuous partitions of placed netlists that enforce hard spatial constraints and yield several to dozens of times smaller spatial cut sizes than prior methods.
Hubert Chan, Anand Louis, Zhihao Gavin Tang, and Chenzi Zhang
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.ET 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
SAAP: An Efficient Spatial-Aware Analytic Partitioning Algorithm of VLSI Netlists for Parallel Routing
SAAP produces k-way spatially continuous partitions of placed netlists that enforce hard spatial constraints and yield several to dozens of times smaller spatial cut sizes than prior methods.