Search NASA⌕ Search

SEARCH · Search NASA

Results for “runtime performance”

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 649 records · Page 36

Concurrent Runtime Verification of Data Rich Events

This paper presents the open source runtime verification tool MESA (MEssage-based System Analysis), implemented in Scala, which supports concurrent monitors using the Actor model. Furthermore, the tool supports indexing (slicing) on the data values occurring in data-carrying events, for each individual monitor. The tool is generic in the sense that any monitoring system can be used for creating monitors. In this paper, we use the internal Scala DSL Daut for programming such in data parameterized state machines and temporal logic. To illustrate MESA/Daut, we present a case study that monitors flights from live U.S. airspace data streams, verifying that they conform to planned routes. With base in the case study, we then perform an extensive empirical study of the potential benefits from monitoring slices of a single property in concurrently executing actors. Due to the overhead of scheduling “small” actors (one for each slice or a small number of slices), it is not obvious that concurrent execution of such is beneficial. However, as a main result, we demonstrate that concurrent monitoring of slices to handle data-carrying events can provide considerable speed gains.

finite state machines↗

Reduced-order CFD modeling of cryogenic hydrogen isotope extrusion for pellet fueling

This study presents a reduced-order model (ROM) for computational fluid dynamics (CFD) simulations of cryogenic hydrogen isotope extrusions, focusing on protium (H₂) and deuterium (D₂) piston extruders. Using a 2D axisymmetric ROM in ANSYS-Polyflow, significant computational savings were achieved (runtime reduced from 9∼24 h to 3∼5 min), with extrusion force discrepancies between the 2D ROM and 3D models being on the order of 1%. Parametric studies identified optimal cutoff shear rates in the viscosity model (0.01/s for H₂ and 0.001/s for D₂), providing recommendations for future simulations. Finally, a comprehensive comparison of ROM results with experimental data was performed across varying geometries, cryogenic materials, temperatures, extrusion lengths, and piston velocities. Predictions at low extrusion temperatures met the objective of providing quick and efficient solutions with an acceptable extrusion force error of approximately 10% or less, validating the effectiveness of the 2D ROM approach. However, at high temperatures closer to the triple point, extrusion force error grows, which necessitates developing an improved model that accounts for temperature effects, e.g. melting. Nevertheless, the findings still represent a significant improvement in efficiency of CFD modeling of cryogenic hydrogenic extrusion. The ROM framework can also be extended to tritium (T2) and screw extruders, which will ultimately provide a fast and effective tool for optimizing pellet injector design for ITER and future reactor systems.

Fan, Joy [ORNL] (ORCID:0000000229751735)↗

A Survey on the Expanding Scope and Interdisciplinary Opportunities for Processing-in-Memory Techniques

Processing-in-Memory (PIM) is emerging as a practical path to overcome the limitations of traditional von Neumann architectures. At its core, PIM systems implement computing primitives such as logic operations and multiply-accumulate acceleration through compute-in-memory, near-memory processing, or hybrid designs. The role of memory cells varies widely across technologies, acting as inputs, outputs, or analog accumulators through bit-lines and sense amplifiers. This diversity creates trade-offs in precision, bandwidth, latency, and programmability, making it difficult to build a unified understanding on the progress of the field. In this survey, we organize recent advances of PIM into three areas. First, we discuss the progress on the architectural optimizations of PIM and its integration with both DRAM and emerging non-volatile memories. Second, we examine how PIM is being used to accelerate key computing domains, including generative AI workloads and high-performance kernels, along with new approaches. Third, we highlight the growing adoption of PIM in computational sciences, where it is being applied to solve interdisciplinary problems such as genome analysis, mRNA quantification, mass spectrometry, quantum circuit simulation, wave modeling, and secure computation. Finally, we synthesize the major challenges that continue to slow PIM adoption, including manufacturing constraints, power delivery, thermal reliability, data consistency, runtime and memory-management coordination, and the difficulty of building portable software abstractions without sacrificing commercial viability. This work provides an updated, structured perspective on PIM’s potential across computing and computational sciences and the barriers that must be solved for it to reach its full impact.

