Search NASA⌕ Search

SEARCH · Search NASA

Results for “Accelerators, 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 613 records · Page 34

A pervasive parallel framework for visualization: final report for FWP 10-014707

We are on the threshold of a transformative change in the basic architecture of highperformance computing. The use of accelerator processors, characterized by large core counts, shared but asymmetrical memory, and heavy thread loading, is quickly becoming the norm in high performance computing. These accelerators represent significant challenges in updating our existing base of software. An intrinsic problem with this transition is a fundamental programming shift from message passing processes to much more fine thread scheduling with memory sharing. Another problem is the lack of stability in accelerator implementation; processor and compiler technology is currently changing rapidly. This report documents the results of our three-year ASCR project to address these challenges. Our project includes the development of the Dax toolkit, which contains the beginnings of new algorithms for a new generation of computers and the underlying infrastructure to rapidly prototype and build further algorithms as necessary.

97 MATHEMATICS AND COMPUTING↗

Scaling deep learning workloads: NVIDIA DGX-1/Pascal and Intel Knights Landing

Deep Learning (DL) algorithms have become ubiquitous in data analytics. As a result, major computing vendors --- including NVIDIA, Intel, AMD, and IBM --- have architectural road-maps influenced by DL workloads. Furthermore, several vendors have recently advertised new computing products as accelerating large DL workloads. Unfortunately, it is difficult for data scientists to quantify the potential of these different products. This paper provides a performance and power analysis of important DL workloads on two major parallel architectures: NVIDIA DGX-1 (eight Pascal P100 GPUs interconnected with NVLink) and Intel Knights Landing (KNL) CPUs interconnected with Intel Omni-Path or Cray Aries. Our evaluation consists of a cross section of convolutional neural net workloads: CifarNet, AlexNet, GoogLeNet, and ResNet50 topologies using the Cifar10 and ImageNet datasets. The workloads are vendor-optimized for each architecture. Our analysis indicates that although GPUs provide the highest overall performance, the gap can close for some convolutional networks; and the KNL can be competitive in performance/watt. We find that NVLink facilitates scaling efficiency on GPUs. However, its importance is heavily dependent on neural network architecture. Furthermore, for weak-scaling --- sometimes encouraged by restricted GPU memory --- NVLink is less important.

Gawande, Nitin A.↗

Computational Modeling of Photovoltaic Mini-Modules Undergoing Accelerated Stress Testing

A finite element model of a four-cell photovoltaic mini-module was developed and compared to experimental results from an accelerated stress test protocol in order to validate that computational models can accurately represent their physical counterparts when subjected to mechanical loading and to assess mini-module representativeness against full scale photovoltaic modules. Deflected shapes across the simulated mini-modules were compared to measured mini-module shapes when subjected to various pressure loads. Displaced mini-module shape results constrained to the experimental protocols of 0.4 mm and 1.1 mm of displacement at the mini-module center were compared to experimental results of full-size modules subjected to module qualification test load levels of 1.0 kPa and 2.4 kPa, to assess if the bending of mini-modules was representative of full-sized modules under the load. Temperature cycling was incorporated into the model to simulate the impacts of stress due to thermal expansion of the backsheet and cells. A preliminary uncertainty analysis was performed to show how variations in material properties and geometric parameters change the simulation results.

computational modeling↗

The Computer Program LIAR for Beam Dynamics Calculations in Linear Accelerators

Linear accelerators are the central components of the proposed next generation of linear colliders. They need to provide acceleration of up to 750 GeV per beam while maintaining very small normalized emittances. Standard simulation programs, mainly developed for storage rings, do not meet the specific requirements for high energy linear accelerators. We present a new program LIAR ('LInear Accelerator Research code') that includes wakefield effects, a 6D coupled beam description, specific optimization algorithms and other advanced features. Its modular structure allows to use and to extend it easily for different purposes. The program is available for UNIX workstations and Windows PC's. It can be applied to a broad range of accelerators. We present examples of simulations for SLC and NLC.

