Search NASA⌕ Search

SEARCH · Search NASA

Results for “Resource allocation”

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 811 records · Page 45

FORCE Update 2024

The Framework for Optimization of Resources and Economics (FORCE) tool suite is the U.S. Department of Energy’s Nuclear Integrated Energy Systems (IES) Program flagship tool suite for technoeconomic IES analysis of IES. This tool suite is useful for analysis designed to evaluate and improve the technoeconomics of energy production systems, particularly for systems including nuclear technology. In this report, we document the development activity for the FORCE tool suite to extend its capabilities as performed during fiscal year 2024. In addition to reliability and accessibility, capability is one of the three standards guiding the development of the FORCE tool suite and the software codes that are its constituent parts. Extending the capabilities of the FORCE tool suite allows analysis both within the IES program as well as industry, university, and laboratory partners to perform analysis with more accuracy, insight, and impactful narrative. Four areas of capability development were the focus of activity this year: economic parameter uncertainty quantification, multiresolution analysis, components-to-optimization workflow automation, and statespace construction workflows for real-time optimal control. In economic parameter uncertainty quantification, the ability of HERON to capture risk due to scenarios (weather and energy demand uncertainty) was expanded to also include uncertainties in financial parameters such as capital cost or operation and maintenance costs. By including these sources of uncertainty, which are sometimes very large compared with scenario uncertainty, HERON is better able to capture the risk posed by investment in various IES technology. Because of this, analysts can also consider the reduction in risks that can be realized by choice of some technologies. In multiresolution analysis, development activity extended on work completed previously. In fiscal year 2023, methods for decomposing time series signals, such as demand, solar and wind availability, and price profiles, were analyzed and down-selected to those most effective at splitting signals into different resolutions. These resolutions allow considering the influence of different energy demand and supply behaviors across different time scales. For example, energy demand might be divided into seasonal, weekly, and hourly profiles. In fiscal year 2024, this preliminary work was extended and implemented within the Risk Analysis Virtual Environment (RAVEN) risk and uncertainty analysis platform, which is used throughout the FORCE framework. This development of the “multi-resolution time series analysis” (MR-TSA) module in RAVEN allows training synthetic history generators on complex time series. These synthetic history generators can then be used in HERON for generating scenarios that represent possible market and weather scenarios that can be analyzed on different time scales. We envision completing this work in the future, implementing multiresolution dispatch optimization strategies that can make the most beneficial use of these stratified time histories. In components-to-optimization workflow development, workflows for translating user inputs of components into algorithms for algebraic optimization were selected and implemented. Similar algorithms within the Holistic Energy Resource Optimization Network (HERON) were separated from the main code base of HERON and gathered with the components-to-optimization workflows in the new Dispatch Optimization Variable Engine (DOVE) software library. This modularization allows FORCE users to analyze dispatch optimization and energy system duty cycles independently of HERON, which previously was a burdensome task. Additionally, these dispatch optimization algorithms, set up in an independent library, can now be used across all software applications within FORCE, especially including the real-time optimal control software Optimization of Real-time Capacity Allocation (ORCA). Allowing FORCE software to share dispatch optimization algorithms within a single library allows for improved software maintenance and reliability. In statespace characterization workflow development, alternative workflows for optimizing dispatch with additional technical accuracy was the focus, particularly to improve the real-time optimization decision making in ORCA. Using algorithms and workflows initially developed for the Feasible Actuator Range Modifier (FARM), workflows for determining the statespace representation of IES were identified and demonstrated. The resulting dispatch optimization required a more robust optimization algorithm than that originally used in HERON (and moved to DOVE), which required adding an alternate workflow to DOVE that can more accurately match the behavior of physical systems using a partial differential equation representation. In conclusion, capability developments in the FORCE tool suite in fiscal year 2024 have improved the ability of the FORCE tool suite to perform

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Review of Enabling Technologies to Facilitate Secure Compute Customization

