Search NASA⌕ Search

SEARCH · Search NASA

Results for “Parallel optimization”

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 829 records · Page 46

Collaborating CPU and GPU for large-scale high-order CFD simulations with complex grids on the TianHe-1A supercomputer

Programming and optimizing complex, real-world CFD codes on current many-core accelerated HPC systems is very challenging, especially when collaborating CPUs and accelerators to fully tap the potential of heterogeneous systems. In this paper, with a tri-level hybrid and heterogeneous programming model using MPI + OpenMP + CUDA, we port and optimize our high-order multi-block structured CFD software HOSTA on the GPU-accelerated TianHe-1A supercomputer. HOSTA adopts two self-developed high-order compact definite difference schemes WCNS and HDCS that can simulate flows with complex geometries. We present a dual-level parallelization scheme for efficient multi-block computation on GPUs and perform particular kernel optimizations for high-order CFD schemes. The GPU-only approach achieves a speedup of about 1.3 when comparing one Tesla M2050 GPU with two Xeon X5670 CPUs. To achieve a greater speedup, we collaborate CPU and GPU for HOSTA instead of using a naive GPU-only approach. We present a novel scheme to balance the loads between the store-poor GPU and the store-rich CPU. Taking CPU and GPU load balance into account, we improve the maximum simulation problem size per TianHe-1A node for HOSTA by 2.3×, meanwhile the collaborative approach can improve the performance by around 45% compared to the GPU-only approach. Further, to scale HOSTA on TianHe-1A, we propose a gather/scatter optimization to minimize PCI-e data transfer times for ghost and singularity data of 3D grid blocks, and overlap the collaborative computation and communication as far as possible using some advanced CUDA and MPI features. Scalability tests show that HOSTA can achieve a parallel efficiency of above 60% on 1024 TianHe-1A nodes. With our method, we have successfully simulated an EET high-lift airfoil configuration containing 800M cells and China's large civil airplane configuration containing 150M cells. To our best knowledge, those are the largest-scale CPU–GPU collaborative simulations that solve realistic CFD problems with both complex configurations and high-order schemes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Towards Native Execution of Deep Learning on a Leadership-Class HPC System

Large parallel machines generally offer the best parallel performance with "native execution" that is achieved using codes developed with the optimized compilers, communication libraries, and runtimes offered on the machines. In this paper, we report and analyze performance results from native execution of deep learning on a leadership-class high-performance computing (HPC) system. Using our new code called DeepEx, we present a study of the parallel speed up and convergence rates of learning achieved with native parallel execution. In the trade-off between computational parallelism and synchronized convergence, we first focus on maximizing parallelism while still obtaining convergence. Scaling results are reported from execution on up to 15,000 GPUs using two scientific data sets from atom microscopy and protein folding applications, and also using the popular ImageNet data set. In terms of the traditional measure of parallel speed up, excellent scaling is observed up to 12,000 GPUs. Additionally, accounting for convergence rates of deep learning accuracy or error, a deep learning-specific metric called "learning speed up" is also tracked. The performance results indicate the need to evaluate parallel deep learning execution in terms of learning speed up, and point to additional directions for improved exploitation of high-end HPC systems.

Yoginath, Srikanth↗

SWAP-Assembler 2: Optimization of De Novo Genome Assembler at Large Scale

In this paper, we analyze and optimize the most time-consuming steps of the SWAP-Assembler, a parallel genome assembler, so that it can scale to a large number of cores for huge genomes with the size of sequencing data ranging from terabyes to petabytes. According to the performance analysis results, the most time-consuming steps are input parallelization, k-mer graph construction, and graph simplification (edge merging). For the input parallelization, the input data is divided into virtual fragments with nearly equal size, and the start position and end position of each fragment are automatically separated at the beginning of the reads. In k-mer graph construction, in order to improve the communication efficiency, the message size is kept constant between any two processes by proportionally increasing the number of nucleotides to the number of processes in the input parallelization step for each round. The memory usage is also decreased because only a small part of the input data is processed in each round. With graph simplification, the communication protocol reduces the number of communication loops from four to two loops and decreases the idle communication time. The optimized assembler is denoted as SWAP-Assembler 2 (SWAP2). In our experiments using a 1000 Genomes project dataset of 4 terabytes (the largest dataset ever used for assembling) on the supercomputer Mira, the results show that SWAP2 scales to 131,072 cores with an efficiency of 40%. We also compared our work with both the HipMER assembler and the SWAP-Assembler. On the Yanhuang dataset of 300 gigabytes, SWAP2 shows a 3X speedup and 4X better scalability compared with the HipMer assembler and is 45 times faster than the SWAP-Assembler. The SWAP2 software is available at https://sourceforge.net/projects/swapassembler.

