Dominator-based partitioning for delay optimization

Abstract

Most of the logic synthesis algorithms are not scalable for large networks and, for this reason, partitioning is often applied. However traditional mincut-based partitioning techniques are not always suitable for delay and area logic optimizations. The paper presents an approach that uses a dominator-based partitioning and conventional logic synthesis techniques for delay optimization of large networks. The calculation of dominators is crucial to find topologically ordered clusters suitable for logic restructuring. As a result, a scalable and efficient strategy for delay optimization is proposed and evaluated, showing tangible improvements with respect to existing techniques. A comparison with a standard mincut-based partitioning technique is also presented.

DOI: 10.1145/1127908.1127927

Extracted Key Phrases

7 Figures and Tables

Cite this paper

@inproceedings{Baeres2006DominatorbasedPF, title={Dominator-based partitioning for delay optimization}, author={David Ba{\~n}eres and Jordi Cortadella and Michael Kishinevsky}, booktitle={ACM Great Lakes Symposium on VLSI}, year={2006} }