Search NASA⌕ Search

SEARCH · Search NASA

Results for “Parallel in Time”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 523 records · Page 29

Massively parallel solvers for elliptic partial differential equations in numerical weather and climate prediction

The demand for substantial increases in the spatial resolution of global weather and climate prediction models makes it essential to use numerically efficient and highly scalable algorithms to solve the equations of large-scale atmospheric fluid dynamics. For stability and efficiency reasons, several of the operational forecasting centres, in particular the Met Office and the European Centre for Medium-Range Weather Forecasts (ECMWF) in the UK, use semi-implicit semi-Lagrangian time-stepping in the dynamical core of the model. The additional burden with this method is that a three-dimensional elliptic partial differential equation (PDE) for the pressure correction has to be solved at every model time step and this often constitutes a significant proportion of the time spent in the dynamical core. In global models, this PDE must be solved in a thin spherical shell. To run within tight operational time-scales, the solver has to be parallelized and there seems to be a (perceived) misconception that elliptic solvers do not scale to large processor counts and hence implicit time-stepping cannot be used in very high-resolution global models. After reviewing several methods for solving the elliptic PDE for the pressure correction and their application in atmospheric models, we demonstrate the performance and very good scalability of Krylov subspace solvers and multigrid algorithms for a representative model equation with more than 1010 unknowns on 65 536 cores on the High-End Computing Terascale Resource (HECToR), the UK's national supercomputer. Here, we tested and optimized solvers from two existing numerical libraries (the Distributed and Unified Numerics Environment (DUNE) and Parallel High Performance Preconditioners (hypre)) and implemented both a conjugate gradient solver and a geometric multigrid algorithm based on a tensor-product approach, which exploits the strong vertical anisotropy of the discretized equation. We study both weak and strong scalability and compare the absolute solution times for all methods; in contrast to one-level methods, the multigrid solver is robust with respect to parameter variations.

58 GEOSCIENCES↗

Performance Analysis of an Optimization Algorithm for Metamaterial Design on the Integrated High-Performance Computing and Quantum Systems

Optimizing metamaterials with complex geometries is a big challenge. Although an active learning algorithm, combining machine learning (ML), quantum computing, and optical simulation, has emerged as an efficient optimization tool, it still faces difficulties in optimizing complex structures that have potentially high performance. In this work, we comprehensively analyze the performance of an optimization algorithm for metamaterial design on the integrated HPC and quantum systems. We demonstrate significant time advantages through message-passing interface (MPI) parallelization on the high-performance computing (HPC) system showing approximately 54% faster ML tasks and 67 times faster optical simulation against serial workloads. Furthermore, we analyze the performance of a quantum algorithm designed for optimization, which runs with various quantum simulators on a local computer or HPC-quantum system. Results showcase ~24 times speedup when executing the optimization algorithm on the HPC-quantum hybrid system. This study paves a way to optimize complex metamaterials using the integrated HPC-quantum system.

Kim, Seongmin↗

An Accelerated Clip Algorithm for Unstructured Meshes: A Batch-Driven Approach

The clip technique is a popular method for visualizing complex structures and phenomena within 3D unstructured meshes. Meshes can be clipped by specifying a scalar isovalue to produce an output unstructured mesh with its external surface as the isovalue. Similar to isocontouring, the clipping process relies on scalar data associated with the mesh points, including scalar data generated by implicit functions such as planes, boxes, and spheres, which facilitates the visualization of results interior to the grid. In this paper, we introduce a novel batch-driven parallel algorithm based on a sequential clip algorithm designed for high-quality results in partial volume extraction. Our algorithm comprises five passes, each progressively processing data to generate the resulting clipped unstructured mesh. The novelty lies in the use of fixed-size batches of points and cells, which enable rapid workload trimming and parallel processing, leading to a significantly improved memory footprint and run-time performance compared to the original version. On a 32-core CPU, the proposed batch-driven parallel algorithm demonstrates a run-time speed-up of up to 32.6x and a memory footprint reduction of up to 4.37x compared to the existing sequential algorithm. The software is currently available under an open-source license in the VTK visualization system.

Tsalikis, Spiros↗

Metrological characterization of X-ray diffraction methods at different acquisition geometries for determination of crystallite size in nano-scale materials

