Search NASA⌕ Search

SEARCH · Search NASA

Results for “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,729 records · Page 96

Minimizing Error Potential Using Computer Applications - 18498

Many Savannah River Site (SRS) liquid waste facility operations depend upon repetitive engineering calculations and operator actions. Although these calculations and actions are formalized in technical reports and paper procedures, they can still be vulnerable to data entry errors, calculation errors, equipment alignment errors, and occasional changes caused by different people performing these activities. Savannah River Remediation (SRR) is using computer automation to reduce these error precursors by standardizing repetitive calculations and by performing plant alignment checks for repetitive operation processes. Data entry can be automated, calculation methodologies can be standardized, and computers can check to see that predefined plant conditions exist before equipment operation. In addition to improving quality, the time required for these activities to generate technical reports, to perform independent reviews, and to perform equipment alignment checks can be significantly reduced. In the case of operator-performed calculations, error precursors involve distractions that can occur over a multi-page paper procedure, confusing displays and controls from equipment, mathematical errors, complacency, and unfamiliarity with the procedure among many others. Repetitive engineering calculations suffer from similar error precursors and are often compounded by high workloads, lack of proficiency, lack of standard methodology, mental shortcuts, and biases. Web-based computer applications can eliminate many of these precursors through standardization. Calculation methods are fixed, inputs are fixed, and computer checks can highlight potentially wrong inputs and outputs. Automated calculations are performed almost instantaneously once input is provided. Operators and engineers can spend more time focusing on the results than on the process to achieve the results. Similarly, when operators use repetitive procedures involving equipment manipulation, the same error precursors apply. Automated operation sequences and equipment checks can be programmed into the distributed control system to provide standard operating processes that reduce and eliminate error precursors. This paper describes how SRR incorporates Human Performance Improvement (HPI) principles when automating calculations and operation processes. Computer applications will be reviewed in detail, highlighting the software development life-cycle that includes requirements gathering, prototyping, design, development, testing, and implementation. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Parallel Monte Carlo Methods for Heterogeneous Hardware Computer Systems Using GPUs and Coprocessors: Recent Development of ARCHER Code - Paper 54

Traditional methods of accelerating Monte Carlo (MC) calculations typically use CPUs as the computing unit. The parallelism is based upon multithreading on a multi-core processor, and message passing interface (MPI) across many processors and nodes. In recent years, the hardware accelerators have been introduced by the high performance computing industry as an alternative approach to achieve massive parallelism. Hardware accelerators have the advantage of high Floating-point Operations Per Second (FLOPS) and high energy efficiency. Examples include graphics processing units (GPUs) and coprocessors. Compute-intensive programs can be off-loaded to them to be concurrently executed by hundreds or thousands of active threads. Existing production MC codes, however, cannot be directly compiled or executed on the new platforms. It is therefore necessary to rewrite or redevelop the code using the hardware accelerator specific programming models and APIs. Several studies have been conducted on using GPUs to accelerate MC calculations in reactor analysis and medical physics. In this paper, we present the recent progress at Rensselaer Polytechnic Institute (RPI) in developing a new parallel MC code called ARCHER (Accelerated Radiation-transport Computations in Heterogeneous Environments) for coupled photon-electron transport simulations. The code is designed as a test bed to evaluate the efficacy of heterogeneous computing systems for low-cost MC-based radiation dosimetric calculations. The code has three variants corresponding to three parallel hardware platforms: ARCHER-CPU (multi-core CPU), ARCHER-GPU (Nvidia GPU) and ARCHER-COP (Intel Xeon Phi coprocessor). The code has been used for several applications, including CT imaging dosimetry, radiotherapy dosimetry and radiation shielding design. (authors)

61 RADIATION PROTECTION AND DOSIMETRY↗

SEISMIC SIMULATIONS USING PARALLEL COMPUTING AND THREE-DIMENSIONAL EARTH MODELS TO IMPROVE NUCLEAR EXPLOSION PHENOMENOLOGY AND MONITORING

