DocumentCode
1629381
Title
Circuit partitioning and iteration scheme for waveform relaxation on multicomputers
Author
Peterson, Lena ; Mattisson, Sven
Author_Institution
Dept. of Appl. Electron., Lund Univ., Sweden
fYear
1989
Firstpage
570
Abstract
An algorithm is presented for the global iteration in the waveform relaxation method for circuit simulation: the n -colored Gauss-Seidel algorithm. The authors also investigate a simple method for circuit partitioning, the source-drain partitioning. These methods are compared with others in experiments on both sequential and concurrent computers. One conclusion is that the n -colored algorithm can be used successfully when the number of subsystems in the circuit is significantly larger than the number of nodes in the multicomputer. The source-drain partitioning algorithm gives improved convergence rates for all test cases but fails to decrease the CPU time for some circuits, since model evaluation time per iteration increases
Keywords
circuit analysis computing; iterative methods; parallel algorithms; CPU time; circuit partitioning; circuit simulation; circuit subsystems; concurrent computers; convergence rates; global iteration algorithm; model evaluation time per iteration; multicomputer nodes; multicomputer waveform relaxation; n-colored Gauss-Seidel algorithm; parallel processing; sequential computers; source-drain partitioning; Circuit simulation; Circuit testing; Concurrent computing; Convergence; Equations; Gaussian processes; Jacobian matrices; Partitioning algorithms; Relaxation methods; Very large scale integration;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 1989., IEEE International Symposium on
Conference_Location
Portland, OR
Type
conf
DOI
10.1109/ISCAS.1989.100416
Filename
100416
Link To Document