Search NASA⌕ Search

SEARCH · Search NASA

Results for “complex computing”

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,207 records · Page 67

Reconfigurable optical interconnections via dynamic computer-generated holograms

A system is proposed for optically providing one-to-many irregular interconnections, and strength-adjustable many-to-many irregular interconnections which may be provided with strengths (weights) w(sub ij) using multiple laser beams which address multiple holograms and means for combining the beams modified by the holograms to form multiple interconnections, such as a cross-bar switching network. The optical means for interconnection is based on entering a series of complex computer-generated holograms on an electrically addressed spatial light modulator for real-time reconfigurations, thus providing flexibility for interconnection networks for largescale practical use. By employing multiple sources and holograms, the number of interconnection patterns achieved is increased greatly.

Liu, Hua-Kuang↗

Reconfigurable Optical Interconnections Via Dynamic Computer-Generated Holograms

A system is presented for optically providing one-to-many irregular interconnections, and strength-adjustable many-to-many irregular interconnections which may be provided with strengths (weights) w(sub ij) using multiple laser beams which address multiple holograms and means for combining the beams modified by the holograms to form multiple interconnections, such as a cross-bar switching network. The optical means for interconnection is based on entering a series of complex computer-generated holograms on an electrically addressed spatial light modulator for real-time reconfigurations, thus providing flexibility for interconnection networks for large-scale practical use. By employing multiple sources and holograms, the number of interconnection patterns achieved is increased greatly.

Liu, Hua-Kuang↗

Is the bipyridyl thorium metallocene a low-valent thorium complex? A combined experimental and computational study

Bipyridyl thorium metallocenes [5-1,2,4-(Me3C)3C5H2]2Th(bipy) (1) and [5-1,3-(Me3C)2C5H3]2Th(bipy) (2) have been investigated by magnetic susceptibility and computational studies. The magnetic susceptibility data reveal that 1 and 2 are not diamagnetic, but they behave as temperature independent paramagnets (TIPs). To rationalize this observation, density functional theory (DFT) and complete active space SCF (CASSCF) calculations have been undertaken, which indicated that Cp2Th(bipy) has indeed a Th(IV)(bipy2-) ground state (f0d0 2, S = 0), but the open-shell singlet (f0d1 1, S = 0) (almost degenerate with its triplet congener) is lying only 9.2 kcal/mol higher in energy. Complexes 1 and 2 react cleanly with Ph2CS to give [ 5-1,2,4-(Me3C)3C5H2]2Th[(bipy)(SCPh2)] (3) and [ 5-1,3-(Me3C)2C5H3]2Th[(bipy)(SCPh2)] (4), respectively, in quantitative conversions. Since no intermediates were observed experimentally, this reaction was also studied computationally. Coordination of Ph2CS to 2 in its S = 0 ground state is not possible, but Ph2CS can coordinate to 2 in its triplet state (S = 1) upon which a single electron transfer (SET) from the (bipy2-) fragment to Ph2CS followed by C-C coupling takes place.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Qualitative Fault Isolation of Hybrid Systems: A Structural Model Decomposition-Based Approach

Quick and robust fault diagnosis is critical to ensuring safe operation of complex engineering systems. A large number of techniques are available to provide fault diagnosis in systems with continuous dynamics. However, many systems in aerospace and industrial environments are best represented as hybrid systems that consist of discrete behavioral modes, each with its own continuous dynamics. These hybrid dynamics make the on-line fault diagnosis task computationally more complex due to the large number of possible system modes and the existence of autonomous mode transitions. This paper presents a qualitative fault isolation framework for hybrid systems based on structural model decomposition. The fault isolation is performed by analyzing the qualitative information of the residual deviations. However, in hybrid systems this process becomes complex due to possible existence of observation delays, which can cause observed deviations to be inconsistent with the expected deviations for the current mode in the system. The great advantage of structural model decomposition is that (i) it allows to design residuals that respond to only a subset of the faults, and (ii) every time a mode change occurs, only a subset of the residuals will need to be reconfigured, thus reducing the complexity of the reasoning process for isolation purposes. To demonstrate and test the validity of our approach, we use an electric circuit simulation as the case study.

Hybrid Systems Diagnosis↗

PREPARING FOR EXASCALE: ORNL Leadership Computing Application Requirements and Strategy

