Abstract
AbstractWaveform relaxation algorithms for the simulation of digital MOS circuits exhibit natural parallelism which can be exploited on parallel processors. This paper addressed the question of how much the circuit simulation run‐time can be reduced by using this natural parallelism. the parallel waveform relaxation methods examined in this paper are based on the Gauss‐Seidel and Gauss‐Jacobi relaxation methods, and window‐level and time‐point level parallelization strategies. the different methods are evaluated using an actual multiprocessor implementation of the algorithms, and by using a program which estimates speed‐ups, neglecting overhead. the method giving the best performance is a function of the circuit being simulated and the number of processors used. When sufficiently many processors are available, the Gauss‐Jacobi method with time‐point pipelining offers the best speed‐up potential. Speed‐ups close to one order of magnitude should be possible using this method for 1000‐node for 32 processors.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