Crystallite size values were determined by X-ray diffraction methods for 183 powder samples. The tested size range was from a few to about several hundred nanometers. Crystallite size was calculated with direct use of the Scherrer equation, the Williamson–Hall method and the Rietveld procedure via the application of a series of commercial and free software. The results were statistically treated to estimate the significance of the difference in size resulting from these methods. We also estimated effect of acquisition conditions (Bragg–Brentano, parallel-beam geometry, step size, counting time) and data processing on the calculated crystallite size values. On the basis of the obtained results it is possible to conclude that direct use of the Scherrer equation, Williamson–Hall method and the Rietveld refinement employed by a series of software (EVA, PCW and TOPAS respectively) yield very close results for crystallite sizes less than 60 nm for parallel beam geometry and less than 100 nm for Bragg–Brentano geometry. However, we found that despite the fact that the differences between the crystallite sizes, which were calculated by various methods, are small by absolute values, they are statistically significant in some cases. The values of crystallite size determined from XRD were compared with those obtained by imaging in a transmission (TEM) and scanning electron microscopes (SEM). It was found that there was a good correlation in size only for crystallites smaller than 50 – 60 nm. Highlights: • The crystallite sizes for 183 nanopowders were calculated using different XRD methods • Obtained results were subject to statistical treatment • Results obtained with Bragg-Brentano and parallel beam geometries were compared • Influence of conditions of XRD pattern acquisition on results was estimated • Calculated by XRD crystallite sizes were compared with same obtained by TEM and SEM.

36 MATERIALS SCIENCE↗

Accelerating a fluvial incision and landscape evolution model with parallelism

Solving inverse problems, performing sensitivity analyses, and achieving statistical rigour in landscape evolution models require running many model realizations. Parallel computation is necessary to achieve this in a reasonable time. However, no previous landscape evolution algorithm is able to leverage modern parallelism. In this report, I describe an algorithm that can utilize the parallel potential of GPUs and many-core processors, in addition to working well in serial. The new algorithm runs 43× faster (70 s vs. 3000 s on a 10,000×10,000 input) than the previous state-of-the-art and exhibits sublinear scaling with input size. I also identify key techniques for multiple flow direction routing and quickly eliminating landscape depressions and local minima. Complete, well-commented, easily adaptable source code for all versions of the algorithm is available on Github and Zenodo.

58 GEOSCIENCES↗

Look-ahead Dynamic Simulation

Look-ahead dynamic simulation software system incorporates the high performance parallel computing technologies, significantly reduces the solution time for each transient simulation case, and brings the dynamic simulation analysis into on-line applications to enable more transparency for better reliability and asset utilization. It takes the snapshot of the current power grid status, functions in parallel computing the system dynamic simulation, and outputs the transient response of the power system in real time.

Jin, Shuangshuang↗

Rapid QSTS Simulations for High-Resolution Comprehensive Assessment of Distributed PV

The rapid increase in penetration of distributed energy resources on the electric power distribution system has created a need for more comprehensive interconnection modeling and impact analysis. Unlike conventional scenario-based studies, quasi-static time-series (QSTS) simulations can realistically model time-dependent voltage controllers and the diversity of potential impacts that can occur at different times of year. However, to accurately model a distribution system with all its controllable devices, a yearlong simulation at 1-second resolution is often required, which could take conventional computers a computational time of 10 to 120 hours when an actual unbalanced distribution feeder is modeled. This computational burden is a clear limitation to the adoption of QSTS simulations in interconnection studies and for determining optimal control solutions for utility operations. The solutions we developed include accurate and computationally efficient QSTS methods that could be implemented in existing open-source and commercial software used by utilities and the development of methods to create high-resolution proxy data sets. This project demonstrated multiple pathways for speeding up the QSTS computation using new and innovative methods for advanced time-series analysis, faster power flow solvers, parallel processing of power flow solutions and circuit reduction. The target performance level for this project was achieved with year-long high-resolution time series solutions run in less than 5 minutes within an acceptable error.

24 POWER TRANSMISSION AND DISTRIBUTION↗

SU-D-BRE-06: Modeling the Dosimetric Effects of Volumetric and Layer-Based Repainting Strategies in Spot Scanning Proton Treatment Plans

