
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
P. Sadayappan, V. Visvanathan, "Circuit Simulation on SharedMemory Multiprocessors," IEEE Transactions on Computers, vol. 37, no. 12, pp. 16341642, December, 1988.  
BibTex  x  
@article{ 10.1109/12.9740, author = {P. Sadayappan and V. Visvanathan}, title = {Circuit Simulation on SharedMemory Multiprocessors}, journal ={IEEE Transactions on Computers}, volume = {37}, number = {12}, issn = {00189340}, year = {1988}, pages = {16341642}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.9740}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Circuit Simulation on SharedMemory Multiprocessors IS  12 SN  00189340 SP1634 EP1642 EPD  16341642 A1  P. Sadayappan, A1  V. Visvanathan, PY  1988 KW  sharedmemory multiprocessors; parallelization; vector multiprocessor; sparse matrix solution; parallel implementation; circuit simulator; circuit CAD; digital simulation; parallel processing. VL  37 JA  IEEE Transactions on Computers ER   
[1] G. Alghband and H. F. Jordan, "Multiprocessor sparse L/U decomposition with controlled fillin," Tech. Rep. 8548, ICASE, NASA Langley Res. Center, Hampton, VA, 1985.
[2] P. R. Benyon, "Exploiting vector computers by replication,"Comput. J., vol. 28, no. 2, pp. 138141, 1985.
[3] Betancourt, "Efficient parallel processing technique for inverting matrices with random sparsity,"IEE Proc., vol. 133, pt. E, pp. 235 240, July 1986.
[4] G. Bischoff and S. Greenberg, "CAYENNE: A parallel implementation of the circuit simulator SPICE," inProc. Int. Conf. Comput. Aided Design, Santa Clara, CA, Nov. 1986, pp. 182185.
[5] P. Cox, R. Burch, and B. Epler, "Circuit partitioning for parallel processing," inProc. Int. Conf. Comput.Aided Design, Santa Clara, CA, Nov. 1986, pp. 186189.
[6] T. A. Davis and E. S. Davidson, "PSOLVE: A concurrent algorithm for solving sparse systems of linear equations," inProc. 1987 Int. Conf. Parallel Processing, St. Charles, IL, Aug. 1987, pp. 483490.
[7] J. J. Dongarra, F. G. Gustavson, and A. Karp, "Implementing linear algebra algorithms for dense matrices on a vector pipeline machine,"Siam Rev., vol. 26, no. 1, pp. 91112, 1984.
[8] I. S. Duff, "Parallel implementation of multifrontal schemes,"Parallel Comput., vol. 3, pp. 193204, 1986.
[9] I. S. Duff, "Multiprocessing a sparse matrix code on the Alliant FX/8," Rep. CSS210, Comput. Sci. Syst. Division, Harwell Lab., 1987.
[10] I. S. Duff, A. M. Erisman, and J. K. Reid,Direct Methods for Sparse Matrices. Oxford, England: Clarendon, 1986.
[11] FX/Architecture Manual, Alliant Comput. Corp., 1986.
[12] B. Greer, "Converting SPICE to vector code,"VLSI Syst. Design, Jan. 1986.
[13] J. W. Huang and O. Wing, "Optimal parallel triangulation of a sparse matrix,"IEEE Trans. Circuits Syst., vol. CAS26, pp. 726732, Sept. 1979.
[14] G. K. Jacob, A. R. Newton, and D. O. Pederson, "Parallel linearequation solution in directmethod circuit simulators," inProc. Int. Symp. Circuits Syst., Philadelphia, PA, May 1987, pp. 10561059.
[15] J. W. H. Liu, "Computational models and task scheduling for parallel sparse Cholesky factorization,"Parallel Comput., vol. 3, pp. 327 342, 1986.
[16] R. Lucas, T. Blank, and J. Tiemann, "A parallel solution method for large sparse systems of equations,"IEEE Trans. ComputerAided Design, vol. CAD6, pp. 981990, Nov. 1987.
[17] L. W. Nagel, "SPICE2: A computer program to simulate semiconductor circuits," Memo. ERLM520, Electron. Res. Lab., Univ. California, Berkeley, May 1975.
[18] L. W. Nagel, AT&T Bell Labs., unpublished work.
[19] B. R. Penumalli, AT&T Bell Labs., unpublished work.
[20] J. Perry, Alliant Comput. Syst., unpublished work.
[21] P. Sadayappan and V. Visvanathan, "Circuit simulation on a multiprocessor," inProc. Custom Integrated Circuits Conf., Portland, OR, May 1987, pp. 124128.
[22] P. Sadayappan and V. Visvanathan, "Parallelization and performance evaluation of circuit simulation on a shared memory multiprocessor," inProc. 1988 Int. Conf. Supercomput., St. Malo, France, July 1988, pp. 254265.
[23] D. Smart and J. White, "Reducing the parallel solution time of sparse circuit matrices using reordered Gaussian elimination and relaxation," inProc. Int. Symp. Circuits Syst., Helsinki, Finland, 1988.
[24] R. E. Tarjan and A. C. Yao, "Storing a sparse table,"Commun. ACM, vol. 22, pp. 606611, Nov. 1979.
[25] J. Vlach and K. Singhal,Computer Methods for Circuit Analysis and Design. New York: Van Nostrand Reinhold, 1983.
[26] W. T. Weeks, A. J. Jimenez, G. W. Mahoney, D. Mehta, H. Qassemzadeh, and T. R. Scott, "Algorithms for ASTAPA network analysis program,"IEEE Trans. Circuit Theory, vol. CT20, pp. 628634, Nov. 1973.
[27] F. Yamamoto and S. Takahashi, "VectorizedLUdecomposition algorithms for largescale circuit simulation,"IEEE Trans. Comput. Aided Design, vol. CAD4, pp. 232238, July 1985.