Search NASA⌕ Search

SEARCH · Search NASA

Results for “distributed computation”

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 1,549 records · Page 86

Non-Maxwellian velocity distribution functions associated with steep temperature gradients in the solar transition region. Paper 2: The effect of non-Maxwellian electron distribution functions on ionization equilibrium calculations for carbon, nitrogen and oxygen

Non-Maxwellian electron velocity distribution functions, previously computed for Dupree's model of the solar transition region are used to calculate ionization rates for ions of carbon, nitrogen, and oxygen. Ionization equilibrium populations for these ions are then computed and compared with similar calculations assuming Maxwellian distribution functions for the electrons. The results show that the ion populations change (compared to the values computed with a Maxwellian) in some cases by several orders of magnitude depending on the ion and its temperature of formation.

Roussel-Dupre, R.↗

Coordinated neutron and X-ray computed tomography of meteorites: Detection and distribution of hydrogen-bearing materials

The presence and distribution of hydrogen-bearing materials in meteorites are important constraints on processes in the early solar system, and the delivery of volatile constituents to growing planets. Here, in this paper, we show that coordinated neutron and X-ray computed tomography, NXCT, can reveal the presence and distributions of hydrogen-bearing materials in meteorites, and thus help constrain the presence and actions of water in the early solar system. NXCT is nearly nondestructive of meteorite samples. Neutron fluence in NXCT is approximately seven orders of magnitude less than in typical instrumental neutron activation analysis, and so produces little residual radioactivity and currently undetectable changes in isotope ratios. Heating during NXCT is minimal, but NXCT will overprint the record of cosmic ray exposure held in natural thermoluminescence. Two meteorites were examined. EET 87503 is a howardite, a regolith breccia inferred to be from the asteroid 4 Vesta, and contains fragments of eucrite basalt, diogenite pyroxenite, and H-rich carbonaceous chondrites. With NXCT, the chondrite fragments within the meteorite piece can be clearly located and characterized, in preparation for possible extraction and detailed analyses. Graves Nunataks (GRA) 06100 is a CR2 chondrite meteorite that contains abundant iron metal and H-bearing silicates from aqueous alteration. In NXCT, H-bearing altered material is clearly distinguished from metal, and its distribution in three dimensions is revealed as a constraint on the processes of alteration.

79 ASTRONOMY AND ASTROPHYSICS↗

An analysis of bulk data movement patterns in large-scale scientific collaborations

Large-scale research efforts such as LHC experiments, ITER, and climate modelling are built upon large, globally distributed collaborations. For reasons of scalability and agility and to make effective use of existing computing resources, data processing and analysis for these projects is based on distributed computing models. Such projects thus depend on predictable and efficient bulk data movement between collaboration sites. However, the available computing and networking resources to different collaboration sites vary greatly. Large collaboration sites (such as Fermilab, CERN) have created data centres comprising hundreds, and even thousands, of computation nodes to develop massively scaled, highly distributed cluster-computing platforms. These sites are usually well connected to outside worlds with high-speed networks with bandwidth greater than 10Gbps. On the other hand, some small collaboration sites have limited computing resources or poor networking connectivity. Therefore, the bulk data movements across collaboration sites vary greatly. Fermilab is the US-CMS Tier-1 Centre and the main data centre for a few other large-scale research collaborations. Scientific traffic (e.g., CMS) dominates the traffic volumes in both inbound and outbound directions of Fermilab off-site traffic. Fermilab has deployed a Flow-based network traffic collection and analysis system to monitor and analyze the status and patterns of bulk data movement between the Laboratory and its collaboration sites. In this paper, we discuss the current status and patterns of bulk data movement between Fermilab and its collaboration sites.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Use of Constrained Gamma Emission Computed Tomography to Evaluate Fission Product Distributions in High-Temperature Materials from a TRISO Fuel Irradiation

An image reconstruction technique was developed to overcome problems with earlier methods of gamma emission computed tomography of graphite rings surrounding the AGR-3/4 TRISO fission product transport experiment. The profiles obtained from the tomography are compared with sampling done via radially resolved destructive sampling techniques. Generally, there is good agreement between profiles measured via destructive sampling of the rings and the tomographic profiles, though at low signal strengths, the tomographic profiles appear elevated.

11 - NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Stationary Distribution and Perturbation Bounds for a Stochastic Inventory Model

In this paper, we use the theory of generalized inverses to compute the stationary distribution of the (s, S) inventory model directly from the transition matrix of the underlying Markov chain and to provide perturbation bounds. Indeed, approximations are employed to build a tractable model, and statistical methods are used to estimate the unknown parameters and distributions. Hence, the system is subject to perturbations that may cause deviation in the characteristics. The proposed perturbation bound provides a means to estimate the impact of the perturbations on the performance measures of the considered inventory system.

