Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “parallel search”

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 91 records · Page 5

Local Distortions and Metal–Semiconductor–Metal Transition in Quasi-One-Dimensional Nanowire Compounds AV 3 Q 3 O δ (A = K, Rb, Cs and Q = Se, Te)

Metal cluster compounds have garnered renewed interest in the search for novel superconductors and topological semimetals owing to structural instabilities of metal-cluster geometries and broken symmetries. Here we synthesized needle-like crystals of the V-cluster-based quasi-one-dimensional (Q1D) materials AV 3 Q 3 O δ (A = K, Rb, Cs, Q= Se, Te) which can also be viewed as being composed of parallel nanowires. We examine how changes in their average and local structure control their electronic properties. All compounds crystallize in the TIFe 3 Te 3 -type structure (P6 3 /m space group) with infinite (V 3 )Q 3 ) - double-walled columnar chains separated by A + cations. Our single-crystal and synchrotron powder diffraction studies indicate oxygen atoms partially occupy the center site of the V 6 octahedral metal cluster cages in KV 3 Te 3 O 0.33 , RbV 3 Te 3 O 0.32 , and CsV 3 Te 3 O 0.35 , whereas KV 3 Se 3 is structurally oxygen-free. Our synchrotron X-ray pair distribution function (PDF) analyses indicate that the oxygen-free V 6 cluster octahedra in KV 3 Se 3 are highly distorted perpendicular to the chain direction even at room temperature, reducing the symmetry of the average structure from hexagonal P6 3 /m to monoclinic P2 1 /m. Our theoretical calculation supports this P2 1 /m distortion and suggests the structure further distorts to P2 1 or P2 1 /c at lower temperatures. In contrast, the oxygen-centered V-cluster in KV 3 Te 3 O 0.33 exhibits a V-3-triangle-trimerization along the chain direction. This feature is discernible from the local PDF and is consistent with lattice dynamical calculations based on density functional theory. Resistivity measurements indicate that KV 3 Se 3 exhibits metallic behavior, whereas a dramatic metal-semiconductor-metal transition emerges in KV 3 Te 3 O 6.33 , RbV 3 Te 3 O 0.32 , and CsV 3 Te 3 O 0.35 because of oxygen disorder and changes in local structure captured from our electronic structure analyses of the Fermi surface. Our investigation of the AV 3 Q 3 O 6 family demonstrates the importance of understanding local changes in structure driven by electronic instabilities, which can guide the search for new quantum materials in other low-dimensional cluster-compound materials.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Profiling the BLAST bioinformatics application for load balancing on high-performance computing clusters

Abstract Background The Basic Local Alignment Search Tool (BLAST) is a suite of commonly used algorithms for identifying matches between biological sequences. The user supplies a database file and query file of sequences for BLAST to find identical sequences between the two. The typical millions of database and query sequences make BLAST computationally challenging but also well suited for parallelization on high-performance computing clusters. The efficacy of parallelization depends on the data partitioning, where the optimal data partitioning relies on an accurate performance model. In previous studies, a BLAST job was sped up by 27 times by partitioning the database and query among thousands of processor nodes. However, the optimality of the partitioning method was not studied. Unlike BLAST performance models proposed in the literature that usually have problem size and hardware configuration as the only variables, the execution time of a BLAST job is a function of database size, query size, and hardware capability. In this work, the nucleotide BLAST application BLASTN was profiled using three methods: shell-level profiling with the Unix “time” command, code-level profiling with the built-in “profiler” module, and system-level profiling with the Unix “gprof” program. The runtimes were measured for six node types, using six different database files and 15 query files, on a heterogeneous HPC cluster with 500+ nodes. The empirical measurement data were fitted with quadratic functions to develop performance models that were used to guide the data parallelization for BLASTN jobs. Results Profiling results showed that BLASTN contains more than 34,500 different functions, but a single function, RunMTBySplitDB, takes 99.12% of the total runtime. Among its 53 child functions, five core functions were identified to make up 92.12% of the overall BLASTN runtime. Based on the performance models, static load balancing algorithms can be applied to the BLASTN input data to minimize the runtime of the longest job on an HPC cluster. Four test cases being run on homogeneous and heterogeneous clusters were tested. Experiment results showed that the runtime can be reduced by 81% on a homogeneous cluster and by 20% on a heterogeneous cluster by re-distributing the workload. Discussion Optimal data partitioning can improve BLASTN’s overall runtime 5.4-fold in comparison with dividing the database and query into the same number of fragments. The proposed methodology can be used in the other applications in the BLAST+ suite or any other application as long as source code is available.

59 BASIC BIOLOGICAL SCIENCES↗

Prediction of Above-Room-Temperature Superconductivity in Lanthanide/Actinide Extreme Superhydrides

Achieving superconductivity at or above room temperature has been a century long held dream for physicists since the discovery of superconductivity in mercury in 1911. Following the recent predictions and ensuing synthesis of clathrate superhydride LaH 10 under pressure exhibiting extraordinary superconducting critical temperatures (T c ) of 250 260 K, we predict via advanced crystal structure search methods a new class of extremely hydrogen rich clathrate superhydrides. These MH 18 (M: rare earth/actinide metal atom) stoichiometric compounds consisting of H36 cage networks are predicted to host T c values above room temperature up to 330 K at pressures of 350 GPa. The bonding and electronic properties of these MH 18 clathrate superhydrides parallel those of atomic metallic hydrogen, giving rise to the highest superconducting temperatures predicted thus far for a thermodynamically stable hydride compound. In depth examination of these extreme superhydrides offers key insights for elucidating and further exploring phonon mediated superconductivity above room temperature in hydrogen rich and other low Z materials.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Predictive Inverse Model for Advective Heat Transfer in a Short–Circuited Fracture: Dimensional Analysis, Machine Learning, and Field Demonstration

Identifying fluid flow maldistribution in planar geometries is a well–established problem in subsurface science/engineering. Of particular importance to the thermal performance of enhanced (or “engineered”) geothermal systems is identifying the existence of nonuniform (i.e., heterogeneous) permeability and subsequently predicting advective heat transfer. Here, machine learning via a genetic algorithm (GA) identifies the spatial distribution of an unknown permeability field in a two–dimensional Hele–Shaw geometry (i.e., parallel plates). The inverse problem is solved by minimizing the L2 norm between simulated residence time distribution (RTD) and measurements of an inert tracer breakthrough curve (BTC) (C–Dot nanoparticle). Principal component analysis (PCA) of spatially correlated permeability fields enabled reduction of the parameter space by more than a factor of 10 and restricted the inverse search to reservoir–scale permeability variations. Thermal experiments and tracer tests conducted at the mesoscale Altona Field Laboratory (AFL) demonstrate that the method accurately predicts the effects of extreme flow channeling on heat transfer in a single bedding–plane rock fracture. However, this is only true when the permeability distributions provide adequate matches to both tracer RTD and frictional pressure loss. Without good agreement to frictional pressure loss, it is still possible to match a simulated RTD to measurements, but subsequent predictions of heat transfer are grossly inaccurate. Here, the results of this study suggest that it is possible to anticipate the thermal effects of flow maldistribution, but only if both simulated RTDs and frictional pressure loss between fluid inlets and outlets are in good agreement with measurements.

42 ENGINEERING↗

OptZConfig: Efficient Parallel Optimization of Lossy Compression Configuration

Lossless compressors have very low compression ratios that do not meet the needs of today's large-scale scientific applications that produce vast volumes of data. Error-bounded lossy compression (EBLC) is considered a critical technique for the success of scientific research. Although EBLC allows users to set an error bound for the compression, users have been unable to specify the requirements on the compression quality, limiting practical use. Our contributions are: (1) We formulate the problem of configuring EBLC to preserve a user-defined metric as an optimization problem. This allows many classes of new metrics to be preserved, which improves over current practices. (2) We present a framework, OptZConfig, that can adapt to improvements in the search algorithm, compressor, and metrics with minimal changes, enabling future advancements in this area. (3) We demonstrate the advantages of our approach against the leading methods to configure compressors to preserve specific metrics. Here, our approach improves compression ratios against a specialized compressor by up to 3 x, has a 56x speedup over FRaZ, 1000x speedup over MGARD-QOI post tuning, and 110x speedup over systematic approaches which had not been bounded by compressors before.

97 MATHEMATICS AND COMPUTING↗

Integrating ytopt and libEnsemble to autotune OpenMC

