Search NASA⌕ Search

SEARCH · Search NASA

Results for “Computational Load Balancing”

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 379 records · Page 21

Quantum Monte Carlo Endstation for Petascale Computing

NCSU research group has been focused on accomplising the key goals of this initiative: establishing new generation of quantum Monte Carlo (QMC) computational tools as a part of Endstation petaflop initiative for use at the DOE ORNL computational facilities and for use by computational electronic structure community at large; carrying out high accuracy quantum Monte Carlo demonstration projects in application of these tools to the forefront electronic structure problems in molecular and solid systems; expanding the impact of QMC methods and approaches; explaining and enhancing the impact of these advanced computational approaches. In particular, we have developed quantum Monte Carlo code (QWalk, www.qwalk.org) which was significantly expanded and optimized using funds from this support and at present became an actively used tool in the petascale regime by ORNL researchers and beyond. These developments have been built upon efforts undertaken by the PI's group and collaborators over the period of the last decade. The code was optimized and tested extensively on a number of parallel architectures including petaflop ORNL Jaguar machine. We have developed and redesigned a number of code modules such as evaluation of wave functions and orbitals, calculations of pfaffians and introduction of backflow coordinates together with overall organization of the code and random walker distribution over multicore architectures. We have addressed several bottlenecks such as load balancing and verified efficiency and accuracy of the calculations with the other groups of the Endstation team. The QWalk package contains about 50,000 lines of high quality object-oriented C++ and includes also interfaces to data files from other conventional electronic structure codes such as Gamess, Gaussian, Crystal and others. This grant supported PI for one month during summers, a full-time postdoc and partially three graduate students over the period of the grant duration, it has resulted in 13 published papers, 15 invited talks and lectures nationally and internationally. My former graduate student and postdoc Dr. Michal Bajdich, who was supported byt this grant, is currently a postdoc with ORNL in the group of Dr. F. Reboredo and Dr. P. Kent and is using the developed tools in a number of DOE projects. The QWalk package has become a truly important research tool used by the electronic structure community and has attracted several new developers in other research groups. Our tools use several types of correlated wavefunction approaches, variational, diffusion and reptation methods, large-scale optimization methods for wavefunctions and enables to calculate energy differences such as cohesion, electronic gaps, but also densities and other properties, using multiple runs one can obtain equations of state for given structures and beyond. Our codes use efficient numerical and Monte Carlo strategies (high accuracy numerical orbitals, multi-reference wave functions, highly accurate correlation factors, pairing orbitals, force biased and correlated sampling Monte Carlo), are robustly parallelized and enable to run on tens of thousands cores very efficiently. Our demonstration applications were focused on the challenging research problems in several fields of materials science such as transition metal solids. We note that our study of FeO solid was the first QMC calculation of transition metal oxides at high pressures.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

MPI-Bash: Parallel scripting right from the Bourne-Again Shell (Bash)

Parallel, scientific applications running on massively parallel supercomputers commonly produce large numbers of large data files. While parallel filesystems improve the performance of file generation, postprocessing activities such as archiving and compressing the data are often run sequentially (and therefore slowly), squandering the supercomputer's vast performance. Consequently, data that take hours to generate may take days to postprocess. Writing and debugging parallel postprocessing programs is often too time-consuming to be worthwhile, especially for one-off postprocessing operations. What the community needs is a simple mechanism for cobbling together scripts that distribute postprocessing work across a supercomputer's many nodes. MPI-Bash attempts to supply that mechanism by augmenting the GNU project's command shell, Bash, with support for the Message Passing Interface (MPI) and, if available, the Libcircle library for work distribution and load balancing. MPI-Bash makes it easy to parallelize bash scripts that run a set of Linux commands independently over a large number of input files. Because MPI-Bash includes various MPI functions for data transfer and synchronization, it is not limited to embarrassingly parallel workloads but can incorporate phased operations (i.e., all workers must finish operation X before any worker is allowed to begin operation Y).