Asifuzzaman, Kazi [Oak Ridge National Laboratory (↗

High-fidelity retrieval from instantaneous line-of-sight returns of nacelle-mounted lidar including supervised machine learning

Abstract. Wind turbine applications that leverage nacelle-mounted Doppler lidar are hampered by several sources of uncertainty in the lidar measurement, affecting both bias and random errors. Two problems encountered especially for nacelle-mounted lidar are solid interference due to intersection of the line of sight with solid objects behind, within, or in front of the measurement volume and spectral noise due primarily to limited photon capture. These two uncertainties, especially that due to solid interference, can be reduced with high-fidelity retrieval techniques (i.e., including both quality assurance/quality control and subsequent parameter estimation). Our work compares three such techniques, including conventional thresholding, advanced filtering, and a novel application of supervised machine learning with ensemble neural networks, based on their ability to reduce uncertainty introduced by the two observed nonideal spectral features while keeping data availability high. The approach leverages data from a field experiment involving a continuous-wave (CW) SpinnerLidar from the Technical University of Denmark (DTU) that provided scans of a wide range of flows both unwaked and waked by a field turbine. Independent measurements from an adjacent meteorological tower within the sampling volume permit experimental validation of the instantaneous velocity uncertainty remaining after retrieval that stems from solid interference and strong spectral noise, which is a validation that has not been performed previously. All three methods perform similarly for non-interfered returns, but the advanced filtering and machine learning techniques perform better when solid interference is present, which allows them to produce overall standard deviations of error between 0.2 and 0.3 m s−1, or a 1 %–22 % improvement versus the conventional thresholding technique, over the rotor height for the unwaked cases. Between the two improved techniques, the advanced filtering produces 3.5 % higher overall data availability, while the machine learning offers a faster runtime (i.e., ∼ 1 s to evaluate) that is therefore more commensurate with the requirements of real-time turbine control. The retrieval techniques are described in terms of application to CW lidar, though they are also relevant to pulsed lidar. Previous work by the authors (Brown and Herges, 2020) explored a novel attempt to quantify uncertainty in the output of a high-fidelity lidar retrieval technique using simulated lidar returns; this article provides true uncertainty quantification versus independent measurement and does so for three techniques rather than one.

47 OTHER INSTRUMENTATION↗

Residential HVAC Fault Data Collection Plan – Refrigerant Undercharge and Overcharge Faults

Heating, ventilation, and air-conditioning (HVAC) systems can develop faults due to poor installation practices or gradual wear and tear, leading to decreased HVAC system’s efficiency, compromised thermal comfort, and shortened equipment lifespan (EERE, 2018). Automated fault detection and diagnosis (AFDD) technologies offer a solution by identifying energy-wasting HVAC faults, such as inadequate indoor airflow and incorrect refrigerant charge, and guiding technicians to enhance system efficiency. In the realm of residential HVAC, AFDD can be implemented through various fault detection and diagnosis capabilities, sensor configurations, and target applications. These technologies typically fall into three categories: smart diagnostic tools, original equipment manufacturer (OEM)-embedded tools, and add-on tools. Smart diagnostic tools employ temporarily installed sensors to directly measure HVAC system characteristics, while OEM-embedded tools utilize factory-installed sensors to identify faults or assess system performance. However, both these types of AFDD technologies are often only accessible for high-end HVAC equipment or require additional sensor installation by qualified technicians, resulting in high investment costs and limited applicability for low-income residential buildings. On the other hand, add-on tools rely solely on data from smart thermostats and meters to detect faults by continuously analyzing equipment runtime or energy usage. As smart thermostat and meter costs decrease and their prevalence increases, these tools can be readily deployed in low-income residential buildings. However, they possess limited capabilities as they rely solely on basic trend analysis. Enhancing such tools with advanced machine learning algorithms can significantly improve their effectiveness.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Analyzing inference workloads for spatiotemporal modeling

Ensuring power grid resiliency, forecasting climate conditions, and optimization of transportation infrastructure are some of the many application areas where data is collected in both space and time. Spatiotemporal modeling is about modeling those patterns for forecasting future trends and carrying out critical decision-making by leveraging machine learning/deep learning. Once trained offline, field deployment of trained models for near real-time inference could be challenging because performance can vary significantly depending on the environment, available compute resources and tolerance to ambiguity in results. Users deploying spatiotemporal models for solving complex problems can benefit from analytical studies considering a plethora of system adaptations to understand the associated performance-quality trade-offs. To facilitate the co-design of next-generation hardware architectures for field deployment of trained models, it is critical to characterize the workloads of these deep learning (DL) applications during inference and assess their computational patterns at different levels of the execution stack. In this paper, we develop several variants of deep learning applications that use spatiotemporal data from dynamical systems. We study the associated computational patterns for inference workloads at different levels, considering relevant models (Long short-term Memory, Convolutional Neural Network and Spatio-Temporal Graph Convolution Network), DL frameworks (Tensorflow and PyTorch), precision (FP16, FP32, AMP, INT16 and INT8), inference runtime (ONNX and AI Template), post-training quantization (TensorRT) and platforms (Nvidia DGX A100 and Sambanova SN10 RDU). Overall, our findings indicate that although there is potential in mixed-precision models and post-training quantization for spatiotemporal modeling, extracting efficiency from contemporary GPU systems might be challenging. Instead, co-designing custom accelerators by leveraging optimized High Level Synthesis frameworks (such as SODA High-Level Synthesizer for customized FPGA/ASIC targets) can make workload-specific adjustments to enhance the efficiency.

97 MATHEMATICS AND COMPUTING↗

Initial Evaluation of CropManage Decision-Support Model for Vineyard ET Estimation

The CropManage(CM) decision-support web application was originally developed by U.C. Cooperative Extension to support evapotranspiration (ET) based irrigation scheduling and nutrient management of cool-season vegetables. The model uses prescribed crop phenology curves to develop daily estimates of fractional green canopy cover (Fc) within the field. Periodic Fc observations acquired by ground-based methods or imported from NASA’s Satellite Irrigation Management Support (SIMS) can be used to adjust the prescribed timeseries for such factors as weather anomalies or non-standard agronomic practice, as needed. Fc is then converted to daily crop coefficient (fraction of reference ET) values. The crop coefficient is combined with reference evapotranspiration, collected by the California Irrigation Management Information System, to derive daily ET estimates for the given field. Irrigation runtime recommendations are issued for a given date based on total ET since the last irrigation event (less any rainfall), and corrected for distribution uniformity of the water delivery system. In this project, CM was adapted to vineyards by adding sub-models to account for early-season depletion of stored soil moisture, cover crop presence, and intentional water stress. An initial trial was performed on a Central Coast winegrape vineyard, where an eddy covariance tower measured daily ET during from May-Dec 2020. Total ET for the period showed strong agreement between the tower-based measurements (443 mm) and the CM model (431 mm). The model tended to overestimate cumulative ET during mid-June by up to 30 mm (about 15%) and later underestimated cumulative ET by as much as 65 mm (about 23%) in late September, suggesting that additional model calibration is needed to improve simulation of within-season variability. Results will be reported for trials on additional vineyard sites conducted during the 2021 season.

Evaluation↗

Coupled Decay Heat and Thermal Hydraulic Capability for Loss-of-Coolant Accident Simulations

As the nuclear energy industry considers ways to achieve improved economics in the current fleet of light-water reactors (LWRs), one possible approach is to operate each cycle for longer durations. This causes a greater portion of the fuel to be burned and reduces the frequency of outages, which ultimately reduces the cost to operate the reactor. However, this also leads to higher burnup fuels than has traditionally been allowed in these reactors. Thus, there are concerns about integrity of high-burnup (HBu) fuel, especially during accident conditions such as loss-of-coolant accidents (LOCAs), as shown by Capps et al.. To investigate these concerns, advanced modeling and simulation capabilities are being leveraged to determine the susceptibility of HBu fuel to fuel fragmentation, relocation, and dispersion (FFRD). Improvements have previously been made to fuel performance capabilities to more accurately model these phenomena; multiphysics simulations have also been conducted to determine the power and burnup histories of the HBu fuel, which are needed as inputs for the fuel performance calculations. Most recently, new statistical approaches have been developed to identify a subset of fuel rods that have greater FFRD susceptibility, reducing the total number of fuel performance simulations required. Prior LOCA simulations have relied on the TRACE systems code, which can model the core and primary loop during accident conditions. TRACE includes many models for various aspects of the primary loop, but two sets of models are important for this report. First, TRACE uses a lumped-fuel approach for modeling the core. This approximates the ~50,000 fuel rods in the core with a much smaller number of rods. The rods can be lumped in various ways as determined by the user. For example, one lumped rod may be used to represent all rods in an assembly, sometimes with an additional rod representing the hottest fuel rod. However, due to runtime constraints and complexity of modeling, a more common approach is to group several assemblies or larger regions of the core into single lumped rods. These lumping schemes apply not only to fuel rods but to flow channels as well. Second, TRACE has several different models for treating decay heat, ranging from pregenerated decay heat curves based on an ANSI/ANS-5.1 standard (hereinafter abbreviated simply as ANSI) to explicit time-dependent heat inputs from the user. None of these models account for differences in isotopics between different rods, which is an approximation the work in this report seeks to eliminate. This report focuses on the implementation of coupled decay heat capabilities in the Virtual Environment for Reactor Applications (VERA) code suite to address a gap identified in previous LOCA simulations. This constitutes an improvement for both the lumped-fuel and decay heat models in TRACE. VERA has been developed to perform high-fidelity, whole-core multiphysics simulations for LWRs. Previously, during the Consortium for Advanced Simulation of LWRs (CASL) program, the emphasis was on providing accurate steady-state analysis—with a secondary focus on reactivity insertion accident (RIA) analysis—to address operational challenges in the nuclear energy industry. Under the Department of Energy (DOE) Nuclear Energy Advanced Modeling and Simulation (NEAMS) program, these capabilities are being extended to a broader range of transient analyses with the goal of quantifying the risk of fuel failures such as FFRD. To properly model such conditions with VERA, decay heat calculations have been integrated with the multiphysics to enable rod-by-rod thermal hydraulic (TH) conditions to be driven by the decay heat in long-running accidents such as LOCAs.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

A Code-Agnostic Driver Application for Coupled Neutronics and Thermal-Hydraulic Simulations

While the literature has numerous examples of Monte Carlo and computational fluid dynamics (CFD) coupling, most are hard-wired codes intended primarily for research rather than as standalone, general-purpose applications. In this work, we describe an open source application, ENRICO, that enables coupled neutronic and thermal-hydraulic simulations between multiple codes that can be chosen at runtime (as opposed to a coupling between two specific codes). The application has been designed such that the control flow logic, domain mapping, nonlinear fixed-point iteration, solution transfers, and convergence checks are all agnostic to the underlying physics solvers used. Special emphasis has also been placed on enabling efficient execution on distributed-memory computing environments. The transfer of solution fields between solvers is performed in memory rather than through filesystem I/O. Additionally, solvers can be configured to run on overlapping or disjoint sets of processes. To date, coupling with the OpenMC and Shift Monte Carlo codes, the Nek5000 CFD code, and a simplified heat diffusion and subchannel solver has been implemented in ENRICO. We present results for coupled simulations of a single light-water reactor fuel assembly based on the NuScale reactor using various combinations of the physics solvers. For this problem, the coupled simulations are shown to converge in about four Picard iterations. A comparison of the heat source and temperature distributions computed by ENRICO using OpenMC coupled with Nek5000 and Shift coupled with Nek5000 illustrates remarkable agreement between the codes.

42 ENGINEERING↗

Fast GPU-Based Generation of Large Graph Networks From Degree Distributions

Synthetically generated, large graph networks serve as useful proxies to real-world networks for many graph-based applications. The ability to generate such networks helps overcome several limitations of real-world networks regarding their number, availability, and access. Here, we present the design, implementation, and performance study of a novel network generator that can produce very large graph networks conforming to any desired degree distribution. The generator is designed and implemented for efficient execution on modern graphics processing units (GPUs). Given an array of desired vertex degrees and number of vertices for each desired degree, our algorithm generates the edges of a random graph that satisfies the input degree distribution. Multiple runtime variants are implemented and tested: 1) a uniform static work assignment using a fixed thread launch scheme, 2) a load-balanced static work assignment also with fixed thread launch but with cost-aware task-to-thread mapping, and 3) a dynamic scheme with multiple GPU kernels asynchronously launched from the CPU. The generation is tested on a range of popular networks such as Twitter and Facebook, representing different scales and skews in degree distributions. Results show that, using our algorithm on a single modern GPU (NVIDIA Volta V100), it is possible to generate large-scale graph networks at rates exceeding 50 billion edges per second for a 69 billion-edge network. GPU profiling confirms high utilization and low branching divergence of our implementation from small to large network sizes. For networks with scattered distributions, we provide a coarsening method that further increases the GPU-based generation speed by up to a factor of 4 on tested input networks with over 45 billion edges.