High performance computing environments are often used for a wide variety of workloads ranging from simulation, data transformation and analysis, and complex workflows to name just a few. These systems may process data for a variety of users, often requiring strong separation between job allocations. There are many challenges to establishing these secure enclaves within the shared infrastructure of high-performance computing (HPC) environments. The isolation mechanisms in the system software are the basic building blocks for enabling secure compute enclaves. There are a variety of approaches and the focus of this report is to review the different virtualization technologies that facilitate the creation of secure compute enclaves. The report reviews current operating system (OS) protection mechanisms and modern virtualization technologies to better understand the performance/isolation properties. We also examine the feasibility of running ``virtualized'' computing resources as non-privileged users, and providing controlled administrative permissions for standard users running within a virtualized context. Our examination includes technologies such as Linux containers (LXC [32], Docker [15]) and full virtualization (KVM [26], Xen [5]). We categorize these different approaches to virtualization into two broad groups: OS-level virtualization and system-level virtualization. The OS-level virtualization uses containers to allow a single OS kernel to be partitioned to create Virtual Environments (VE), e.g., LXC. The resources within the host's kernel are only virtualized in the sense of separate namespaces. In contrast, system-level virtualization uses hypervisors to manage multiple OS kernels and virtualize the physical resources (hardware) to create Virtual Machines (VM), e.g., Xen, KVM. This terminology of VE and VM, detailed in Section 2, is used throughout the report to distinguish between the two different approaches to providing virtualized execution environments. As part of our technology review we analyzed several current virtualization solutions to assess their vulnerabilities. This included a review of common vulnerabilities and exposures (CVEs) for Xen, KVM, LXC and Docker to gauge their susceptibility to different attacks. The complete details are provided in Section 5 on page 33. Based on this review we concluded that system-level virtualization solutions have many more vulnerabilities than OS level virtualization solutions. As such, security mechanisms like sVirt (Section 3.3) should be considered when using system-level virtualization solutions in order to protect the host against exploits. The majority of vulnerabilities related to KVM, LXC, and Docker are in specific regions of the system. Therefore, future "zero day attacks" are likely to be in the same regions, which suggests that protecting these areas can simplify the protection of the host and maintain the isolation between users. The evaluations of virtualization technologies done thus far are discussed in Section 4. This includes experiments with 'user' namespaces in VEs, which provides the ability to isolate user privileges and allow a user to run with different UIDs within the container while mapping them to non-privileged UIDs in the host. We have identified Linux namespaces as a promising mechanism to isolate shared resources, while maintaining good performance. In Section 4.1 we describe our tests with LXC as a non-root user and leveraging namespaces to control UID/GID mappings and support controlled sharing of parallel file-systems. We highlight several of these namespace capabilities in Section 6.2.3. The other evaluations that were performed during this initial phase of work provide baseline performance data for comparing VEs and VMs to purely native execution. In Section 4.2 we performed tests using the High-Performance Computing Conjugate Gradient (HPCCG) benchmark to establish baseline performance for a scientific application when run on the Native (host) machine in contrast with execution under Docker and KVM. Our tests verified prior studies showing roughly 2-4% overheads in application execution time & MFlops when running in hypervisor-base environments (VMs) as compared to near native performance with VEs. For more details, see Figures 4.5 (page 28), 4.6 (page 28), and 4.7 (page 29). Additionally, in Section 4.3 we include network measurements for TCP bandwidth performance over the 10GigE interface in our testbed. The Native and Docker based tests achieved >= ~9Gbits/sec, while the KVM configuration only achieved 2.5Gbits/sec (Table 4.6 on page 32). This may be a configuration issue with our KVM installation, and is a point for further testing as we refine the network settings in the testbed. The initial network tests were done using a bridged networking configuration. The report outline is as follows: - Section 1 introduces the report and clarifies the scope of the proj...

Aderholdt, Ferrol↗

Multi-layered Energy Management Framework for Extreme Fast Charging Stations Considering Demand Charges, Battery Degradation, and Forecast Uncertainties

