Development of parallelism for circuit simulation by tearing
H. Onozuka, M. Kanoh, C. Mizuta, Toshiyuki Nakata, Noboru Tanabe · 2002
A hierarchical clustering with min-cut exchange method for parallel circuit simulation is presented. Partitioning into subcircuits is near optimum in terms of distribution of computational cost and does not sacrifice the sparsity of the entire matrix. In order to compute the arising dense interconnection matrix in parallel, multilevel and distributed row-base dissection algorithms are used. A processing speed up of 28 with 64 processors was achieved in large scale DRAM simulations.>