메뉴 건너뛰기




Volumn 2005, Issue , 2005, Pages

Reducing power with performance constraints for parallel sparse applications

Author keywords

[No Author keywords available]

Indexed keywords

FREQUENCY SCALING; LARGE-SCALE CLUSTERS; PARALLEL COMPUTATIONS; PARALLEL SPARSE APPLICATIONS;

EID: 33746318690     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2005.378     Document Type: Conference Paper
Times cited : (43)

References (26)
  • 5
    • 0005029490 scopus 로고
    • LAPACK working note 80. the design and implementation of the scaLAPACK LU, QR, and cholesky factorization routines
    • Department of Computer Science, University of Tennessee, September
    • J. Choi, J. J. Dongarra, S. Ostrouchov, A. P. Petitet, D. W. Walker, and R. C. Whaley. LAPACK Working Note 80. The Design and Implementation of the ScaLAPACK LU, QR, and Cholesky Factorization Routines. Technical Report CS-94-246, Department of Computer Science, University of Tennessee, September 1994.
    • (1994) Technical Report , vol.CS-94-246
    • Choi, J.1    Dongarra, J.J.2    Ostrouchov, S.3    Petitet, A.P.4    Walker, D.W.5    Whaley, R.C.6
  • 7
    • 0010154898 scopus 로고
    • A supernodal approach to sparse partial pivoting
    • Xerox Palo Alto Research Center
    • J. Demmel, S. C. Eisenstat, J. R. Gilbert, X. S. Li, and J. W. H. Liu. A supernodal approach to sparse partial pivoting. Technical Report CSL-94-14, Xerox Palo Alto Research Center, 1995.
    • (1995) Technical Report , vol.CSL-94-14
    • Demmel, J.1    Eisenstat, S.C.2    Gilbert, J.R.3    Li, X.S.4    Liu, J.W.H.5
  • 10
    • 85055521808 scopus 로고    scopus 로고
    • A new scheduling algorithm for parallel sparse lu factorization with static pivoting
    • IEEE Computer Society Press
    • L. Grigori and X. S. Li. A new scheduling algorithm for parallel sparse lu factorization with static pivoting. In Proceedings of the 2002 ACM/IEEE conference on Supercomputing, pages 1-18. IEEE Computer Society Press, 2002.
    • (2002) Proceedings of the 2002 ACM/IEEE Conference on Supercomputing , pp. 1-18
    • Grigori, L.1    Li, X.S.2
  • 12
    • 25144435709 scopus 로고
    • Performance and seal-ability of preconditioned conjugate gradient methods on the CM-5
    • R. F. Sincovec, D. E. Keyes, M. R. Leuze, L. R. Petzold, and D. A. Reed, editors, Philadephia, PA, SIAM Publications
    • A. Gupta, V. Kumar, and A. Sameh. Performance and seal-ability of preconditioned conjugate gradient methods on the CM-5. In R. F. Sincovec, D. E. Keyes, M. R. Leuze, L. R. Petzold, and D. A. Reed, editors, Proceedings of the Sixth SIAM Conference on Parallel Processing for Scientific Computing, pages 664-674, Philadephia, PA, 1993. SIAM Publications.
    • (1993) Proceedings of the Sixth SIAM Conference on Parallel Processing for Scientific Computing , pp. 664-674
    • Gupta, A.1    Kumar, V.2    Sameh, A.3
  • 14
    • 0026219647 scopus 로고
    • Parallel algorithms for sparse linear systems
    • M. T. Heath, E. Ng, and B. W. Peyton. Parallel algorithms for sparse linear systems. SIAM Review, 33:420-460, 1991.
    • (1991) SIAM Review , vol.33 , pp. 420-460
    • Heath, M.T.1    Ng, E.2    Peyton, B.W.3
  • 15
    • 0031084227 scopus 로고    scopus 로고
    • Performance of a fully parallel sparse solver
    • M. T. Heath and P. Raghavan. Performance of a fully parallel sparse solver. Int. J. Supercomputing Appl., 11:49-64, 1997.
    • (1997) Int. J. Supercomputing Appl. , vol.11 , pp. 49-64
    • Heath, M.T.1    Raghavan, P.2
  • 17
    • 0000135303 scopus 로고
    • Methods of conjugate gradients for solving linear systems
    • M. R. Hestenes and E. Stiefel. Methods of conjugate gradients for solving linear systems. J. Res. Nat. Bur. Stand., 49:409-436, 1952.
    • (1952) J. Res. Nat. Bur. Stand. , vol.49 , pp. 409-436
    • Hestenes, M.R.1    Stiefel, E.2
  • 18
    • 0003692957 scopus 로고
    • METIS: Unstructured graph partitioning and sparse matrix ordering system
    • Department of Computer Science, University of Minnesota, Minneapolis, MN
    • G. Karypis and V. Kumar. METIS: Unstructured graph partitioning and sparse matrix ordering system. Technical report, Department of Computer Science, University of Minnesota, Minneapolis, MN, 1995.
    • (1995) Technical Report
    • Karypis, G.1    Kumar, V.2
  • 19
    • 33746297024 scopus 로고    scopus 로고
    • Trends in algorithms for nonuniform applications on hierarchical distributed architectures
    • M. D. Salas and W. K. Anderson, editors, Kluwer
    • D. E. Keyes. Trends in algorithms for nonuniform applications on hierarchical distributed architectures. In M. D. Salas and W. K. Anderson, editors, Proceedings of the Workshop on Computational. Aerosciences for the 21st Century, pages 103-137. Kluwer, 2000.
    • (2000) Proceedings of the Workshop on Computational. Aerosciences for the 21st Century , pp. 103-137
    • Keyes, D.E.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.