To achieve a cost-effective and expeditious charging experience for extreme fast charging station (XFCS) owners and electric vehicle (EV) users, the optimal operation of XFCS is crucial. It is however challenging to simultaneously manage the profit from energy arbitrage, the cost of demand charges, and the degradation of a battery energy storage system (BESS) under uncertainties. This paper, therefore, proposes a multi-layered multi-time scale energy flow management framework for an XFCS by considering long- and short-term forecast uncertainties, monthly demand charges reduction, and BESS life degradation. In the proposed approach, an upper scheduling layer (USL) ensures the overall operation economy and yields optimal scheduling of the energy resources on a rolling horizon basis, thereby considering the long-term forecast errors. A lower dispatch layer (LDL) takes the short-term forecast errors into account during the real-time operation of the XFCS. Per the latest research, monthly demand charges can be as high as 90% of the total monthly bills for EV fast charging stations; to this end, this paper takes the first attempt at the reduction of demand charges cost by considering the trade-off between the energy cost and monthly demand charges. Contrasting literature, this work allocates an energy reserve in the BESS stored energy to deal with the impact of short-term forecast errors on the optimized real-time operation of the XFCS. Moreover, degradation modeling considers the trade-off between short-term benefits and long-term BESS life degradation. As a result, case studies and a comparative analysis prove the efficacy of the proposed framework.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A Measurement-Based Adaptive Voltage Regulation Method Considering Topology Changes

This paper proposes an online adaptive data-driven distributed energy resource (DER) dispatch optimization method for voltage control considering topology changes. By using a local sensitivity factor (LSF)-enabled voltage control, traditional DER control can be reformulated into a linear programming (LP) problem, leading to faster computation speeds. Power injection alteration and topology changes are two common operational changes in the distribution network that can affect the LSF and voltage control performance. To address this issue, a robust estimation method is developed to adjust the sensitivity matrix at each time step for the time-varying power injection changes. When topology changes occur, only the allocated predominant LSF submatrices are updated based on measurement data, allowing for a fast adaptation to the system reconfiguration. Results obtained from a real distribution feeder in Southern California demonstrate its robustness as compared to traditional volt-var control and constant LSF matrix dispatch control methods.

DERs↗

Task 12 Sustainability - Methodological Guidelines on Net Energy Analysis of Photovoltaic Electricity (2nd Edition)

Net Energy Analysis (NEA) is a structured, comprehensive method of quantifying the extent to which a given energy source is able to provide a net energy gain (i.e., an energy surplus) to the end user, after accounting for all the energy losses occurring along the chain of processes that are required to exploit it (i.e., for its extraction, processing and transformation into a usable energy carrier, and delivery to the end user), as well as for all the additional energy 'investments' that are required in order to carry out the same chain of processes. However, this general framework leaves the individual practitioner with a range of choices that can affect the results and thus, the conclusions of a NEA study. The current IEA PVPS guidelines were developed to provide guidance on assuring consistency, balance, and quality to enhance the credibility and reliability of the results from photovoltaic (PV) NEAs. The guidelines represent a consensus among the authors - PV NEA experts in North America and Europe - for assumptions made on PV performance, process inputs and outputs, methods of analysis, and reporting of the results. Guidance is given on photovoltaic-specific parameters used as inputs in NEA and on choices and assumptions in inventory data analysis and on implementation of modelling approaches. A consistent approach towards system modelling, the functional unit, the system boundaries and allocation aspects enhance the credibility of PV electricity NEA studies and enables balanced NEA-based comparisons. Specifically, "apples-to-oranges" comparisons of different energy carriers (e.g., fuels vs. electricity) are not methodologically sound and are to be avoided in all cases; also, any comparison across renewable and non-renewable electricity generation technologies must clearly point out the intrinsically short-term nature of the NEA viewpoint, which does not capture the long-term sustainability implications of renewable vs. non-renewable primary energy harvesting and use: non-renewable primary energy resources are depleted and finally exhausted (irrespective of the size of the EROI), while renewable primary energy resources are not. This document provides an in-depth discussion of a common metric of NEA, namely the energy return on investment (EROI), and how this is to be interpreted vis-a-vis the deceptively similar-sounding metrics in the field of Life Cycle Assessment (LCA): cumulative energy demand (CED) and non-renewable cumulative energy demand (nr-CED) per unit output. Specifically, a number of key differences are highlighted between these metrics as applied to electricity production systems, which are listed in Table S-1.

