next up previous
Next: Nomenclature Up: Parallel Block-Diagonal-Bordered Sparse Linear Previous: Future Research Opportunities

References

1
M. M. Adibi, P. M. Hirsch, and J. A. Jordan, Jr. Solution Methods for Transient and Dynamic Stability. Proceedings of the IEEE, 62(7):951--958, July 1974.

2
P. M. Anderson and B. Demhart. Computational Aspects of Transient Stability Analysis. In A. M. Erisman, K. W. Neves, and M. H. Dwarakanath, editors, Electrical Power Problems: The Mathematical Challenge, pages 159--189. SIAM, Philadelphia, July 1980.

3
S. T. Barnard and H. D. Simon. A Fast Multilevel Implementation of Recursive Spectral Bisection for Partitioning Unstructured Problems. Technical Report RNR-92-033, NASA Ames Research Center, November 1992.

4
A. R. Bergen. Power Systems Analysis. Prentice-Hall, 1986.

5
G. Brassard and P. Bratley. Algorithmics --- Theory and Practice. Prentice-Hall, 1988.

6
E. A. Brewer and B. C. Kuszmaul. How to Get Good Performance from the CM-5 Data Network. Proceedings of the 1994 International Parallel Processing Symposium, 1994.

7
J. S. Chai and A. Bose. Bottlenecks in Parallel Algorithms for Power System Stability Analysis. IEEE Transactions on Power Systems, 8(1):9--15, February 1993.

8
T. A. David. Performance of an Unsymmetric-Pattern Multifrontal Method for Sparse LU Factorization. Technical Report TR-92--14, University of Florida, Computer and Information Sciences Department, May 1992.

9
T. A. David and I. S. Duff. Unsymmetric-Pattern Multifrontal Methods for Parallel Sparse LU Factorization. Technical Report TR-91-23, University of Florida, Computer and Information Sciences Department, September 1991.

10
T. A. David and I. S. Duff. An Unsymmetric-Pattern Multifrontal Method for Sparse LU Factorization. Technical Report TR-93-018, University of Florida, Computer and Information Sciences Department, March 1993.

11
J. J. Dongarra, D. C. Sorensen I. S. Duff, and H. A. van der Vorst. Solving Linear Systems on Vector and Shared Memory Computers. SIAM, Philadelphia, 1991.

12
I. S. Duff, A. M. Erisman, and J. K. Reid. Direct Methods for Sparse Matrices. Oxford University Press, Oxford, 1990.

13
I. S. Duff, R. G. Grimes, and J. G. Lewis. Users' Guide for the Harwell-Boeing Sparse Matrix Collection (Release I). Technical Report TR/PA/92/86, CERFACS, 1992.

14
Electrical Power Research Institute, Palo Alto, California. Extended Transient-Midterm Stability Program: Version 3.0 - Volume 4: Programmers Manual , Part 1, April 1993.

15
J. Fong and C. Pottle. Parallel Processing of Power System Analysis Problems Via Simple Parallel Microcomputer Structures. IEEE Transactions on Power Apparatus and Systems, PAS-97(5):1834--1841, September/October 1978.

16
G. Fox. . private correspondance, December 1994.

17
G. Fox, M. Johnson, G. Lyzenga, S. Otto, J. Salmon, and D. Walker. Solving Problems on Concurrent Processors. Prentice Hall, 1988.

18
A. George and E. Eg. Some Shared Memory is Desirable in Parallel Sparse Matrix Computation. SIGNUM Newsletter, 23(2):9--13, April 1988.

19
A. George, M. T. Heath, J. Liu, and E. Ng. Solution of Sparse Positive Definite Systems on a Shared-Memory Multiprocessor. International Journal of Parallel Programming, 15(4):309--328, August 1986.

20
A. George, M. T. Heath, J. Liu, and E. Ng. Sparse Cholesky Factorization on a Local-Memory Multiprocessor. SIAM journal on Scientific and Statistical Computing, 9(2):327--340, March 1988.

21
A. George, M. T. Heath, J. Liu, and E. Ng. Solution of Sparse Positive Definite Systems on a Hypercube. Journal of Computational and Applied Mathematics, 27:129--156, 1989.

22
A. George and J. Liu. The Evolution of the Minimum Degree Ordering Algorithm. SIAM Review, 31(1):1--19, March 1989.

23
G. Golub and J. M. Ortega. Scientific Computing with an Introduction to Parallel Computing. Academic Press, Boston, MA., 1993.

