BonnPlace Legalization: Minimizing Movement by Iterative Augmentation

@article{Brenner2013BonnPlaceLM,
  title={BonnPlace Legalization: Minimizing Movement by Iterative Augmentation},
  author={Ulrich Brenner},
  journal={IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems},
  year={2013},
  volume={32},
  pages={1215-1227}
}
We describe BONNPLACELEGAL, an algorithm for VLSI placement legalization. Based on a minimum-cost flow algorithm that iteratively augments flows along paths, our approach ensures that only augmentations are considered that can be realized exactly by cell movements. Hence, this method avoids realization problems that are inherent to previous flow-based legalization algorithms. As a result, it combines the global perspective of minimum-cost flow approaches with the efficiency of local search… CONTINUE READING