97 MATHEMATICS AND COMPUTING↗

TOOLS FOR COMPUTING THE AGN FEEDBACK: RADIO-LOUDNESS DISTRIBUTION AND THE KINETIC LUMINOSITY FUNCTION

We studied the active galactic nucleus (AGN) radio emission from a compilation of hard X-ray-selected samples, all observed in the 1.4 GHz band. A total of more than 1600 AGNs with 2-10 keV de-absorbed luminosities higher than 10{sup 42} erg s{sup -1} cm{sup -2} were used. For a sub-sample of about fifty z {approx}< 0.1 AGNs, it was possible to reach {approx}80% of radio detections and therefore, for the first time, it was possible to almost completely measure the probability distribution function of the ratio between the radio and the X-ray luminosity R{sub X} = log(L {sub 1.4}/L{sub X}), where L {sub 1.4}/L{sub X} = {nu}L {sub {nu}}(1.4 GHz)/L{sub X} (2-10 keV). The probability distribution function of R{sub X} was functionally fitted as dependent on the X-ray luminosity and redshift, P(R{sub X} |L{sub X} , z). It roughly spans over six decades (-7< R{sub X} <-1) and does not show any sign of bi-modality. The result is that the probability of finding large values of the R{sub X} ratio increases with decreasing X-ray luminosities and (possibly) with increasing redshift. No statistically significant difference was found between the radio properties of the X-ray absorbed (N {sub H}>10{sup 22} cm{sup -2}) and un-absorbed AGNs. Measurement of the probability distribution function of R{sub X} allowed us to compute the kinetic luminosity function and the kinetic energy density which, at variance with that assumed in many galaxy evolution models, is observed to decrease by about a factor of 5 at redshift below 0.5. About half of the kinetic energy density results in being produced by the more radio quiet (R{sub X} <-4) AGNs. In agreement with previous estimates, the AGN efficiency {epsilon}{sub kin} in converting the accreted mass energy into kinetic power (L{sub K}={epsilon}{sub kin} m-dot c{sup 2}) is, on average, {epsilon}{sub kin} {approx_equal} 5 x 10{sup -3}. The data suggest a possible increase of {epsilon}{sub kin} at low redshifts.

79 ASTRONOMY AND ASTROPHYSICS↗

Distributing structural optimization software between a mainframe and a minicomputer

This paper describes a distributed software system for solving large-scale structural optimization problems. Distributing the software between a mainframe computer and a minicomputer takes advantage of some of the best features available on each computer. The described software system consists of a finite element structural analysis computer program, a general purpose optimizer program, and several small user-supplied problem dependent programs. Comparison with a similar system executing entirely on the mainframe computer reveals that the distributed system costs less, uses computer resources more efficiently and improves production through faster turnaround and improved user control. The system interfaces with interactive graphics software for generating models and displaying the intermediate and final results

Rogers, J. L., Jr.↗

Using an architectural approach to integrate heterogeneous, distributed software components

Many computer programs cannot be easily integrated because their components are distributed and heterogeneous, i.e., they are implemented in diverse programming languages, use different data representation formats, or their runtime environments are incompatible. In many cases, programs are integrated by modifying their components or interposing mechanisms that handle communication and conversion tasks. For example, remote procedure call (RPC) helps integrate heterogeneous, distributed programs. When configuring such programs, however, mechanisms like RPC must be used explicitly by software developers in order to integrate collections of diverse components. Each collection may require a unique integration solution. This paper describes improvements to the concepts of software packaging and some of our experiences in constructing complex software systems from a wide variety of components in different execution environments. Software packaging is a process that automatically determines how to integrate a diverse collection of computer programs based on the types of components involved and the capabilities of available translators and adapters in an environment. Software packaging provides a context that relates such mechanisms to software integration processes and reduces the cost of configuring applications whose components are distributed or implemented in different programming languages. Our software packaging tool subsumes traditional integration tools like UNIX make by providing a rule-based approach to software integration that is independent of execution environments.

Callahan, John R.↗

Manual of phosphoric acid fuel cell stack three-dimensional model and computer program

A detailed distributed mathematical model of phosphoric acid fuel cell stack have been developed, with the FORTRAN computer program, for analyzing the temperature distribution in the stack and the associated current density distribution on the cell plates. Energy, mass, and electrochemical analyses in the stack were combined to develop the model. Several reasonable assumptions were made to solve this mathematical model by means of the finite differences numerical method.