97 MATHEMATICS AND COMPUTING↗

Collective communications apparatus and method for parallel systems

A collective communication apparatus and method for parallel computing systems. For example, one embodiment of an apparatus comprises a plurality of processor elements (PEs); collective interconnect logic to dynamically form a virtual collective interconnect (VCI) between the PEs at runtime without global communication among all of the PEs, the VCI defining a logical topology between the PEs in which each PE is directly communicatively coupled to a only a subset of the remaining PEs; and execution logic to execute collective operations across the PEs, wherein one or more of the PEs receive first results from a first portion of the subset of the remaining PEs, perform a portion of the collective operations, and provide second results to a second portion of the subset of the remaining PEs.

97 MATHEMATICS AND COMPUTING↗

A flexible data acquisition system architecture for the Nab experiment

Here, the Nab experiment will measure the electron–neutrino correlation and Fierz interference term in free neutron beta decay to test the Standard Model and probe Beyond the Standard Model physics. Using National Instrument’s PXIe-5171 Reconfigurable Oscilloscope module, we have developed a data acquisition system that is not only capable of meeting Nab’s specifications, but flexible enough to be adapted in situ as the experimental environment dictates. The L1 and L2 trigger logic can be reconfigured to optimize the system for coincidence event detection at runtime through configuration files and LabVIEW controls. This system is capable of identifying L1 triggers at a rate of at least 1 MHz, while reading out a peak signal rate of approximately 2 GB/s. During the commissioning phase of the experiment, the system ran at a sustained readout rate of 400 MB/s of detector signal data originating from roughly 6 kHz L2 triggers, well within the peak performance of the system.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