97 MATHEMATICS AND COMPUTING↗

A Micromorphic Length-Scale Coupling Framework for the Determination of Higher-Order Constitutive Models and the Multi-Scale Simulation of Heterogeneous Materials [Thesis]

Heterogeneous materials and materials with complex microstructures pose a unique challenge in the development of accurate models of their response to external stimuli. These difficulties principally arise due to the difficulty in characterizing and modeling the constituents and their interactions. It is usually possible, though non-trivial, to construct an explicit representation of the microstructure (a direct numeric simulation or DNS) but the method by which the complex modes of deformation and other processes can be homogenized to a reduced-order approximation is frequently unclear. Many homogenization approaches are ad-hoc and lack a strong justification beyond ease of computation. Furthermore, the homogenization approach can, in some cases, not utilize the full breadth of information available in the computation of the macro-scale stresses and deformation measures. It is also noteworthy that homogenization, by its very nature, will tend to obfuscate details of processes occurring at the lower length-scale. It is therefore of interest to include as much information as possible in the construction of the reduced-order model so as to be predictive in a variety of loading environments. We here present a length-scale bridging technique based upon the micromorphic continuum mechanics of Eringen which incorporates volume and surface area averages as a part of its construction. This approach enforces the balance equations at the micro-scale and then studies the effect of the spatially varying nature on the macro-scale. This leads, naturally, to further balance equations which are solved at the macro-scale. This work details a homogenization framework which arises naturally from the micromorphic construction of Eringen attempting to introduce no definitions beyond which are justifiable from micro-structural considerations. One of the results of this effort is the so-called “micromorphic filter” which has been developed and applied to several DNS to demonstrate its effectively. In order to determine the macroscopic degrees of freedom we utilize the special case of an overlap coupling technique where the macro-scale is fully constrained to the micro-scale. This enables us to study the resulting material properties as expected but also allows us to further study the boundary conditions on the additional degrees of freedom at the macro-scale.

42 ENGINEERING↗

Domain decomposition in the GPU-accelerated Shift Monte Carlo code

The GPU solver within the Shift continuous-energy Monte Carlo neutron transport code has been extended to provide domain decomposition in addition to domain replication to enable the solution of problems with memory requirements exceeding the capacity of a single GPU. The strategy follows the Multiple Set, Overlapping Domain (MSOD) approach that is used in Shift’s CPU solver and integrates into the event-based algorithm used for Shift’s GPU solver. Furthermore, the ability to assign processors to spatial domains non-uniformly has been maintained. In this work, two different approaches for communicating particle data between domains are considered, and multiple criteria for load balancing problems have been investigated. Numerical results are presented for both fresh and depleted small modular nuclear reactor (SMR) cores. A parallel efficiency of approximately 80% was achieved with up to 16 spatial domains measured relative to full domain replication. A scaling study on the Summit supercomputer demonstrates a weak scaling parallel efficiency of over 90% on over 24000 GPUs.

97 MATHEMATICS AND COMPUTING↗

DOE Hanford Network Upgrades and Disaster Recovery Exercise Support the Cleanup Mission Now and into the Future