In 2009 the Oak Ridge Leadership Computing Facility (OLCF), a U.S. Department of Energy (DOE) facility at the Oak Ridge National Laboratory (ORNL) National Center for Computational Sciences (NCCS), elicited petascale computational science requirements from leading computational scientists in the international science community. This effort targeted science teams whose projects received large computer allocation awards on OLCF systems. A clear finding of this process was that in order to reach their science goals over the next several years, multiple projects will require computational resources in excess of an order of magnitude more powerful than those currently available. Additionally, for the longer term, next-generation science will require computing platforms of exascale capability in order to reach DOE science objectives over the next decade. It is generally recognized that achieving exascale in the proposed time frame will require disruptive changes in computer hardware and software. Processor hardware will become necessarily heterogeneous and will include accelerator technologies. Software must undergo the concomitant changes needed to extract the available performance from this heterogeneous hardware. This disruption portends to be substantial, not unlike the change to the message passing paradigm in the computational science community over 20 years ago. Since technological disruptions take time to assimilate, we must aggressively embark on this course of change now, to insure that science applications and their underlying programming models are mature and ready when exascale computing arrives. This includes initiation of application readiness efforts to adapt existing codes to heterogeneous architectures, support of relevant software tools, and procurement of next-generation hardware testbeds for porting and testing codes. The 2009 OLCF requirements process identified numerous actions necessary to meet this challenge: (1) Hardware capabilities must be advanced on multiple fronts, including peak flops, node memory capacity, interconnect latency, interconnect bandwidth, and memory bandwidth. (2) Effective parallel programming interfaces must be developed to exploit the power of emerging hardware. (3) Science application teams must now begin to adapt and reformulate application codes to the new hardware and software, typified by hierarchical and disparate layers of compute, memory and concurrency. (4) Algorithm research must be realigned to exploit this hierarchy. (5) When possible, mathematical libraries must be used to encapsulate the required operations in an efficient and useful way. (6) Software tools must be developed to make the new hardware more usable. (7) Science application software must be improved to cope with the increasing complexity of computing systems. (8) Data management efforts must be readied for the larger quantities of data generated by larger, more accurate science models. Requirements elicitation, analysis, validation, and management comprise a difficult and inexact process, particularly in periods of technological change. Nonetheless, the OLCF requirements modeling process is becoming increasingly quantitative and actionable, as the process becomes more developed and mature, and the process this year has identified clear and concrete steps to be taken. This report discloses (1) the fundamental science case driving the need for the next generation of computer hardware, (2) application usage trends that illustrate the science need, (3) application performance characteristics that drive the need for increased hardware capabilities, (4) resource and process requirements that make the development and deployment of science applications on next-generation hardware successful, and (5) summary recommendations for the required next steps within the computer and computational science communities.

applications requirements↗

Hybrid quantum-classical approach for coupled-cluster Green's function theory

The three key elements of a quantum simulation are state preparation, time evolution, and measurement. While the complexity scaling of time evolution and measurements are well known, many state preparation methods are strongly system-dependent and require prior knowledge of the system's eigenvalue spectrum. Here, we report on a quantum-classical implementation of the coupled-cluster Green's function (CCGF) method, which replaces explicit ground state preparation with the task of applying unitary operators to a simple product state. While our approach is broadly applicable to many models, we demonstrate it here for the Anderson impurity model (AIM). The method requires a number of T gates that grows as O ( N 5 ) per time step to calculate the impurity Green's function in the time domain, where N is the total number of energy levels in the AIM. Since the number of T gates is analogous to the computational time complexity of a classical simulation, we achieve an order of magnitude improvement over a classical CCGF calculation of the same order, which requires O ( N 6 ) computational resources per time step.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Study of sensor spectral responses and data processing algorithms and architectures for onboard feature identification

A computational model of the deterministic and stochastic processes involved in remote sensing is used to study spectral feature identification techniques for real-time onboard processing of data acquired with advanced earth-resources sensors. Preliminary results indicate that: Narrow spectral responses are advantageous; signal normalization improves mean-square distance (MSD) classification accuracy but tends to degrade maximum-likelihood (MLH) classification accuracy; and MSD classification of normalized signals performs better than the computationally more complex MLH classification when imaging conditions change appreciably from those conditions during which reference data were acquired. The results also indicate that autonomous categorization of TM signals into vegetation, bare land, water, snow and clouds can be accomplished with adequate reliability for many applications over a reasonably wide range of imaging conditions. However, further analysis is required to develop computationally efficient boundary approximation algorithms for such categorization.

