L. M. Silveira, "Circuit simulation algorithms for massively parallel processors," Master's thesis. MIT. May 1990. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Massively Parallel Simulation Algorithms for Grid-Based .. - Lumsdaine, Silveira.. (1993) Self-citation (Silveira) (Correct)
....relevant processors, and one can operate identically on the data with all the relevant processors. The general circuit simulation problem violates all three of the above constraints, and previous attempts at using a SiMD machine to accelerate circuit simulation have yielded only limited success [12], 19] As will be shown in the rest of this section, simulation of grid based analog signal processors is well suited to SIMD architectures. These circuits are large enough to keep a large number of processors active, and they can be simulated with algorithms that depend on nearest neighbor ....
L. M. Silveira, "Circuit simulation algorithms for massively parallel processors," Master's thesis. MIT. May 1990.
Parallel Simulation Algorithms for Grid-Based Analog.. - Silveira, Lumsdaine.. Self-citation (Silveira) (Correct)
.... processors and One can operate identically on the data with all the rele vant processors The general circuit simulation problem violates all three of the above constraints, and previous attempts at circuit simu lation on the Connection Machine have not yielded impressive results [Webber 87, Silveira 90] As we will show in the rest of this section, simulation of grid based analog signal processors is well suited to the CM. These circuits are large, and can be simulated with algorithms that are mostly data parallel and which depend on mostly nearest neighbor communication be tween processors. ....
L. M. Silveira, "Circuit Simulation Algorithms for Massively Parallel Processors," S. M. Thesis, MIT, May 1990.
Massively Parallel Simulation Algorithms for Grid-Based .. - Lumsdaine, Silveira.. Self-citation (Silveira) (Correct)
....direction methods to the problem under consideration is that the convergence rates of these methods depend on the condition number of J F . By taking timesteps small enough, the capacitive portion of the Jacobian, which tends to be better conditioned than the conductive portion, will dominate (see [11]) To demonstrate the effectiveness of the conjugate direction methods, in Table 1 the CPU time required to compute the transient analysis of the network in Figure 1 is compared using several different matrix solution algorithms to solve (6) These results were obtained using the simulation ....
.... processors, and ffl One can operate identically on the data with all the relevant processors The general circuit simulation problem violates all three of the above constraints, and previous attempts at using a SIMD machine to accelerate circuit simulation have yielded only limited success [11, 12]. As will be shown in the rest of this section, simulation of grid based analog signal processors is well suited to SIMD architectures. These circuits are large enough to keep a large number of processors active, and they can be simulated with algorithms that depend on nearest neighbor ....
L. M. Silveira, "Circuit simulation algorithms for massively parallel processors," Master's thesis, Massachusetts Institute of Technology, May 1990.
Parallel Simulation Algorithms for Grid-Based Analog.. - Silveira, Lumsdaine.. Self-citation (Silveira) (Correct)
.... the analog grid involves numerically solving (4) To compute the solution, it is possible to use simple explicit or semi implicit numerical integration algorithms, but for these types of circuits, experiments show that an implicit method like the trapezoidal rule is substantially more efficient [Silveira 90] The trapezoidal rule leads to the following algebraic problem at each time step h: q(v(t h) Gamma q(v(t) 1 2h [f(v(t h) f(v(t) 0: 5) As is standard, the algebraic problem is solved with Newton s method, JF (v m (t h) v m 1 (t h) Gamma v m (t h) GammaF (v m (t ....
.... processors and ffl One can operate identically on the data with all the relevant processors The general circuit simulation problem violates all three of the above constraints, and previous attempts at circuit simulation on the Connection Machine have not yielded impressive results [Webber 87, Silveira 90] As we will show in the rest of this section, simulation of grid based analog signal processors is well suited to the CM. These circuits are large, and can be simulated with algorithms that are mostly data parallel and which depend on mostly nearest neighbor communication between processors. ....
L. M. Silveira, "Circuit Simulation Algorithms for Massively Parallel Processors," S. M. Thesis, MIT, May 1990.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC