Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “parallel machines”

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 829 records · Page 46
All sourcesNASA NTRSDOE OSTI
NASA NTRS2000

On the Computational Capabilities of Physical Systems: The Impossibility of Infallible Computation - Part 1

In this first of two papers, strong limits on the accuracy of physical computation are established. First it is proven that there cannot be a physical computer C to which one can pose any and all computational tasks concerning the physical universe. Next it is proven that no physical computer C can correctly carry out any computational task in the subset of such tasks that can be posed to C. This result holds whether the computational tasks concern a system that is physically isolated from C, or instead concern a system that is coupled to C. As a particular example, this result means that there cannot be a physical computer that can, for any physical system external to that computer, take the specification of that external system's state as input and then correctly predict its future state before that future state actually occurs; one cannot build a physical computer that can be assured of correctly 'processing information faster than the universe does'. The results also mean that there cannot exist an infallible, general-purpose observation apparatus, and that there cannot be an infallible, general-purpose control apparatus. These results do not rely on systems that are infinite, and/or non-classical, and/or obey chaotic dynamics. They also hold even if one uses an infinitely fast, infinitely dense computer, with computational powers greater than that of a Turing Machine. This generality is a direct consequence of the fact that a novel definition of computation - a definition of 'physical computation' - is needed to address the issues considered in these papers. While this definition does not fit into the traditional Chomsky hierarchy, the mathematical structure and impossibility results associated with it have parallels in the mathematics of the Chomsky hierarchy. The second in this pair of papers presents a preliminary exploration of some of this mathematical structure, including in particular that of prediction complexity, which is a 'physical computation analogue' of algorithmic information complexity. It is proven in that second paper that either the Hamiltonian of our universe proscribes a certain type of computation, or prediction complexity is unique (unlike algorithmic information complexity), in that there is one and only version of it that can be applicable throughout our universe.

Wolpert, David H.↗
NASA NTRS2001

NAS Grid Benchmarks: A Tool for Grid Space Exploration

We present an approach for benchmarking services provided by computational Grids. It is based on the NAS Parallel Benchmarks (NPB) and is called NAS Grid Benchmark (NGB) in this paper. We present NGB as a data flow graph encapsulating an instance of an NPB code in each graph node, which communicates with other nodes by sending/receiving initialization data. These nodes may be mapped to the same or different Grid machines. Like NPB, NGB will specify several different classes (problem sizes). NGB also specifies the generic Grid services sufficient for running the bench-mark. The implementor has the freedom to choose any specific Grid environment. However, we describe a reference implementation in Java, and present some scenarios for using NGB.

Frumkin, Michael↗
NASA NTRS1998

High Performance Parallel Architectures

Traditional remote sensing instruments are multispectral, where observations are collected at a few different spectral bands. Recently, many hyperspectral instruments, that can collect observations at hundreds of bands, have been operational. Furthermore, there have been ongoing research efforts on ultraspectral instruments that can produce observations at thousands of spectral bands. While these remote sensing technology developments hold great promise for new findings in the area of Earth and space science, they present many challenges. These include the need for faster processing of such increased data volumes, and methods for data reduction. Dimension Reduction is a spectral transformation, aimed at concentrating the vital information and discarding redundant data. One such transformation, which is widely used in remote sensing, is the Principal Components Analysis (PCA). This report summarizes our progress on the development of a parallel PCA and its implementation on two Beowulf cluster configuration; one with fast Ethernet switch and the other with a Myrinet interconnection. Details of the implementation and performance results, for typical sets of multispectral and hyperspectral NASA remote sensing data, are presented and analyzed based on the algorithm requirements and the underlying machine configuration. It will be shown that the PCA application is quite challenging and hard to scale on Ethernet-based clusters. However, the measurements also show that a high- performance interconnection network, such as Myrinet, better matches the high communication demand of PCA and can lead to a more efficient PCA execution.

El-Ghazawi, Tarek↗
NASA NTRS2014

Coupled CFD-Thermal Analysis of Erosion Patterns Resulting from Nozzle Wedgeouts on the SRTMV-N2

