Network-flow based delay-aware circuit partitioning algorithm

摘要

We propose a network-flow based delay-aware circuit partitioning algorithm which takes into account the propagation delays introduced by partitioning operation. The idea is in first calculating the timing slacks of the nets and then refrain from cutting the slack-tight nets. It is done by taking into account the timing slack to determine the flow network edge capacity, i.e., the tighter the slack is, the larger the capacity of the flow network edge will be. We also describe a way to flexibly define the capacities of the flow network edges by the timing slacks between the input of a net and the outputs of the net.