In 2013, the U.S. Department of Energy's (DOE) Hanford Site, located in Washington State, funded an update to the critical network infrastructure supporting the Hanford Federal Cloud (HFC). The project, called ET-50, was the final step in a plan that was initiated five years ago called "Hanford's IT Vision, 2015 and Beyond." The ET-50 project upgraded Hanford's core data center switches and routers along with a majority of the distribution layer switches. The upgrades allowed HFC the network intelligence to provide Hanford with a more reliable and resilient network architecture. The culmination of the five year plan improved network intelligence and high performance computing as well as helped to provide 10 Gbps capable links between core backbone devices (10 times the previous bandwidth). These improvements allow Hanford the ability to further support bandwidth intense applications, such as video teleconferencing. The ET-50 switch upgrade, along with other upgrades implemented from the five year plan, have prepared Hanford's network for the next evolution of technology in voice, video, and data. Hand-in-hand with ET-50's major data center outage, Mission Support Alliance's (MSA) Information Management (IM) organization executed a disaster recovery (DR) exercise to perform a true integration test and capability study. The DR scope was planned within the constraints of ET-50's 14 hour datacenter outage window. This DR exercise tested Hanford's Continuity of Operations (COOP) capability and failover plans for safety and business critical Hanford Federal Cloud applications. The planned suite of services to be tested was identified prior to the outage and plans were prepared to test the services ability to failover from the primary Hanford data center to the backup data center. The services tested were: Core Network (backbone, firewall, load balancers); Voicemail; Voice over IP (VoIP); Emergency Notification; Virtual desktops; and, Select set of production applications and data. The primary objective of the exercise was to test COOP around the emergency operations at Hanford to provide information on capabilities and dependencies of the current system to insure improved focus of emergency, safety and security capacity in a disaster situation. The integration of the DR test into the ET-50 project allowed the testing of COOP at Hanford and allowed the lessons learned to be defined. These lessons learned have helped improve the understanding of Hanford's COOP capabilities and will be critical for future planning. With the completion of the Hanford Federal Cloud network upgrades and the disaster recovery exercise, the MSA has a clearer path forward for future technology implementations as well as network improvements to help shape the usability and reliability of the Hanford network in support of the cleanup mission.

97 MATHEMATICS AND COMPUTING↗

DC 12m telescope. Preliminary calculations. Investigation of elevation axis position.

This paper examines some simple calculations of a 2D model of a telescope in order to understand how different design parameters affect the design. For the design of a telescope it is assumed that they need a design that minimizes deflections of the dish and also minimizes the size of the motors and torques needed to rotate in elevation. A common belief is that a lighter dish and minimum counterweight is desirable. However, these calculations show this is not necessarily true. The torque needed for rotation depends on the moment of inertia and if the telescope is balanced about the elevation axis. A light dish with no CW requires that the elevation axis be several meters in front of the dish (8-9m) in order to be balanced. This is not practical from a structural point of view. If the elevation axis is only 2m in front of the dish and there is no counterweight then the telescope will be unbalanced and the toruqes required will be very high - much higher than the torques needed only to overcome inertia. A heavy dish though can act as its own counterweight and the elevation axis only has to be 2-3m in front of the dish in order to achieve a balanced telescope. Also the struts that support the camera from the dish place a load on the dish which will put a bending moment on the dish. This bending moment will deform the dish and require it to be stiffer. A counterweight structure performs two functions. First, it allows the telescope to be balanced about the elevation axis. Second, it applies a force on the dish that opposes the forces from the camera struts, thereby reducing the bending moment and deformations of the dish.

47 OTHER INSTRUMENTATION↗

FPDeep: Scalable Acceleration of CNN Training on Deeply-Pipelined FPGA Clusters

In this paper, we propose a framework called FPDeep, which uses a hybrid of model and layer paral- lelism to configure distributed reconfigurable clusters to train DNNs. This approach has numerous benefits. First, the design does not suffer from batch size growth. Second, novel workload and weight partitioning leads to balanced loads of both among nodes. And third, the entire system is fine-grained pipeline. This leads to high parallelism and utilization and also minimizes the time features need to be cached while waiting for back-propagation.

Wang, Tianqi↗

Modeling Smart Microgrids for the Developing World with Probabilistic Supply and Demand Inputs

Developing world microgrids often balance insufficient supply with growing, unpredictable demand. Deterministic and probabilistic simulators exist to model these microgrids, and each focuses on different technical aspects. With the addition of smart meters into microgrids, monitoring and control is now available at high granularity, which enriches microgrid planning and operation. This research is designing a new simulator to model smart microgrids with discrete probability distributions as supply and demand inputs. In our model, smart meters allow real-time power clipping for demand side management, effectively smoothing the system load curve as needed. To compare clipping schemes for grid operation and generation mixes for planning, we aggregate inputs by convolution then compute expected energy sold and probability of avoiding power cuts. The simulator plots these values for different combinations of power clipping threshold and number of customers clipped.