The objective of this analysis was to study the effects of the erosion patterns from the introduction of nozzle flaws machined into the nozzle of the SRTMV-N2 (Solid Rocket Test Motor V Nozzle 2). The SRTMV-N2 motor was a single segment static subscale solid rocket motor used to further develop the RSRMV (Redesigned Solid Rocket Motor V Segment). Two flaws or "wedgeouts" were placed in the nozzle inlet parallel to the ply angles of that section to study erosion effects. One wedgeout was placed in the nose cap region and the other placed in the inlet ring on the opposite side of the bondline, separated 180 degrees circumferentially. A coupled CFD (Computational Fluid Analysis)-thermal iterative analytical approach was utilized at the wedgeouts to analyze the erosion profile during the burn time. The iterative CFD thermal approach was applied at five second intervals throughout the motor burn. The coupled fluid thermal boundary conditions were derived from a steady state CFD solution at the beginning of the interval. The derived heat fluxes were then applied along the surface and a transient thermal solution was developed to characterize the material response over the specified interval. Eroded profiles of each of the nozzle's wedgeouts and the original contour were created at each of the specified intervals. The final iteration of the erosion profile showed that both wedgeouts were "washedout," indicating that the erosion profile of the wedgeout had rejoined the original eroded contour, leaving no trace of the wedgeouts post fire. This analytical assessment agreed with post-fire observations made of the SRTMV-N2 wedgeouts, which noted a smooth eroded contour.

Ables, Catherine↗
DOE OSTI2025

Performance Portability Evaluation of Fluid-Structure Interaction Simulations on Heterogeneous Platforms

The rapid proliferation of heterogeneous programming languages and multi-vendor hardware has underscored the critical need to evaluate the performance portability of scientific applications. In this work, we present the systematic porting and optimization of a massively parallel fluid-structure interaction code across multiple heterogeneous programming frameworks for deployment on leadership-class supercomputers from major vendors. Our analysis focuses on at-scale performance for simulations involving hundreds of millions of deformable cells, executed on a combination of CPUs and GPUs spanning thousands of nodes on exascale machines. We benchmark the performance of each implementation, highlighting the trade-offs inherent in adopting diverse programming models. Key insights regarding the portability of CUDA on multi-vendor platforms, the superior multi-core CPU performance from SYCL, and architectural considerations on performance optimization are distilled from our experience, offering guidance to other users of high performance computing based on our findings.

Martin, Aristotle [Duke University]↗
DOE OSTI2023

Human Factors for Advanced Reactors

Existing light water reactors in the U.S. are primarily large baseload electricity generating facilities. The concept of operations for these plants remains largely unchanged since the advent of commercial nuclear power—the main control room serves as the hub of plant activities and is staffed with multiple licensed operators who work in tandem under the shift supervisor, and staff such as field workers support the control room remotely. While newer plants have brought the advent of digital human-machine interfaces to replace earlier analog and mechanical instrumentation and controls, much of the control process remains unchanged and manual. It is simply a newer version of legacy concepts. Advanced reactors potentially bring considerable changes to the size, fuel type, automation, and staffing of nuclear power plants, necessitating a fundamental shift not just from analog to digital, but further from human to automation, from onsite to remote, from control to monitoring, and from many to few operators. Despite this multitude of parallel evolutions in reactor designs, many of the vendors developing the next generation of reactors represent smaller research and development enterprises. It is therefore not feasible to address all aspects of plant design at the same time. In particular, the competing design aspects of new reactors present a significant challenge to the development of robust and human factored systems at the plant. As vendors develop new reactor designs, much of the early focus is naturally on the fuel and reactor system technology. Looming behind these early advances is the daunting prospect of first-of-a-kind control concepts that have not yet been developed or validated. A failure to address the human element of reactor design early will lead to missed opportunities. The quickest development process is the replication of existing concepts of operations at legacy plants, even when such systems were long ago surpassed by better human-machine technologies outside the nuclear industry. Conversely, attempting to undertake novel concepts of operations late in the design life cycle of a plant could result in protracted development efforts and delays in licensing and deployment. This does not have to happen, and it is imperative that human factors be considered now, early in the design of new reactors.

99 GENERAL AND MISCELLANEOUS↗
DOE OSTI2022

Simulation of the Impact of Point Defects and Edge Dislocations on X-Ray Diffraction in Hexagonal (Ni,Co) 1+2 x Ti 1– x O 3 Thin Films