2025 Advances in NekRS: Supporting improved performance for nuclear applications

This report presents several 2025 advancements in NekRS, a high-fidelity spectral element CFD code developed at Argonne National Laboratory to support the NEAMS thermal-hydraulics program. The forthcoming v25 release consolidates several of these advances, adding new features for portability across heterogeneous GPU architectures, real-time in situ visualization, improved turbulence modeling, and conjugate heat transfer coupling. Over the past year, NekRS has demonstrated strong scalability and performance on DOE’s leading exascale platforms, including Aurora and Frontier, confirming its readiness for some of the largest and most complex simulations attempted to date. These achievements provide a powerful new platform for high-fidelity data generation, which in turn supports the development and validation of advanced closure models critical for reactor safety and design. Significant algorithmic innovations have also been introduced. A new global runtime h-refinement capability simplifies workflows by reducing mesh preparation burdens and enabling coarse-to-fine restarts. Building on this, a novel multigrid strategy was implemented to accelerate pressure and transport solves at scale, addressing long-standing bottlenecks in exascale CFD. Together, these developments improve both the efficiency and accessibility of high-fidelity simulations for reactor-relevant problems. Collectively, these enhancements represent a major step forward in simulation technology, positioning NekRS as a cornerstone of NEAMS efforts to enable accurate, efficient, and scalable high-fidelity analysis of advanced nuclear systems.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Launch Complex 34, SWMU CCO542022 DNAPL Source Zone Operations, Maintenance, and Monitoring, Site-Wide Long-Term Monitoring, and Hot Spot 6 Air Sparge System Annual Performance Monitoring Report Cape Canaveral Space Force Station, Florida