Purpose: To compare multiple repainting techniques as strategies for mitigating the interplay effect in free-breathing, spot scanning proton plans. Methods: An analytic routine modeled three-dimensional dose distributions of pencil-beam proton plans delivered to a moving target. The interplay effect was studied in subsequent calculations by modeling proton delivery from a clinical synchrotron based spot scanning system and respiratory target motion, patterned from surrogate breathing traces from clinical 4DCT scans and normalized to nominal 0.5 and 1 cm amplitudes. Two distinct repainting strategies were modeled. In idealized volumetric repainting, the plan is divided up and delivered multiple times successively, with each instance only delivering a fraction of the total MU. Maximum-MU repainting involves delivering a fixed number of MU per spot and repeating a given energy layer until the prescribed MU are reached. For each of 13 patient breathing traces, the dose was computed for up to four volumetric repaints and an array of maximum-MU values. Delivery strategies were inter-compared based on target coverage, dose homogeneity, and delivery time. Results: Increasing levels of repainting generally improved plan quality and reduced dosimetric variability at the expense of longer delivery time. Motion orthogonal to the scan direction yielded substantially greater dose deviations than motion parallel to the scan direction. For a fixed delivery time, maximum-MU repainting was most effective relative to idealized volumetric repainting at small maximum-MU values. For 1 cm amplitude motion orthogonal to the scan direction, the average homogeneity metric (D5 – D95)[%] of 23.4% was reduced to 7.6% with a 168 s delivery using volumetric repainting compared with 8.7% in 157.2 s for maximum-MU repainting. The associated static target homogeneity metric was 2.5%. Conclusion: Maximum-MU repainting can provide a reasonably effective alternative to volumetric repainting for systems without the capability to switch energies rapidly.

60 APPLIED LIFE SCIENCES↗

Framework for Multi Layer Control in Python (FMLC) v1.0

This package is developed as a backend for multi-layer and multi-time domain controller. One example are controller based on [Model Predictive Control] (MPC) where different modules with different time constants have to be coordinated to allow optimal control. In a simple example, the Weather Forecast must be acquired and processed, the MPC is computed, and finally the control is applied. All these modules typically run on the same time step (Time step: 5 minutes), but are different instances within the framework. The framework allows parallelization using the `multiprocessing` module. However, another real-time controller (Time step: 1 second) must be applied to react on instant system disturbances beyond the MPC time step. Last, a supervisory MPC controller (Time step: 1 hour) might be added to ensure global optimality.

Gehbauer, Christoph↗

Spatiotemporal parallelization of an analytical heat conduction model for additive manufacturing via a hybrid OpenMP + MPI approach

The ability to do thermal simulations for entire additive manufacturing builds is a key computational problem facing the additive manufacturing community; however, complex numerical models considering multiple physical phenomena currently do not have the capacity for simulations at this scale. To this end, conduction only analytic models offer a viable approach due to the massive drop in computational expense. In this work, we extend an existing implementation which uses a governing equation which can be evaluated at any point in space and time. This implementation already utilizes OpenMP with a spatial decompositions scheme stemming from a melt pool tracking algorithm. Furthermore, we then combine this with a parallel in time (PinT) approach to make the problem highly parallelizable. The new scheme, which uses MPI for internode communication and OpenMP for intranode communication, is shown to scale very well across multiple computational nodes. This approach results in the ability to simulate the 3D solidification conditions for entire layers of additively manufactured parts in minutes making part scale thermal simulations more practical.

36 MATERIALS SCIENCE↗

Monte Carlo-based treatment planning system calculation engine for microbeam radiation therapy