The development of accurate numerical methods to simulate wave propagation in three-dimensional (3D) earth models and advances in computational power offer exciting possibilities for modeling the motions excited by underground nuclear explosions. This presentation will describe recent work to use new numerical techniques and parallel computing to model earthquakes and underground explosions to improve understanding of the wave excitation at the source and path-propagation effects. Firstly, we are using the spectral element method (SEM, SPECFEM3D code of Komatitsch and Tromp, 2002) to model earthquakes and explosions at regional distances using available 3D models. SPECFEM3D simulates anelastic wave propagation in fully 3D earth models in spherical geometry with the ability to account for free surface topography, anisotropy, ellipticity, rotation and gravity. Results show in many cases that 3D models are able to reproduce features of the observed seismograms that arise from path-propagation effects (e.g. enhanced surface wave dispersion, refraction, amplitude variations from focusing and defocusing, tangential component energy from isotropic sources). We are currently investigating the ability of different 3D models to predict path-specific seismograms as a function of frequency. A number of models developed using a variety of methodologies are available for testing. These include the WENA/Unified model of Eurasia (e.g. Pasyanos et al 2004), the global CUB 2.0 model (Shapiro and Ritzwoller, 2002), the partitioned waveform model for the Mediterranean (van der Lee et al., 2007) and stochastic models of the Yellow Sea Korean Peninsula region (Pasyanos et al., 2006). Secondly, we are extending our Cartesian anelastic finite difference code (WPP of Nilsson et al., 2007) to model the effects of free-surface topography. WPP models anelastic wave propagation in fully 3D earth models using mesh refinement to increase computational speed and improve memory efficiency. Thirdly, we are modeling non-linear near-source shock wave propagation with GEODYN, an Eulerian Godunov finite-difference code (Antoun et al., 2001). This code accounts for shock wave propagation and a variety of effects including cavity formation, rock fracture and plastic deformation. We are exploring the coupling of GEODYN to WPP to propagate motions from the near-source (non-linear) region to the (linear anelastic) region where seismic observations are made at local, regional and teleseismic distances. This effort has just begun and we show preliminary results in this paper (with more to follow in our poster). These simulation tools are supported by massively parallel computers operated by Livermore Computing.

58 GEOSCIENCES↗

Computational Modeling of Blood Flow in the TrapEase Inferior Vena Cava Filter

To evaluate the flow hemodynamics of the TrapEase vena cava filter using three dimensional computational fluid dynamics, including simulated thrombi of multiple shapes, sizes, and trapping positions. The study was performed to identify potential areas of recirculation and stagnation and areas in which trapped thrombi may influence intrafilter thrombosis. Computer models of the TrapEase filter, thrombi (volumes ranging from 0.25mL to 2mL, 3 different shapes), and a 23mm diameter cava were constructed. The hemodynamics of steady-state flow at Reynolds number 600 was examined for the unoccluded and partially occluded filter. Axial velocity contours and wall shear stresses were computed. Flow in the unoccluded TrapEase filter experienced minimal disruption, except near the superior and inferior tips where low velocity flow was observed. For spherical thrombi in the superior trapping position, stagnant and recirculating flow was observed downstream of the thrombus; the volume of stagnant flow and the peak wall shear stress increased monotonically with thrombus volume. For inferiorly trapped spherical thrombi, marked disruption to the flow was observed along the cava wall ipsilateral to the thrombus and in the interior of the filter. Spherically shaped thrombus produced a lower peak wall shear stress than conically shaped thrombus and a larger peak stress than ellipsoidal thrombus. We have designed and constructed a computer model of the flow hemodynamics of the TrapEase IVC filter with varying shapes, sizes, and positions of thrombi. The computer model offers several advantages over in vitro techniques including: improved resolution, ease of evaluating different thrombus sizes and shapes, and easy adaptation for new filter designs and flow parameters. Results from the model also support a previously reported finding from photochromic experiments that suggest the inferior trapping position of the TrapEase IVC filter leads to an intra-filter region of recirculating/stagnant flow with very low shear stress that may be thrombogenic.

42 ENGINEERING↗

Validation of Broadly Filtered Diagonalization Method for Extracting Frequencies and Modes from High-Performance Computations