This Annual Performance Monitoring Report (PMR) for the Dense Non-Aqueous Phase Liquid (DNAPL) Source Zone (DSZ), Site-Wide Long-Term Monitoring (LTM), and Hot Spot (HS) 6 Air Sparge (AS) System presents the results of Year 13 operation of the hydraulic containment (HC) Interim Measure (IM), the results of performance monitoring direct-push technology (DPT) sampling and monitoring well sampling conducted in the DSZ, results of the biennial site-wide LTM event, and the results of operations and performance sampling of the HS 6 AS IM at Launch Complex 34 (LC34), located at Cape Canaveral Space Force Station (CCSFS), Florida. This site has been designated Solid Waste Management Unit (SWMU) CC054 under the Kennedy Space Center (KSC) Resource Conservation and Recovery Act (RCRA) Corrective Action Program. For the site-wide biennial LTM event, a total of 55 monitoring wells were sampled for volatile organic compounds (VOCs) in February 2023 and one well was sampled for polychlorinated biphenyls (PCBs) in December 2022. One well planned for VOC sampling was found to be destroyed and could not be sampled (CW0002). The LTM wells are screened in two lithologic zones: Layer 1 (0 to 25 feet below land surface [bls]) and Layer 2 (25 to 30 ft bls), and are located in the outlying areas of LC34 to monitor groundwater conditions within the Low-Concentration Plume (LCP), defined as concentrations exceeding Groundwater Cleanup Target Levels (GCTLs), and the High-Concentration Plume (HCP), defined as concentrations exceeding Natural Attenuation Default Concentrations (NADCs). Results from the biennial sampling event indicated overall plume stability and delineation for the plume, which extends over 300 acres. The operational period for Year 13 of the HCS was from April 1, 2022 to March 31, 2023. Operational runtime for the system was 90 percent during Year 13, with downtime events attributed to planned maintenance, system repairs, and power outages. As of March 31, 2023, a total of 313,673,241 cumulative gallons of groundwater containing 88,337 pounds of VOCs have been removed by the HCS. Influent concentrations of trichloroethene (TCE) have decreased since startup from approximately 280,000 μg/L (January 2010) to 12,000 μg/L (March 2023). During the reporting period, all effluent concentrations from the HCS (aqueous and vapor) were below regulatory reporting limits, indicating the system continues to operate as intended. Performance monitoring was conducted in December 2022 within the DSZ to evaluate TCE contamination. Groundwater samples were collected via DPT at nine locations, consistent with previous events between 2017 and 2021. Full vertical profile sampling was completed at each DPT from 8 to 98 feet bls, at 5-foot intervals. The DPT performance monitoring results are summarized in this PMR. The results revealed TCE remains at concentrations greater than 11,000 μg/L in the DSZ (1-percent solubility, indicative of DNAPL) at eight of the nine DPT locations and at depths ranging from 8 to 98 feet bls. In addition to DPT sampling, groundwater samples were collected from deep monitoring wells in the DSZ area (Layers 7 and 8) in December 2022 to verify vertical delineation. Layer 7/8 monitoring well results were non-detect in December 2022, with exception of three wells (IW0162, IW043D2, and IW044D2), where TCE, cis-1,2-dichloroethene (cDCE), and/or vinyl chloride (VC) were detected above GCTLs. These wells are screened 105 to 115 feet bls, which is below the existing recovery well capture zone. TCE was first detected in IW0162 in December 2021 and has since been sampled at least monthly to monitor TCE concentrations. The maximum TCE concentration during this operational period was 15,000 μg/L at IW0162 in March 2023. Because of the increased TCE concentrations in this well, a new recovery well (RW21D), screened 86 to 106 feet bls, was installed in January 2023 and incorporated into existing HCS operations. The HS 6 AS IM was initiated in 2018 with 160 AS wells, and expanded in 2019 with an additional 140 AS wells. Quarterly performance monitoring was reduced to semi-annual in 2020. The HS 6 AS system remained operational during the reporting period covered under this report. The results of the HS 6 system operation and semi-annual performance monitoring are summarized in this report. Semi-annual monitoring results collected in April and October 2022 show concentrations of contaminants of concern (cDCE, trans-1,2-dichloroethene, and vinyl chloride) are generally decreasing and not impacting the surface water drainage canal, indicating the HS 6 IM is meeting objectives. A Phase Two Expansion of the HS 6 AS IM was recently completed. As of the date of this report, the expansion became operational in August 2023 and the first quarter of monitoring was conducted in November 2023. Details of the construction, start-up, and performance monitoring will be included in a future Annual PMR. Overall, the tasks associated with Year 13 operation of the HC IM, operation of the HS 6 AS IM, and biennial site-wide sampling were performed in accordance with recommendations included in the previous 2021 LC34 (Year 12) annual report. Evaluation of results from the HC IM and HS 6 IM show that these systems are operating as designed and meeting performance objectives. Results from the site-wide biennial LTM program also show that the overall network of monitoring wells is adequate to continue monitoring plume-wide conditions.