Lu, C. Y.↗

A Distributed-Memory Package for Dense Hierarchically Semi-Separable Matrix Computations Using Randomization

In this paper, we present a distributed-memory library for computations with dense structured matrices. A matrix is considered structured if its off-diagonal blocks can be approximated by a rank-deficient matrix with low numerical rank. Here, we use Hierarchically Semi-Separable (HSS) representations. Such matrices appear in many applications, for example, finite-element methods, boundary element methods, and so on. Exploiting this structure allows for fast solution of linear systems and/or fast computation of matrix-vector products, which are the two main building blocks of matrix computations. The compression algorithm that we use, that computes the HSS form of an input dense matrix, relies on randomized sampling with a novel adaptive sampling mechanism. We discuss the parallelization of this algorithm and also present the parallelization of structured matrix-vector product, structured factorization, and solution routines. The efficiency of the approach is demonstrated on large problems from different academic and industrial applications, on up to 8,000 cores. Finally, this work is part of a more global effort, the STRUctured Matrices PACKage (STRUMPACK) software package for computations with sparse and dense structured matrices. Hence, although useful on their own right, the routines also represent a step in the direction of a distributed-memory sparse solver.

98 NUCLEAR DISARMAMENT, SAFEGUARDS, AND PHYSICAL P↗

NASA's Small Spacecraft and Distributed Systems: Development and Demonstration of Technologies Enabling Swarms and New Spacecraft Platforms with AI and Edge Computing

NASA’s Small Spacecraft & Distributed Systems (SSDS) within the Research and Technology Mission Directorate (RTMD) expands U.S. capability to execute unique missions through targeted investment, rapid development, and flight demonstration of small spacecraft technologies applicable to exploration, science and the commercial space sector. SSDS strategically invests in technology development and on-orbit demonstrations executed across NASA, other government agencies, industry, and academia. The program’s University SmallSat Technology Partnerships initiative awards academic researchers with the opportunity to collaborate with NASA to mature innovative technology. Capabilities aligned with RTMD’s technology shortfalls and interests - power, processing, propulsion, sensors, communications, autonomous navigation, architectures, and advanced applications like artificial intelligence (AI), machine learning, and edge computing - are prioritized in SSDS investments. These investments enable distributed, autonomous, and cooperative small spacecraft systems that support swarm missions extending beyond low Earth orbit into cislunar and deep space. This paper highlights representative SSDS flight demonstrations that mature these capabilities to enable a future operational infrastructure needed to support sustained exploration of the Moon and beyond. SSDS’s investment strategy emphasizes rapid development and on-orbit demonstration to validate spacecraft technologies required for swarms and distributed mission architectures. The Starling swarm technology demonstration mission exemplifies this approach by advancing distributed spacecraft autonomy, cooperative operations, and space situational awareness. Extended flight testing and ongoing studies of next generation swarm configurations and on-orbit space traffic monitoring and management continue to inform future swarm designs. DiskSat’s four-spacecraft demonstration mission represents SSDS’s strategic vision to expand the design space for future small spacecraft through its commitment to advance novel platform concepts that can impact how science is performed on orbit. Continuing to invest in future platforms, the notional PY12 concept is a 12-spacecraft swarm hosting neuromorphic processors and is envisioned as an on-orbit testbed for AI, edge computing, and positioning, navigation and timing technologies. SSDS also invests in single-spacecraft technology demonstrations that underpin the success of future swarm missions and accelerate the availability of validated technologies across the small spacecraft ecosystem. Examples of such demonstrations include Pathfinder Technology Demonstrator-3 (PTD-3), which performed high-rate optical communications; PTD-R, which demonstrated a camera capable of simultaneous ultraviolet and short-wave infrared optical sensing; and CAPSTONE, the Cislunar Autonomous Positioning System Technology and Operations Navigation Experiment, which validated autonomous navigation in cislunar space. Collectively, SSDS-funded demonstrations advance capabilities across swarms and illustrate a coordinated investment strategy to mature high-impact technologies required for autonomous, distributed, and cooperative small spacecraft systems for low Earth orbit, cislunar, and deep space applications. Technology demonstrations strengthen SSDS partnerships with industry, academia, and other government agencies, and promote small spacecraft community adoption of capabilities required to close technical gaps for swarm missions.

Jan Stupl↗

NASA's Small Spacecraft and Distributed Systems: Development and Demonstration of Technologies Enabling Swarms and New Spacecraft Platforms with AI and Edge Computing