14 SOLAR ENERGY↗

Experimental investigation of flow distribution in enhanced geothermal systems with deep eutectic solvent

Geothermal energy has been recognized as a valuable alternative to fossil fuels and nuclear power, as it is renewable and reliable. Enhanced Geothermal Systems (EGSs) have the potential to expand geothermal energy production by enabling access to previously untapped geothermal resources. Geothermal short-circuiting poses a significant challenge to EGS development, leading to reduced heat extraction. Deep Eutectic Solvent (DES) exhibits favorable thermal and rheological properties, making it a candidate for geothermal applications. Here, this paper examines Choline Chloride-Based Deep Eutectic Solvent (DES) as a working fluid in geothermal applications and its potential to mitigate geothermal short-circuiting. Hydraulic experiments using a dual fracture flow loop were conducted at high temperatures. The results showed that DES exhibited higher differential pressure behavior compared to water. Flow distribution results revealed that DES enhances flow allocation within the small fracture, particularly when a temperature difference exists between fractures. Specifically, DES increased flow distribution by an average of 11% when the temperature difference was 85°C, and by 13% when the difference was 45°C, relative to water. These findings suggest that DES responds to thermal fracture differences, making it a potential remedy to address geothermal short-circuiting.

15 GEOTHERMAL ENERGY↗

Modulation of lignin and anthocyanin homeostasis by GTP cyclohydrolase1 in maize

Summary Maize is a key biomass resource with wide agricultural applications. Anthocyanins, potent antioxidants, offer health benefits like reducing oxidative stress. The biosynthesis of anthocyanins competes with that of lignin for shared metabolic precursors, which can lead to trade‐offs in plant growth and feed quality. Higher lignin content can decrease silage digestibility, posing challenges for livestock feed. The maizebrown midrib 6(bm6) mutant, known for reduced lignin, has an unclear genetic basis. Here, we identifyZmGCH1as the candidate gene forbm6through fine mapping. Mutations inZmGCH1shift precursors from lignin to anthocyanin biosynthesis. Furthermore, we show that ZmGCH1 interacts with ZmPEBP15 to modulate chalcone synthase activity, thereby stabilizing the allocation of precursors between lignin and anthocyanin pathways. To evaluate the practical implications of our findings, we introduced thebm6mutation into Zhengdan958 and Xianyu335. In vitro rumen digestion assays confirmed that the introduction of thebm6mutation significantly improved silage digestibility. This discovery not only holds great potential for enhancing silage digestibility but also provides a broader strategy for optimizing maize production to better meet the increasing demands of both the food and livestock feed.

Biotechnology & Applied Microbiology↗

Portable, heterogeneous ensemble workflows at scale using libEnsemble

libEnsemble is a Python-based toolkit for running dynamic ensembles, developed as part of the DOE Exascale Computing Project. The toolkit utilizes a unique generator–simulator–allocator paradigm, where generators produce input for simulators, simulators evaluate those inputs, and allocators decide whether and when a simulator or generator should be called. The generator steers the ensemble based on simulation results. Generators may, for example, apply methods for numerical optimization, machine learning, or statistical calibration. libEnsemble communicates between a manager and workers. Flexibility is provided through multiple manager–worker communication substrates each of which has different benefits. These include Python’s multiprocessing, mpi4py, and TCP. Multisite ensembles are supported using Balsam or Globus Compute. We overview the unique characteristics of libEnsemble as well as current and potential interoperability with other packages in the workflow ecosystem. We highlight libEnsemble’s dynamic resource features: libEnsemble can detect system resources, such as available nodes, cores, and GPUs, and assign these in a portable way. These features allow users to specify the number of processors and GPUs required for each simulation; and resources will be automatically assigned on a wide range of systems, including Frontier, Aurora, and Perlmutter. Such ensembles can include multiple simulation types, some using GPUs and others using only CPUs, sharing nodes for maximum efficiency. We also describe the benefits of libEnsemble’s generator–simulator coupling, which easily exposes to the user the ability to cancel, and portably kill, running simulations based on models that are updated with intermediate simulation output. We demonstrate libEnsemble’s capabilities, scalability, and scientific impact via a Gaussian process surrogate training problem for the longitudinal density profile at the exit of a plasma accelerator stage. In conclusion, the study uses gpCAM for the surrogate model and employs either Wake-T or WarpX simulations, highlighting efficient use of resources that can easily extend to exascale.