Purpose: Microbeam radiation therapy (MRT) is a synchrotron radiotherapy technique that explores the limits of the dose-volume effect. Preclinical studies have shown that MRT irradiations (arrays of 25-75-{mu}m-wide microbeams spaced by 200-400 {mu}m) are able to eradicate highly aggressive animal tumor models while healthy tissue is preserved. These promising results have provided the basis for the forthcoming clinical trials at the ID17 Biomedical Beamline of the European Synchrotron Radiation Facility (ESRF). The first step includes irradiation of pets (cats and dogs) as a milestone before treatment of human patients. Within this context, accurate dose calculations are required. The distinct features of both beam generation and irradiation geometry in MRT with respect to conventional techniques require the development of a specific MRT treatment planning system (TPS). In particular, a Monte Carlo (MC)-based calculation engine for the MRT TPS has been developed in this work. Experimental verification in heterogeneous phantoms and optimization of the computation time have also been performed. Methods: The penelope/penEasy MC code was used to compute dose distributions from a realistic beam source model. Experimental verification was carried out by means of radiochromic films placed within heterogeneous slab-phantoms. Once validation was completed, dose computations in a virtual model of a patient, reconstructed from computed tomography (CT) images, were performed. To this end, decoupling of the CT image voxel grid (a few cubic millimeter volume) to the dose bin grid, which has micrometer dimensions in the transversal direction of the microbeams, was performed. Optimization of the simulation parameters, the use of variance-reduction (VR) techniques, and other methods, such as the parallelization of the simulations, were applied in order to speed up the dose computation. Results: Good agreement between MC simulations and experimental results was achieved, even at the interfaces between two different media. Optimization of the simulation parameters and the use of VR techniques saved a significant amount of computation time. Finally, parallelization of the simulations improved even further the calculation time, which reached 1 day for a typical irradiation case envisaged in the forthcoming clinical trials in MRT. An example of MRT treatment in a dog's head is presented, showing the performance of the calculation engine. Conclusions: The development of the first MC-based calculation engine for the future TPS devoted to MRT has been accomplished. This will constitute an essential tool for the future clinical trials on pets at the ESRF. The MC engine is able to calculate dose distributions in micrometer-sized bins in complex voxelized CT structures in a reasonable amount of time. Minimization of the computation time by using several approaches has led to timings that are adequate for pet radiotherapy at synchrotron facilities. The next step will consist in its integration into a user-friendly graphical front-end.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Development of Ensemble Neural Network Convection Parametrizations for Climate Models Using ARM Data

The novel neural network (NN) approach has been formulated and used for development of a NN ensemble stochastic convection parametrization for climate models. This fast parametrization is built based on data from Cloud Resolving Model (CRM) simulations initialized with and forced by TOGA-COARE data. The SAM (System for Atmospheric Modeling), developed by D. Randall, M. Khairoutdinov, and their collaborators, has been used for CRM simulations. The observational data are also used for validation of model simulations. The SAM-simulated data have been averaged and projected onto the GCM space of atmospheric states to implicitly define a stochastic convection parametrization. This parametrization is emulated using an ensemble of NNs. An ensemble of NNs with different NN parameters has been trained and tested. The inherent uncertainty of the stochastic convection parametrization derived in such a way is estimated. Due to these inherent uncertainties, NN ensemble is used to constitute a stochastic NN convection parametrization. The developed NN convection parametrization have been validated in a diagnostic CAM (CAM-NN) run vs. the control CAM run. Actually, CAM inputs have been used, at every time step of the control/original CAM integration, for parallel calculations of the NN convection parametrization (CAM-NN) to produce its outputs as a diagnostic byproduct. Total precipitation (P) and cloudiness (CLD) time series, diurnal cycles, and P and CLD distributions for the large Tropical Pacific Ocean for the parallel CAM-NN and CAM runs show similarity and consistency with the NCEP reanalysis. The P and CLD distributions for the tropical area for the parallel runs have been analyzed first for the TOGA-COARE boreal winter season (November 1992 through February 1993) and then for the winter seasons of the follow-up parallel decadal simulations. The obtained results are encouraging and practically meaningful. They show the validity of the NN approach. This constitutes an important practical conclusion of the study: the obtained results on NN ensembles as a stochastic physics parametrization show a realistic possibility of development of NN convection parametrization for climate (and NWP) models based on learning cloud physics from CRM/SAM simulated data.

97 MATHEMATICS AND COMPUTING↗

Porting Adaptive Ensemble Molecular Dynamics Workflows to the Summit Supercomputer

Molecular dynamics (MD) simulations must take very small (femtosecond) integration steps in simulation-time to avoid numerical errors. Efficient use of parallel programming models and accelerators in state-of-the art MD programs now is pushing Moore’s limit for time-per-MD step. As a result, directly simulating timescales beyond milliseconds will not be attainable directly, even at exascale. However, concepts from statistical physics can be used to combine many parallel simulations to provide information about longer timescales and to adequately sample the simulation space, while preserving details about the dynamics of the system. Implementing such an approach requires a workflow program that allows adaptable steering of task assignments based on extensive statistical analysis of intermediate results. Here we report the implementation of such an adaptable workflow program to drive simulations on the Summit IBM Power System AC922, a pre-exascale supercomputer at the Oak Ridge Leadership Computing Facility (OLCF). We compare to experiences on Titan, Summit’s predecessor, report the performance of the workflow and its components, and describe the porting process. We find that using a workflow program managed by a Mongo database can provide the fault tolerance, scalable performance, task dispatch rate, and reconfigurability required for robust and portable implementation of ensemble simulations such as are used in enhanced-sampling molecular dynamics. This type of workflow generator can also be used to provide adaptive steering of ensemble simulations for other applications in addition to MD.