13 HYDRO ENERGY↗

ECP Milestone Deliverable Memo 2.3.1.04.15

The DARMA many-task framework provides asynchronous communication and load balancing functionality. This functionality is embedded in standard , modern C++ through the use of the template wrapper classes similar to futures. DARMA codes previously could not interoperate with MPI. A new C++ interface and extended semantics now allow quiescence of DARMA kernels and transfer of data ownership back into MPI, allowing 1) isolated DARMA kernels to be inserted in a larger MPI code or 2) reuse of MPI libraries like solvers within a DARMA application.

97 MATHEMATICS AND COMPUTING↗

TBAA20: Task-Based Algorithms and Applications

The new challenges posed by Exascale system architectures have resulted in difficulty achieving a desired scalability using traditional distributed ­memory runtimes. Task­-based programming models show promise in addressing these challenges, providing application developers with a productive and performant approach to programming on next generation systems. Empirical studies show that task-based models can overcome load ­balancing issues that are inherent to traditional distributed ­memory runtimes, and that task-­based runtimes perform comparably to those systems when balanced. This panel is designed to explore the advantages of task-­based programming models on modern and future HPC systems from an industry, university, and national lab perspective. It aims at gathering application experts and proponents of these models to present concrete and practical examples of using task­-based runtimes to overcome the challenges posed by Exascale system architectures. This report describes the objectives, activities, and outcomes of the panel TBAA: Task­-Based Algorithms and Applications which was held at the International Conference for High Performance Computing, Networking, Storage, and Analysis (SC 20) on November 18, 2020.

97 MATHEMATICS AND COMPUTING↗

PC-RPL: Joint Control of Routing Topology and Transmission Power in Real Low-Power and Lossy Networks

We present PC-RPL , a transmission power-controlled IPv6 routing protocol for low-power and lossy wireless networks that significantly improves the end-to-end packet delivery performance under heavy traffic compared to the standard RPL. We show through actual design, implementation, and experiments that a multihop wireless network can achieve better throughput and routing stability when transmission power and routing topology are “jointly and adaptively” controlled. Our experiments show that the predominant “fixed and uniform” transmission power strategy with “link quality and hop distance”–based routing topology construction (i.e., RPL) loses significant bandwidth due to hidden terminal and load imbalance problems. We design an adaptive and distributed control mechanism for transmission power and routing topology, named PC-RPL , on top of the standard RPL routing protocol for hidden terminal mitigation and load balancing. We implement PC-RPL on real embedded devices and evaluate its performance on a 49-node multihop testbed. PC-RPL reduces total end-to-end packet losses by approximately sevenfold without increasing hop distance compared to RPL with the highest transmission power, resulting in 17% improvement in aggregate bandwidth and 64% improvement for the worst-case node by successfully alleviating both hidden terminal and load imbalance problems.

Computer Science↗

Data Locality Enhancement of Dynamic Simulations for Exascale Computing (Final Report)