In this work, a computer code for simulating high-resolution X-ray diffraction (XRD) data from disordered crystals with arbitrary spatial composition and local lattice parameters is developed. Simulated patterns are compared with the experimental data collected on a single phase, highly crystalline (Ni 0.42 Co 0.58 ) 2.22 Ti 0.39 O 3 solid-solution thin film exhibiting a large number of subsidiary minima. As a case study, the edge dislocations in hexagonal (Ni,Co) 3 O 3 thin films with Burgers vector parallel and perpendicular to the a-axis and c-axis, respectively, are modeled. No peak profiles are assumed and thus issues related to profile fitting are avoided. Both macroscopic features, such as film thickness, and atomic-scale structure, such as dislocations, are simultaneously modeled. Simulations are run on a desktop machine. Commonly applied database-based phase identification routines can result in wrong phase identification, unless intensities are properly modeled. Modeling tools of diffractometer manufacturers are compared with the present approach. An example of how simulated reciprocal lattice patterns can be used to choose relevant measurement geometries in defected thin films is given.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
NASA NTRS1990

Concurrent Finite-Element Analysis On Hypercube Computers

Improved approach to execution of finite-element codes on hypercube and similar concurrent data processors increases efficiency of computation for many different types of problems. Based on flexible general model of computation on, and communication among, large-node parallel processors. Hybrid combining direct methods within subdomains and preconditioned-conjugate-gradient (PCG) iteration on remaining boundary system to obtain method of solution both robust and efficient. Preserves general structure and function of conventional sequential finite-element-method software. Generalized to both distributed- and shared-memory multicomputers, eliminating degree of machine specificity restricting general usefulness.

Lyzenga, G. A.↗
DOE OSTI2023

Real-space solution to the electronic structure problem for nearly a million electrons

We report a Kohn–Sham density functional theory calculation of a system with more than 200 000 atoms and 800 000 electrons using a real-space high-order finite-difference method to investigate the electronic structure of large spherical silicon nanoclusters. Our system of choice was a 20 nm large spherical nanocluster with 202 617 silicon atoms and 13 836 hydrogen atoms used to passivate the dangling surface bonds. To speed up the convergence of the eigenspace, we utilized Chebyshev-filtered subspace iteration, and for sparse matrix–vector multiplications, we used blockwise Hilbert space-filling curves, implemented in the PARSEC code. For this calculation, we also replaced our orthonormalization + Rayleigh–Ritz step with a generalized eigenvalue problem step. We utilized all of the 8192 nodes (458 752 processors) on the Frontera machine at the Texas Advanced Computing Center. We achieved two Chebyshev-filtered subspace iterations, yielding a good approximation of the electronic density of states. Our work pushes the limits on the capabilities of the current electronic structure solvers to nearly 106 electrons and demonstrates the potential of the real-space approach to efficiently parallelize large calculations on modern high-performance computing platforms.

Chemistry↗
DOE OSTI2025

Development of Transformative Preparation Methods to Push up High Q&G Performance of FRIB Spare HWR Cryomodule Cavities

The FRIB accelerator project construction, a top priority of US nuclear science, was completed in January 2022, and is now moving to user operation. The stable and reliable operation of the accelerating cryomodules is essential in achieving/fulfilling DOE and user expectations. So far, FRIB cryomodules meet all FRIB specifications for cavity performance. However, during the lifetime of machine operation, degradation of cryomodule performance is possible, as reported in similar operating facilities (CEBAF, SNS). If cryomodule degradation is observed at FRIB, the under-performing cryomodule will require replacement/maintenance. In effort to manage operational reliability, FRIB plans to construct a 0.53 half-wave cryomodule to serve as an active spare. In a parallel effort, FRIB will also work toward increasing operational Q and gradient of spare cryomodule cavities to gain an overall performance margin to support future operational reliability. The current FRIB cavity designs have a potential to operate at gradients higher than 8 MV/m, but are currently limited by field emission (FE) and/or high field Q slope (HFQS); known issue in buffered chemical polished (BCP) treated cavities. The proposal looks to develop transformative surface preparation treatments to improve the operational gradient of spare cryomodules higher than 10 MV/m while maintaining high Q. Thus, increasing operational margin by 30 - 50%. With the goal to improve operational reliability set, the proposal will investigate multiple objectives as possible paths forward to achieve an overall increase in cavity performance and gain a better understanding of SRF limiting mechanisms. The proposal will study the application of different chemical surface treatments to 0.53 half-wave cavities, with the addition of low temperature bakes (LTB), and measure their effects on accelerating performance. Proposed chemical treatments to be explored in this proposal include conventional EP acid mixtures, as well as innovated EP and BCP acid mixtures designed to simplify processing paths in migrating FE and HFQS. The proposed transformative treatment wet N-doping also has the potential to replicate recent advancements in SRF technology relating to nitrogen doping and high Q operation without the requirement for an ultra-high vacuum annealing furnace; currently being developed at FNAL and JLAB. In parallel, high Q performance relating to flux trapping will be investigated with the installation of a second layer of magnetic shielding in the vertical test Dewar. The research objectives presented in the proposal, and their corresponding effects on cavity performance, will provide essential knowledge and future guidance to the SRF community and provide possible paths for future SRF based projects and applications.