Ossyra, John R.↗

Towards the clinical implementation of iterative low-dose cone-beam CT reconstruction in image-guided radiation therapy: Cone/ring artifact correction and multiple GPU implementation

Purpose: Compressed sensing (CS)-based iterative reconstruction (IR) techniques are able to reconstruct cone-beam CT (CBCT) images from undersampled noisy data, allowing for imaging dose reduction. However, there are a few practical concerns preventing the clinical implementation of these techniques. On the image quality side, data truncation along the superior–inferior direction under the cone-beam geometry produces severe cone artifacts in the reconstructed images. Ring artifacts are also seen in the half-fan scan mode. On the reconstruction efficiency side, the long computation time hinders clinical use in image-guided radiation therapy (IGRT). Methods: Image quality improvement methods are proposed to mitigate the cone and ring image artifacts in IR. The basic idea is to use weighting factors in the IR data fidelity term to improve projection data consistency with the reconstructed volume. In order to improve the computational efficiency, a multiple graphics processing units (GPUs)-based CS-IR system was developed. The parallelization scheme, detailed analyses of computation time at each step, their relationship with image resolution, and the acceleration factors were studied. The whole system was evaluated in various phantom and patient cases. Results: Ring artifacts can be mitigated by properly designing a weighting factor as a function of the spatial location on the detector. As for the cone artifact, without applying a correction method, it contaminated 13 out of 80 slices in a head-neck case (full-fan). Contamination was even more severe in a pelvis case under half-fan mode, where 36 out of 80 slices were affected, leading to poorer soft tissue delineation and reduced superior–inferior coverage. The proposed method effectively corrects those contaminated slices with mean intensity differences compared to FDK results decreasing from ∼497 and ∼293 HU to ∼39 and ∼27 HU for the full-fan and half-fan cases, respectively. In terms of efficiency boost, an overall 3.1 × speedup factor has been achieved with four GPU cards compared to a single GPU-based reconstruction. The total computation time is ∼30 s for typical clinical cases. Conclusions: The authors have developed a low-dose CBCT IR system for IGRT. By incorporating data consistency-based weighting factors in the IR model, cone/ring artifacts can be mitigated. A boost in computational efficiency is achieved by multi-GPU implementation.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Enabling Parallel Performance and Portability of Solid Mechanics Simulations Across CPU and GPU Architectures

Efficiently simulating solid mechanics is vital across various engineering applications. As constitutive models grow more complex and simulations scale up in size, harnessing the capabilities of modern computer architectures has become essential for achieving timely results. This paper presents advancements in running parallel simulations of solid mechanics on multi-core CPUs and GPUs using a single-code implementation. This portability is made possible by the C++ matrix and array (MATAR) library, which interfaces with the C++ Kokkos library, enabling the selection of fine-grained parallelism backends (e.g., CUDA, HIP, OpenMP, pthreads, etc.) at compile time. MATAR simplifies the transition from Fortran to C++ and Kokkos, making it easier to modernize legacy solid mechanics codes. We applied this approach to modernize a suite of constitutive models and to demonstrate substantial performance improvements across different computer architectures. This paper includes comparative performance studies using multi-core CPUs along with AMD and NVIDIA GPUs. Results are presented using a hypoelastic–plastic model, a crystal plasticity model, and the viscoplastic self-consistent generalized material model (VPSC-GMM). The results underscore the potential of using the MATAR library and modern computer architectures to accelerate solid mechanics simulations.

Morgan, Nathaniel (ORCID:0000000276118449)↗

Suppression of multiphoton intrashell resonances in Li Rydberg atoms

