A parallel WLS S tate estimator on S hared memory computers

8th International Power Engineering Conference, IPEC 2007

Volumn , Issue , 2007, Pages 395-400

  Nieplocha, J ^a   Chavarria Miranda D ^a   Tipparaju, V ^a   Huang, Z ^a   Marquez, A ^a  

^a PACIFIC NORTHWEST NATIONAL LABORATORY   (United States)

Author keywords

Conjugate gradient methods; Parallel processing; Shared memory architectures; Sparse linear equation solvers; Weighted least square state estimation

Indexed keywords

COMPUTER NETWORKS; CONJUGATE GRADIENT METHOD; LEAST SQUARES APPROXIMATIONS; SPONTANEOUS EMISSION;

CONJUGATE GRADIENT METHODS; PARALLEL PROCESSING; SHARED MEMORY ARCHITECTURES; SPARSE LINEAR EQUATION SOLVERS; WEIGHTED LEAST SQUARE STATE ESTIMATION;

LINEAR EQUATIONS;

EID: 51349112444     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (24)

1. F. C. S chweppe, J. Wildes, and D. B. Rom, "Power system static state estimation I, I I, I I," IEEE Trans. PAS, vol. 89.
2. R. E. Larson, W. F. Tinney, L. P. Hadju, and D. S. Piercy, "S tate estimation in power systems, Parts I and I I," IEEE Trans. PAS, vol. 89.
3. A. Abur and A. G. Exposito, Power System State Estimation: Theory and Implementation, 2004.
4. Niagara: A Torrent of Threads, http://www.aceshardware.com/reads. jsp?id=65000292
5. K. Lau, D. J. Tylavsky, and A. Bose, "Coarse gr ain scheduling in parallel triangular factorization and solution of power system matrices," presented at IEEE/PESS ummer Meeting, Minneapolis, July 1990.
6. A. Abur, "A parallel scheme for the forward/bac kward substitutions in solving sparse linear systems," IEEE Trans. Power Systems, vol. 3, November 1988.
7. W. R. Tinney and J. W. Walker, "Direct Solutions of sparse network equations by optimally ordered triangular factorization," Proc. IEEE, vol. 55, 1967.
8. -1 methods," IEEE Trans. Power Systems, vol. 5, May 1990.
9. A. M. Turing, "Rounding-off errors in matrix pr ocesses," Quart. J. Mech. Appl. Math., vol. 1, pp. 287-308, 1948.
10. "An Overview of SuperLU: Algorithms, Implementation and User Interface," ACM Transactions on Mathematical Software, vol. 31, 2005.
11. J. Dongarra, J. Croz, I. Duff, and S. Hammärling, "A S et of Level 3 Basic Linear Algebra Subprograms," ACM Trans. Math. Soft., vol. 16, pp. 1-17, 1990.
12. IEEE S tandards, "POS I X S ystem Application Prog ram Interface: Threads extension 1003. 1c," 1995.
13. Message Passing Interface Forum, http://www.mpiforum.org
14. M. R. Hestenes and E. L. Stiefel, "Methods of Conjugate Gradient for S olving Linear Systems," Nat. Bur. Std., vol. 49, pp. 409-436, 1952.
15. K. C Jea and D. M. Young, "On the Simplification of Generalized Conjugate-Gradient Methods for Nonsymmetrizable Linear Systems," Linear Algebra Appl., vol. 52/53, pp. 399-417, 1983.
16. S GI Inc, http://www.sgi.com/products/servers/altix/3000/
17. J. Liu, "Modification of the minimum degree al gorithm by multiple elimination," ACM Trans. Math. Soft., vol. 11, pp. 141-153, 1985.
18. T. A. Davis, J. R. Gilbert, S. I. Larimore, and E. Ng, "A column approximate minimum degree ordering algorithm," Technical Report TR-00-005, CISD, University of Florida, 2000.
19. J. Nieplocha, RJ Harrison, and RJ Littlefield, Global Arrays: A nonuniform memory access programming model for high-performance computers, The Journal of Supercomputing, 10:197-220, 1996.
20. Y. Zhang, V. Tipparaju, J. Nieplocha, S. Hariri: Parallelization of the NAS Conjugate Gradient Benchmark Using the Global Arrays S hared Memory Programming Model. Proceedings of I PDPS '05. 2005
21. J. Nieplocha, A. Marquez, V. Tipparaju, D. Cha varría-Miranda, R Guttromson, H. Huang, Towards Efficient Power System State Estimators on Shared Memory Computers, Proc. IEEE PES General Meeting, 2006.
22. T. Ungerer, B. Robi, and A. J urij, "A survey of processors with explicit multithreading," ACM Comput. Surv., vol. 35, pp. 29-63, 2003.
23. W. Anderson et. al. Early Experience with Scientific Programs on the Cray MTA-2, S C'03.
24. J. Feo, D. Harper, et. al. ELDORADO. Proc. Computing Frontiers'2005. 2005.