Huck, F. O.↗

Using Numba for GPU acceleration of Neutron Beamline Digital Twins

Digital twins of neutron instruments using Monte Carlo ray tracing have proven to be useful in neutron data analysis and verifying instrument and sample designs. However, these simulations can become quite complex and computationally demanding with tens of billions of neutrons. In this paper, we present a GPU accelerated version of MCViNE using Python and Numba to balance user extensibility with performance. Numba is an open-source just-in-time (JIT) compiler for Python using LLVM to generate efficient machine code for CPUs and GPUs with NVIDIA CUDA. The JIT nature of Numba allowed complex instrument kernels to be generated easily. Initial simulations have shown a speedup between 200-1000x over the original CPU implementation. The performance gain with Numba enables more sophisticated data analysis and impacts neutron scattering science and instrument design.

Kendrick, Coleman↗

Compiled MPI: Cost-Effective Exascale Applications Development

The complexity of petascale and exascale machines makes it increasingly difficult to develop applications that can take advantage of them. Future systems are expected to feature billion-way parallelism, complex heterogeneous compute nodes and poor availability of memory (Peter Kogge, 2008). This new challenge for application development is motivating a significant amount of research and development on new programming models and runtime systems designed to simplify large-scale application development. Unfortunately, DoE has significant multi-decadal investment in a large family of mission-critical scientific applications. Scaling these applications to exascale machines will require a significant investment that will dwarf the costs of hardware procurement. A key reason for the difficulty in transitioning today's applications to exascale hardware is their reliance on explicit programming techniques, such as the Message Passing Interface (MPI) programming model to enable parallelism. MPI provides a portable and high performance message-passing system that enables scalable performance on a wide variety of platforms. However, it also forces developers to lock the details of parallelization together with application logic, making it very difficult to adapt the application to significant changes in the underlying system. Further, MPI's explicit interface makes it difficult to separate the application's synchronization and communication structure, reducing the amount of support that can be provided by compiler and run-time tools. This is in contrast to the recent research on more implicit parallel programming models such as Chapel, OpenMP and OpenCL, which promise to provide significantly more flexibility at the cost of reimplementing significant portions of the application. We are developing CoMPI, a novel compiler-driven approach to enable existing MPI applications to scale to exascale systems with minimal modifications that can be made incrementally over the application's lifetime. It includes: (1) New set of source code annotations, inserted either manually or automatically, that will clarify the application's use of MPI to the compiler infrastructure, enabling greater accuracy where needed; (2) A compiler transformation framework that leverages these annotations to transform the original MPI source code to improve its performance and scalability; (3) Novel MPI runtime implementation techniques that will provide a rich set of functionality extensions to be used by applications that have been transformed by our compiler; and (4) A novel compiler analysis that leverages simple user annotations to automatically extract the application's communication structure and synthesize most complex code annotations.

97 MATHEMATICS AND COMPUTING↗

Revealing the nature of electron correlation in transition metal complexes with symmetry breaking and chemical intuition

Here, in this work, we provide a nuanced view of electron correlation in the context of transition metal complexes, reconciling computational characterization via spin and spatial symmetry breaking in single-reference methods with qualitative concepts from ligand-field and molecular orbital theories. These insights provide the tools to reliably diagnose the multi-reference character, and our analysis reveals that while strong (i.e., static) correlation can be found in linear molecules (e.g., diatomics) and weakly bound and antiferromagnetically coupled (monometal-noninnocent ligand or multi-metal) complexes, it is rarely found in the ground-states of mono-transition-metal complexes. This leads to a picture of static correlation that is no more complex for transition metals than it is, e.g., for organic biradicaloids. In contrast, the ability of organometallic species to form more complex interactions, involving both ligand-to-metal σ-donation and metal-to-ligand π-backdonation, places a larger burden on a theory's treatment of dynamic correlation. We hypothesize that chemical bonds in which inter-electron pair correlation is non-negligible cannot be adequately described by theories using MP2 correlation energies and indeed find large errors vs experiment for carbonyl-dissociation energies from double-hybrid density functionals. A theory's description of dynamic correlation (and to a less important extent, delocalization error), which affects relative spin-state energetics and thus spin symmetry breaking, is found to govern the efficacy of its use to diagnose static correlation.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

GAHLS: an optimized graph analytics based high level synthesis framework