24
A. Grama, A. Gupta, and V. Kumar. Isoefficiency: Measuring the Scalablility of Parallel Algorithms and Architectures. IEEE Parallel & Distributed Technology: Systems and Applications, 1(3):12--22, August 1993.

25
A. Gupta and V. Kumar. A Scalable Parallel Algorithm for Sparse Cholesky Factorization. In SuperComputing '94, pages 793--802. IEEE Computer Society and ACM, November 1994.

26
H. H. Happ. Diakoptics - The Solution of System Problems by Tearing. Proceedings of the IEEE, 62(7):930--940, July 1974.

27
N. Hartsfield and G. Ringel. Pearls in Graph Theory --- A Comprehensive Introduction. Acedemic Press, Inc., 1990.

28
K. A. Hawick. High Performance Computing and Communicaitons Glossary --- Release 1.3a. Technical report, Northeast Parallel Architectures Center (NPAC), July 1994. available at http://www.npac.syr.edu/nse/hpccgloss/index.html.

29
M. T. Heath, E. Ng, and B. W. Peyton. Parallel Algorithms for Sparse Linear Systems. In Parallel Algorithms for Matrix Computations, pages 83--124. SIAM, Philadelphia, 1991.

30
W. Hoffmann. Solving Linear Systems by Direct Methods Related to Gaussian Elimination. In Algorithms and Applications on Vector and Parallel Computers. Elsevier Science Publishers B. V., 1987.

31
G. Huang and W. Ongsakul. Managing the Bottlenecks in Parallel Gauss-Seidel Type Algorithms for Power Flow Analysis. Proceedings of the 18th Power Industry Computer Applications (PICA) Conference, pages 74--81, May 1993.

32
M. T. Jones and P. E. Plassman. A Parallel Graph Coloring Heuristic. SIAM Journal on Scientific Computing, 14(3):654--69, May 1993.

33
G. Karypis, A. Gupta, and V. Kumar. A Parallel Formulation of Interior Point Algorithms. In SuperComputing '94, pages 204--213. IEEE Computer Society and ACM, November 1994.

34
D. P. Koester, S. Ranka, and G. C. Fox. Parallel LU Factorization of Block-Diagonal-Bordered Sparse Matrices. NPAC Technical Report SCCS-550, Northeast Parallel Architectures Center (NPAC), Syracuse Univeristy, August 1993.

35
D. P. Koester, S. Ranka, and G. C. Fox. A Parallel Gauss-Seidel Algorithm for Sparse Power System Matrices. In SuperComputing '94, pages 184--193. IEEE Computer Society and ACM, November 1994.

36
D. P. Koester, S. Ranka, and G. C. Fox. A Parallel Gauss-Seidel Algorithm for Sparse Power System Matrices. NPAC Technical Report SCCS 630, Northeast Parallel Architectures Center (NPAC), Syracuse University, April 1994.

37
D. P. Koester, S. Ranka, and G. C. Fox. Parallel Block-Diagonal-Bordered Sparse Linear Solvers for Electrical Power System Applications. In A. Skjellum, editor, Proceeding of the Scalable Parallel Libraries Conference. IEEE Press, 1994.

38
D. P. Koester, S. Ranka, and G. C. Fox. Parallel Choleski Factorization of Block-Diagonal-Bordered Sparse Matrices. NPAC Technical Report SCCS 604, Northeast Parallel Architectures Center (NPAC), Syracuse University, January 1994.

39
D. P. Koester, S. Ranka, and G. C. Fox. Parallel Choleski Factorization of Block-Diagonal-Bordered Sparse Matrices. Technical Report SCCS-604, Northeast Parallel Architectures Center (NPAC), Syracuse University, Syracuse, NY 13244-4100, January 1994.

40
D. P. Koester, S. Ranka, and G. C. Fox. Parallel Direct Methods for Block-Diagonal-Bordered Sparse Matrices. NPAC Technical Report SCCS 679, Northeast Parallel Architectures Center (NPAC), Syracuse University, December 1994.

41
V. Kumar and A. Gupta. Analyzing Scalablility of Parallel Algorithms and Architectures. Technical Report TR 91-18, Department of Computer Science University of Minnesota, Minneapolis, MN, November 1991.

42
D. W. Matula, G. Marble, and J. D. Isaacson. Graph Coloring Algorithms. Academic Press, New York, 1972.

43
W. Oed. The Cray Research Massively Parallel Processor System --- Cray T3D. Technical report, Cray Research GmbH, November 1993.

44
V. Pan. Parallel Solution of Sparse Linear and Path Systems. In J. H. Reif, editor, Synthesis of Parallel Algorithms, chapter 14. Morgan Kaufmann, San Mateo, CA, 1993.