43 PARTICLE ACCELERATORS↗

Laser ion source with solenoid field

Pulse length extension of highly charged ion beam generated from a laser ion source is experimentally demonstrated. In this study, the laser ion source (LIS) has been recognized as one of the most powerful heavy ion source. However, it was difficult to provide long pulse beams. By applying a solenoid field (90 mT, 1 m) at plasma drifting section, a pulse length of carbon ion beam reached 3.2 μs which was 4.4 times longer than the width from a conventional LIS. The particle number of carbon ions accelerated by a radio frequency quadrupole linear accelerator was 1.2 × 10 11 , which was provided by a single 1 J Nd-YAG laser shot. A laser ion source with solenoid field could be used in a next generation heavy ion accelerator.

43 PARTICLE ACCELERATORS↗

The SODA Approach: Leveraging High-Level Synthesis for Hardware/Software Co-design and Hardware Specialization: Invited

Novel "converged" applications combine phases of scientific simulation with data analysis and machine learning. Each computational phase can benefit from specialized accelerators. However, algorithms evolve so quickly that mapping them on existing accelerators is suboptimal or even impossible. This paper presents the SODA (Software Defined Accelerators) framework, a modular, multi-level, open-source, no-human-in-the-loop, hardware synthesizer that enables end-to-end generation of specialized accelerators. SODA is composed of SODA-Opt, a high-level frontend developed in MLIR that interfaces with domain-specific programming frameworks and allows performing system level design, and Bambu, a state-of-the-art high-level synthesis engine that can target different device technologies. The framework implements design space exploration as compiler optimization passes. We show how the modular, yet tight, integration of the high-level optimizer and lower-level HLS tools enables the generation of accelerators optimized for the computational patterns of converged applications. We then discuss some of the research opportunities that such a framework allows, including system-level design, profile driven optimization, and supporting new optimization metrics.

Bohm Agostini, Nicolas↗

GPU Acceleration of Volume Fraction and Centroid Computation from General Shapes on Unstructured Mesh

One important requirement for coupling multi-physics models is a means to remap fields between meshes in an accurate and conservative manner. Since the remapping algorithm is embarrassingly parallel, this motivates the use of Graphical Processing Units (GPU) for such routine. However, since our remapping code, portage, is fairly complex, we explore the use of GPUs through a simpler problem of generating material’s volume fraction and centroid inside each cell of the mesh. We use the same programming structure that is used in portage, namely, on-node parallelism via NVIDIA’s thrust library. Using a similar programming structure enables us to draw lessons from this study that can be applied to the more complex problem. We have found that while the speed-up is pronounced (10-100 times), significant effort is required to re-factor the code so that thrust can be used with a CUDA backend. Moreover, thrust takes away the fine grain control that vanilla CUDA programming gives us.

97 MATHEMATICS AND COMPUTING↗

High Energy Physics Network Requirements Review (Final Report, July-October 2020)

Throughout 2020, ESnet and the Office of High Energy Physics (HEP) of the DOE SC organized an ESnet requirements review of HEP-supported activities. Preparation for this event included identification of key stakeholders: program and facility management, research groups, technology providers, and a number of external observers. These individuals were asked to prepare formal case study documents about their relationship to the HEP program to build a complete understanding of the current, near-term, and long-term status, expectations, and processes that will support the science going forward. A series of pre-planning meetings better prepared case study authors for this task, along with guidance on how the review would proceed in a virtual fashion.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Gravitational Acceleration Effects on Macrosegregation: Experiment and Computational Modeling