Multiphoton intrashell transitions in strongly driven Li (n=25) Rydberg atoms are studied experimentally. Orthogonal dc electric and magnetic fields lift the degeneracy of the n shell and define the eccentricity e of the initial coherent elliptic states, which are formed by laser excitation and subsequent adiabatic transformation. The intrashell transitions are driven by a time-harmonic electric field linearly polarized parallel to the major axis of the ellipse. N-photon resonances with N=1-9 are studied as a function of e. All resonances with N{>=}3 are suppressed at certain e values in between 0 and 1. A similar system was analyzed by Yabuzaki et al. [Phys. Rev. A 10, 1955 (1974)] who found a simple pattern of suppressions that applies also for the present experiments. The results of these experimentally confirm that each time N is increased by two, an additional suppression is observed.

74 ATOMIC AND MOLECULAR PHYSICS↗

A Lyapunov Function Based Remedial Action Screening Tool Using Real-Time Data

This report summarizes the outcome of a research project that comprised the development of a Lyapunov function based remedial action screening tool using real-time data (L-RAS). The L-RAS is an advanced computational tool that is intended to assist system operators in making real-time redispatch decisions to preserve power grid stability. The tool relies on screening contingencies using a homotopy method based on Lyapunov functions to avoid, to the extent possible, the use of time domain simulations. This enables transient stability evaluation at real-time speed without the use of massively parallel computational resources. The project combined the following components. 1. Development of a methodology for contingency screening using a homotopy method based on Lyapunov functions and real-time data. 2. Development of a methodology for recommending remedial actions based on the screening results. 3. Development of a visualization and operator interaction interface. 4. Testing of screening tool, validation of control actions, and demonstration of project outcomes on a representative real system simulated on a Real-Time Digital Simulator (RTDS) cluster. The project was led by Michigan State University (MSU), where the theoretical models including homotopy-based screening, trajectory correction using real-time data, and remedial action were developed and implemented in the form of research-grade software. Los Alamos National Laboratory (LANL) contributed to the development of energy margin sensitivity dynamics, which constituted a part of the remedial action portfolio. Florida State University (FSU) and Southern California Edison (SCE) developed a model of the SCE system that was implemented on FSU's RTDS cluster to simulate real-time data that was streamed over the internet to MSU where the L-RAS tool was executed and remedial actions were communicated back to FSU to execute stabilizing controls on the simulated system. LCG Consulting developed the visualization and operator interaction interface, based on specifications provided by MSU. The project was performed from October 2012 to December 2016, at the end of which the L-RAS tool, as described above, was completed and demonstrated. The project resulted in the following innovations and contributions: (a) the L-RAS software prototype, tested on a simulated system, vetted by utility personnel, and potentially ready for wider testing and commercialization; (b) an RTDS-based test bed that can be used for future research in the field; (c) a suite of breakthrough theoretical contributions to the field of power system stability and control; and (d) a new tool for visualization of power system stability margins. While detailed descriptions of the development and implementation of the various project components have been provided in the quarterly reports, this final report provides an overview of the complete project, and is demonstrated using public domain test systems commonly used in the literature. The SCE system, and demonstrations thereon, are not included in this report due to Critical Energy Infrastructure Information (CEII) restrictions.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Mitigating Cascading Outages in Severe Weather Using Simulation-Based Optimization

Severe weather events can trigger cascading power outages and lead to significant losses. In this work, we investigate cascading outage mitigation under severe weather conditions. Given day-ahead weather forecasts and component failure models, we aim to identify a set of power lines that can be hardened to minimize the expected impact of potential cascading outages. Since the expected load shedding cannot be expressed as an explicit function of line hardening decisions and system states, we developed a cascading outage simulator to estimate the expected value of load shedding under various initial weather-related disruption scenarios generated using a weather forecast. To avoid massive enumeration of all possible combinations of line hardening decisions and reduce the simulation efforts, we employed an efficient simulation-based optimization approach that quickly identifies the (near) optimal line hardening decisions in the presence of both large simulation noises due to the highly variable initial disturbances and system states, and significant randomness in the subsequent cascades. Furthermore, the algorithm is also able to utilize parallel computing to dramatically reduce computation time to support decision making in preparation for severe weather conditions. We performed a case study on the Northeast Power Coordinating Council (NPCC) 140-bus system model to demonstrate that our approach can significantly improve power grid resilience to adverse weather events.

24 POWER TRANSMISSION AND DISTRIBUTION↗