The development of modern processors exhibits two trends that complicate the optimizations of modern software. The first is the increasing sensitivity of processors' throughput to irregularities in computation. With more processors produced through a massive integration of simple cores, future systems will increasingly favor regular data-level parallel computations, but deviate from the needs of applications with complex patterns. Some evidences are already shown on Graphic Processing Units (GPU): Irregular data accesses (e.g., indirect references A[D[i]]) and conditional branches are limiting many GPU applications' performance at a level an order of magnitude lower than the peak of GPU. The second hardware trend is the growing gap between memory bandwidth and the aggregate speed—that is, the sum of all cores' computing power—of a Chip Multiprocessor (CMP). Despite the capped growth of the peak CPU speed, the aggregate speed of a CMP keeps increasing as more cores get into a single chip. It is expected that by 2018, node concurrency in an exascale system will increase by hundreds of times, whereas, memory bandwidth will expand by only 10 to 20 times. Consequently, data movement and storage is expected to consume more than 70% of the total system power. Bridging this gap is difficult; the complexities of modern CMP memory hierarchy make it even harder: Data cache becomes shared among computing units, and the sharing is often non-uniform—whether two computing units share a cache depends on their proximity and the level of the cache. On the recent IBM Power7 architecture, for instance, four hardware contexts (or SMT threads) in a core share the entire memory hierarchy, all cores in one chip share an on-chip L3 cache, and cores across chips share L3 and main memory through off-chip connections. These two trends complicate the translation of computing power into performance, especially for a program with either intensive data accesses or complex patterns in data accesses or control flow paths. Unfortunately, both attributes present and will persist in a class of important applications. For instance, many scientific simulations deal with a large volume of data. And meanwhile, as most real-world processes are non-uniform and evolving (e.g., the evolution of a galaxy or the process of a drug injection), both the computations and data accesses of these programs tend to be irregular and dynamically changing. Currently, the lack of support to these applications on modern CMP severely limits their performance. On GPU, as our recent study shows and other studies echo, performance enhancement of a factor of integers is possible when memory accesses or control flows are streamlined for a set of GPU applications. On multicore CPU, our studies show that traditional locality enhancement, for being oblivious to the new features of multicore memory hierarchy, may even cause large slowdown to data-intensive dynamic applications. The severity of the issues is expected to worsen as the two hardware trends continue. Some recent studies try to match software with the trends, but in a limited scope or manner. For irregularities on GPU, most studies focus on irregularities analyzable through static analysis (e.g., data accesses in regular loops). Dynamic irregularities are harder to address because the needed analysis and transformations typically have to happen at run time. Some other research resorts to hardware extensions, an actual adoption of which is unclear for the entailed space cost and complexity. For data locality, recent years have seen some exploitations of the new memory hierarchy on multicore for performance, but most of them are on process or thread scheduling, rather than program transformations. Our recent study reveals that program-level transformations may magnify the scheduling benefits by a factor of seven, concluding that program-level transformation should play a central role for data locality enhancement on modern CMP. But research in this direction has been sparse, and most have focused on data layout or cache performance modeling, rather than program transformations to match with the new memory hierarchy features. Overall, it is still an open question how to bridge the gap between dynamic computations and the two prominent properties of modern processors. The goal of this project is to develop a set of techniques and software tools to enhance the matching between memory accesses in dynamic simulations and the prominent features of modern and future CMP, alleviating the memory performance issues for petascale and exascale computing. This report summarizes the discoveries and products produced throughout this project. It includes free launch, a new software approach to overcoming the shortcomings of both methods; coherence-free multiview, an approach that allows multiple views of a single data object to co-exist on GPU memory during a GPU kernel execution; algorithmic optimizations to data analytics problems, especially those that involve lots of distance calculations. Supporting dynamic parallelism is important for GPU to benefit a broad range of applications. There are currently two fundamental ways for programs to exploit dynamic parallelism on GPU: a software-based approach with software-managed worklists, and a hardware-based approach through dynamic subkernel launches. Neither is satisfactory. The former is complicated to program and is often subject to some load imbalance; the latter suffers large runtime overhead. In this work, we propose free launch, a new software approach to overcoming the shortcomings of both methods. It allows programmers to use subkernel launches to express dynamic parallelism. It employs a novel compiler-based code transformation named subkernel launch removal to replace the subkernel launches with the reuse of parent threads. Coupled with an adaptive task assignment mechanism, the transformation reassigns the tasks in the subkernels to the parent threads with a good load balance. The technique requires no hardware extensions, immediately deployable on existing GPUs. It keeps the programming convenience of the subkernel launch-based approach while avoiding its large runtime overhead. Meanwhile, its superior load balancing makes it outperform manual worklist-based techniques by 3X on average. The work was published at the 48th Annual IEEE/ACM International Symposium on Microarchitecture (Micro'2015). A Graphic Processing Unit (GPU) system is typically equipped with many types of memory (e.g., global, constant, texture, shared, cache). Data placement determines what data are placed on which type of memory, essential for GPU memory performance. Prior optimizations of data placement always require a single view of a data object on memory, which limits the optimization effectiveness. In this work, we propose coherence-free multiview, an approach that allows multiple views of a single data object to co-exist on GPU memory during a GPU kernel execution. We demonstrate that under certain conditions, the multiple views can remain incoherent while facilitating enhanced data placement. We present a theorem and some compiler support to ensure the soundness of the usage of coherence-free multiview. We further develop reference-discerning data placement, a new way to enhance data placements on GPU. It enables more flexible data placements by using coherence-free multiview to leverage the slack in coherence requirement of some GPU programs. Experiments on three types of GPU systems show that, with less than 200KB space cost, the new data placement technique can provide a 1.6X average (up to 4.27X) speedup. In addition, we have examined algorithmic optimizations to data analytics problems, especially those that involve lots of distance calculations. Computing distances among data points is an essential part of many important algorithms in data analytics, graph analysis, and other domains. In each of these domains, developers have spent significant manual effort optimizing algorithms, often through novel applications of the triangle equality, in order to minimize the number of distance computations in the algorithms. In this work, we observe that many algorithms across these domains can be generalized as an instance of a generic distance-related abstraction. Based on this abstraction, we derive seven principles for correctly applying the triangular inequality to optimize distance-related algorithms. Guided by the findings, we develop Triangular OPtimizer (TOP), the first software framework that is able to automatically produce optimized algorithms that either matches or outperforms manually designed algorithms for solving distance-related problems. TOP achieves up to 237x speedups and 2.5X on average. The work has been published at the 32nd International Conference on Machine Learning (ICML'15) and the 41st International Conference on Very Large Data Bases (VLDB'15).