Dynamic ensembles↗

Resilient Disaster Recovery Logistics of Distribution Systems: Co-Optimize Service Restoration With Repair Crew and Mobile Power Source Dispatch

Repair crews (RCs) and mobile power sources (MPSs) are critical resources for distribution system (DS) outage management after a natural disaster. However, their logistics have not been well investigated. We propose a resilient scheme for disaster recovery logistics to co-optimize DS restoration with the dispatch of RCs and MPSs. A novel co-optimization model is formulated to route RCs and MPSs in the transportation network, schedule them in the DS, and reconfigure the DS for microgrid formation coordinately, etc. The model incorporates different timescales of DS restoration and RC/MPS dispatch, the coupling of transportation and power networks, etc. To ensure radiality of the DS with variable physical structure and MPS allocation, we also model topology constraints based on the concept of spanning forest. The model is convexified equivalently and linearized into a mixed-integer linear programming. To reduce its computation time, preprocessing methods are proposed to preassign a minimal set of repair tasks to depots and reduce the number of candidate nodes for MPS connection. Resilient recovery strategies thus are generated to enhance service restoration, especially by dynamic formation of microgrids that are powered by MPSs and topologized by repair actions of RCs and network reconfiguration of the DS. Case studies demonstrate the proposed methodology.

Disaster recovery logistics↗

A comparison study on trading behavior and profit distribution in local energy transaction games

With the increasing integration of distributed energy resources, localized peer-to-peer energy transactions are receiving more attention since they could absorb more distributed renewables locally and stabilize the power grid. To better study the trading behavior and provide guidance for a viable local market design, different game-theoretical frameworks including cooperative and non-cooperative games are established and compared here. For the cooperative grand coalition, the maximum social welfare is guaranteed, the Shapley value and bargaining based approaches are implemented for further profit redistribution. It is shown that the asymmetrical bargaining power can be critical in the final payment clearing and it is equivalent to the Shapley value allocation if prosumers bargain based on their marginal contributions. Non-cooperative trading is formulated by using a Stackelberg bilevel model in which the upper level has the privilege in internal price setting. However, system optimum is not obtained due to competition, and the selfish leader could take away 89% of the collective benefit by price-gap based arbitraging. Aiming for a long-lasting trading market, a virtual benevolent leader and a uniform price structure in which purchase price equals selling price are tested. Experimental results indicate that maximum social welfare and a fairer profit allocation can be achieved with a uniform price structure, regardless of the selfish or benevolent attitude.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Petascale Computing Enabling Technologies Project Final Report