Meng, Jintao↗

Optimizing Grain Boundary Structures with LAMMPS Using Evolutionary Algorithms

Grain boundary structure optimization is an important part of materials modeling. Current methods for grain boundary structure optimization involve inefficient, time-consuming processes that do not fully explore the interface parameter space. Evolutionary algorithms have recently been demonstrated to be effective at determining both stable and metastable grain boundary interface structures. In this work, we demonstrate the use of GBOpt, a grain boundary structure optimization software designed to use the Large-scale Atomic/Molecular Massively Parallel Simulation (LAMMPS) software to efficiently determine grain boundary structures. We demonstrate that a only a few manipulations, namely atom insertion, atom removal, and relative grain displacement, are sufficient to explore much of the grain boundary structure parameter space. The efficacy of this approach is demonstrated on an FCC Ni system, and a BCC Fe system. The computational cost is compared against the gamma-surface sampling approach to demonstrate performance improvement.

Evolutionary algorithms↗

Integrated Sensing and Controls for Coal Gasification - Development of Model-Based Controls for GE's Gasifier and Syngas Cooler (Final Technical Report)

This report summarizes the achievements and final results of this program. The objective of this program is to develop a comprehensive systems approach to integrated design of sensing and control systems for an Integrated Gasification Combined Cycle (IGCC) plant, using advanced model-based techniques. In particular, this program is focused on the model-based sensing and control system design for the core gasification section of an IGCC plant. The overall approach consists of (i) developing a first-principles physics-based dynamic model of the gasification section, (ii) performing model-reduction where needed to derive low-order models suitable for controls analysis and design, (iii) developing a sensing system solution combining online sensors with model-based estimation for important process variables not measured directly, and (iv) optimizing the steady-state and transient operation of the plant for normal operation as well as for startup using model predictive controls (MPC). Initially, available process unit models were implemented in a common platform using Matlab/Simulink{reg_sign}, and appropriate model reduction and model updates were performed to obtain the overall gasification section dynamic model. Also, a set of sensor packages were developed through extensive lab testing and implemented in the Tampa Electric Company IGCC plant at Polk power station in 2009, to measure temperature and strain in the radiant syngas cooler (RSC). Plant operation data was also used to validate the overall gasification section model. The overall dynamic model was then used to develop a sensing solution including a set of online sensors coupled with model-based estimation using nonlinear extended Kalman filter (EKF). Its performance in terms of estimating key unmeasured variables like gasifier temperature, carbon conversion, etc., was studied through extensive simulations in the presence sensing errors (noise and bias) and modeling errors (e.g. unknown gasifier kinetics, RSC fouling). In parallel, an MPC solution was initially developed using ideal sensing to optimize the plant operation during startup pre-heating as well as steady state and transient operation under normal high-pressure conditions, e.g. part-load, base-load, load transition and fuel changes. The MPC simulation studies showed significant improvements both for startup pre-heating and for normal operation. Finally, the EKF and MPC solutions were coupled to achieve the integrated sensing and control solution and its performance was studied through extensive steady state and transient simulations in the presence of sensor and modeling errors. The results of each task in the program and overall conclusions are summarized in this final report.

01 COAL, LIGNITE, AND PEAT↗

Optimization of Collimator Trajectory in Volumetric Modulated Arc Therapy: Development and Evaluation for Paraspinal SBRT

