As circuit sizes increase, a means to improve the performance of simulations without sacrificing the accuracy of the results becomes increasingly essential. To achieve this goal, a new parallel algorithm is presented that allows modern multicore processors to be exploited to realize this performance improvement. These improvements are obtained without sacrificing accuracy or resorting to iterative techniques. The computational complexity of the new algorithm is compared with the previously published algorithms based on the domain decomposition (DD) technique. A mathematical proof is presented showing that in the case of the DD algorithm, the CPU cost per iteration as a function of the number of links L between partitions is in the order of O(L2), leading to poor scalability as the number of partitions increases. On the other hand, the proposed algorithm exhibits superior scalability as its complexity increases only in the order of O(L). This result has been verified numerically and the scalability of the proposed algorithm is demonstrated with several industrial examples.

Additional Metadata
Keywords Binary links, circuit simulation, cloud computing, companion form, distributed computing, domain decomposition, multicore, Newton-Raphson iterations, node tearing, parallel simulation, SPICE, transient analysis
Persistent URL dx.doi.org/10.1109/TCPMT.2012.2237228
Journal IEEE Transactions on Components, Packaging and Manufacturing Technology
Citation
Paul, D. (Douglas), Nakhla, M.S, Achar, R, & Nakhla, N.M. (Natalie M.). (2013). Parallel circuit simulation via binary link formulations (PvB). IEEE Transactions on Components, Packaging and Manufacturing Technology, 3(5), 768–782. doi:10.1109/TCPMT.2012.2237228