The urgent need for low latency, high-compute and low power on-board intelligence in autonomous systems, cyber-physical systems, robotics, edge computing, evolvable computing, and complex data science calls for determining the optimal amount and type of specialized hardware together with reconfigurability capabilities. With these goals in mind, we propose a novel comprehensive graph analytics based high level synthesis (GAHLS) framework that efficiently analyzes complex high level programs through a combined compiler-based approach and graph theoretic optimization and synthesizes them into message passing domain-specific accelerators. This GAHLS framework first constructs a compiler-assisted dependency graph (CaDG) from low level virtual machine (LLVM) intermediate representation (IR) of high level programs and converts it into a hardware friendly description representation. Next, the GAHLS framework performs a memory design space exploration while account for the identified computational properties from the CaDG and optimizing the system performance for higher bandwidth. The GAHLS framework also performs a robust optimization to identify the CaDG subgraphs with similar computational structures and aggregate them into intelligent processing clusters in order to optimize the usage of underlying hardware resources. Finally, the GAHLS framework synthesizes this compressed specialized CaDG into processing elements while optimizing the system performance and area metrics. Evaluations of the GAHLS framework on several real-life applications (e.g., deep learning, brain machine interfaces) demonstrate that it provides 14.27× performance improvements compared to state-of-the-art approaches such as LegUp 6.2.

97 MATHEMATICS AND COMPUTING↗

Dynamic Load Balancing for Computational Plasticity on Parallel Computers

The simulation of the computational plasticity on a complex structure remains a formidable computational task, especially when a highly nonlinear, complex material model was used. It appears that the computational requirements for a such problem can only be satisfied by massively parallel architectures. In order to effectively harness the tremendous computational power provided by such architectures, it is imperative to investigate and to study the algorithmic and implementation issues pertaining to dynamic load balancing for computational plasticity on a highly parallel, distributed-memory, multiple-instruction, multiple-data computers. This paper will measure the effectiveness of the algorithms developed in handling the dynamic load balancing.

Pramono, Eddy↗

NASCAP, a three-dimensional Charging Analyzer Program for complex spacecraft

A computer code, NASCAP (NASA Charging Analyzer Program), has been developed by Systems, Science and Software under contract to NASA-LeRC to simulate the charging of a complex spacecraft in geosynchronous orbit. The capabilities of the NASCAP code include a fully three-dimensional solution of Poisson's equation about an object having considerable geometrical and material complexity, particle tracking, shadowing in sunlight, calculation of secondary emission, backscatter and photoemission, and graphical output. A model calculation shows how the NASCAP code may be used to improve our understanding of the spacecraft-plasma interaction.

Katz, I.↗

MO-G-BRF-01: BEST IN PHYSICS (JOINT IMAGING-THERAPY) - Sensitivity of PET-Based Texture Features to Respiratory Motion in Non-Small Cell Lung Cancer (NSCLC)

Purpose: PET-based texture features are used to quantify tumor heterogeneity due to their predictive power in treatment outcome. We investigated the sensitivity of texture features to tumor motion by comparing whole body (3D) and respiratory-gated (4D) PET imaging. Methods: Twenty-six patients (34 lesions) received 3D and 4D [F-18]FDG-PET scans before chemo-radiotherapy. The acquired 4D data were retrospectively binned into five breathing phases to create the 4D image sequence. Four texture features (Coarseness, Contrast, Busyness, and Complexity) were computed within the the physician-defined tumor volume. The relative difference (δ) in each measure between the 3D- and 4D-PET imaging was calculated. Wilcoxon signed-rank test (p<0.01) was used to determine if δ was significantly different from zero. Coefficient of variation (CV) was used to determine the variability in the texture features between all 4D-PET phases. Pearson correlation coefficient was used to investigate the impact of tumor size and motion amplitude on δ. Results: Significant differences (p<<0.01) between 3D and 4D imaging were found for Coarseness, Busyness, and Complexity. The difference for Contrast was not significant (p>0.24). 4D-PET increased Busyness (∼20%) and Complexity (∼20%), and decreased Coarseness (∼10%) and Contrast (∼5%) compared to 3D-PET. Nearly negligible variability (CV=3.9%) was found between the 4D phase bins for Coarseness and Complexity. Moderate variability was found for Contrast and Busyness (CV∼10%). Poor correlation was found between the tumor volume and δ for the texture features (R=−0.34−0.34). Motion amplitude had moderate impact on δ for Contrast and Busyness (R=−0.64− 0.54) and no impact for Coarseness and Complexity (R=−0.29−0.17). Conclusion: Substantial differences in textures were found between 3D and 4D-PET imaging. Moreover, the variability between phase bins for Coarseness and Complexity was negligible, suggesting that similar quantification can be obtained from all phases. Texture features, blurred out by respiratory motion during 3D-PET acquisition, can be better resolved by 4D-PET imaging with any phase.