Ytopt is a Python machine-learning-based autotuning software package developed within the ECP PROTEAS-TUNE project. The ytopt software adopts an asynchronous search framework that consists of sampling a small number of input parameter configurations and progressively fitting a surrogate model over the input-output space until exhausting the user-defined maximum number of evaluations or the wall-clock time. libEnsemble is a Python toolkit for coordinating workflows of asynchronous and dynamic ensembles of calculations across massively parallel resources developed within the ECP PETSc/TAO project. libEnsemble helps users take advantage of massively parallel resources to solve design, decision, and inference problems and expands the class of problems that can benefit from increased parallelism. In this paper we present our methodology and framework to integrate ytopt and libEnsemble to take advantage of massively parallel resources to accelerate the autotuning process. Specifically, we focus on using the proposed framework to autotune the ECP ExaSMR application OpenMC, an open source Monte Carlo particle transport code. OpenMC has seven tunable parameters some of which have large ranges such as the number of particles in-flight, which is in the range of 100,000 to 8 million, with its default setting of 1 million. Setting the proper combination of these parameter values to achieve the best performance is extremely time-consuming. Therefore, we apply the proposed framework to autotune the MPI/OpenMP offload version of OpenMC based on a user-defined metric such as the figure of merit (FoM) (particles/s) or energy efficiency energy-delay product (EDP) on Crusher at Oak Ridge Leadership Computing Facility. In conclusion, the experimental results show that we achieve the improvement up to 29.49% in FoM and up to 30.44% in EDP.

Autotuning↗

Evaluation of Graph Analytics Frameworks Using the GAP Benchmark Suite

The analysis of connected data is an increasingly important application in high-performance computing. Such analyses can reveal fraudulent patterns in financial transactions, optimize telecommunications networks, predict information flow in social networks, etc. However, the landscape of graph analytics is highly diverse. Graph algorithms stress processor architectures differently, and no one graph can represent all topologies. Consequently, no single approach or framework is expected to be optimal for all graph analytics problems. To help make sense of this diverse landscape, we evaluated four approaches to graph analytics: GraphBLAS, Galois, BGL17, GraphIt; and compare them against hand-tuned implementations that take advantage of hardware features on our test platform. Graph- BLAS formulates graph analytics as sparse linear algebra. Galois provides syntactic constructs for data parallelism over irregular data structures. BGL17 is a generic C++ template library for implementing graph algorithms. GraphIt provides a domain- specific language to describe and optimize graph algorithms. We use the GAP Benchmark Suite to establish baseline performance and guide the side-by-side evaluation of each framework. GAP consists of 30 tests: six graph analytics algorithms (breadth- first search, single-source shortest path, PageRank, betweenness centrality, connected components, and triangle counting) run on five graphs, each with different topological characteristics (e.g., high diameter, skewed degree distribution, high average degree). High-performance reference implementations are included for each benchmark algorithm. Because a graph can be loaded into memory a number of ways (e.g., flat file on disk, compressed sparse format, data frames, retrieved from SQL or NoSQL databases), our evaluation focused on computational performance rather than I/O. Our results show the relative strengths of each framework.

Graph algorithms, Benchmarking, shared-memory prog↗

Restoration Strategy for Active Distribution Systems Considering Endogenous Uncertainty in Cold Load Pickup

Cold load pickup (CLPU) phenomenon is identified as the persistent power inrush upon a sudden load pickup after an outage. Under the active distribution system (ADS) paradigm, where distributed energy resources (DERs) are extensively installed, the decreased outage duration can induce a strong interdependence between CLPU pattern and load pickup decisions. In this paper, we propose a novel modelling technique to tractably capture the decision-dependent uncertainty (DDU) inherent in the CLPU process. Subsequently, a two-stage stochastic decision-dependent service restoration (SDDSR) model is constructed, where first stage searches for the optimal switching sequences to decide step-wise network topology, and the second stage optimizes the detailed generation schedule of DERs as well as the energization of switchable loads. Further, to tackle the computational burdens introduced by mixed-integer recourse, the progressive hedging algorithm (PHA) is utilized to decompose the original model into scenario-wise subproblems that can be solved in parallel. The numerical test on modified IEEE 123-node test feeders has verified the efficiency of our proposed SDDSR model and provided fresh insights into the monetary and secure values of DDU quantification.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Radial Spin Texture of the Weyl Fermions in Chiral Tellurium

