Search NASA⌕ Search

SEARCH · Search NASA

Results for “Parallelization Strategy”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 811 records · Page 45

Dakota, A Multilevel Parallel Object-Oriented Framework for Design Optimization, Parameter Estimation, Uncertainty Quantification, and Sensitivity Analysis (V.6.16 User's Manual)

The Dakota toolkit provides a flexible and extensible interface between simulation codes and iterative analysis methods. Dakota contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quantification with sampling, reliability, and stochastic expansion methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the Dakota toolkit provides a flexible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers. This report serves as a user's manual for the Dakota software and provides capability overviews and procedures for software execution, as well as a variety of example studies.

97 MATHEMATICS AND COMPUTING↗

Dakota, A Multilevel Parallel Object-Oriented Framework for Design Optimization, Parameter Estimation, Uncertainty Quantification, and Sensitivity Analysis: Version 6.16 Theory Manual

The Dakota toolkit provides a flexible and extensible interface between simulation codes and iterative analysis methods. Dakota contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quantification with sampling, reliability, and stochastic expansion methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the Dakota toolkit provides a flexible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers. This report serves as a theoretical manual for selected algorithms implemented within the Dakota software. It is not intended as a comprehensive theoretical treatment, since a number of existing texts cover general optimization theory, statistical analysis, and other introductory topics. Rather, this manual is intended to summarize a set of Dakota-related research publications in the areas of surrogate-based optimization, uncertainty quantification, and optimization under uncertainty that provide the foundation for many of Dakota’s iterative analysis capabilities.

97 MATHEMATICS AND COMPUTING↗

Structured Growth of Metal–Organic Framework MIL-53(Al) from Solid Aluminum Carbide Precursor

The conventional synthesis of metal–organic frameworks (MOFs) through soluble metal-salt precursors provides little control over the growth of MOF crystals. The use of alternative metal precursors would provide a more flexible and cost-effective strategy for direction- and shape-controlled MOF synthesis. Here, we demonstrate for the first time the use of insoluble metal–carbon matrices to foster directed growth of MOFs. Aluminum carbide was implemented as both the metal precursor and growth-directing agent for the generation of MIL-53(Al). A unique needle-like morphology of the MOF was grown parallel to the bulk surface in a layer-by-layer manner. Importantly, the synthesis scheme was found to be transferrable to the production of different linker analogues of the MOF and other topologies. Finally, given the variety of metal carbides available, these findings can be used as a blueprint for controlled, efficient, and economical MOF syntheses and set a new milestone toward the industrial use of MOFs at large-scale.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Giant virus diversity and host interactions through global metagenomics

Our current knowledge about nucleocytoplasmic large DNA viruses (NCLDVs) is largely derived from viral isolates that are co-cultivated with protists and algae. Here we reconstructed 2,074 NCLDV genomes from sampling sites across the globe by building on the rapidly increasing amount of publicly available metagenome data. This led to an 11-fold increase in phylogenetic diversity and a parallel 10-fold expansion in functional diversity. Analysis of 58,023 major capsid proteins from large and giant viruses using metagenomic data revealed the global distribution patterns and cosmopolitan nature of these viruses. The discovered viral genomes encoded a wide range of proteins with putative roles in photosynthesis and diverse substrate transport processes, indicating that host reprogramming is probably a common strategy in the NCLDVs. Furthermore, inferences of horizontal gene transfer connected viral lineages to diverse eukaryotic hosts. We anticipate that the global diversity of NCLDVs that we describe here will establish giant viruses-which are associated with most major eukaryotic lineages-as important players in ecosystems across Earth's biomes.

59 BASIC BIOLOGICAL SCIENCES↗

Characterization of Clouds and the Anisotropy of Emitted and Reflected Radiances for the Purpose of Obtaining the Radiative Heating of the Atmosphere

The goal of the work supported through this grant was to assess the validity of the assumptions underlying the CERES Strategy for determining radiative fluxes. Specifically, the work focused on the determination of scene type and the use of anisotropic factors to derive radiative fluxes from observed broadband radiances. The work revealed a dependence of the anisotropy of reflected and emitted broadband radiances on the spatial resolution of the observations that had been overlooked in the formulation of the CERES strategy. This dependence on spatial resolution coupled with errors in scene identification led to view zenith angle dependent biases in the ERBE derived radiative fluxes. Scene identification will be greatly improved in CERES thereby alleviating somewhat the biases arising from the dependence of the anisotropy of the radiances on spatial resolution. Attention was then focused on the validity of plane-parallel radiative transfer theory which is relied on to characterize the scene types viewed by the CERES scanner. Again, viewing geometry dependent biases were found even for single-layered, overcast cloud systems. Such systems are taken to be the closest examples of plane-parallel clouds. At least some of the departures from plane-parallel behavior were evidently due to relatively small bumps on the tops of extensive stratus layers. The bumps cannot be resolved in the imagery that will be used to characterize the scenes viewed by the CERES scanner. As part of this investigation, the ice sheets of Greenland and Antarctica were shown to provide radiometrically stable targets for determining the visible and near infrared calibrations of radiometers. These targets were used to calibrate the reflected sunlight at visible wavelengths used in this study. Finally, the limitations of plane-parallel theory notwithstanding, the common practice of ignoring fractional cloud cover within the fields of view of imaging radiometers was shown to lead to biases in the retrieved cloud properties. The development of retrievals for pixel-scale cloud cover fraction is an attempt to reduce such bases. Work on these retrievals continues.

Coakley, James A., Jr.↗

Real Time Optima Tracking Using Harvesting Models of the Genetic Algorithm

Tracking optima in real time propulsion control, particularly for non-stationary optimization problems is a challenging task. Several approaches have been put forward for such a study including the numerical method called the genetic algorithm. In brief, this approach is built upon Darwinian-style competition between numerical alternatives displayed in the form of binary strings, or by analogy to 'pseudogenes'. Breeding of improved solution is an often cited parallel to natural selection in.evolutionary or soft computing. In this report we present our results of applying a novel model of a genetic algorithm for tracking optima in propulsion engineering and in real time control. We specialize the algorithm to mission profiling and planning optimizations, both to select reduced propulsion needs through trajectory planning and to explore time or fuel conservation strategies.

Baskaran, Subbiah↗

Personalized Infrastructure: Leveraging Behavioral Strategies for Future Mobility

For decades, the transportation system has been built to position the personal automobile at the pinnacle of mobility options. This prominence is strongly reflected in individual and population behaviors, and supported by coevolved transportation policy, social norms, funding, and physical structures. Such has been the status quo for the living memory of the U.S. population. However, with the advent of emergent, technologically driven mobility options, the transportation system is in an era of rapid and disruptive change. No longer is transportation infrastructure an externality predominantly composed of physical elements; it is also now a personalized interface carried in the pockets of the majority of the population. Perceptions of personal mobility are evolving, in large part because of the proliferation of smartphone technology and the related Internet of Things (IoT), which will become increasingly essential within future transportation systems. With the emergence of personalized mobility infrastructure, many intervention approaches to influence transportation behavior do not adequately acknowledge the complexity of the social/digital environment within which transportation decisions are made. Transportation decisions are influenced by multiple facets, including costs and benefits in time and money, but also by sociocultural elements shaped by social norms and diffusion of ideas. Understanding of factors that lead to transportation behaviors can help to identify incentives and leverage points whereby alternative choices may be most accepted by individuals, and which, if well coordinated, may lead to improved transportation energy outcomes. How can change be initiated to shift away from the transportation status quo? Is it possible to use technologically delivered incentives to produce meaningful changes in transportation behavior? What types of incentives and at what perceived value is necessary to induce changes in behavior? As transportation agencies look toward an ever more complex mobility landscape, and with a quickly growing population, we look for answers to these questions as the core of developing strategies for the future of transportation. Using available data from emergent modes, and experiments conducted as part of an Advanced Research Projects Agency - Energy (ARPA-E) Traveler Response Architecture using Novel Signaling for Network Efficiency in Transportation (TRANSNET) project, we look at how the sharing economy and transportation mobility services have begun to radically alter transportation behavior, while operating in parallel with traditional transportation infrastructure. Emerging modes and practices are affecting car dependence and enabling multimodality. We weigh influences on travel behaviors, identify decision breakpoints where inelastic behavior becomes elastic, incentives, and societal leverage points.

25 ENERGY STORAGE↗

Dakota, A Multilevel Parallel Object-Oriented Framework for Design Optimization Parameter Estimation Uncertainty Quantification and Sensitivity Analysis: Version 6.12 User's Manual

The Dakota toolkit provides a flexible and extensible interface between simulation codes and iterative analysis methods. Dakota contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quantification with sampling, reliability, and stochastic expansion methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the Dakota toolkit provides a flexible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers. This report serves as a user's manual for the Dakota software and provides capability overviews and procedures for software execution, as well as a variety of example studies.

97 MATHEMATICS AND COMPUTING↗

Dakota, A Multilevel Parallel Object-Oriented Framework for Design Optimization, Parameter Estimation, Uncertainty Quantification, and Sensitivity Analysis: Version 6.13 User's Manual

The Dakota toolkit provides a flexible and extensible interface between simulation codes and iterative analysis methods. Dakota contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quantification with sampling, reliability, and stochastic expansion methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the Dakota toolkit provides a flexible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers. This report serves as a user’s manual for the Dakota software and provides capability overviews and procedures for software execution, as well as a variety of example studies.

97 MATHEMATICS AND COMPUTING↗

Dakota, A Multilevel Parallel Object-Oriented Framework for Design Optimization, Parameter Estimation, Uncertainty Quantification, and Sensitivity Analysis: Version 6.15 User's Manual

The Dakota toolkit provides a flexible and extensible interface between simulation codes and iterative analysis methods. Dakota contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quantification with sampling, reliability, and stochastic expansion methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the Dakota toolkit provides a flexible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers.

97 MATHEMATICS AND COMPUTING↗

Two-level overlapping additive Schwarz preconditioner for training scientific machine learning applications

In this work we introduce a novel two-level overlapping additive Schwarz preconditioner for accelerating the training of scientific machine learning applications. The design of the proposed preconditioner is motivated by the nonlinear two-level overlapping additive Schwarz preconditioner. The neural network parameters are decomposed into groups (subdomains) with overlapping regions. In addition, the network’s feed-forward structure is indirectly imposed through a novel subdomain-wise synchronization strategy and a coarse-level training step. Through a series of numerical experiments, which consider physicsinformed neural networks and operator learning approaches, we demonstrate that the proposed two-level preconditioner significantly speeds up the convergence of the standard (LBFGS) optimizer while also yielding more accurate machine learning models. Moreover, the devised preconditioner is designed to take advantage of model-parallel computations, which can further reduce the training time.

97 MATHEMATICS AND COMPUTING↗

Systematic Crosstalk Mitigation for Superconducting Qubits via Frequency-Aware Compilation

One of the key challenges in current Noisy Intermediate-Scale Quantum (NISQ) computers is to control a quantum system with high-fidelity quantum gates. There are many reasons a quantum gate can go wrong - for superconducting transmon qubits in particular, one major source of gate error is the unwanted crosstalk between neighboring qubits due to a phenomenon called frequency crowding. We motivate a systematic approach for understanding and mitigating the crosstalk noise when executing near-term quantum programs on superconducting NISQ computers. Here, we present a general software solution to alleviate frequency crowding by systematically tuning qubit frequencies according to input programs, trading parallelism for higher gate fidelity when necessary. The net result is that our work dramatically improves the crosstalk resilience of tunable-qubit, fixed-coupler hardware, matching or surpassing other more complex architectural designs such as tunable-coupler systems. On NISQ benchmarks, we improve worst-case program success rate by 13.3x on average, compared to existing traditional serialization strategies.

Computer architecture↗

Soot Imaging and Measurement

Soot, sometimes referred to as smoke, is made up primarily of the carbon particles generated by most combustion processes. For example, large quantities of soot can be seen issuing from the exhaust pipes of diesel-powered vehicles. Heated soot also is responsible for the warm orange color of candle flames, though that soot is generally consumed before it can exit the flame. Research has suggested that heavy atmospheric soot concentrations aggravate conditions such as pneumonia and asthma, causing many deaths each year. To understand the formation and oxidation of soot, NASA Lewis Research Center scientists, together with several university investigators, are investigating the properties of soot generated in reduced gravity, where the absence of buoyancy allows more time for the particles to grow. The increased time allows researchers to better study the life cycle of these particles, with the hope that increased understanding will lead to better control strategies. To quantify the amount of soot present in a flame, Lewis scientists developed a unique imaging technique that provides quantitative and qualitative soot data over a large field of view. There is significant improvement over the single-point methods normally used. The technique is shown in the sketch, where light from a laser is expanded with a microscope objective, rendered parallel, and passed through a flame where soot particles reduce the amount of light transmitted to the camera. A filter only allows light at the wavelength of the laser to pass to the camera, preventing any extraneous signals. When images of the laser light with and without the flame are compared, a quantitative map of the soot concentration is produced. In addition to that data, a qualitative image of the soot in the flame is also generated, an example of which is displayed in the photo. This technique has the potential to be adapted to real-time process control in industrial powerplants.

Source record↗

Combinatorial geometry domain decomposition strategies for Monte Carlo simulations

Analysis and modeling of nuclear reactors can lead to memory overload for a single core processor when it comes to refined modeling. A method to solve this problem is called 'domain decomposition'. In the current work, domain decomposition algorithms for a combinatorial geometry Monte Carlo transport code are developed on the JCOGIN (J Combinatorial Geometry Monte Carlo transport INfrastructure). Tree-based decomposition and asynchronous communication of particle information between domains are described in the paper. Combination of domain decomposition and domain replication (particle parallelism) is demonstrated and compared with that of MERCURY code. A full-core reactor model is simulated to verify the domain decomposition algorithms using the Monte Carlo particle transport code JMCT (J Monte Carlo Transport Code), which has being developed on the JCOGIN infrastructure. Besides, influences of the domain decomposition algorithms to tally variances are discussed. (authors)

97 MATHEMATICS AND COMPUTING↗

The Kokkos OpenMPTarget Backend: Implementation and Lessons Learned

As the supercomputing landscape diversifies, solutions such as Kokkos to write vendor agnostic applications and libraries have risen in popularity. Kokkos provides a programming model designed for performance portability, which allows developers to write a single source implementation that can run efficiently on various architectures. At its heart, Kokkos maps parallel algorithms to architecture and vendor specific backends written in lower level programming models such as CUDA and HIP. Another approach to writing vendor agnostic parallel code is using OpenMP’s directives based approach, which lets developers annotate code to express parallelism. It is implemented at the compiler level and is supported by all major high performance computing vendors, as well as the primary Open Source toolchains GNU and LLVM. Since its inception, Kokkos has used OpenMP to parallelize on CPU architectures. In this paper, we explore leveraging OpenMP for a GPU backend and discuss the challenges we encountered when mapping the Kokkos APIs and semantics to OpenMP target constructs. As an exemplar workload we chose a simple conjugate gradient solver for sparse matrices. We find that performance on NVIDIA and AMD GPUs varies widely based on details of the implementation strategy and the chosen compiler. Furthermore, the performance of the OpenMP implementations decreases with increasing complexity of the investigated algorithms.

Gayatri, Rahulkumar↗

Lynx x-ray microcalorimeter

Lynx is an x-ray telescope, one of four large satellite mission concepts currently being studied by NASA to be a flagship mission. One of Lynx’s three instruments is an imaging spectrometer called the Lynx x-ray microcalorimeter (LXM), an x-ray microcalorimeter behind an x-ray optic with an angular resolution of 0.5 arc sec and ~2 m 2 of area at 1 keV. The LXM will provide unparalleled diagnostics of distant extended structures and, in particular, will allow the detailed study of the role of cosmic feedback in the evolution of the Universe. We discuss the baseline design of LXM and some parallel approaches for some of the key technologies. The baseline sensor technology uses transition-edge sensors, but we also consider an alternative approach using metallic magnetic calorimeters. We discuss the requirements for the instrument, the pixel layout, and the baseline readout design, which uses microwave superconducting quantum interference devices and high-electron mobility transistor amplifiers and the cryogenic cooling requirements and strategy for meeting these requirements. For each of these technologies, we discuss the current technology readiness level and our strategy for advancing them to be ready for flight. We also describe the current system design, including the block diagram, and our estimate for the mass, power, and data rate of the instrument.

47 OTHER INSTRUMENTATION↗

A whole-genome shotgun approach for assembling and anchoring the hexaploid bread wheat genome

We report that polyploid species have long been thought to be recalcitrant to whole-genome assembly. By combining high-throughput sequencing, recent developments in parallel computing, and genetic mapping, we derive, de novo, a sequence assembly representing 9.1 Gbp of the highly repetitive 16 Gbp genome of hexaploid wheat, Triticum aestivum , and assign 7.1 Gb of this assembly to chromosomal locations. The genome representation and accuracy of our assembly is comparable or even exceeds that of a chromosome-by-chromosome shotgun assembly. Our assembly and mapping strategy uses only short read sequencing technology and is applicable to any species where it is possible to construct a mapping population.

59 BASIC BIOLOGICAL SCIENCES↗