Experiments were performed under terrestrial gravity (1g) and during parabolic flights (10-2 g) to study the solidification and macrosegregation patterns of Al-Cu alloys. Alloys having 2% and 5% Cu were solidified against a chill at two different cooling rates. Microscopic and Electron Microprobe characterization was used to produce microstructural and macrosegregation maps. In all cases positive segregation occurred next to the chill because shrinkage flow, as expected. This positive segregation was higher in the low-g samples, apparently because of the higher heat transfer coefficient. A 2-D computational model was used to explain the experimental results. The continuum formulation was employed to describe the macroscopic transports of mass, energy, and momentum, associated with the solidification phenomena, for a two-phase system. The model considers that liquid flow is driven by thermal and solutal buoyancy, and by solidification shrinkage. The solidification event was divided into two stages. In the first one, the liquid containing freely moving equiaxed grains was described through the relative viscosity concept. In the second stage, when a fixed dendritic network was formed after dendritic coherency, the mushy zone was treated as a porous medium. The macrosegregation maps and the cooling curves obtained during experiments were used for validation of the solidification and segregation model. The model can explain the solidification and macrosegregation patterns and the differences between low- and high-gravity results.

Leon-Torres, J.↗

Acceleration of the KINETICS Integrated Dynamical/Chemical Computational Model Using MPI

Understanding the evolution of a planet's atmosphere not only provides a better theoretical understanding of planetary physics and the formation of planets, but also grants useful insight into Earth's own atmosphere. One of the tools used at JPL for the modeling of planetary atmospheres and protostellar disks is KINETICS. KINETICS can simulate years of complex dynamics and chemistry.

planetary physics↗

Resolving Wave-Particle Duality Could Accelerate the Mass Production of Quantum Computers

Quantum computers, hypothesized in 1980s, use concepts of superposition and entanglement phenomena. Although theoretical propositions and associated search algorithms for accurate measurements are being generated, the development of practical quantum computers themselves are advancing very slowly requiring enormous time and investments. The underlying concepts of a quantum computer are not new to the optical domain. However, the crucial enabling concepts of Entanglement and Superposition Principle are remaining clouded under the unresolved postulates, Wave-Particle Duality (WPD), and Wave Packet Reduction (WPR), implicating incompleteness in the interpretations of the mathematical formalism behind Quantum Mechanics. The WPD debate started during late1600 between Newton and Huygens. Young’s resolution of WPD through his double-slit experiment in 1802 was effectively overturned by Einstein’s interpretation of photoelectric effect as due to “indivisible light quanta”. However, Einstein disowned his “light quanta” postulate shortly before his death in1955, even though it had earned him the Nobel Prize. We resolve WPD by synthesizing Newton’s and Maxwell’s concepts and assume atoms do emit quanta but propagate as time-finite exponential pulses. This assumption also resolves WPR for light-matter interaction with the assumption that Schrodinger’s ψ represents atom’s internal dipolar amplitude stimulations. This over-turns Born’s interpretation that ψ only represents the abstract mathematical probability amplitude, rather than the physical “internal amplitude stimulation” of the quantum entity. However, our concept of atomic pulse emission forces us to re-derive the expression for the N-slit grating-spectrometer response since the classical derivation uses CW light, which does not exist. This pulsespectrometric response function strengthens our postulate since the grating response to the exponential pulse appears to be the convolution of a Lorentzian spectrum with the classical CW response function of the grating. The Fourier Transform of an exponential function is Lorentzian and QM predicts spontaneous emission line width to be Lorentzian. Then, conceptually one can extend the grating-expression (with N=2) to get the double-slit pattern. This approach preserves the classical causality that each of the two slits, like the N-signals out of a grating, are physically real and jointly stimulate the quantum detector array at the far field to generate the “Local” cosine fringes. The detector array executes the square modulus operation on its imposed dipolar amplitude stimulation and absorbs the necessary energy to fill up their quantum cups. Hence the double-slit pattern must also be “Local”, just as the N-slit grating spectrum is generated locally at the exit spectral-plane of the spectrometer. This removes the need to believe that “single photons” mysteriously generate the double slit pattern. Quantum computers, hypothesized in 1980s, use concepts of superposition and entanglement phenomena. Although theoretical propositions and associated search algorithms for accurate measurements are being generated, the development of practical quantum computers themselves are advancing very slowly requiring enormous time and investments. The underlying concepts of a quantum computer are not new to the optical domain. However, the crucial enabling concepts of Entanglement and Superposition Principle are remaining clouded under the unresolved postulates, Wave-Particle Duality (WPD), and Wave Packet Reduction (WPR), implicating incompleteness in the interpretations of the mathematical formalism behind Quantum Mechanics. The WPD debate started during late1600 between Newton and Huygens. Young’s resolution of WPD through his double-slit experiment in 1802 was effectively overturned by Einstein’s interpretation of photoelectric effect as due to “indivisible light quanta”. However, Einstein disowned his “light quanta” postulate shortly before his death in1955, even though it had earned him the Nobel Prize. We resolve WPD by synthesizing Newton’s and Maxwell’s concepts and assume atoms do emit quanta but propagate as time-finite exponential pulses. This assumption also resolves WPR for light-matter interaction with the assumption that Schrodinger’s ψ represents atom’s internal dipolar amplitude stimulations. This over-turns Born’s interpretation that ψ only represents the abstract mathematical probability amplitude, rather than the physical “internal amplitude stimulation” of the quantum entity. However, our concept of atomic pulse emission forces us to re-derive the expression for the N-slit grating-spectrometer response since the classical derivation uses CW light, which does not exist. This pulsespectrometric response function strengthens our postulate since the grating response to the exponential pulse appears to be the convolution of a Lorentzian spectrum with the classical CW response function of the grating. The Fourier Transform of an exponential function is Lorentzian and QM predicts spontaneous emission line width to be Lorentzian. Then, conceptually one can extend the grating-expression (with N=2) to get the double-slit pattern. This approach preserves the classical causality that each of the two slits, like the N-signals out of a grating, are physically real and jointly stimulate the quantum detector array at the far field to generate the “Local” cosine fringes. The detector array executes the square modulus operation on its imposed dipolar amplitude stimulation and absorbs the necessary energy to fill up their quantum cups. Hence the double-slit pattern must also be “Local”, just as the N-slit grating spectrum is generated locally at the exit spectral-plane of the spectrometer. This removes the need to believe that “single photons” mysteriously generate the double slit pattern.