The Petascale Computing Enabling Technologies (PCET) project addressed challenges arising from current trends in computer architecture that will lead to large-scale systems with many more nodes, each of which uses multicore chips. These factors will soon lead to systems that have over one million processors. Also, the use of multicore chips will lead to less memory and less memory bandwidth per core. We need fundamentally new algorithmic approaches to cope with these memory constraints and the huge number of processors. Further, correct, efficient code development is difficult even with the number of processors in current systems; more processors will only make it harder. The goal of PCET was to overcome these challenges by developing the computer science and mathematical underpinnings needed to realize the full potential of our future large-scale systems. Our research results will significantly increase the scientific output obtained from LLNL large-scale computing resources by improving application scientist productivity and system utilization. Our successes include scalable mathematical algorithms that adapt to these emerging architecture trends and through code correctness and performance methodologies that automate critical aspects of application development as well as the foundations for application-level fault tolerance techniques. PCET's scope encompassed several research thrusts in computer science and mathematics: code correctness and performance methodologies, scalable mathematics algorithms appropriate for multicore systems, and application-level fault tolerance techniques. Due to funding limitations, we focused primarily on the first three thrusts although our work also lays the foundation for the needed advances in fault tolerance. In the area of scalable mathematics algorithms, our preliminary work established that OpenMP performance of the AMG linear solver benchmark and important individual kernels on Atlas did not match the predictions of our simple initial model. Our investigations demonstrated that a poor default memory allocation mechanism degraded performance. We developed a prototype NUMA library to provide generic mechanisms to overcome these issues, resulting in significantly improved OpenMP performance. After additional testing, we will make this library available to all users, providing a simple means to improve threading on LLNL's production Linux platforms. We also made progress on developing new scalable algorithms that target multicore nodes. We designed and implemented a new AMG interpolation operator with improved convergence properties for very low complexity coarsening schemes. This implementation will also soon be available to LLNL's application teams as part of the hypre library. We presented results for both topics in an invited plenary talk entitled 'Efficient Sparse Linear Solvers for Multi-Core Architectures' at the 2009 HPCMP Institutes Annual Meeting/CREATE Annual All-Hands Meeting. The interpolation work was summarized in a talk entitled 'Improving Interpolation for Aggressive Coarsening' at the 14th Copper Mountain Conference on Multigrid Methods and in a research paper that will appear in Numerical Linear Algebra with Applications. In the area of code correctness, we significantly extended our behavior equivalence class identification mechanism. Specifically, we not only demonstrated it works well at very large scales but we also added the ability to classify MPI tasks not only by function call traces, but also by specific call sites (source code line numbers) being executed by tasks. More importantly, we developed a new technique to determine relative logical execution progress of tasks in the equivalence classes by combining static analysis with our original dynamic approach. We applied this technique to a correctness issue that arose at 4096 tasks during the development of the new AMG interpolation operator discussed above. This scale isat the limit of effectiveness of production tools, but our technique quickly located the erroneous source code, demonstrating the power of understanding relationships between behavioral equivalence classes. This work is the subject of a paper recently accepted to SC09, as well as a presentation entitled 'Providing Order to Extreme Scale Debugging Chaos' given at the ParaDyn Week annual conference in College Park, MD. In addition to this theoretical extension, we have made significant progress in developing a front end for this tool set, and the front-end is now available on several of LLNL's largescale computing resources. In addition, we explored mechanisms to identify exact locations of erroneous MPI usage in application source code. In this work, we developed a new model that led to a highly efficient algorithm for detecting deadlock during dynamic software testing. This work was the subject of a well-received paper at ICS 2009 [4].

99 GENERAL AND MISCELLANEOUS↗

A multistage distributionally robust optimization approach to water allocation under climate uncertainty

This paper investigates a Multistage Distributionally Robust Optimization (MDRO) approach to water allocation under climate uncertainty. The MDRO is formed by creating sets of conditional distributions (called conditional ambiguity sets) on a finite scenario tree. The distributions in the conditional ambiguity sets remain close to a nominal conditional distribution according a ø-divergence (e.g., Kullback-Leibler divergence, Hellinger distance, Burg entropy, etc.). Here, the paper discusses a decomposition algorithm to solve the resulting MDRO with ø-divergences, which uses the dual formulation and solves only linear subproblems instead of convex ones. Some properties of the algorithm such as generating feasible policies and valid upper/lower bounds are established. The paper then applies the modeling and solution techniques to allocate water in a rapidly-developing area of Tucson, Arizona. Tucson, like many arid and semi-arid regions around the world, faces considerable uncertainty in its ability to provide water for its citizens in the future. The primary sources of uncertainty in the Tucson region include (1) unpredictable population growth, (2) the availability of water from the Colorado River, and (3) the effects of climate variability on water consumption. This paper integrates forecasts for all these sources of uncertainty into a single optimization model for robust and sustainable water allocation. Then, it uses this model to analyze the value of constructing additional treatment facilities to reduce future water shortages. The results indicate that the MDRO approach can be very valuable for water managers by providing insights to minimize their risks and help them plan for the future.

54 ENVIRONMENTAL SCIENCES↗

A lightweight method for evaluating in situ workflow efficiency