45
A. Pothen, H. Simon, and K. P. Liou. Partitioning Sparse Matrices with Eigenvalues of Graphs. SIAM J. Mat. Anal. Appl., 11(3):pp. 430--452, 1990.

46
E. Rothberg. Exploiting the Memory Hierarchy in Sequential and Parallel Sparse Cholesky Factorization. PhD thesis, Stanford University, December 1992.

47
E. Rothberg and R. Schreiber. Improved Load Distribution in Parallel Sparse Cholesky Factorization. In SuperComputing '94, pages 783--792. IEEE Computer Society and ACM, November 1994.

48
R. A. Saleh, K. A. Gallivan, M. Chang, I. N. Hajj, D. Smart, and T. N. Trick. Parallel Circuit Simulation on Supercomputers. Proceedings of the IEEE, 77(12):1915--1930, December 1989.

49
A. Sangiovanni-Vincentelli, L. K. Chen, and L. O. Chua. Node-Tearing Nodal Analysis. Technical Report ERL-M582, Electronics Research Laboratory, College of Engineering, University of California, Berkeley, October 1976.

50
H. D. Simon. Partitioning of Unstructured Problems for Parallel Processing. Technical Report RNR-91-008, NASA Ames Research Center, February 1991.

51
A. Skjellum. Concurrent Dynamic Simulation: Multicomputer Algorithms Research Applied to Ordinary Differential-Algebraic Process Systems in Chemical Engineering. PhD thesis, California Institute of Technology, Division of Chemistry and Chemical Engineering, Pasadena, CA, 1990.

52
X. H. Sun and D. T. Rover. Scalability of Parallel Algorithm-Machine Combinations. IEEE Transactions on Parallel and Distributed Systems, 5(6):599--613, June 1994.

53
Thinking Machines Corporation, Cambridge, MA. CMMD Reference Manual, 1993. Version 3.0.

54
D. J. Tylavsjy, A. Bose, and et. al. Parallel Processing in Power Systems Computation. IEEE Transactions on Power Systems, 7(2):629--638, May 1992.

55
S. Venugopal and V. K. Naik. Effects of Partitioning and Scheduling Sparse Matrix Factorization on Communications and Load Balance. NASA Contractor Report 189563 ICASE Report No. 91-80, NASA, Langley Research Center, October 1991.

56
S. Venugopal and V. K. Naik. SHAPE: A Parallelization Tool for Sparse Matrix Computations. Research Report RC 17899 (77448), IBM Research Division, T. J. Watson Research Center Yorktown Heights, NY 10598, January 1992.

57
S. Venugopal and V. K. Naik. Towards Understanding Block Partitioning for Sparse Cholesky Factorization. Research Report RC 18666 (80517), IBM Research Division, T. J. Watson Research Center Yorktown Heights, NY 10598, October 1992.

58
S. Venugopal, V. K. Naik, and J. Saltz. Performance of Distributed Sparse Cholesky Factorization with Pre-scheduling. Research Report RC 18623 (78732), IBM Research Division, T. J. Watson Research Center Yorktown Heights, NY 10598, April 1992.

59
T. von Eicken, D. E. Culler, S. C. Goldstein, and K. E. Schauser. Active Messages: a Mechanism for Integrated Communication and Computation. Technical report, Computer Science Division --- EECS, University of California, Berkeley, CA, March 1992. Report No. UCB/CSD 92/#675.

60
G. von Laszewski, M. Parashar, A. G. Mohamed, and G. C. Fox. High Performance Scalable Matrix Algebra Algorithms for Distributed Memory Architectures. Technical Report SCS-271, Northeast Parallel Architectures Center, Syracuse University, 1992.

61
G. von Laszewski, M. Parashar, A. G. Mohamed, and G. C. Fox. On the Parallelization of Blocked LU Factorization Algorithms on Distributed Memory Architectures. Technical Report SCS-271b, Northeast Parallel Architectures Center, Syracuse University, June 1992.

62
Y. Wallach. Calculations and Programs for Power System Networks. Prentice-Hall, 1986.

63
Y. Wallach. Parallel Processing and Ada. Prentice-Hall, 1991.

64
M. Zubair and M. Ghose. A Performance Study of Sparse Cholesky Factorization on the INTEL iPSC/860. NASA Contractor Report 189634 ICASE Report No. 92-13, NASA, Langley Research Center, March 1992.



David P. Koester
Sun Oct 22 17:27:14 EDT 1995