NASA’s Small Spacecraft & Distributed Systems (SSDS) within the Research and Technology Mission Directorate (RTMD) expands U.S. capability to execute unique missions through targeted investment, rapid development, and flight demonstration of small spacecraft technologies applicable to exploration, science and the commercial space sector. SSDS strategically invests in technology development and on-orbit demonstrations executed across NASA, other government agencies, industry, and academia. The program’s University SmallSat Technology Partnerships initiative awards academic researchers with the opportunity to collaborate with NASA to mature innovative technology. Capabilities aligned with RTMD’s technology shortfalls and interests - power, processing, propulsion, sensors, communications, autonomous navigation, architectures, and advanced applications like artificial intelligence (AI), machine learning, and edge computing - are prioritized in SSDS investments. These investments enable distributed, autonomous, and cooperative small spacecraft systems that support swarm missions extending beyond low Earth orbit into cislunar and deep space. This paper highlights representative SSDS flight demonstrations that mature these capabilities to enable a future operational infrastructure needed to support sustained exploration of the Moon and beyond. SSDS’s investment strategy emphasizes rapid development and on-orbit demonstration to validate spacecraft technologies required for swarms and distributed mission architectures. The Starling swarm technology demonstration mission exemplifies this approach by advancing distributed spacecraft autonomy, cooperative operations, and space situational awareness. Extended flight testing and ongoing studies of next generation swarm configurations and on-orbit space traffic monitoring and management continue to inform future swarm designs. DiskSat’s four-spacecraft demonstration mission represents SSDS’s strategic vision to expand the design space for future small spacecraft through its commitment to advance novel platform concepts that can impact how science is performed on orbit. Continuing to invest in future platforms, the notional PY12 concept is a 12-spacecraft swarm hosting neuromorphic processors and is envisioned as an on-orbit testbed for AI, edge computing, and positioning, navigation and timing technologies. SSDS also invests in single-spacecraft technology demonstrations that underpin the success of future swarm missions and accelerate the availability of validated technologies across the small spacecraft ecosystem. Examples of such demonstrations include Pathfinder Technology Demonstrator-3 (PTD-3), which performed high-rate optical communications; PTD-R, which demonstrated a camera capable of simultaneous ultraviolet and short-wave infrared optical sensing; and CAPSTONE, the Cislunar Autonomous Positioning System Technology and Operations Navigation Experiment, which validated autonomous navigation in cislunar space. Collectively, SSDS-funded demonstrations advance capabilities across swarms and illustrate a coordinated investment strategy to mature high-impact technologies required for autonomous, distributed, and cooperative small spacecraft systems for low Earth orbit, cislunar, and deep space applications. Technology demonstrations strengthen SSDS partnerships with industry, academia, and other government agencies, and promote small spacecraft community adoption of capabilities required to close technical gaps for swarm missions.

Jan Stupl↗

Velocity-Space Hybridization of Direct Simulation Monte Carlo and a Quasi-Particle Boltzmann Solver

This paper presents a new method for modeling rarefied gas flows based on hybridization of direct simulation Monte Carlo (DSMC) and discrete velocity method (DVM)-based quasi-particle representations of the velocity distribution function. It is aimed at improving the resolution of the tails of the distribution function (compared with DSMC) and computational efficiency (compared with DVM). Details of the method, such as the collision algorithm and the particle merging scheme, are discussed. The hybrid approach is applied to the study of noise in a Maxwellian distribution, computation of electron-impact ionization rate coefficient, as well as numerical simulation of a supersonic Couette flow. The hybrid-based solver is compared with pure DSMC and DVM approaches in terms of accuracy, computational speed, and memory use. It is shown that such a hybrid approach can provide a lower computational cost than a pure DVM approach, while being able to retain accuracy in modeling high-velocity tails of the distribution function. For problems where trace species have a significant impact on the flow physics, the proposed method is shown to be capable of providing better computational efficiency and accuracy compared with standard fixed-weight DSMC.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Distributed optimization for multi-commodity urban traffic control

A distributed method for concurrent traffic signal and routing control of traffic networks is proposed. The method is based on the multi-commodity store-and-forward model, in which the destinations are the commodities. The system benefits from the communication between vehicles and infrastructure, providing optimal signal timings to intersections and routes to vehicles on a link-by-link basis. Using the augmented Lagrangian to model the constraints into the objective, the baseline centralized problem is decomposed into a set of objective-coupled subproblems, one for each intersection, enabling the solution to be computed by a distributed- gradient projection algorithm. Further, the intersection agents only need to communicate and coordinate with neighboring intersections to ensure convergence to the optimal solution while tolerating suboptimal iterations that offer more flexibility, unlike other distributed approaches. Through microsimulation, we demonstrate the effectiveness of the proposed algorithm in traffic networks with time-varying demand. Computational analysis shows that the distributed problem is suitable for real-time applications. A robustness analysis show that the distributed formulation enables a graceful degradation of the system in case of failure.