Purpose: To develop a collimator trajectory optimization paradigm for volumetric modulated arc therapy (VMAT) and evaluate this technique in paraspinal stereotactic body radiation therapy (SBRT). Method and Materials: We propose a novel VMAT paradigm, Coll-VMAT, which integrates collimator rotation with synchronized gantry rotation, multileaf collimator (MLC) motion, and dose-rate modulation. At each gantry angle a principal component analysis (PCA) is applied to calculate the primary cord orientation. The collimator angle is then aligned so that MLC travel is parallel to the PCA-derived direction. An in-house VMAT optimization follows the geometry-based collimator trajectory optimization to obtain the optimal MLC position and monitor units (MU) at each gantry angle. A treatment planning study of five paraspinal SBRT patients compared Coll-VMAT to standard VMAT (fixed collimator angle) and static field IMRT plans. Plan evaluation statistics included planning target volume (PTV) V95%, PTV-D95%, cord-D05%, and total beam-on time. Results: Variation of collimator angle in Coll-VMAT plans ranges from 26 deg. to 54 deg., with a median of 40 deg. Patient-averaged PTV V95% (94.6% Coll-VMAT vs. 92.1% VMAT and 93.3% IMRT) and D95% (22.5 Gy vs. 21.4 Gy and 22.0 Gy, respectively) are highest with Coll-VMAT, and cord D05% (9.8 Gy vs. 10.0 Gy and 11.7 Gy) is lowest. Total beam-on time with Coll-VMAT (5,164 MU) is comparable to standard VMAT (4,868 MU) and substantially lower than IMRT (13,283 MU). Conclusion: Collimator trajectory optimization-based VMAT provides an additional degree of freedom that can improve target coverage and cord sparing of paraspinal SBRT plans compared with standard VMAT and IMRT approaches.

07 ISOTOPE AND RADIATION SOURCES↗

Optimal control system design of an acid gas removal unit for an IGCC power plants with CO2 capture

Future IGCC plants with CO{sub 2} capture should be operated optimally in the face of disturbances without violating operational and environmental constraints. To achieve this goal, a systematic approach is taken in this work to design the control system of a selective, dual-stage Selexol-based acid gas removal (AGR) unit for a commercial-scale integrated gasification combined cycle (IGCC) power plant with pre-combustion CO{sub 2} capture. The control system design is performed in two stages with the objective of minimizing the auxiliary power while satisfying operational and environmental constraints in the presence of measured and unmeasured disturbances. In the first stage of the control system design, a top-down analysis is used to analyze degrees of freedom, define an operational objective, identify important disturbances and operational/environmental constraints, and select the control variables. With the degrees of freedom, the process is optimized with relation to the operational objective at nominal operation as well as under the disturbances identified. Operational and environmental constraints active at all operations are chosen as control variables. From the results of the optimization studies, self-optimizing control variables are identified for further examination. Several methods are explored in this work for the selection of these self-optimizing control variables. Modifications made to the existing methods will be discussed in this presentation. Due to the very large number of candidate sets available for control variables and due to the complexity of the underlying optimization problem, solution of this problem is computationally expensive. For reducing the computation time, parallel computing is performed using the Distributed Computing Server (DCS®) and the Parallel Computing® toolbox from Mathworks®. The second stage is a bottom-up design of the control layers used for the operation of the process. First, the regulatory control layer is designed followed by the supervisory control layer. Finally, an optimization layer is designed. In this paper, the proposed two-stage control system design approach is applied to the AGR unit for an IGCC power plant with CO{sub 2} capture. Aspen Plus Dynamics® is used to develop the dynamic AGR process model while MATLAB is used to perform the control system design and for implementation of model predictive control (MPC).

97 MATHEMATICS AND COMPUTING↗

Non-Intrusive Parallel-in-Time Solvers for Partial Differential Equations (Final Report)

Many time-dependent problems and simulations are often modeled using Partial Differential Equations. Traditional modeling approaches that use sequential time-stepping are reaching a bottleneck in optimizing efficiency. The Center of Applied Science and Computing at Lawrence Livermore National Laboratory extensively works on parallelizing these algorithms to leverage the increasing computational power from the growing number of processors in computer hardware. In particular, they aim to design non-intrusive algorithms that can generalize to a variety of problems and sizes without requiring additional information from or modifications on the original problems. Multigrid Reduction in Time (MGRIT) is a parallel-in-time algorithm that is designed to be non-intrusive. This project focuses on increasing the efficiency of MGRIT by approximating the coarse-grid operator using machine learning approaches as a means to find the most non-intrusive, or general, solution.

97 MATHEMATICS AND COMPUTING↗

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↗