Recent developments have shown that one can get around the difficulties of finding the eigenvalues and eigenmodes of the large systems studied with high performance computation by using broadly filtered diagonalization [G. R. Werner and J. R. Cary, J. Compo Phys. 227, 5200 (2008)]. This method can be used in conjunction with any time-domain computation, in particular those that scale very well up to 10000s of processors and beyond. Here we present results that show that this method accurately obtains both modes and frequencies of electromagnetic cavities, even when frequencies are nearly degenerate. The application was to a well-characterized Kaon separator cavity, the A15. The computations are shown to have a precision to a few parts in 10{sup 5}. Because the computed frequency differed from the measured frequency by more than this amount, a careful validation study to determine all sources of difference was undertaken. Ultimately, more precise measurements of the cavity showed that the computations were correct, with remaining differences accounted for by uncertainties in cavity dimensions and atmospheric and thermal conditions. Thus, not only was the method validated, but it was shown to have the ability to predict differences in cavity dimensions from fabrication specifications.

99 GENERAL AND MISCELLANEOUS↗

Challenges for the CMS computing model in the first year

CMS is in the process of commissioning a complex detector and a globally distributed computing infrastructure simultaneously. This represents a unique challenge. Even at the beginning there is not sufficient analysis or organized processing resources at CERN alone. In this presentation we discuss the unique computing challenges CMS expects to face during the first year of running and how they influence the baseline computing model decisions. During the early accelerator commissioning periods, CMS will attempt to collect as many events as possible when the beam is on in order to provide adequate early commissioning data. Some of these plans involve overdriving the Tier-0 infrastructure during data collection with recovery when the beam is off. In addition to the larger number of triggered events, there will be pressure in the first year to collect and analyze more complete data formats as the summarized formats mature. The large event formats impact the required storage, bandwidth, and processing capacity across all the computing centers. While the understanding of the detector and the event selections is being improved, there will likely be a larger number of reconstruction passes and skims performed by both central operations and individual users. We discuss how these additional stresses impact the allocation of resources and the changes from the baseline computing model.

99 GENERAL AND MISCELLANEOUS↗

A multi-purpose computing center: FNAL

The Fermilab Computing Center is described with a special emphasis given to the scientific computing systems and the data storage and archiving systems. The scope and focus of this paper is the Fermilab scientific computing facility. It does not cover, or does not cover very well, related issues such as data Grids, cloud computing and storage, commercial storage, data integrity, authorization, access rates, and novel storage technologies. These are all important considerations in discussing data centers and should be kept in mind when one explores issues related to computing centers and long-term data storage.

99 GENERAL AND MISCELLANEOUS↗

Methods and apparatus using commutative error detection values for fault isolation in multiple node computers

Methods and apparatus perform fault isolation in multiple node computing systems using commutative error detection values for--example, checksums--to identify and to isolate faulty nodes. When information associated with a reproducible portion of a computer program is injected into a network by a node, a commutative error detection value is calculated. At intervals, node fault detection apparatus associated with the multiple node computer system retrieve commutative error detection values associated with the node and stores them in memory. When the computer program is executed again by the multiple node computer system, new commutative error detection values are created and stored in memory. The node fault detection apparatus identifies faulty nodes by comparing commutative error detection values associated with reproducible portions of the application program generated by a particular node from different runs of the application program. Differences in values indicate a possible faulty node.

97 MATHEMATICS AND COMPUTING↗

Identifying messaging completion in a parallel computer by checking for change in message received and transmitted count at each node

Methods, parallel computers, and products are provided for identifying messaging completion on a parallel computer. The parallel computer includes a plurality of compute nodes, the compute nodes coupled for data communications by at least two independent data communications networks including a binary tree data communications network optimal for collective operations that organizes the nodes as a tree and a torus data communications network optimal for point to point operations that organizes the nodes as a torus. Embodiments include reading all counters at each node of the torus data communications network; calculating at each node a current node value in dependence upon the values read from the counters at each node; and determining for all nodes whether the current node value for each node is the same as a previously calculated node value for each node. If the current node is the same as the previously calculated node value for all nodes of the torus data communications network, embodiments include determining that messaging is complete and if the current node is not the same as the previously calculated node value for all nodes of the torus data communications network, embodiments include determining that messaging is currently incomplete.

97 MATHEMATICS AND COMPUTING↗

A framework for characterizing overlap of communication and computation in parallel applications.