Complex 34↗

Extending the Frontier of Quantum Computers with Qutrits

Here, we advocate for a fundamentally different way to perform quantum computation by using three-level qutrits instead of qubits. In particular, we substantially reduce the resource requirements of quantum computations by exploiting a third state for temporary variables (ancilla) in quantum circuits. Past work with qutrits has demonstrated only constant factor improvements, owing to the log 2 (3) binary-to-ternary compression factor. We present a novel technique using qutrits to achieve a logarithmic runtime decomposition of the Generalized Toffoli gate using no ancilla - an exponential improvement over the best qubit-only equivalent. Our approach features a 70× improvement in total two-qudit gate count over the qubit-only decomposition. This results in improvements for important algorithms for arithmetic and QRAM. Simulation results under realistic noise models indicate over 90% mean reliability (fidelity) for our circuit, versus under 30% for the qubit-only baseline. These results suggest that qutrits offer a promising path toward extending the frontier of quantum computers.

97 MATHEMATICS AND COMPUTING↗

Applications of the Dynamic N-Dimensional K-Vector

The n-dimensional k-vector (NDKV) is an appealing alternative to binary tress for resolving complex queries in large relational databases. The method has excelled in several applications involving static databases. The present paper extends the theory supporting the NDKV to handle dynamic databases, where the data is updated frequently. This includes deleting records, adding new entries, or editing existing elements. The merit of this new version of the NDKV, the dynamic n-dimensional k-vector (DNDKV), is that it is no longer necessary to recompute the entire k-vector (the main structure that indexes the data) every time a record changes. The algorithm updates the four constituents of the standard NDKV on the fly: the database, sorted database, index, and k-vector tables. As a result, the DNDKV becomes comparable in terms of capabilities and flexibility to stateof-the-art storage engines relying on structured query languages (SQL). The performance of the DNDKV is assessed by running typical read/write operations on a database that contains millions of pre-computed missions to celestial bodies. This database requires frequent updates whenever an orbit solution is refined or new bodies are discovered. The DNDKV is faster than rebuilding the k-vector tables completely, provided that the number of elements being added or removed is not excessively large. Direct runtime comparisons with MySQL suggest that the DNDKV is several times faster for reading but might be slower for writing and updating the database. One limit of the technique is the elements being added must be within the range of the current k-vector tables. If this is not the case, the technique cannot be used and the k-vector tables must be rebuilt from scratch.

