An efficient partitioning algorithm for large-scale circuits

A parallel circuit-partitioning algorithm aimed at minimizing the number of tearing nodes between subcircuits, the size of each subcircuit, or both, is presented. The algorithm is most suitable for circuit-simulation problems. It is currently implemented in a symbolic circuit simulator (SCAPP). The algorithm depends on the exploration of the coupling between the modified fundamental loops of the circuit. It recursively performs a hierarchical binary partitioning on the circuit and its subcircuits based on the concepts of loop index, tearing index, and branch index. Experimental results show the algorithm reaching optimum or better near-optimal solutions to problems for which existing algorithms failed or produced worse solutions.<>