Performance evaluation is crucial to understanding the behavior of scientific workflows. In this study, we target an emerging type of workflow, called in situ workflows. These workflows tightly couple components such as simulation and analysis to improve overall workflow performance. To understand the tradeoffs of various configurable parameters for coupling these heterogeneous tasks, namely simulation stride, and component placement, separately monitoring each component is insufficient to gain insights into the entire workflow behavior. Through an analysis of the state-of-the-art research, we propose a lightweight metric, derived from a defined in situ step, for assessing resource usage efficiency of an in situ workflow execution. By applying this metric to a synthetic workflow, which is parameterized to emulate behaviors of a molecular dynamics simulation, we explore two possible scenarios (Idle Simulation and Idle Analyzer) for the characterization of in situ workflow execution. In addition to preliminary results from a recently published study [11], we further exploit the proposed metric to evaluate a practical in situ workflow with a real molecular dynamics application, i.e., GROMACS. Here, experimental results show that the in transit placement (analytics on dedicated nodes) sustains a higher frequency for performing in situ analysis compared to the helper-core configuration (analytics co-allocated with simulation).

97 MATHEMATICS AND COMPUTING↗

Regional water consumption for hydro and thermal electricity generation in the United States

Water is an essential resource for most electric power generation technologies. Thermal power plants typically require a large amount of cooling water whose evaporation is regarded to be consumed. Hydropower plants result in evaporative water loss from the large surface areas of the storing reservoirs. This paper estimated the regional water consumption factors (WCFs) for thermal and hydro electricity generation in the United States, because the WCFs of these power plants vary by region and water supply and demand balance are of concern in many regions. For hydropower, total WCFs were calculated using a reservoir’s surface area, state-level water evaporation, and background evapotranspiration. Then, for a multipurpose reservoir, a fraction of its WCF was allocated to hydropower generation based on the share of the economic valuation of hydroelectricity among benefits from all purposes of the reservoir. For thermal power plants, the variations in WCFs by type of cooling technology, prime mover technology, and by region were addressed. The results show that WCFs for electricity generation vary significantly by region. Finally, the generation-weighted average WCFs of thermoelectricity and hydropower are 1.25 (range of 0.18–2.0) and 16.8 (range of 0.67–1194) L/kWh, respectively, and the generation-weighted average WCF by the U.S. generation mix in 2015 is estimated at 2.18 L/kWh.

13 HYDRO ENERGY↗

Better Than Worst-Case Decoding for Quantum Error Correction

The overheads of classical decoding for quantum error correction in cryogenic quantum systems grow rapidly with the number of logical qubits and their correction code distance. Decoding at room temperature is bottlenecked by refrigerator I/O bandwidth while cryogenic on-chip decoding is limited by area/power/thermal budget. To overcome these overheads, we are motivated by the observation that in the common case (over 90% of the time), error correction 'syndromes' are fairly trivial with high redundancy / sparsity, since the error correction codes are over-provisioned to be able to correct for uncommon worst-case complex scenarios (to ensure substantially low logical error rates). If suitably exploited, these trivial scenarios can be handled with insignificant overhead, thereby alleviating any bottlenecks towards handling the worst-case scenarios by state-of-the-art means. Here, we propose Better Than Worst-Case Decoding for Quantum Error Correction, targeting cryogenic quantum systems and Surface Code, consisting of: On-chip Clique Decoder: An extremely lightweight decoder for correcting trivial common-case errors, designed for the cryogenic domain. The decoder is implemented and evaluated for SFQ logic. Statistical Off-chip Bandwidth Allocation: A statistical confidence-based technique for allocation of off-chip decoding bandwidth, to efficiently handle the rare complex decodes that are not covered by the Clique Decoder. Decode-Overflow Execution Stalling: A method to stall circuit execution, for the worst-case scenarios in which the provisioned off-chip bandwidth is insufficient to complete all requested off-chip decodes. In all, BTWC decoding achieves 70-99+% off-chip bandwidth elimination across a range of logical and physical error rates, without significantly sacrificing the accuracy of a state-of-the-art off-chip decoder. Further, it achieves 10-1000x bandwidth reduction over prior bandwidth reduction techniques, as well as 15-37x resource overhead reduction compared to prior on-chip decoding.