Quantum Computer↗

Automated Production of Movies on a Cluster of Computers

A method of accelerating and facilitating production of video and film motion-picture products, and software and generic designs of computer hardware to implement the method, are undergoing development. The method provides for automation of most of the tedious and repetitive tasks involved in editing and otherwise processing raw digitized imagery into final motion-picture products. The method was conceived to satisfy requirements, in industrial and scientific testing, for rapid processing of multiple streams of simultaneously captured raw video imagery into documentation in the form of edited video imagery and video derived data products for technical review and analysis. In the production of such video technical documentation, unlike in production of motion-picture products for entertainment, (1) it is often necessary to produce multiple video derived data products, (2) there are usually no second chances to repeat acquisition of raw imagery, (3) it is often desired to produce final products within minutes rather than hours, days, or months, and (4) consistency and quality, rather than aesthetics, are the primary criteria for judging the products. In the present method, the workflow has both serial and parallel aspects: processing can begin before all the raw imagery has been acquired, each video stream can be subjected to different stages of processing simultaneously on different computers that may be grouped into one or more cluster(s), and the final product may consist of multiple video streams. Results of processing on different computers are shared, so that workers can collaborate effectively.

Nail, Jasper↗

An Offload NIC for NASA, NLR, and Grid Computing

This work addresses distributed data management and access dynamically configurable high-speed access to data distributed and shared over wide-area high-speed network environments. An offload engine NIC (network interface card) is proposed that scales at nX10-Gbps increments through 100-Gbps full duplex. The Globus de facto standard was used in projects requiring secure, robust, high-speed bulk data transport. Novel extension mechanisms were derived that will combine these technologies for use by GridFTP, bandwidth management resources, and host CPU (central processing unit) acceleration. The result will be wire-rate encrypted Globus grid data transactions through offload for splintering, encryption, and compression. As the need for greater network bandwidth increases, there is an inherent need for faster CPUs. The best way to accelerate CPUs is through a network acceleration engine. Grid computing data transfers for the Globus tool set did not have wire-rate encryption or compression. Existing technology cannot keep pace with the greater bandwidths of backplane and network connections. Present offload engines with ports to Ethernet are 32 to 40 Gbps f-d at best. The best of ultra-high-speed offload engines use expensive ASICs (application specific integrated circuits) or NPUs (network processing units). The present state of the art also includes bonding and the use of multiple NICs that are also in the planning stages for future portability to ASICs and software to accommodate data rates at 100 Gbps. The remaining industry solutions are for carrier-grade equipment manufacturers, with costly line cards having multiples of 10-Gbps ports, or 100-Gbps ports such as CFP modules that interface to costly ASICs and related circuitry. All of the existing solutions vary in configuration based on requirements of the host, motherboard, or carriergrade equipment. The purpose of the innovation is to eliminate data bottlenecks within cluster, grid, and cloud computing systems, and to add several more capabilities while reducing space consumption and cost. Provisions were designed for interoperability with systems used in the NASA HEC (High-End Computing) program. The new acceleration engine consists of state-ofthe- art FPGA (field-programmable gate array) core IP, C, and Verilog code; novel communication protocol; and extensions to the Globus structure. The engine provides the functions of network acceleration, encryption, compression, packet-ordering, and security added to Globus grid or for cloud data transfer. This system is scalable in nX10-Gbps increments through 100-Gbps f-d. It can be interfaced to industry-standard system-side or network-side devices or core IP in increments of 10 GigE, scaling to provide IEEE 40/100 GigE compliance.