Effective overlap of computation and communication is a well understood technique for latency hiding and can yield significant performance gains for applications on high-end computers. In this paper, we propose an instrumentation framework for message-passing systems to characterize the degree of overlap of communication with computation in the execution of parallel applications. The inability to obtain precise time-stamps for pertinent communication events is a significant problem, and is addressed by generation of minimum and maximum bounds on achieved overlap. The overlap measures can aid application developers and system designers in investigating scalability issues. The approach has been used to instrument two MPI implementations as well as the ARMCI system. The implementation resides entirely within the communication library and thus integrates well with existing approaches that operate outside the library. The utility of the framework is demonstrated by analyzing communication-computation overlap for micro-benchmarks and the NAS benchmarks, and the insights obtained are used to modify the NAS SP benchmark, resulting in improved overlap.

97 MATHEMATICS AND COMPUTING↗

Monitoring installation of partially occluded subassemblies in modular construction factories using BIM, ray tracing, and computer vision

Modular and offsite construction methods are being increasingly adopted due to the advantages they offer in terms of project completion time, quality, and energy-efficiency. Despite these advantages, the current state of monitoring systems in modular construction factories highly relies on labor-intensive, subjective, and error-prone observational methods. A large body of research has aimed to automate the monitoring process using an array of sensors, such as IMUs and RFIDs, during the past two decades. Recently, computer vision-based methods have gained increasing interest as a non-intrusive technology to monitor the process inside modular construction factories. However, partial occlusion challenges have impeded their practical application on a large scale. This challenge is specifically important for monitoring the installation of subassemblies since they can obstruct the view of the monitoring camera, especially those that enable long-term monitoring like closed-circuit television (CCTV) fixed-view surveillance cameras. Here, this paper aims to address this challenge by proposing a novel computer vision-based method to monitor the installation of new subassemblies inside modular factories in highly occluded scenes. The proposed methodology identifies the subassemblies in the CCTV video footage using computer vision, analyzes the occlusions using BIM and ray casting techniques, and estimates the progress of assembly by comparing the BIM model with the detected subassemblies in the video. The proposed methodology was successfully validated on surveillance videos captured from a volumetric modular construction factory in the U.S., achieving 93% accuracy in identifying the installation of subassemblies. The results from this research show that the integration of BIM and computer vision is a promising method for monitoring the installation processes inside modular factories under severe occlusion.

97 MATHEMATICS AND COMPUTING↗

Quantum computation with Turaev-Viro codes

For a 3-manifold with triangulated boundary, the Turaev-Viro topological invariant can be interpreted as a quantum error-correcting code. The code has local stabilizers, identified by Levin and Wen, on a qudit lattice. Kitaev's toric code arises as a special case. The toric code corresponds to an abelian anyon model, and therefore requires out-of-code operations to obtain universal quantum computation. In contrast, for many categories, such as the Fibonacci category, the Turaev-Viro code realizes a non-abelian anyon model. A universal set of fault-tolerant operations can be implemented by deforming the code with local gates, in order to implement anyon braiding. We identify the anyons in the code space, and present schemes for initialization, computation and measurement. This provides a family of constructions for fault-tolerant quantum computation that are closely related to topological quantum computation, but for which the fault tolerance is implemented in software rather than coming from a physical medium.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Parallel quantum computing simulations via quantum accelerator platform virtualization

Quantum circuit execution is a central task in quantum computation. Due to inherent quantum-mechanical constraints, quantum computing workflows often involve a considerable number of independent measurements over a large set of slightly different quantum circuits. Here we discuss a simple model for parallelizing such quantum circuit executions that is based on introducing a large array of virtual quantum processing units (mapped to HPC nodes in our case) as a parallel quantum computing platform. Implemented within the XACC framework, the model can readily take advantage of its backend-agnostic features, enabling parallel quantum computing/simulation over any target backend supported by XACC. We illustrate the performance of this approach by demonstrating strong scaling in two pertinent domain science problems, namely in computing the gradients for the multi-contracted variational quantum eigensolver and in data-driven quantum circuit learning, where we vary the number of qubits and the number of circuit layers. Here, the latter simulation leverages the cuQuantum library to run efficiently on GPU-accelerated HPC platforms.

97 MATHEMATICS AND COMPUTING↗

Π4U: A high performance computing framework for Bayesian uncertainty quantification of complex models