43 PARTICLE ACCELERATORS↗
NASA NTRS1988

Dynamically allocating sets of fine-grained processors to running computations

Researchers explore an approach to using general purpose parallel computers which involves mapping hardware resources onto computations instead of mapping computations onto hardware. Problems such as processor allocation, task scheduling and load balancing, which have traditionally proven to be challenging, change significantly under this approach and may become amenable to new attacks. Researchers describe the implementation of this approach used by the FFP Machine whose computation and communication resources are repeatedly partitioned into disjoint groups that match the needs of available tasks from moment to moment. Several consequences of this system are examined.

Middleton, David↗
NASA NTRS1993

Generating local addresses and communication sets for data-parallel programs

Generating local addresses and communication sets is an important issue in distributed-memory implementations of data-parallel languages such as High Performance FORTRAN. We show that, for an array A affinely aligned to a template that is distributed across p processors with a cyclic(k) distribution and a computation involving the regular section A(l:h:s), the local memory access sequence for any processor is characterized by a finite state machine of at most k states. We present fast algorithms for computing the essential information about these state machines, and extend the framework to handle multidimensional arrays. We also show how to generate communication sets using the state machine approach. Performance results show that this solution requires very little run-time overhead and acceptable preprocessing time.

Chatterjee, Siddhartha↗
NASA NTRS1998

Rapid Prototyping of Composite Structures

This progress report for the project Rapid Production of Composite Structures covers the period from July 14, 1997 to June 30, 1998. It will present a short overview of the project, followed by the results to date and plans for the future. The goal of this research is to provide a minimum 100x reduction in the time required to produce arbitrary, laminated products without the need for a separate mold or an autoclave. It will accomplish this by developing the science underlying the rapid production of composite structures, specifically those of carbon fiber-epoxy materials. This scientific understanding will be reduced to practice in a demonstration device that will produce a part on the order of 12" by 12" by 6". Work in the past year has focussed on developing an understanding of the materials issues and of the machine design issues. Our initial goal was to use UV cureable resins to accomplish full cure on the machine. Therefore, we have centered our materials work around whether or not UV cureable resins will work. Currently, the answer seems to be that they will not work, because UV light cannot penetrate the carbon fibers, and because no "shadow" curing seems to occur. As a result, non-UV cureable resins are being investigated. This has resulted in a change in the machine design focus. We are now looking into a "dip and place" machine design, whereby a prepreg layer would have one side coated with a curing agent, and then would be placed onto the previous layer. This would lead to cure at the interface, but not to the top of the layer. The formulation of the resins to accomplish this task at room or slightly elevated temperatures is being investigated, as is the machine design needed to apply the curing agent and then cure or partially cure the part. A final, out-of-autoclave, post-cure may be needed with this strategy, as final cure on the machine may not be possible, as it was for the initial UV cure strategy. The remainder of this report details the progress in the materials and machine design areas. Materials Development The material system must be designed to fulfill the following requirements: to reduce the time and labor requirements of typical cure cycles; to reduce the thermal stresses developed during conventional heat curing; and to develop a structure that the build sequence requires. In order to accomplish these goals, there have been parallel tracks of investigation. One area has tested photopolymerizable (ultraviolet (UV) curable) materials and combinations of these materials with standard heat curing resins. The second area has investigated resins that cure rapidly at room or low heat temperatures. The main goal of these investigations has been to identify a system that will rapidly set or cure at room temperature during a tape lay-up process and hold its structure during a post-cure cycle.

Colton, Jonathan S.↗
NASA NTRS1997

A Low-Power High-Speed Smart Sensor Design for Space Exploration Missions