Mortari, Daniele↗

On the Feasibility of Simulation-Driven Portfolio Scheduling for Cyberinfrastructure Runtime Systems

Runtime systems that automate the execution of applications on distributed cyberinfrastructures need to make scheduling decisions. Researchers have proposed many scheduling algorithms, but most of them are designed based on analytical models and assumptions that may not hold in practice. The literature is thus rife with algorithms that have been evaluated only within the scope of their underlying assumptions but whose practical effectiveness is unclear. It is thus difficult for developers to decide which algorithm to implement in their runtime systems.To obviate the above difficulty, we propose an approach by which the runtime system executes, throughout application execution, simulations of this very execution. Each simulation is for a different algorithm in a scheduling algorithm portfolio, and the best algorithm is selected based on simulation results. The main objective of this work is to evaluate the feasibility and potential merit of this portfolio scheduling approach, even in the presence of simulation inaccuracy, when compared to the traditional one-algorithm approach. We perform this evaluation via a case study in the context of scientific workflows. Our main finding is that portfolio scheduling can outperform the best one-algorithm approach even in the presence of relatively large simulation inaccuracies.

Casanova, Henri↗

Use of DAGMan in CRAB3 to improve the splitting of CMS user jobs

CRAB3 is a workload management tool used by CMS physicists to analyze data acquired by the Compact Muon Solenoid (CMS) detector at the CERN Large Hadron Collider (LHC). Research in high energy physics often requires the analysis of large collections of files, referred to as datasets. The task is divided into jobs that are distributed among a large collection of worker nodes throughout the Worldwide LHC Computing Grid (WLCG). Splitting a large analysis task into optimally sized jobs is critical to efficient use of distributed computing resources. Jobs that are too big will have excessive runtimes and will not distribute the work across all of the available nodes. However, splitting the project into a large number of very small jobs is also inefficient, as each job creates additional overhead which increases load on infrastructure resources. Currently this splitting is done manually, using parameters provided by the user. However the resources needed for each job are difficult to predict because of frequent variations in the performance of the user code and the content of the input dataset. As a result, dividing a task into jobs by hand is difficult and often suboptimal. In this work we present a new feature called “automatic splitting” which removes the need for users to manually specify job splitting parameters. We discuss how HTCondor DAGMan can be used to build dynamic Directed Acyclic Graphs (DAGs) to optimize the performance of large CMS analysis jobs on the Grid. We use DAGMan to dynamically generate interconnected DAGs that estimate the processing time the user code will require to analyze each event. This is used to calculate an estimate of the total processing time per job, and a set of analysis jobs are run using this estimate as a specified time limit. Some jobs may not finish within the alloted time; they are terminated at the time limit, and the unfinished data is regrouped into smaller jobs and resubmitted.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