We present Π4U,{sup 1} an extensible framework, for non-intrusive Bayesian Uncertainty Quantification and Propagation (UQ+P) of complex and computationally demanding physical models, that can exploit massively parallel computer architectures. The framework incorporates Laplace asymptotic approximations as well as stochastic algorithms, along with distributed numerical differentiation and task-based parallelism for heterogeneous clusters. Sampling is based on the Transitional Markov Chain Monte Carlo (TMCMC) algorithm and its variants. The optimization tasks associated with the asymptotic approximations are treated via the Covariance Matrix Adaptation Evolution Strategy (CMA-ES). A modified subset simulation method is used for posterior reliability measurements of rare events. The framework accommodates scheduling of multiple physical model evaluations based on an adaptive load balancing library and shows excellent scalability. In addition to the software framework, we also provide guidelines as to the applicability and efficiency of Bayesian tools when applied to computationally demanding physical models. Theoretical and computational developments are demonstrated with applications drawn from molecular dynamics, structural dynamics and granular flow.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Multinucleon structure and dynamics via quantum computing

We propose a framework for computing the structure and dynamics for second-quantized many-nucleon Hamiltonians on quantum computers. We develop an oracle-based Hamiltonian input model that computes the many-nucleon states and nonzero Hamiltonian matrix elements of the many-nucleon system. With our Fock-state based input model, we show how to implement the sparse matrix simulation algorithms to calculate the dynamics of the second-quantized many-nucleon Hamiltonian. Based on the dynamics simulation methods, we also present the methodology for structure calculations of the many-nucleon system. In this work, we provide an explicit circuit design of our input model of the second-quantized Hamiltonian within a direct encoding scheme that maps the occupation of each available single-particle state in the many-nucleon state to the state of specific qubit in a quantum register. Here, we analyze our method and provide the asymptotic cost in computing resources for structure and dynamics calculations of many-nucleon systems. For pedagogical purposes, we demonstrate our input model with two model problems in restricted model spaces.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Entanglement-fidelity relations for inaccurate ancilla-driven quantum computation

It was shown by T. Morimae [Phys. Rev. A 81, 060307(R) (2010)] that the gate fidelity of an inaccurate one-way quantum computation is upper bounded by a decreasing function of the amount of entanglement in the register. This means that a strong entanglement causes the low gate fidelity in the one-way quantum computation with inaccurate measurements. In this paper, we derive similar entanglement-fidelity relations for the inaccurate ancilla-driven quantum computation. These relations again imply that a strong entanglement in the register causes the low gate fidelity in the ancilla-driven quantum computation if the measurements on the ancilla are inaccurate.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

XaaS: Acceleration as a Service to Enable Productive High-Performance Cloud Computing

High-performance computing (HPC) and the cloud have evolved independently, specializing their innovations into performance or productivity. Acceleration as a Service (XaaS) is a recipe to empower both fields with a shared execution platform that provides transparent access to computing resources, regardless of the underlying cloud or HPC service provider. Bridging HPC and cloud advancements, XaaS presents a unified architecture built on performance-portable containers. Here, our converged model concentrates on low-overhead, high-performance communication and computing, targeting resource-intensive workloads from climate simulations to machine learning. XaaS lifts the restricted allocation model of Function as a Service (FaaS), allowing users to benefit from the flexibility and efficient resource utilization of serverless computing while supporting long-running and performance-sensitive workloads from HPC.

97 MATHEMATICS AND COMPUTING↗

Combinatorial Algorithms to Enable Computational Science and Engineering: Work from the CSCAPES Institute

This final progress report summarizes the work accomplished at the Combinatorial Scientific Computing and Petascale Simulations Institute. We developed Zoltan, a parallel mesh partitioning library that made use of accurate hypergraph models to provide load balancing in mesh-based computations. We developed several graph coloring algorithms for computing Jacobian and Hessian matrices and organized them into a software package called ColPack. We developed parallel algorithms for graph coloring and graph matching problems, and also designed multi-scale graph algorithms. Three PhD students graduated, six more are continuing their PhD studies, and four postdoctoral scholars were advised. Six of these students and Fellows have joined DOE Labs (Sandia, Berkeley), as staff scientists or as postdoctoral scientists. We also organized the SIAM Workshop on Combinatorial Scientific Computing (CSC) in 2007, 2009, and 2011 to continue to foster the CSC community.

97 MATHEMATICS AND COMPUTING↗