Trigonal tellurium, a small-gap semiconductor with pronounced magneto-electric and magneto-optical responses, is among the simplest realizations of a chiral crystal. We have studied by spin- and angle-resolved photoelectron spectroscopy its unconventional electronic structure and unique spin texture. We identify Kramers-Weyl, composite, and accordionlike Weyl fermions, so far only predicted by theory, and show that the spin polarization is parallel to the wave vector along the lines in k space connecting high-symmetry points. Our results clarify the symmetries that enforce such spin texture in a chiral crystal, thus bringing new insight in the formation of a spin vectorial field more complex than the previously proposed hedgehog configuration. Our findings thus pave the way to a classification scheme for these exotic spin textures and their search in chiral crystals.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

The LSBmax algorithm for boosting resilience of electric grids post (N‐2) contingencies

Abstract A computationally improved algorithm is presented to find the best transmission switching (TS) candidate for boosting resilience of electricity grids subject to ( N ‐2) contingencies. Here, resilience is computed as the reduction in load shed after the above‐mentioned ( N‐ ) contingencies. TS is a planned line outage, and past research shows that changing the transmission system's topology changes the power flow and removes post contingency violations. Finding the best TS candidate in a computationally suitable time for effectively boosting resilience is a challenge. The best TS candidate is found using a novel heuristic method by decreasing the search space based on proximity to the bus with the maximum load shedding (LSB). The LSB algorithm is faster than existing algorithms in the literature; and, it is compatible with both the AC and DC optimal power flow formulations. To validate the authors' claims of speedup and accuracy, two metrics are used to analyze the results from the IEEE 39‐bus and 118‐bus systems. Finally, the inherent parallelism of the LSB algorithm is leveraged on a high‐performance computing platform and applied to the large‐scale Polish 2383‐bus test system to validate scalability in both size and speedup in computation time.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Parallel Time Integration for Constrained Optimization

The number of transistors in an average processor continues to increase, but individual clock speeds have plateaued. Those transistors are instead going into additional cores, increasing the number of different things that a processor can do at once and placing an emphasis on parallel computation. Many problems in scientific computing follow a time-evolution model, and it can be difficult to solve such problems in parallel across the temporal domain. The Multi-Grid Reduction In Time (MGRIT) algorithm, developed at Lawrence Livermore National Laboratory (LLNL), solves differential equations with a method designed specifically to take advantage of extreme numbers of processors by parallelizing across time. The Tri-diagonal MGRIT (TriMGRIT) algorithm, also developed at LLNL, is a generalization of MGRIT which enables parallel-in-time solving of a greater number of problems. Constrained optimization problems, in particular, may be solved in parallel using TriMGRIT. These consist of choosing a control function such that an objective functional is minimized, constrained by a differential-equation. We consider two such problems: applying torque to a pendulum to bring it to a gentle stop and moving a crowd of people from one distribution into another. We also perform some miscellaneous theoretical and practical research, including investigating the use of a line-search subroutine to refine intermediate TriMGRIT results and preliminary work on strategies for choosing operators for TriMGRIT to use.

97 MATHEMATICS AND COMPUTING↗

Shocks in the stacked Sunyaev-Zel’dovich profiles of clusters II: Measurements from SPT-SZ + Planck Compton- y map

ABSTRACT We search for the signature of cosmological shocks in stacked gas pressure profiles of galaxy clusters using data from the South Pole Telescope (SPT). Specifically, we stack the latest Compton-y maps from the 2500 deg2 SPT-SZ survey on the locations of clusters identified in that same data set. The sample contains 516 clusters with mean mass $\langle M_{\rm 200m}\rangle = 10^{14.9} \, {\rm M}_\odot$ and redshift 〈z〉 = 0.55. We analyse in parallel a set of zoom-in hydrodynamical simulations from the three hundred project. The SPT-SZ data show two features: (i) a pressure deficit at R/R200m = 1.08 ± 0.09, measured at 3.1σ significance and not observed in the simulations, and; (ii) a sharp decrease in pressure at R/R200m = 4.58 ± 1.24 at 2.0σ significance. The pressure deficit is qualitatively consistent with a shock-induced thermal non-equilibrium between electrons and ions, and the second feature is consistent with accretion shocks seen in previous studies. We split the cluster sample by redshift and mass, and find both features exist in all cases. There are also no significant differences in features along and across the cluster major axis, whose orientation roughly points towards filamentary structure. As a consistency test, we also analyse clusters from the Planck and Atacama Cosmology Telescope Polarimeter surveys and find quantitatively similar features in the pressure profiles. Finally, we compare the accretion shock radius ($R_{\rm sh,\, acc}$) with existing measurements of the splashback radius (Rsp) for SPT-SZ and constrain the lower limit of the ratio, $R_{\rm sh,\, acc}/R_{\rm sp}\gt 2.16 \pm 0.59$.