Optimization of the hop-byte metric for effective topology aware mapping

Suitable mapping of processes to the nodes of a massively parallel machine can substantially improve communication performance by reducing network congestion. The hop-byte metric has been used as a measure of the quality of such a mapping by several recent works. Optimizing this metric is NP hard, and thus heuristics are applied. However, the heuristics proposed so far do not directly try to optimize this metric. Rather, they use some intuitive methods for reducing congestion and use the metric just to evaluate the quality of the mapping. In fact, heuristics intending to optimize other metrics too don't directly optimize for them, but, rather, use the metric to evaluate the results of the heuristic. In contrast, we pose the mapping problem with the hop-byte metric as a quadratic assignment problem and use a heuristic to directly optimize for this metric. We evaluate our approach on realistic node allocations obtained on the Kraken system at NICS. Our approach yields values for the metric that are up to 75% lower than the default mapping and 66 % lower than existing heuristics. However, the time taken to produce the mapping can be substantially more, which makes this suitable for somewhat static, though possibly irregular, communication patterns. We introduce new heuristics that reduce the time taken to be comparable to that of existing fast heuristics, while still producing mappings of higher quality than existing ones. We also use theoretical lower bounds to suggest that our mapping may be close to optimal, at least for medium sized problems. Consequently, our work can also provide insight into the tradeoff between mapping quality and time taken by other mapping heuristics.

Sudheer, C. D.↗

An Optimizing Compiler for Petascale I/O on Leadership Class Architectures

In high-performance computing systems, parallel I/O architectures usually have very complex hierarchies with multiple layers that collectively constitute an I/O stack, including high-level I/O libraries such as PnetCDF and HDF5, I/O middleware such as MPI-IO, and parallel file systems such as PVFS and Lustre. Our project explored automated instrumentation and compiler support for I/O intensive applications. Our project made significant progress towards understanding the complex I/O hierarchies of high-performance storage systems (including storage caches, HDDs, and SSDs), and designing and implementing state-of-the-art compiler/runtime system technology that targets I/O intensive HPC applications that target leadership class machine. This final report summarizes the major achievements of the project and also points out promising future directions.

97 MATHEMATICS AND COMPUTING↗

Evaluation of fuel cycle scenarios on MOX fuel recycling in PWRs and SFRs

Prospects on advanced fuel cycle scenario are considered for achieving a progressive integration of Sodium Fast Reactor (SFR) technology within the current French Pressurized Water Reactor (PWR) nuclear fleet, in a view to benefit from fissile material multi-recycling capability. A step by step process is envisioned, and emphasis is put on its potential implementation through the nuclear mass inventory calculations with the COSAC code. The overall time scale is not optimized. The first step, already implemented in several countries, the plutonium coming from the reprocessing of used Light Water Reactor (LWR) fuels is recycled into a small number of LWRs. The second step is the progressive introduction of the first SFRs, in parallel with the continuation of step 1. This second step lets to prepare the optimized multi recycling of MOX fuel which is considered in step 3. Step 3 is characterized by the introduction of a greater number of SFR and MOX management between EPR reactors and SFRs. In the final step 4, all the fleet is formed with SFRs. This study assesses the viability of each step of the overall scenario. The switch from one step to the other one could result from different constrains related to issues such as resources, waste, experience feedback, public acceptance, country policy, etc.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

High-Order Spectral Volume Method for the Navier-Stokes Equations On Unstructured Tetrahedral Grids (Final Report)

The overriding objective for this project is to develop an efficient and accurate method for capturing strong discontinuities and fine smooth flow structures of disparate length scales with unstructured grids, and demonstrate its potentials for problems relevant to DOE. More specifically, we plan to achieve the following objectives: 1. Extend the SV method to three dimensions, and develop a fourth-order accurate SV scheme for tetrahedral grids. Optimize the SV partition by minimizing a form of the Lebesgue constant. Verify the order of accuracy using the scalar conservation laws with an analytical solution; 2. Extend the SV method to Navier-Stokes equations for the simulation of viscous flow problems. Two promising approaches to compute the viscous fluxes will be tested and analyzed; 3. Parallelize the 3D viscous SV flow solver using domain decomposition and message passing. Optimize the cache performance of the flow solver by designing data structures minimizing data access times; 4. Demonstrate the SV method with a wide range of flow problems including both discontinuities and complex smooth structures. The objectives remain the same as those outlines in the original proposal. We anticipate no technical obstacles in meeting these objectives.