42 ENGINEERING↗

Advanced Cell-Level Control for Extending Electric Vehicle Battery Pack Lifetime

A cell-level control approach for electric vehicle battery packs is presented that enhances traditional battery balancing goals to not only provide cell balancing but also achieve significant pack lifetime extension. These goals are achieved by applying a new life-prognostic based control algorithm that biases individual cells differently based on their state of charge, capacity and internal resistance. The proposed life control approach reduces growth in capacity mismatch typically seen in large battery packs over life while optimizing usable energy of the pack. The result is a longer lifetime of the overall pack and a more homogeneous distribution of cell capacities at the end of the first life for vehicle applications. Active cell balancing circuits and associated algorithms are used to accomplish the cell-level life extension objectives. This paper presents details of the cell-level control approach, selection and design of the active balancing system, and low-complexity state-of-charge, capacity, and series-resistance estimation algorithms. A laboratory prototype is used to demonstrate the proposed control approach. The prototype consists of twenty-one 25 Ah Panasonic lithium-Ion NMC battery cells from a commercial electric vehicle and an integrated BMS/DC-DC system that provides 750 W to the vehicle low voltage auxiliary loads.

25 ENERGY STORAGE↗

Inter-phase heat transfer and energy coupling in turbulent dispersed multiphase flows