60 APPLIED LIFE SCIENCES↗

Projective toric polynomial generators in the unitary cobordism ring

According to Milnor and Novikov's classical result, the unitary cobordism ring is isomorphic to a graded polynomial ring with countably many generators: Ω{sub ∗}{sup U}≃Z[a{sub 1},a{sub 2},…], deg(a{sub i})=2i. In this paper we solve the well-known problem of constructing geometric representatives for the a{sub i} among smooth projective toric varieties, a{sub n}=[X{sup n}], dim{sub C} X{sup n}=n. Our proof uses a family of equivariant modifications (birational isomorphisms) B{sub k}(X)→X of an arbitrary complex manifold X of complex dimension n (n≥2, k=0,…,n−2). The key fact is that the change of the Milnor number under these modifications depends only on the dimension n and the number k and does not depend on the manifold X itself. Bibliography: 22 titles. (paper)

97 MATHEMATICS AND COMPUTING↗

A finite element approach for solution of the 3D Euler equations

Prediction of thermal deformations and stresses has prime importance in the design of the next generation of high speed flight vehicles. Aerothermal load computations for complex three-dimensional shapes necessitate development of procedures to solve the full Navier-Stokes equations. This paper details the development of a three-dimensional inviscid flow approach which can be extended for three-dimensional viscous flows. A finite element formulation, based on a Taylor series expansion in time, is employed to solve the compressible Euler equations. Model generation and results display are done using a commercially available program, PATRAN, and vectorizing strategies are incorporated to ensure computational efficiency. Sample problems are presented to demonstrate the validity of the approach for analyzing high speed compressible flows.

Thornton, E. A.↗

Generalized fractional approach to solving partial differential equations with arbitrary dispersion relations

The dynamics of physical systems are typically modeled by partial differential equations (PDEs). Because of the complexity in physical systems, PDE models rely on approximations or limiting cases. To model the full complexity of physical systems, it is necessary to use multiscale approaches where appropriate models are used at each level. Alternatively, complexity can be directly tackled by fractional integrodifferential equations that must be derived for each system. Here, we argue that complexity can be restored in PDEs by describing them from a fractional calculus perspective. Rather than deriving a fractional integrodifferential equation, we reinterpret the dispersion relation of the system by use of the Riesz definition, which contains the required information relating the energy and momentum space of the system and thus fully describes their dynamics. The approach is demonstrated by two examples: the Landau–Lifshitz equation in a 1D ferromagnetic chain and a modified KdV equation supporting surface gravity waves or Euler dispersion. The presented approach is applicable to fluids, soft matter, and solid-state matter and can be readily generalized to higher dimensions and more complex systems. While numerical calculations are needed to determine the fractional operator, the approach is analytical and can be utilized to determine analytical solutions and investigate nonlinear problems.

97 MATHEMATICS AND COMPUTING↗

A Posteriori Analysis of Adaptive Multiscale Operator Decomposition Methods for Multiphysics Problems

This project was concerned with the accurate computational error estimation for numerical solutions of multiphysics, multiscale systems that couple different physical processes acting across a large range of scales relevant to the interests of the DOE. Multiscale, multiphysics models are characterized by intimate interactions between different physics across a wide range of scales. This poses significant computational challenges addressed by the proposal, including: (1) Accurate and efficient computation; (2) Complex stability; and (3) Linking different physics. The research in this project focused on Multiscale Operator Decomposition methods for solving multiphysics problems. The general approach is to decompose a multiphysics problem into components involving simpler physics over a relatively limited range of scales, and then to seek the solution of the entire system through some sort of iterative procedure involving solutions of the individual components. MOD is a very widely used technique for solving multiphysics, multiscale problems; it is heavily used throughout the DOE computational landscape. This project made a major advance in the analysis of the solution of multiscale, multiphysics problems.

97 MATHEMATICS AND COMPUTING↗