메뉴 건너뛰기




Volumn , Issue , 2009, Pages 277-283

A High-performance hybrid computing approach to massive contingency analysis in the power grid

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEX TASK; COMPUTATIONAL TASK; CONTINGENCY ANALYSIS; ELECTRICAL POWER; GRAPH PROCESSING; GRID OPERATORS; HYBRID COMPUTATIONAL; PARALLEL COMPUTE; POWER FAILURE; POWER GRIDS; PRELIMINARY PERFORMANCE RESULTS; SAFE OPERATION; SCALABLE SOLUTION; SOCIAL IMPACT; TRANSMISSION LINE;

EID: 77949842475     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/e-Science.2009.46     Document Type: Conference Paper
Times cited : (51)

References (12)
  • 1
    • 33846295388 scopus 로고    scopus 로고
    • State and Canada
    • U.S.-Canada Power System Outage Task Force, 14, 2003 Blackout in the United, Causes and Recommendations, April, at
    • U.S.-Canada Power System Outage Task Force, Final Report on the August 14, 2003 Blackout in the United State and Canada: Causes and Recommendations, April 2004. at https://reports.energy.gov/.
    • (2004) Final Report on the August
  • 8
    • 84865730611 scopus 로고
    • A set of measures of centrality based on betweenness
    • L.C. Freeman, A set of measures of centrality based on betweenness, Sociometry, 1977, 40:35-41.
    • (1977) Sociometry , vol.40 , pp. 35-41
    • Freeman, L.C.1
  • 9
    • 0007334606 scopus 로고
    • The rush in a directed graph
    • 9/71, Stichting Mathematisch Centrum, Amsterdam
    • J.M. Anthonisse, The rush in a directed graph, Technical Report BN 9/71, Stichting Mathematisch Centrum, Amsterdam, 1971.
    • (1971) Technical Report BN
    • Anthonisse, J.M.1
  • 10
    • 0035648637 scopus 로고    scopus 로고
    • A Faster Algorithm for Betweenness Centrality
    • U. Brandes, A Faster Algorithm for Betweenness Centrality, Journal of Mathematical Sociology, Vol. 25, 2001, pp. 163-177.
    • (2001) Journal of Mathematical Sociology , vol.25 , pp. 163-177
    • Brandes, U.1
  • 11
    • 34147120474 scopus 로고
    • A note on Two Problems Inconnexion with Graphs
    • S
    • E. W. Dijkstra, A note on Two Problems Inconnexion with Graphs, Numerische Mathematik, 1 (1959), S. 269-271.
    • (1959) Numerische Mathematik , vol.1 , pp. 269-271
    • Dijkstra, E.W.1
  • 12
    • 71849099468 scopus 로고    scopus 로고
    • Massive Contingency Analysis with High Performance Computing
    • Calgary, Canada, July
    • Z. Huang, Y. Chen, J. Nieplocha, Massive Contingency Analysis with High Performance Computing, Proc. IEEE PES General Meeting, Calgary, Canada, July 2009
    • (2009) Proc. IEEE PES General Meeting
    • Huang, Z.1    Chen, Y.2    Nieplocha, J.3


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