Here, the present paper addresses important fundamental issues of inter-phase heat transfer and energy coupling in turbulent dispersed multiphase flows through scaling analysis. In typical point-particle or two-fluid approaches, the fluid motion and convective heat transfer at the particle scale are not resolved and the momentum and energy coupling between fluid and particles are provided by proper closure models. By examining the kinetic energy transfer due to the coupling forces from the macroscale to microscale fluid motion, closure models are obtained for the contributions of the coupling forces to the energy coupling. Due to the inviscid origin of the added-mass force, its contribution to the microscale kinetic energy does not contribute to dissipative transfer to fluid internal energy as was done by the quasi-steady force. Time scale analysis shows that when the particle is larger than a critical diameter, the diffusive-unsteady kernel decays at a time scale that is smaller than the Kolmogorov time scale. As a result, the computationally costly Basset-like integral form of diffusive-unsteady heat transfer can be simplified to a non-integral form. Conventionally, the fluid-to-particle volumetric heat capacity ratio is used to evaluate the relative importance of the unsteady heat transfer to the energy balance of the particles. Therefore, for gas-particle flows, where the fluid-to-particle volumetric heat capacity ratio is small, unsteady heat transfer is usually ignored. However, the present scaling analysis shows that for small fluid-to-particle volumetric heat capacity ratio, the importance of the unsteady heat transfer actually depends on the ratio between the particle size and the Kolmogorov scale. Furthermore, the particle mass loading multiplied by the heat capacity ratio is usually used to estimate the importance of the thermal two-way coupling effect. Through scaling argument, improved estimates are established for the energy coupling parameters of each energy exchange mechanism between the phases.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Real-Time Dispatch With Secondary Frequency Regulation: A Pathway to Consider Intra-Interval Fluctuations

Real-time dispatch balances the power demand with minimized operating costs. For the current dispatch model, the demand is assumed to be constant within a time interval, while the intra-interval power balance is left to frequency regulation. Based on practical experience and simulations, this behavior may lead to insufficient frequency regulation and uneconomic regulation costs considering the increase in intra-interval fluctuations caused by renewables. Here, a real-time dispatch method with secondary frequency regulation behaviors is proposed. Without changing the interval of the real-time dispatch command, the system regulation mileage and intra-interval generation adjustment are explicitly formulated in a mixed-integer optimization model. To reduce the computational burden, an efficient two-stage calculation method is proposed. With practical utility data, this article finds that the proposed method can effectively improve the system frequency performance with the subminute net load forecasting curve obtained by an off-the-shelf forecasting approach. Time-domain simulations in IEEE and practical utility systems validate the effectiveness of the proposed method in terms of the frequency performance and total operating costs.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Three-phase Four-leg Inverter LabVIEW FPGA Control Code [SWR-16-26]

In the area of power electronics control, Field Programmable Gate Arrays (FPGAs) have the capability to outperform their Digital Signal Processor (DSP) counterparts due to the FPGA’s ability to implement true parallel processing and therefore facilitate higher switching frequencies, higher control bandwidth, and/or enhanced functionality. National Instruments (NI) has developed two platforms, Compact RIO (cRIO) and Single Board RIO (sbRIO), which combine a real-time processor with an FPGA. The FPGA can be programmed with a subset of the well-known LabVIEW graphical programming language. The use of cRIO and sbRIO for power electronics control has developed over the last few years to include control of three-phase inverters. Most three-phase inverter topologies include three switching legs. The addition of a fourth-leg to natively generate the neutral connection allows the inverter to serve single-phase loads in a microgrid or stand-alone power system and to balance the three-phase voltages in the presence of significant load imbalance. However, the control of a four-leg inverter is much more complex. In particular, instead of standard two-dimensional space vector modulation (SVM), the inverter requires three-dimensional space vector modulation (3D-SVM). The candidate software implements complete control algorithms in LabVIEW FPGA for a three-phase four-leg inverter. The software includes feedback control loops, three-dimensional space vector modulation gate-drive algorithms, advanced alarm handling capabilities, contactor control, power measurements, and debugging and tuning tools. The feedback control loops allow inverter operation in AC voltage control, AC current control, or DC bus voltage control modes based on external mode selection by a user or supervisory controller. The software includes the ability to synchronize its AC output to the grid or other voltage-source before connection. The software also includes provisions to allow inverter operation in parallel with other voltage regulating devices on the AC or DC buses. This flexibility allows the Inverter to operate as a stand-alone voltage source, connected to the grid, or in parallel with other controllable voltage sources as part of a microgrid or remote power system. In addition, as the inverter is expected to operate under severe unbalanced conditions, the software includes algorithms to accurately compute real and reactive power for each phase based on definitions provided in the IEEE Standard 1459: IEEE Standard Definitions for the Measurement of Electric Power Quantities Under Sinusoidal, Nonsinusoidal, Balanced, or Unbalanced Conditions. Finally, the software includes code to output analog signals for debugging and for tuning of control loops. The software fits on the Xilinx Virtex V LX110 FPGA embedded in the NI cRIO-9118 FPGA chassis, and with a 40 MHz base clock, supports a modulation update rate of 40 MHz, user-settable switching frequencies and synchronized control loop update rates of tens of kHz, and reference waveform generation, including Phase Lock Loop (PLL), update rate of 100 kHz.