Awrach, James↗

A Scalable Reduced‐Order Model for the Steady Navier–Stokes Equations

Scaling up new scientific technologies from laboratory to industry often involves demonstrating performance on a larger scale. Computer simulations can accelerate design and predictions in the deployment process, though traditional numerical methods are computationally intractable even for intermediate pilot plant scales. Recently, the component reduced order modeling method has been developed to tackle this challenge by combining projection reduced order modeling and discontinuous Galerkin domain decomposition. However, while many scientific or engineering applications involve nonlinear physics, this method has only been demonstrated for various linear systems. In this work, the component reduced order modeling method is extended to steady Navier–Stokes flow, with application to general nonlinear physics in view. The large‐scale, global domain is decomposed into a combination of small‐scale unit component. Linear subspaces for flow velocity and pressure are identified via proper orthogonal decomposition over sample snapshots collected from each small‐scale unit component. Velocity bases are augmented with a pressure supremizer to satisfy the inf–sup condition for stable pressure prediction. Two different nonlinear reduced order modeling methods are employed and compared for efficient evaluation of nonlinear advection: A third‐order tensor projection operator and the empirical quadrature procedure. The proposed method is demonstrated on the flow over arrays of five different unit objects, achieving a 23‐fold speedup with less than 4% relative error in domains up to 256 times larger than the unit components. Furthermore, a numerical experiment with the pressure supremizer strongly indicates the need for a supremizer for stable pressure prediction. A comparison between the tensorial approach and the empirical quadrature procedure revealed a slight advantage of the empirical quadrature procedure. The framework is compared with an alternating Schwarz‐based reduced‐order approach, demonstrating improved efficiency and robustness for the DG‐based global solver while retaining flexibility for sub‐scale iterative solvers. The method is further extended to a coupled advection–diffusion and Navier–Stokes system, illustrating its applicability to multi‐physics problems and its potential for more general, inter‐coupled nonlinear systems.

42 ENGINEERING↗

Kokkos Version 2.0

The Kokkos library implements thread-parallel execution policies and shared-memory multidimensional array data structures that enable applications and domain libraries to develop computational kernels that are performance portable across multicore-CPU and manycore-accelerator (e.g. GPU) computing architectures.

SciDAC↗