Circuit partitioning issues for circuit simulation on distributed mult
iprocessors are discussed in this paper. An efficient three-level part
itioning algorithm for large-scale circuit is proposed. Using this alg
orithm, we can partition a large-scale circuit into r subcircuits of s
imilar size while keeping the interconnect set of nodes to a minimum.
This algorithm can be implemented for parallel processing. Some exampl
es are given to show the performance of the algorithm. Copyright (C) 1
996 Elsevier Science Ltd