Parallel simulation of massively coupled interconnect networks
IEEE Transactions on Advanced Packaging , Volume 33 - Issue 1 p. 115- 127
In a system containing high-speed interconnects, the presence of a large number of coupled lines seriously limits the ability to perform fast simulations. In this paper, a parallel algorithm is presented that allows for simulations of massively coupled interconnects to be performed efficiently. New methods based on physical and time-domain partitioning are developed to create parallelism during transient simulations of large coupled interconnects. In addition, the proposed method exploits the recently developed waveform relaxation techniques to decouple and parallelize the large coupled simulation problem. In this approach, for a simulation of nL lines run on n P processors, the computational complexity is O(nLn P -1). This provides considerable savings as opposed to ≤ β ≤ 4 for full coupled-line simulations.
|, , , , ,|
|IEEE Transactions on Advanced Packaging|
|Organisation||Department of Electronics|
Paul, D. (Douglas), Nakhla, N.M. (Natalie M.), Achar, R, & Nakhla, M.S. (2010). Parallel simulation of massively coupled interconnect networks. IEEE Transactions on Advanced Packaging, 33(1), 115–127. doi:10.1109/TADVP.2009.2025263