cryogenic optimization↗

NVMalloc: Exposing an Aggregate SSD Store as a Memory Partition in Extreme-Scale Machines

DRAM is a precious resource in extreme-scale machines and is increasingly becoming scarce, mainly due to the growing number of cores per node. On future multi-petaflop and exaflop machines, the memory pressure is likely to be so severe that we need to rethink our memory usage models. Fortunately, the advent of non-volatile memory (NVM) offers a unique opportunity in this space. Current NVM offerings possess several desirable properties, such as low cost and power efficiency, but suffer from high latency and lifetime issues. We need rich techniques to be able to use them alongside DRAM. In this paper, we propose a novel approach for exploiting NVM as a secondary memory partition so that applications can explicitly allocate and manipulate memory regions therein. More specifically, we propose an NVMalloc library with a suite of services that enables applications to access a distributed NVM storage system. We have devised ways within NVMalloc so that the storage system, built from compute node-local NVM devices, can be accessed in a byte-addressable fashion using the memory mapped I/O interface. Our approach has the potential to re-energize out-of-core computations on large-scale machines by having applications allocate certain variables through NVMalloc, thereby increasing the overall memory capacity available. Our evaluation on a 128-core cluster shows that NVMalloc enables applications to compute problem sizes larger than the physical memory in a cost-effective manner. It can bring more performance/efficiency gain with increased computation time between NVM memory accesses or increased data access locality. In addition, our results suggest that while NVMalloc enables transparent access to NVM-resident variables, the explicit control it provides is crucial to optimize application performance.

Computer Science↗

Sharing Storage in a Smart Grid: A Coalitional Game Approach

Sharing economy is a transformative socio-economic phenomenon built around the idea of sharing underused resources and services, e.g., transportation and housing, thereby reducing costs and extracting value. Anticipating continued reduction in the cost of electricity storage, we look into the potential opportunity in electrical power system where consumers share storage with each other. We consider two different scenarios. In the first scenario, consumers are assumed to already have individual storage devices and they explore cooperation to minimize the realized electricity consumption cost. In the second scenario, a group of consumers is interested to invest in joint storage capacity and operate it cooperatively. The resulting system problems are modeled using cooperative game theory. Finally, in both cases, the cooperative games are shown to have non-empty cores and we develop efficient cost allocations in the core with analytical expressions. Thus, sharing of storage in cooperative manner is shown to be very effective for the electric power system.

24 POWER TRANSMISSION AND DISTRIBUTION↗

NVMalloc: Exposing an Aggregate SSD Store as a Memory Partition in Extreme-Scale Machines

DRAM is a precious resource in extreme-scale machines and is increasingly becoming scarce, mainly due to the growing number of cores per node. On future multi-petaflop and exaflop machines, the memory pressure is likely to be so severe that we need to rethink our memory usage models. Fortunately, the advent of non-volatile memory (NVM) offers a unique opportunity in this space. Current NVM offerings possess several desirable properties, such as low cost and power efficiency, but suffer from high latency and lifetime issues. We need rich techniques to be able to use them alongside DRAM. In this talk, we present a novel approach for exploiting NVM as a secondary memory partition so that applications can explicitly allocate and manipulate memory regions therein. More specifically, we propose an NVMalloc library with a suite of services that enables applications to access a distributed NVM storage system. We have devised ways within NVMalloc so that the storage system, built from compute node-local NVM devices, can be accessed in a byte-addressable fashion using the memory mapped I/O interface. Our approach has the potential to re-energize out-of-core computations on largescale machines by having applications allocate certain variables through NVMalloc, thereby increasing the overall memory capacity available. Our evaluation on a 128-core cluster shows that NVMalloc enables applications to compute problem sizes larger than the physical memory in a cost-effective manner. It can bring more performance/efficiency gain with increased computation time between NVM memory accesses or increased data access locality. In addition, our results suggest that while NVMalloc enables transparent access to NVM-resident variables, the explicit control it provides is crucial to optimize application performance.

99 GENERAL AND MISCELLANEOUS↗