Martin, Gregory↗

Packaging strategies for printed circuit board components. Volume I, materials & thermal stresses.

Decisions on material selections for electronics packaging can be quite complicated by the need to balance the criteria to withstand severe impacts yet survive deep thermal cycles intact. Many times, material choices are based on historical precedence perhaps ignorant of whether those initial choices were carefully investigated or whether the requirements on the new component match those of previous units. The goal of this program focuses on developing both increased intuition for generic packaging guidelines and computational methodologies for optimizing packaging in specific components. Initial efforts centered on characterization of classes of materials common to packaging strategies and computational analyses of stresses generated during thermal cycling to identify strengths and weaknesses of various material choices. Future studies will analyze the same example problems incorporating the effects of curing stresses as needed and analyzing dynamic loadings to compare trends with the quasi-static conclusions.

36 MATERIALS SCIENCE↗

Flexible Spatial Partitions in MPACT Through Module-Based Data Passing

As part of the Consortium for Advanced Simulation of Light Water Reactors (CASL), the Virtual Environment for Reactor Applications (VERA) is being developed to provide high-fidelity multiphysics simulations of nuclear reactor cores. The MPACT code being developed collaboratively by Oak Ridge National Laboratory and the University of Michigan is the primary deterministic neutron transport solver available within VERA. MPACT employs the 2D/1D method to solve 3D problems using 2D method of characteristics (MOC) radial transport solvers with 1D nodal expansion method-based P3 (NEM-P3) axial transport solvers, which are coupled using axial and radial transverse leakages. A 3D coarse mesh finite difference (CMFD) solver is used to provide accelerated convergence and stability. Quarter-core problems in MPACT are typically run on moderately sized clusters ({approx}500-10,000 cores). As such, it relies heavily on spatial decomposition, both radially and axially, using MPI data communication along spatial domain boundaries to pass angular flux boundary condition and neighboring data. The initial spatial decomposition strategy implemented into MPACT overlaid a Cartesian grid over the core to form the domain boundaries. With this approach, a single buffer spanning across the entire boundary between two spatial domains is passed to a domain's neighbor. Additionally, only one neighboring domain index was allowed in each direction. For example, the entire eastern boundary of a domain must be the entire western boundary of the corresponding neighbour's domain. This implementation helped to execute cases on several thousand cores, where substantial radial decomposition was used. The default for several years was to use assembly decomposition, which yielded 73 radial partitions in the Watts Bar Unit 1 (WBN1) models being analyzed. However, as CASL formed stronger connections with industry partners, there was a strong push to allow MPACT to run on fewer cores, preferably in the 500-1,000 core range. Such cases require much less radial decomposition, typically with 8-16 radial domains on each plane. Unfortunately, the previous decomposition strategy is very limited in its ability to yield well-balanced domains, and it does not permit partitions with an arbitrary number of domains, particularly with small numbers of radial domains (3, 5, 7, 11, 13, etc.). With these limitations, a more flexible approach that provided more even-load balancing was needed. The details of this new strategy are outlined here, along with insights to its advantages. The examples provided are for the WBN1 core, which has been the focus of several initial CASL analyses. It is worth noting that spatial decomposition strategies have been employed in many codes with focus on a number of different transport methodologies. The references cited are not exhaustive as this has been very important research topic across many areas.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