97 MATHEMATICS AND COMPUTING↗

Characterization of a Pixelated Cadmium Telluride Detector System Using a Polychromatic X-Ray Source and Gold Nanoparticle-Loaded Phantoms for Benchtop X-Ray Fluorescence Imaging

In this paper, the imaging dose and scan time have been considered as the two major constraints for routine benchtop x-ray fluorescence computed tomography (XFCT) imaging. One way to address this issue is to acquire x-ray fluorescence (XRF) signals in parallel through a 2D array of single-crystal detectors or a pixelated detector along with the cone-beam x-ray source. To identify a detector system suitable for this purpose, a commercially available, fully spectroscopic cadmium telluride (CdTe) pixelated detector, HEXITEC (High-Energy X-ray Imaging Technology), was tested under the experimental conditions optimized for benchtop XFCT imaging of gold nanoparticles (GNPs). Specifically, two different parallel-hole stainless steel collimators were fabricated and coupled with the detector for seamless integration into our existing benchtop cone-beam XFCT system. After the detector deployment, this benchtop XFCT system was used to detect XRF photons from GNP-loaded phantoms. A pixel-merging algorithm was introduced to enhance the sensitivity of XRF photon detection thereby minimizing the scan time. The effect of pixel-level charge sharing correction algorithms was investigated within the context of benchtop XFCT imaging. The detector energy resolution, in terms of the full width at half maximum (FWHM) values at different gold K-shell XRF energies, was also determined. Of the two charge sharing correction algorithms examined, the charge sharing addition gave better sensitivity than the charge sharing discrimination (csd). On the other hand, under the current experimental conditions, the energy resolution of the HEXITEC detector was the best with the csd and estimated to be 1.56 keV FWHM at 66-69 keV photon energy. Overall, despite some degradation of the detector energy resolution (compared with typical single crystal CdTe detectors), the HEXITEC detector enabled parallel data acquisition under the experimental conditions typical of benchtop XFCT imaging and operated well within our benchtop XFCT setup.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Implementation and optimization of the PTOLEMY transverse drift electromagnetic filter

The PTOLEMY transverse drift filter is a new concept to enable precision analysis of the energy spectrum of electrons near the tritium β-decay endpoint. Here, we detail the implementation and optimization methods for successful operation of the filter for electrons with a known pitch angle. We present the first demonstrator that produces the required magnetic field properties with an iron return-flux magnet. Two methods for the setting of filter electrode voltages are detailed. The challenges of low-energy electron transport in cases of low field are discussed, such as the growth of the cyclotron radius with decreasing magnetic field, which puts a ceiling on filter performance relative to fixed filter dimensions. Additionally, low pitch angle trajectories are dominated by motion parallel to the magnetic field lines and introduce non-adiabatic conditions and curvature drift. To minimize these effects and maximize electron acceptance into the filter, we present a three-potential-well design to simultaneously drain the parallel and transverse kinetic energies throughout the length of the filter. These optimizations are shown, in simulation, to achieve low-energy electron transport from a 1 T iron core (or 3 T superconducting) starting field with initial kinetic energy of 18.6 keV drained to < 10 eV (< 1 eV) in about 80 cm. This result for low field operation paves the way for the first demonstrator of the PTOLEMY spectrometer for measurement of electrons near the tritium endpoint to be constructed at the Gran Sasso National Laboratory (LNGS) in Italy.

47 OTHER INSTRUMENTATION↗

Scalable Triadic Analysis of Large-Scale Graphs: Multi-Core vs. Multi-Processor vs. Multi-Threaded Shared Memory Architectures

