SEARCH · Search NASA
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.
This project performed research into enhancing the MPI programming model in two ways: developing improved algorithms and implementation strategies, tested and realized in the MPICH implementation, and exploring extensions to the MPI standard to better support PetaScale and ExaScale systems.
The present paper explores the applicability of neurocomputing strategies in decomposition based structural optimization problems. It is shown that the modeling capability of a backpropagation neural network can be used to detect weak couplings in a system, and to effectively decompose it into smaller, more tractable, subsystems. When such partitioning of a design space is possible, parallel optimization can be performed in each subsystem, with a penalty term added to its objective function to account for constraint violations in all other subsystems. Dependencies among subsystems are represented in terms of global design variables, and a neural network is used to map the relations between these variables and all subsystem constraints. A vector quantization technique, referred to as a z-Network, can effectively be used for this purpose. The approach is illustrated with applications to minimum weight sizing of truss structures with multiple design constraints.
The design, implementation and performance optimization on the CRAY T3E of an atmospheric general circulation model (AGCM) which includes the transport of, and chemical reactions among, an arbitrary number of constituents is reviewed. The parallel implementation is based on a two-dimensional (longitude and latitude) data domain decomposition. Initial optimization efforts centered on minimizing the impact of substantial static and weakly-dynamic load imbalances among processors through load redistribution schemes. Recent optimization efforts have centered on single-node optimization. Strategies employed include loop unrolling, both manually and through the compiler, the use of an optimized assembler-code library for special function calls, and restructuring of parts of the code to improve data locality. Data exchanges and synchronizations involved in coupling different data-distributed models can account for a significant fraction of the running time. Therefore, the required scattering and gathering of data must be optimized. In systems such as the T3E, there is much more aggregate bandwidth in the total system than in any particular processor. This suggests a distributed design. The design and implementation of a such distributed 'Data Broker' as a means to efficiently couple the components of our climate system model is described.
In the first year of this research, a subgrid turbulent mixing and combustion methodology developed earlier at Georgia Tech has been provided to researchers at NASA/GRC for incorporation into the next generation National Combustion Code (called NCCLES hereafter). A key feature of this approach is that scalar mixing and combustion processes are simulated within the LES grid using a stochastic 1D model. The subgrid simulation approach recovers locally molecular diffusion and reaction kinetics exactly without requiring closure and thus, provides an attractive feature to simulate complex, highly turbulent reacting flows of interest. Data acquisition algorithms and statistical analysis strategies and routines to analyze NCCLES results have also been provided to NASA/GRC. The overall goal of this research is to systematically develop and implement LES capability into the current NCC. For this purpose, issues regarding initialization and running LES are also addressed in the collaborative effort. In parallel to this technology transfer effort (that is continuously on going), research has also been underway at Georgia Tech to enhance the LES capability to tackle more complex flows. In particular, subgrid scalar mixing and combustion method has been evaluated in three distinctly different flow field in order to demonstrate its generality: (a) Flame-Turbulence Interactions using premixed combustion, (b) Spatially evolving supersonic mixing layers, and (c) Temporal single and two-phase mixing layers. The configurations chosen are such that they can be implemented in NCCLES and used to evaluate the ability of the new code. Future development and validation will be in spray combustion in gas turbine engine and supersonic scalar mixing.
Explant organ culture was used to demonstrate that isolated embryonic mouse pre-metatarsal mesenchyme is capable of undergoing a series of differentiative and morphogenetic developmental events. Mesenchyme differentiation into chondrocytes, and concurrent morphogenetic patterning of the cartilage tissue, and terminal chondrocyte differentiation with subsequent matrix mineralization show that cultured tissue closely parallels in vivo development. Whole mount alizarin red staining of the cultured tissue demonstrates that the extracellular matrix around the hypertrophied chondrocytes is competent to support mineralization. Intensely stained mineralized bands are similar to those formed in pre-metatarsals developing in vivo. We have adapted the culture strategy for experimentation in a reduced gravity environment on the Space Shuttle. Spaceflight culture of pre-metatarsals, which have already initiated chondrogenesis and morphogenetic patterning, results in an increase in cartilage rod size and maintenance of rod shape, compared to controls. Older pre-metatarsal tissue, already terminally differentiated to hypertrophied cartilage, maintained rod structure and cartilage phenotype during spaceflight culture.
A recent study for the Supersonics Project, within the National Aeronautics and Space Administration, has been conducted to assess current in-house capabilities for the prediction of near-field sonic boom. Such capabilities are required to simulate the highly nonlinear flow near an aircraft, wherein a sonic-boom signature is generated. There are many available computational fluid dynamics codes that could be used to provide the near-field flow for a sonic boom calculation. However, such codes have typically been developed for applications involving aerodynamic configuration, for which an efficiently generated computational mesh is usually not optimum for a sonic boom prediction. Preliminary guidelines are suggested to characterize a state-of-the-art sonic boom prediction methodology. The available simulation tools that are best suited to incorporate into that methodology are identified; preliminary test cases are presented in support of the selection. During this phase of process definition and tool selection, parallel research was conducted in an attempt to establish criteria that link the properties of a computational mesh to the accuracy of a sonic boom prediction. Such properties include sufficient grid density near shocks and within the zone of influence, which are achieved by adaptation and mesh refinement strategies. Prediction accuracy is validated by comparison with wind tunnel data.
The XPRESS project is the research and development of a complete software architecture for Exascale computing. The four major R&D thrusts include: 1) an Exascale lightweight kernel operating system (LXK), based on the Kitten operating system (OS), to manage billion way hardware parallelism, management of faults and power, management of global virtual name space, and other features of future system architectures; 2) a runtime system (HPX-5), co-designed with LXK, based on the ParalleX execution model that supports dynamic resource management and task scheduling; 3) system interfaces for interoperability between the runtime system and both the OS and the runtime system (RIOS); 4) compilation strategies and systems to translate MPI and OpenMP legacy codes to a form that can be run with performance at least as good as a native code implementation. The software architecture development has been driven by performance evaluation of mini-applications developed at Department of Energy Co-Design Centers as well as ancillary in-house developed applications and benchmarks. Research on the ParalleX execution model has been driven by the development of formal semantics and model checkers for the execution model. The major components of the software architecture are: ParalleX execution model – guiding principles for co-design of components of the system stack with advances in locality management and task prioritization through introspection; HPX runtime system – support of application dynamic adaptive resource management, task scheduling, and introspective control policies; LXK operating system – lightweight kernel operating system for order-constant scalability and low/no noise to manage resources; RIOS – a realm of Exascale system operation unique in the XPRESS project that includes the relationship between the new generation of lightweight kernel operating systems and runtime system software; XPI advanced programming model – intermediate form and low-level (readable) programming interface reflecting the ParalleX model, providing a target for source-to- source high level parallel language translation, and supporting early direct programming experimentation and measurement; Performance models & metrics – providing parameters and their mutual sensitivities to guide co-design and quantify operational behavior; Legacy migration – ensuring seamless transition of legacy codes and programming methods to the future generation of ParalleX-based Exascale systems; . Experiments and evaluation – critical to determining degree of effectiveness and likelihood of ultimate success as well as guiding corrective design changes to achieve DOE objectives; and Applications – collaborations with Co-Design Centers and other mission critical codes. The exemplar implementation of the ParalleX execution model, HPX-5, has been released along with five fully ported applications (LULESH, HPCG, SSSP, WAMR, and DASHMM) and multiple microbenchmarks. Using these applications, the system architecture demonstrated dynamic load balancing through active migration, legacy code migration, and data-driven approaches to for graph-like applications. Crucially for Exascale and billion way parallelism, the needs and patterns of irregular applications in HPX-5 were addressed using local flow control rather than relying on globally synchronized data structures.
We present a filter line-search algorithm that does not require inertia information of the linear system. This feature enables the use of a wide range of linear algebra strategies and libraries, which is essential to tackle large-scale problems on modern computing architectures. The proposed approach performs curvature tests along the search step to detect negative curvature and to trigger convexification. We prove that the approach is globally convergent and we implement the approach within a parallel interior-point framework to solve large-scale and highly nonlinear problems. Our numerical tests demonstrate that the inertia-free approach is as efficient as inertia detection via symmetric indefinite factorizations. We also demonstrate that the inertia-free approach can lead to reductions in solution time because it reduces the amount of convexification needed.
Crystal nucleation from aqueous solutions influences countless geological, biochemical, astrophysical, environmental, and materials science–related phenomena, including ice formation, the manufacturing of active pharmaceutical ingredients, development of diseases such as Alzheimer’s and the origin of life itself. Understanding and controlling nucleation is essential for designing materials with specific properties, developing strategies to inhibit or promote crystallization in various contexts and preventing pathological aggregation in neurodegenerative diseases. Similar to the protein structure prediction problem—where a single amino acid sequence can in theory adopt one most stable conformation but in practice may sample multiple competing conformations—crystal nucleation faces a parallel challenge: the same chemical species can form diverse polymorphs under different environmental conditions (e.g., temperature, pressure, solvent). Each polymorph presents its own set of physical and chemical properties, highlighting the importance of understanding and controlling polymorph selection in fields ranging from pharmaceuticals to materials design. Despite advances in experimental and computational methods for studying phase transitions and polymorph stability, nucleation remains challenging due to its nanoscale nature. Furthermore, in practical settings, salts and impurities can further influence crystal nucleation in diverse contexts, from scaling in pipelines and desalination plants to the durability of concrete and the efficiency of battery materials. This can lead to the formation of polymorphs that may differ from the most stable phase in pure solutions. Or, even though the final structure might appear same irrespective of whether the environment contained impurities or not, the mechanism through which it was formed might be completely different and not intuitive.
Abstract Computing excited-state properties of molecules and solids is considered one of the most important near-term applications of quantum computers. While many of the current excited-state quantum algorithms differ in circuit architecture, specific exploitation of quantum advantage, or result quality, one common feature is their rooting in the Schrödinger equation. However, through contracting (or projecting) the eigenvalue equation, more efficient strategies can be designed for near-term quantum devices. Here we demonstrate that when combined with the Rayleigh–Ritz variational principle for mixed quantum states, the ground-state contracted quantum eigensolver (CQE) can be generalized to compute any number of quantum eigenstates simultaneously. We introduce two excited-state (anti-Hermitian) CQEs that perform the excited-state calculation while inheriting many of the remarkable features of the original ground-state version of the algorithm, such as its scalability. To showcase our approach, we study several model and chemical Hamiltonians and investigate the performance of different implementations.
Given the computing industry trend of increasing processing capacity by adding more cores to a chip, the focus of this work is tuning the performance of a staple visualization algorithm, raycasting volume rendering, for shared-memory parallelism on multi-core CPUs and many-core GPUs. Our approach is to vary tunable algorithmic settings, along with known algorithmic optimizations and two different memory layouts, and measure performance in terms of absolute runtime and L2 memory cache misses. Our results indicate there is a wide variation in runtime performance on all platforms, as much as 254% for the tunable parameters we test on multi-core CPUs and 265% on many-core GPUs, and the optimal configurations vary across platforms, often in a non-obvious way. For example, our results indicate the optimal configurations on the GPU occur at a crossover point between those that maintain good cache utilization and those that saturate computational throughput. This result is likely to be extremely difficult to predict with an empirical performance model for this particular algorithm because it has an unstructured memory access pattern that varies locally for individual rays and globally for the selected viewpoint. Our results also show that optimal parameters on modern architectures are markedly different from those in previous studies run on older architectures. And, given the dramatic performance variation across platforms for both optimal algorithm settings and performance results, there is a clear benefit for production visualization and analysis codes to adopt a strategy for performance optimization through auto-tuning. These benefits will likely become more pronounced in the future as the number of cores per chip and the cost of moving data through the memory hierarchy both increase.
This paper proposes a two-stage energy management system (EMS) for power grids with massive integration of electric vehicles (EVs) and renewable energy resources. The first stage economic dispatch determines the optimal operating points of charging stations and battery swapping stations (BSS) for EVs under plug-in and battery swapping modes, respectively. The proposed stochastic model predictive control (SMPC) problem in this stage is characterized through a chance-constrained optimization formulation that can effectively capture the system and the forecast uncertainties. A distributed algorithm, the alternating direction method of multipliers (ADMM), is applied to accelerate the optimization computation through parallel computing. The second stage is aimed in coordinating the EV charging mechanisms to continuously follow the first-stage solutions, i.e., the target operating points, and meeting the EV customers' charging demands captured via the Advanced Metering Infrastructure (AMI). In this work, the proposed solution offers a holistic control strategy for large-scale centralized power grids in which the aggregated individual parameters are predictable and the system dynamics do not vary sharply within a short time-interval.
Purpose: To determine the feasibility of identifying cortical bone on MR images with a short-TE 3D fast-GRE sequence for attenuation correction of PET data in PET/MR. Methods: A water-fat-bone phantom was constructed with two pieces of beef shank. MR scans were performed on a 3T MR scanner (GE Discovery™ MR750). A 3D GRE sequence was first employed to measure the level of residual signal in cortical bone (TE{sub 1}/TE{sub 2}/TE{sub 3}=2.2/4.4/6.6ms, TR=20ms, flip angle=25°). For cortical bone segmentation, a 3D fast-GRE sequence (TE/TR=0.7/1.9ms, acquisition voxel size=2.5×2.5×3mm{sup 3}) was implemented along with a 3D Dixon sequence (TE{sub 1}/TE{sub 2}/TR=1.2/2.3/4.0ms, acquisition voxel size=1.25×1.25×3mm{sup 3}) for water/fat imaging. Flip angle (10°), acquisition bandwidth (250kHz), FOV (480×480×144mm{sup 3}) and reconstructed voxel size (0.94×0.94×1.5mm{sup 3}) were kept the same for both sequences. Soft tissue and fat tissue were first segmented on the reconstructed water/fat image. A tissue mask was created by combining the segmented water/fat masks, which was then applied on the fast-GRE image (MRFGRE). A second mask was created to remove the Gibbs artifacts present in regions in close vicinity to the phantom. MRFGRE data was smoothed with a 3D anisotropic diffusion filter for noise reduction, after which cortical bone and air was separated using a threshold determined from the histogram. Results: There is signal in the cortical bone region in the 3D GRE images, indicating the possibility of separating cortical bone and air based on signal intensity from short-TE MR image. The acquisition time for the 3D fast-GRE sequence was 17s, which can be reduced to less than 10s with parallel imaging. The attenuation image created from water-fat-bone segmentation is visually similar compared to reference CT. Conclusion: Cortical bone and air can be separated based on intensity in MR image with a short-TE 3D fast-GRE sequence. Further research is required to optimize the strategy to reduce Gibbs artifacts.
torch-einshard is a Python library for describing local and distributed PyTorch tensor computations with compact, einsum-like notation. Its expressions name logical axes, specify how they are sharded across a PyTorch DeviceMesh, and represent partial reductions. The library automatically performs contractions, permutations, reshaping, splitting, gathering, reduction, reduce-scatter, and repartitioning while preserving autograd. Additional features include sharding-aware FFTs, tensor rolls, halo exchange, sliding windows, 1D–3D convolutions, uneven-shard handling, parameter initialization and gradient management, and cost-based execution planning. It is designed for scientific machine learning and large-model workloads, including tensor-, sequence-, and spatial-parallel MLPs, attention, convolutions, and spectral operations. Compared with manually combining torch.einsum and distributed collectives, torch-einshard expresses both the mathematical operation and data placement in one readable formula. This reduces boilerplate and synchronization errors, keeps forward and backward communication consistent, and allows the library to select optimized collective strategies without changing model code.
The largest supercomputers have millions of independent processors, and concurrency levels are rapidly increasing. For ideal efficiency, developers of the simulations that run on these machines must ensure that computational work is evenly balanced among processors. Assigning work evenly is challenging because many large modern parallel codes simulate behavior of physical systems that evolve over time, and their workloads change over time. Furthermore, the cost of imbalanced load increases with scale because most large-scale scientific simulations today use a Single Program Multiple Data (SPMD) parallel programming model, and an increasing number of processors will wait for the slowest one at the synchronization points. To address load imbalance, many large-scale parallel applications use dynamic load balance algorithms to redistribute work evenly. The research objective of this dissertation is to develop methods to decide when and how to load balance the application, and to balance it effectively and affordably. We measure and evaluate the computational load of the application, and develop strategies to decide when and how to correct the imbalance. Depending on the simulation, a fast, local load balance algorithm may be suitable, or a more sophisticated and expensive algorithm may be required. We developed a model for comparison of load balance algorithms for a specific state of the simulation that enables the selection of a balancing algorithm that will minimize overall runtime.
Cyanobacteria dynamically relay environmental inputs to intracellular adaptations through a coordinated adjustment of photosynthetic efficiency and carbon processing rates. The output of such adaptations is reflected through changes in transcriptional patterns and metabolic flux distributions that ultimately define growth strategy. To address interrelationships between metabolism and regulation, we performed integrative analyses of metabolic and gene co-expression networks in a model cyanobacterium, Synechococcus sp. PCC 7002. Centrality analyses using the gene co-expression network identified a set of key genes, which were defined here as ‘topologically important.’ Parallel in silico gene knock-out simulations, using the genome-scale metabolic network, classified what we termed as ‘functionally important’ genes, deletion of which affected growth or metabolism. A strong positive correlation was observed between topologically and functionally important genes. Functionally important genes exhibited variable levels of topological centrality; however, the majority of topologically central genes were found to be functionally essential for growth. Subsequent functional enrichment analysis revealed that both functionally and topologically important genes in Synechococcus sp. PCC 7002 are predominantly associated with translation and energy metabolism, two cellular processes critical for growth. This research demonstrates how synergistic network-level analyses can be used for reconciliation of metabolic and gene expression data to uncover fundamental biological principles.
Motivated by the lack of easily implementable and generally applicable strategies to increase and assess data accuracy, we devised a novel label-free approach, termed REQUIEM, to address challenges in relative quantitation. For comparing the relative amounts of analytes in two samples, a mixture is prepared from aliquots of the samples, and the samples and the mixture are analyzed in parallel according to the intended workflow. Processing of the resulting data using the REQUIEM algorithm yields unbiased analyte fold-changes and associated statistics, allowing several types of errors to be diagnosed or eliminated. Extensive simulations and analysis of carefully prepared standard samples demonstrated the rigorous foundations of REQUIEM. We applied REQUIEM to several real-world analytical techniques and workflows, notably to tandem mass spectrometry analysis by using isomeric oligosaccharides as test analytes. Finally, we conclude that REQUIEM can reveal inaccuracies in the data that are difficult to identify by using traditional approaches.
Utilizing the full solar spectrum is desirable to enhance the conversion efficiency of a solar power generator. In practice, this can be achieved through spectral splitting between multiple converters in parallel. However, it is unclear which wavelength bands should be directed to each converter in order to maximize the efficiency. We developed a model of an ideal hybrid solar converter which utilizes both a single-junction photovoltaic cell and a thermal engine. We determined the limiting efficiencies of this hybrid strategy and the corresponding optimum spectral bandwidth directed to the photovoltaic cell. This optimum width is inversely proportional to the thermal engine efficiency and scales with the bandgap of the photovoltaic cell. This bandwidth was also obtained analytically through an entropy minimization scheme and matches well with our model. We show that the maximum efficiency of the system occurs when it minimizes the spectral entropy generation. This concept can be extended to capture generalized non-idealities to increase the usefulness of this technique for a range of full solar spectrum utilization technologies.