Engineering PapersSearch

SEARCH · Engineering Papers

Results for “Deep Space Network array”

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.

Distributed-Memory Sparse Deep Neural Network Inference Using Global Arrays

Partitioned Global Address Space (PGAS) models exhibit tremendous promise in developing efficient and productive distributed-memory parallel applications. They have been used extensively in scientific computations due to conveniently offering a ``shared-memory''-like model and convenient interfaces that separate communication with synchronization. Traditionally, PGAS communication models have been applied to dense/contiguously distributed data, but most modern applications depict varied levels of sparsity. Existing PGAS models require certain adaptations to support distributed sparse computations, since associated computations often require matrix arithmetic, in addition to data movement. The Global Arrays toolkit from Pacific Northwest National Laboratory (PNNL) is one of the earliest PGAS models to combine one-sided data communication and distributed matrix operations and is still used in the popular NWChem quantum chemistry suite. Recently, we have expanded the Global Arrays toolkit to support common sparse operations, like sparse matrix-dense matrix multiplies (SpMM), sparse matrix-sparse matrix multiplication (SpGEMM) and Sampled Dense-Dense Matrix Multiplication (SDDMM). As it turns out, these operations are the bedrock of sparse Deep Learning (DL); sparse deep neural networks and Graph Neural Networks (GNNs) have gained increasing attention recently in achieving speedups on training and inference with reduced memory footprints. Unlike scientific applications in High Performance Computing (HPC), modern (distributed-memory capable) DL toolkits often rely on non-standardized and closed-source vendor software optimizations, creating challenges in software-hardware co-design at scale. Our goal is to support a variety of distributed-memory sparse matrix operations and helper functions in the newly created Sparse Global Arrays (SGA), such that it is possible to build portable and productive Machine Learning scenarios for algorithm/software and hardware codesign purposes. Contemporary data-parallel schemes for training/inference are undergoing a major overhaul since model replication limits scalability and causes resource inefficiencies. As such, we have adopted tensor parallelism in decomposing the model and inputs, to mitigate memory issues. Current implementation is built on top of MPI and uses CPUs to maximize the portability across the platforms.

Distributed computing, machine learning

Quantum Networks: A New Platform for Aerospace

The ability to distribute entanglement between quantum nodes may unlock new capabilities in the future that include teleporting information across multinode networks, higher resolution detection via entangled sensor arrays, and measurements beyond the quantum limit enabled by networked atomic clocks. These new quantum networks also hold promise for the Aerospace community in areas such as deep space exploration, improved satellite communication, and synchronizing drone swarms. Although exciting, these applications are a long way off from providing a “real-world” benefit, as they have only been theoretically explored or demonstrated in small-scale experiments. An outstanding challenge is to identify near-term use cases for quantum networks; this may be an intriguing new area of interest for the aerospace community, as the quantum networking field would benefit from more multidisciplinary collaborations. This paper introduces quantum networking, discusses the difficulties in distributing entanglement within these networks, highlights recent progress toward this endeavor, and features two current case studies on mobile quantum nodes and an entangled clock network, both of which are relevant to the aerospace community.

Engineering

Identifying environmentally induced calibration changes in cryogenic RF axion detector systems using deep neural networks

The axion is a compelling hypothetical particle that could account for the dark matter in our universe while simultaneously solving the strong CP problem in quantum chromodynamics. The most sensitive axion detection technique demonstrated so far makes use of a high Q cavity immersed in a strong magnetic field, where axions are converted to microwave photons. This is called an axion haloscope and has primarily targeted the 1–10 GHz range. As searches scan up in axion mass, toward the parameter space favored by theoretical predictions, individual cavity sizes decrease in order to achieve higher frequencies. This shrinking cavity volume translates directly to a loss in signal-to-noise, motivating the plan to replace individual cavity detectors with arrays of cavities. When the transition from one to (N) multiple cavities occurs, haloscope searches are anticipated to become much more complicated to operate, requiring N times as many measurements but also the new requirement that N detectors operate in unison, which can be achieved by locking them to a common frequency. To offset this anticipated increase in detector complexity, we aim to develop new tools for diagnosing experiments using neural networks. Current experiments monitor scattering parameters of their receiver for periodically measuring cavity quality factor and coupling. However, off-resonant data remain relatively useless. In this paper, we ask if it is possible that off-resonant information contained in vector network analyzer scans could be used to diagnose equipment failures/anomalies and measure physical conditions (e.g., temperatures and ambient magnetic field). We demonstrate a proof-of-concept that AI techniques can help manage the complexity of an axion haloscope search for operators.