Augmented Lagrangian↗

Computation of imaginary-side pressure distributions over the flexible walls of the test section insert for the 0.3-M transonic cryogenic tunnel

Two dimensional airfoil testing in an adaptive wall test-section wind tunnel requires the computation of the imaginary flow fields extending outward from the top and bottom test section walls. A computer program was developed to compute the flow field which would be associated with an arbitrary test section wall shape. The program is based on incompressible flow theory with a Prandtl-Glauert compressibility correction. The program was validated by comparing the streamline and the pressure field generated by a source in uniform flow with the results from the computer program. A listing of the program, the validation test results, and a sample program are included.

Goodyer, M. J.↗

Techniques for collective operations in distributed systems

Various embodiments are generally directed to techniques for collective operations among compute nodes in a distributed processing set, such as by utilizing ring sets and local sets of the distributed processing set. In some embodiments, a ring set may include a subset of the distributed processing set in which each compute node is connected to a network with a separate router. In various embodiments, a local set may include a subset of the distributed processing set in which each compute node is connected to a network with a common router. In one or more embodiments, each compute node in a distributed processing set may belong to one ring set and one local set.

Langer, Akhil↗

NWChem: scalable parallel computational chemistry

NWChem is a general purpose computational chemistry code specifically designed to run on distributed memory parallel computers. The core functionality of the code focuses on molecular dynamics, Hartree-Fock and density functional theory methods for both plane-wave basis sets as well as Gaussian basis sets, tensor contraction engine based coupled cluster capabilities and combined quantum mechanics/molecular mechanics descriptions. It was realized from the beginning that scalable implementations of these methods required a programming paradigm inherently different from what message passing approaches could offer. In response a global address space library, the Global Array Toolkit, was developed. The programming model it offers is based on using predominantly one-sided communication. This model underpins most of the functionality in NWChem and the power of it is exemplified by the fact that the code scales to tens of thousands of processors. In this paper the core capabilities of NWChem are described as well as their implementation to achieve an efficient computational chemistry code with high parallel scalability. NWChem is a modern, open source, computational chemistry code1 specifically designed for large scale parallel applications2. To meet the challenges of developing efficient, scalable and portable programs of this nature a particular code design was adopted. This code design involved two main features. First of all, the code is build up in a modular fashion so that a large variety of functionality can be integrated easily. Secondly, to facilitate writing complex parallel algorithms the Global Array toolkit was developed. This toolkit allows one to write parallel applications in a shared memory like approach, but offers additional mechanisms to exploit data locality to lower communication overheads. This framework has proven to be very successful in computational chemistry but is applicable to any engineering domain. Within the context created by the features above NWChem has grown into a general purpose computational chemistry code that supports a wide variety of energy expressions and capabilities to calculate properties based there upon. The main energy expressions are classical mechanics force fields, Hartree-Fock and DFT both for finite systems and condensed phase systems, coupled cluster, as well as QM/MM. For most energy expressions single point calculations, geometry optimizations, excited states, and other properties are available. Below we briefly discuss each of the main energy expressions and the critical points involved in scalable implementations thereof.

99 GENERAL AND MISCELLANEOUS↗

Quantum Divide and Compute: Exploring the Effect of Different Noise Sources

Abstract Our recent work (Ayral et al. in Proceedings of IEEE computer society annual symposium on VLSI, ISVLSI, pp 138–140, 2020. 10.1109/ISVLSI49217.2020.00034 ) showed the first implementation of the Quantum Divide and Compute (QDC) method, which allows to break quantum circuits into smaller fragments with fewer qubits and shallower depth. This accommodates the limited number of qubits and short coherence times of quantum processors. This article investigates the impact of different noise sources—readout error, gate error and decoherence—on the success probability of the QDC procedure. We perform detailed noise modeling on the Atos Quantum Learning Machine, allowing us to understand tradeoffs and formulate recommendations about which hardware noise sources should be preferentially optimized. We also describe in detail the noise models we used to reproduce experimental runs on IBM’s Johannesburg processor. This article also includes a detailed derivation of the equations used in the QDC procedure to compute the output distribution of the original quantum circuit from the output distribution of its fragments. Finally, we analyze the computational complexity of the QDC method for the circuit under study via tensor-network considerations, and elaborate on the relation the QDC method with tensor-network simulation methods.

97 MATHEMATICS AND COMPUTING↗