79 ASTRONOMY AND ASTROPHYSICS↗

Color-octet scalars in Dirac gaugino models with broken R symmetry

In this work we study the collider phenomenology of color-octet scalars ( sgluons ) in supersymmetric models with Dirac gaugino masses that feature an explicitly broken R symmetry ( R - broken models ). We construct such models by augmenting minimal R -symmetric models with a fairly general set of supersymmetric and softly supersymmetry-breaking operators that explicitly break R symmetry. We then compute the rates of all significant two-body decays and highlight new features that appear as a result of R symmetry breaking, including enhancements to extant decay rates, novel tree- and loop-level decays, and improved cross sections of single sgluon production. We demonstrate in some detail how the familiar results from minimal R -symmetric models can be obtained by restoring R symmetry. In parallel to this discussion, we explore constraints on these models from the Large Hadron Collider. We find that, in general, R symmetry breaking quantitatively affects existing limits on color-octet scalars, perhaps closing loopholes for light CP-odd (pseudoscalar) sgluons while opening one for a light CP-even (scalar) particle. Qualitatively, however, we find that — much as for minimal R -symmetric models, despite stark differences in phenomenology — scenarios with broken R symmetry and two sgluons below the TeV scale can be accommodated by existing searches.

79 ASTRONOMY AND ASTROPHYSICS↗

Bayesian Optimized Deep Ensemble for Uncertainty Quantification of Deep Neural Networks: a System Safety Case Study on Sodium Fast Reactor Thermal Stratification Modeling

Deep neural networks (DNNs) are increasingly important to scientific computing and engineering system simulations. Accurate uncertainty quantification (UQ) for DNNs is critical in safety-sensitive engineering domains. Traditional Deep Ensemble (DE) methods, while easy to implement, frequently suffer from poorly calibrated uncertainty estimates and limited predictive accuracy due to reliance on fixed architectures with varied weight initializations. To address these issues, we introduce a workflow that combines Bayesian Optimization (BO) and DE. The workflow is modular, scalable, and integrates parallel BO initialized with Sobol sequences to individually optimize the hyperparameters of each ensemble member. This method enhances ensemble diversity, improves predictive accuracy, and provides reliable uncertainty estimates. We evaluate the proposed BODE approach in a sodium fast reactor thermal stratification modeling case study, where we used a densely connected convolutional neural network to predict turbulent viscosity during the reactor transient with consideration of data noise. We benchmark its performance against several optimization approaches, including baseline deep ensemble, evolutionary algorithm-optimized ensemble, ensemble formed via random search combined with greedy selection, and a BO ensemble using random initialization. Here, our results demonstrate superior performance of the developed BODE approach. In noise-free scenarios, BODE notably reduces incorrect aleatoric uncertainty and significantly enhances predictive accuracy. Under conditions of 5% and 10% Gaussian noise, BODE adaptively quantifies uncertainty proportional to data noise, achieving up to an 80% reduction in root mean square error compared to baseline methods and producing well-calibrated prediction intervals.

Bayesian optimization↗

Discovery and Synthesis of a Family of Boride Altermagnets

Borides are a rich material family. To push the boundaries of borides’ properties and applications into broader fields, we have conducted systematic theoretical and experimental searches for synthesizable phases in ternary borides TM 2 B 2 (T = 3d, M = 4d/5d transition metals). We find that TM 2 B 2 in the FeMo 2 B 2 -type and CoW 2 B 2 -type structures form a large family of stable/metastable materials of 120 members. Among them, we identify 40 materials with stable magnetic solutions. Further, we discover 11 altermagnets in the FeMo 2 B 2 -type structure. So far, boride altermagnets are rare. In these altermagnets, T = Fe or Mn atoms are arranged in parallel T-chains with strong ferromagnetic intrachain couplings and antiferromagnetic interchain couplings. They simultaneously exhibit electronic band spin splitting, typical of ferromagnetism, and zero net magnetization, typical of antiferromagnetism. They also exhibit magnonic band chiral splitting. Both effects originate from the unique altermagnetic symmetries crucially constrained by the nonmagnetic atoms in the structure. Transport properties of relevance to spintronic applications, including the strain-induced spin-splitter effect and anomalous Hall effect, are predicted. An iodine-assisted synthesis method for TM 2 B 2 is developed, using which 7 of the predicted low-energy phases are experimentally synthesized and characterized, including 4 altermagnets. This work expands the realm of borides by offering new opportunities for studying altermagnetism and altermagnons in borides. It also provides valuable insights into the discovery and design of altermagnets. Here, by demonstrating that altermagnets can exist as families sharing a common motif, this work paves a feasible route for discovering altermagnets by elemental substitutions and high-throughput computations.