Engel, Andrew W. [Pacific Northwest National Labor

A physics-constrained deep learning treatment of runaway electron dynamics

An adjoint formulation leveraging a physics-informed neural network (PINN) is employed to advance the density moment of a runaway electron (RE) distribution forward in time. A distinguishing feature of this approach is that once the adjoint problem is solved, its solution can be used to project the RE density forward in time for an arbitrary initial momentum space distribution of REs. Furthermore, by employing a PINN, a parametric solution to the adjoint problem can be learned. Thus, once trained, this adjoint-deep learning framework is able to efficiently project the RE density forward in time across various plasma conditions while still including a fully kinetic description of RE dynamics. As an example application, the temporal evolution of the density of primary electrons is studied, with particular emphasis on evaluating the decay of a RE population when below threshold. Predictions from the adjoint-deep learning framework are found to be in good agreement with a traditional relativistic electron Fokker–Planck solver, for several distinct initial conditions, and across an array of physics parameters. Once trained, the PINN thus provides a means of generating RE density time histories with exceptionally low online execution time.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY

Photometric redshifts probability density estimation from recurrent neural networks in the DECam local volume exploration survey data release 2

Photometric wide-field surveys are imaging the sky in unprecedented detail. These surveys face a significant challenge in efficiently estimating galactic photometric redshifts while accurately quantifying associated uncertainties. In this work, we address this challenge by exploring the estimation of Probability Density Functions (PDFs) for the photometric redshifts of galaxies across a vast area of 17,000 square degrees, encompassing objects with a median 5 σ point-source depth of g = 24.3, r = 23 . 9 , i = 23.5, and z = 22.8 mag. Our approach uses deep learning, specifically integrating a Recurrent Neural Network architecture with a Mixture Density Network, to leverage magnitudes and colors as input features for constructing photometric redshift PDFs across the whole DECam Local Volume Exploration (DELVE) survey sky footprint. Subsequently, we rigorously evaluate the reliability and robustness of our estimation methodology, gauging its performance against other well-established machine learning methods to ensure the quality of our redshift estimations. Our best results constrain photometric redshifts with the bias of − 0 . 0013 , a scatter of 0.0293, and an outlier fraction of 5.1%. These point estimates are accompanied by well-calibrated PDFs evaluated using diagnostic tools such as Probability Integral Transform and Odds distribution. We also address the problem of the accessibility of PDFs in terms of disk space storage and the time demand required to generate their corresponding parameters.We present a novel Autoencoder model that reduces the size of PDF parameter arrays to one-sixth of their original length, significantly decreasing the time required for PDF generation to one-eighth of the time needed when generating PDFs directly from the magnitudes.

79 ASTRONOMY AND ASTROPHYSICS

A Full-Stack Exploration of Language-Based Parallelism in Fortran 2023

This poster explores native parallel features in Fortran 2023 through the lens of supporting applications with libraries, compilers, and parallel runtimes. The language revision informally named Fortran 2008 introduced parallelism in the form of Single Program Multiple Data (SPMD) execution with two broad feature sets: (1) loop-level parallelism via do concurrent and (2) a Partitioned Global Address Space (PGAS) comprised of distributed “coarray” data structures. Fortran’s native parallelism has demonstrated high performance [1] and reduced the burden of inserting what sometimes amounts to more directives than code. Several compilers support both feature sets, typically by translating do concurrent into serial do loops annotated by parallel directives and by translating SPMD/PGAS features into direct calls to a communication library. Our research focuses primarily on two questions: (1) can the compiler’s parallel runtime library be developed in the language being compiled (Fortran) and (2) can we define an interface to the runtime that liberates compilers from being hardwired to one runtime and vice versa. We are answering these questions by developing the Parallel Runtime Interface for Fortran (PRIF) [2] and the Co-Array Fortran Framework of Efficient Interfaces to Network Environments (Caffeine) [3]. Caffeine is initially targeting adoption by LLVM Flang, a new open-source Fortran compiler developed by a broad community in industry, academia, and government labs. We are also exploring the use of these features in Inference-Engine, a deep learning library designed to facilitate neural network training and inference for high-performance computing applications written in modern Fortran.

Rasmussen, Katherine