A low-power high-speed smart sensor system based on a large format active pixel sensor (APS) integrated with a programmable neural processor for space exploration missions is presented. The concept of building an advanced smart sensing system is demonstrated by a system-level microchip design that is composed with an APS sensor, a programmable neural processor, and an embedded microprocessor in a SOI CMOS technology. This ultra-fast smart sensor system-on-a-chip design mimics what is inherent in biological vision systems. Moreover, it is programmable and capable of performing ultra-fast machine vision processing in all levels such as image acquisition, image fusion, image analysis, scene interpretation, and control functions. The system provides about one tera-operation-per-second computing power which is a two order-of-magnitude increase over that of state-of-the-art microcomputers. Its high performance is due to massively parallel computing structures, high data throughput rates, fast learning capabilities, and advanced VLSI system-on-a-chip implementation.

Fang, Wai-Chi↗
DOE OSTI2022

ExaCA: A performance portable exascale cellular automata application for alloy solidification modeling

Modeling the as-solidified grain structures that form during alloy processing is a critical component in understanding process-property relationships, particularly for additive manufacturing (AM) where grain structure is very sensitive to processing conditions. While cellular automata (CA)-based models have proven able to predict aspects of microstructure for several alloys and AM process conditions, long run times and large resource sets required limit the utility and the problem size to which existing CA models can be applied. As part of the ExaAM project, an initiative within the Exascale Computing Project (ECP) to develop, test, and optimize an exascale-capable coupled and self-consistent model of AM parts, we developed ExaCA (https://github.com/LLNL/ExaCA) for the liquid–solid phase transformation in the wake of AM melt pools. The CA-based code is parallelized using MPI and the Kokkos programming model, the latter enabling simulation on both CPUs and GPUs within a single-source implementation. Here, we detail the steps taken to transform a baseline, MPI-based CA code into one that is performant on CPUs and GPUs. Performance testing of ExaCA on Summit (a pre-exascale machine at Oak Ridge National Laboratory) was used to quantify CPU–GPU speedup comparing with equal numbers of nodes. Testing showed comparable CPU performance to the MPI-only CA code and a 5-20x speedup when running AM-based test problems using GPUs. The improved performance of CA through GPU utilization and the performance portable nature of ExaCA will enable accurate part-scale modeling by harnessing the power of current and future generations of high performance computing resources. Future work will include improving the strong scaling of ExaCA on GPUs by reducing load imbalance associated with the locality of the problem, and continuing performance optimization across exascale hardware.

36 MATERIALS SCIENCE↗
NASA NTRS1988

Introduction to a system for implementing neural net connections on SIMD architectures

Neural networks have attracted much interest recently, and using parallel architectures to simulate neural networks is a natural and necessary application. The SIMD model of parallel computation is chosen, because systems of this type can be built with large numbers of processing elements. However, such systems are not naturally suited to generalized communication. A method is proposed that allows an implementation of neural network connections on massively parallel SIMD architectures. The key to this system is an algorithm permitting the formation of arbitrary connections between the neurons. A feature is the ability to add new connections quickly. It also has error recovery ability and is robust over a variety of network topologies. Simulations of the general connection system, and its implementation on the Connection Machine, indicate that the time and space requirements are proportional to the product of the average number of connections per neuron and the diameter of the interconnection network.

Tomboulian, Sherryl↗
NASA NTRS1988

Introduction to a system for implementing neural net connections on SIMD architectures

Neural networks have attracted much interest recently, and using parallel architectures to simulate neural networks is a natural and necessary application. The SIMD model of parallel computation is chosen, because systems of this type can be built with large numbers of processing elements. However, such systems are not naturally suited to generalized elements. A method is proposed that allows an implementation of neural network connections on massively parallel SIMD architectures. The key to this system is an algorithm permitting the formation of arbitrary connections between the neurons. A feature is the ability to add new connections quickly. It also has error recovery ability and is robust over a variety of network topologies. Simulations of the general connection system, and its implementation on the Connection Machine, indicate that the time and space requirements are proportional to the product of the average number of connections per neuron and the diameter of the interconnection network.

Tomboulian, Sherryl↗
NASA NTRS1991

Parallel algorithms for boundary value problems

A general approach to solve boundary value problems numerically in a parallel environment is discussed. The basic algorithm consists of two steps: the local step where all the P available processors work in parallel, and the global step where one processor solves a tridiagonal linear system of the order P. The main advantages of this approach are twofold. First, this suggested approach is very flexible, especially in the local step and thus the algorithm can be used with any number of processors and with any of the SIMD or MIMD machines. Secondly, the communication complexity is very small and thus can be used as easily with shared memory machines. Several examples for using this strategy are discussed.

Lin, Avi↗