Triadic analysis encompasses a useful set of graph mining methods that is centered on the concept of a triad, which is a subgraph of three nodes and the configuration of directed edges across the nodes. Such methods are often applied in the social sciences as well as many other diverse fields. Triadic methods commonly operate on a triad census that counts the number of triads of every possible edge configuration in a graph. Like other graph algorithms, triadic census algorithms do not scale well when graphs reach tens of millions to billions of nodes. To enable the triadic analysis of large-scale graphs, we developed and optimized a triad census algorithm to efficiently execute on shared memory architectures. We will retrace the development and evolution of a parallel triad census algorithm. Over the course of several versions, we continually adapted the code’s data structures and program logic to expose more opportunities to exploit parallelism on shared memory that would translate into improved computational performance. We will recall the critical steps and modifications that occurred during code development and optimization. Furthermore, we will compare the performances of triad census algorithm versions on three specific systems: Cray XMT, HP Superdome, and AMD multi-core NUMA machine. These three systems have shared memory architectures but with markedly different hardware capabilities to manage parallelism.

Triadic analysis, triads, triad census, large-scal↗

Multigrid Reduction in Time for Chaotic and Hyperbolic Problems (Final Report)

The coming massive parallelism of exascale computing presents a pressing challenge for the many DOE simulations of time-dependent partial differential equations (PDEs), which typically use traditional sequential time stepping methods. Since this traditional approach is inherently serial, it presents a sequential bottleneck when moving to exascale computing, because future performance gains will come through greater concurrency, not faster clock speeds. Thus, the goal of this work is to research parallelism in time, i.e., methods that compute multiple time values simultaneously, not sequentially. The focus will be on hyperbolic and chaotic problems of interest to DOE, with the goal of enabling scalable simulations of time-dependent hyperbolic and chaotic problems on future architectures. The chosen methodology for solving these problems parallel-in-time is multigrid, because multigrid (when it works) is a powerful, optimal, and scalable solver for discretized PDEs. Multigrid is already commonly used in many DOE simulations for scalably and optimally solving space-only PDE problems. The areas of hyperbolic and chaotic problems are chosen because of their relevance to problems of programmatic interest to DOE. However, these problems are also well-known to be difficult for parallelin-time methods, with the most common method, parareal, diverging in many cases. The current state-of-the-art for parallel-in-time at LLNL is the multigrid reduction in time (MGRIT) XBraid package, which also struggles for such problems, while still showing some improvement over parareal. In summary, new methods are needed for an efficient parallel-in-time scheme for hyperbolic and chaotic problems, and this work shall research promising new multigrid methods in this area. In particular, this work shall continue researching the directions from the current collaboration with Dr. Falgout, which are laid out in the work Toward Parallel in Time for Chaotic Dynamical Systems and showed the first known results of a parallel-in-time speedup for a chaotic problem. This work outlines two key improvements to XBraid for chaotic problems, the so-called “theta” and “delta-correction” methods. Here, these two improvements will be implemented in a high-performance but general way in XBraid and explored for more complicated problems. We will additionally research, as time allows, improvements to these techniques, as well as multigrid relaxation techniques based on Least Squares Shadowing (LSS by Wang) and a nonintrusive block tridiagonal solver based on MGRIT, called TriMGRIT.

97 MATHEMATICS AND COMPUTING↗

A New Configuration of Paralleled Modular ANPC Multilevel Converter Controlled by an Improved Modulation Method for 1 MHz, 1 MW EV Charger

In this work, a new configuration of the modular multilevel converter (MLC) based on the parallel connection of three-level active-neutral-point-clamped (3L-ANPC) cells as well as its improved modulation method is proposed for 1 MHz, 1 MW electric vehicle (EV) megacharger. In the proposed paralleled modular ANPC-MLC, only six high-frequency silicon carbide (SiC) power switches operating at 333 kHz are required to generate 1 MHz switching frequency spectrum. Moreover, the operating voltage of all power devices is halved, the magnitude of the first switching frequency harmonic cluster is decreased by the factor of five, and the load current is equally distributed between the 3L-ANPC legs by employing the proposed improved modulation method. Hence, the modularity, efficiency, and power density of the proposed converter are notably increased, whereas the value of passive components and the overall switching loss are remarkably decreased. In addition, an optimized design of the one 3L-ANPC cell of the proposed paralleled modular ANPC-MLC for 1 MHz, 1MW EV megacharger using Ansys SIwave, Icepak, and Q3D finite element method platforms is presented and analyzed in detail. The provided experimental results of the down-scaled setup verify the feasibility and viability of the proposed configuration as well as its improved switching pattern.

42 ENGINEERING↗