Chemical structure↗

Parallel-in-Time Simulation of Lindblad's Equation

Constructing fast quantum logic gates is critical to building a scalable quantum computer. We consider a qudit, a quantum version of a bit that can take an arbitrary number of states, coupled with a cavity. In this project, we wish to force the qudit to reach the 0-state, for any possible initial state. The coupled system changes in time according to Lindblad’s equation, an ordinary differential equation on the density matrix of the quantum system. Lindblad’s equation contains some parameters that we can control, so-called control functions. We seek control functions which force the qudit to the 0-state within 2 microseconds, which is much faster than what is currently done in practice. The search method is gradient descent, a numerical optimization method that uses gradient information to iteratively improve the control parameters. My contribution to this project is an attempt to speed up the computation of the gradient. It currently takes about 40 seconds to compute the gradient which involves solving a set of ODEs sequentially. Current supercomputers have thousands of cores, but sequential computations can only make use of 1 core at a time. We wish to divide up the work better, so that we can use many more cores at once. To this end, we have implemented the Multigrid Reduction in Time (MGRIT) algorithm. We perform a systematic parameter search on how to best apply this algorithm. Results indicate a 25 percent speed up for solving Lindblad’s equation and determining how close the final state is the 0-state.

97 MATHEMATICS AND COMPUTING↗

Enhanced negative energy with a massless Dirac field

Motivated by traversable wormhole constructions that require large amounts of negative energy, we explore constraints on the amount of negative energy that can be carried by a free Dirac field in a slab-shaped region between two parallel spatial planes. Specifically, we ask what is the minimum possible uniform energy density that can exist at some time, considering all possible states and all possibilities for the physics outside the slab. The vacuum state where we identify the two sides of the slab with antiperiodic boundary conditions gives one possible state with uniform negative energy, but we argue that states with more negative energy exist above 1+1 dimensions. Technically, we reduce the problem to studying a massive Dirac field on an interval in 1+1 dimensions and numerically search for states with uniform energy density in a lattice regulated model. We succeed in finding states with enhanced negative energy (relative to the antiperiodic vacuum) which also appear to have a sensible continuum limit. Our results for the mass-dependence of the minimum uniform energy density in 1+1 dimensions suggest that for a 3+1 dimensional massless Dirac fermion, it is possible to have states with arbitrarily large uniform negative energy density in an arbitrarily wide slab.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Management and Storage of Scientific Data

Scientific discoveries rely heavily on efficient access, search, and management of massive data sets. Data management technologies have, for decades, provided foundational capabilities for scientific computing. Just as storage, input/output (I/O), and data management have been fundamental to simulation-based science for many years, so too are capable data-management technologies key to the success of today’s scientific workflows utilizing data intensive and machine learning (ML) techniques. The Department of Energy, Office of Science, Advanced Scientific Computing Research (ASCR) program has invested broadly in data-management research focused on high-performance computing (HPC) systems, from parallel file systems that store data to application software that makes these systems more productive. Still, advances in technology combined with growing diversity of supported science strongly motivate continued investment in this area. In January 2022, ASCR convened a workshop to identify priority research directions in the area of data management for high-performance and scientific computing. Attendees were challenged to identify promising approaches that would support the breadth of the DOE mission, including the explosion of artificial intelligence (AI) uses and the growing needs of experimental and observational science. Technological and science drivers were identified and considered as they relate to key aspects of data management such as interfaces, architectural design, and FAIR principles (Findable, Accessible, Interoperable, and Reusable). The thoughts of the workshop participants were distilled into a set of four priority research directions with the potential for high impact on DOE science. These research directions are summarized in the following pages.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