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 379 records · Page 21

Fast Change Point Detection for Electricity Market Analysis

Electricity is a vital part of our daily life; therefore it is important to avoid irregularities such as the California Electricity Crisis of 2000 and 2001. In this work, we seek to predict anomalies using advanced machine learning algorithms. These algorithms are effective, but computationally expensive, especially if we plan to apply them on hourly electricity market data covering a number of years. To address this challenge, we significantly accelerate the computation of the Gaussian Process (GP) for time series data. In the context of a Change Point Detection (CPD) algorithm, we reduce its computational complexity from O($n^{5}$) to O($n^{2}$). Our efficient algorithm makes it possible to compute the Change Points using the hourly price data from the California Electricity Crisis. By comparing the detected Change Points with known events, we show that the Change Point Detection algorithm is indeed effective in detecting signals preceding major events.

97 MATHEMATICS AND COMPUTING↗

Wakefield Computations for the CLIC PETS using the Parallel Finite Element Time-Domain Code T3P

In recent years, SLAC's Advanced Computations Department (ACD) has developed the high-performance parallel 3D electromagnetic time-domain code, T3P, for simulations of wakefields and transients in complex accelerator structures. T3P is based on advanced higher-order Finite Element methods on unstructured grids with quadratic surface approximation. Optimized for large-scale parallel processing on leadership supercomputing facilities, T3P allows simulations of realistic 3D structures with unprecedented accuracy, aiding the design of the next generation of accelerator facilities. Applications to the Compact Linear Collider (CLIC) Power Extraction and Transfer Structure (PETS) are presented.

43 PARTICLE ACCELERATORS↗

Efficient Minimum-Polynomial And Reduced-Rank Extrapolation

MPERRE computer program accelerates convergence of sequence of vectors by use of minimum-polynomial extrapolation (MPE) and reduced-rank extrapolation (RRE). Effective in accelerating convergences of such sequences of vectors as those obtained from iterative solution of systems of linear and nonlinear equations. In conjunction with various iterative techniques, successfully employed in finite-difference solution of large-scale elliptic boundary-value problems and problems in computational-fluid-dynamics. Only input required is sequence of vectors, convergence of which is accelerated. Program economical and easy to use. Written in FORTRAN 77.

Sidi, Avram↗

Improvements of the boundary projection acceleration technique applied to the discrete-ordinates transport solver in XYZ geometries

In this paper we discuss the latest upgrades of the Boundary Projection Acceleration (BPA) applied to the XYZ transport solver of APOLLO3, namely IDT. The acceleration method is a well-known effective technique for the speed-up of the source iterations of the discrete-ordinates method. The BPA in IDT has been improved in three aspects: the taking into account of the residue on boundary conditions as a boundary source for the acceleration problem, the extension of the method to higher order angular moments in the case of anisotropic scattering and, finally, the application of the method to the multigroup iterations for the acceleration of the fission source and k-effective. The spectrum of the method has been Fourier-analyzed to explore the effectiveness. The 3D mock-up geometry of the ZPPR is presented as final study to test the performances of the acceleration on a realistic whole-core 3D calculation. (authors)

97 MATHEMATICS AND COMPUTING↗

Multigrid acceleration and turbulence models for computations of 3D turbulent jets in crossflow

A multigrid method is presented for the calculation of three-dimensional turbulent jets in crossflow. Turbulence closure is achieved with either the standard k-epsilon model or a Reynolds Stress Model (RSM). Multigrid acceleration enables convergence rates which are far superior to that for a single grid method. With the k-epsilon model the rate approaches that for laminar flow, but with RSM it is somewhat slower. The increased stiffness of the system of equations in the latter may be responsible. Computed results with both turbulence models are compared with experimental data for a pair of opposed jets in crossflow. Both models yield reasonable agreement with mean flow velocity but RSM yields better prediction of the Reynolds stresses.

Demuren, A. O.↗

Evaluation of a multigrid-based Navier-Stokes solver for aerothermodynamic computations

A multigrid acceleration technique developed for solving the three-dimensional Navier-Stokes equations is used for computing high Mach number flows over configurations of practical interest. An explicit multistage Runge-Kutta type of time-stepping scheme is used as the basic algorithm. Solutions are presented for a spherically blunted cone at Mach 10 and a modified shuttle orbiter at Mach 6. The computed surface heat-transfer distributions are shown to compare favorably with the experimental data. Effect of grid-refinement on computed heat-transfer distributions is also examined to assess the numerical accuracy of the computed solutions. The rapid convergence rate associated with multigrid schemes in previous applications at transonic speeds is observed at the higher Mach number flows investigated here.

Vatsa, Veer N.↗

Multigrid acceleration and turbulence models for computations of 3D turbulent jets in crossflow

A multigrid method is presented for the calculation of three-dimensional turbulent jets in crossflow. Turbulence closure is achieved with either the standard k-epsilon model or a Reynolds stress model (RSM). Multigrid acceleration enables convergence rates which are far superior to that for a single grid method to be obtained with both turbulence models. With the k-epsilon model the rate approaches that for laminar flow, but with RSM it is somewhat slower. The increased stiffness of the system of equation in the latter may be responsible. Computed results with both turbulence models are compared to experimental data for a pair of opposed jets in crossflow. Both models yield reasonable agreement for the mean flow velocity, but RSM yields better predictions of the Reynolds stresses.

Demuren, A. O.↗

Revolutionizing Neuromorphic Computing for Science (Brochure on the 2024 ASCR Workshop on Neuromorphic Computing for Science)

The ASCR basic research needs for Neuromorphic Computing for Science workshop was held in September 2024. The workshop brochure and report aim to inform and draft a set of grand challenges for advancing the field of neuromorphic computing and developing proof of principle neuromorphic circuits applicable for High Performance Computer (HPC) acceleration for scientific discovery, and brainstorm ideas needed for a successful, robust, and world leading basic research program. The resulting priority research directions are: (1) Neuromorphic computing circuit primitives; (2) Connectivity, communication, and hardware integration; (3) Neuroscience-derived dynamics and algorithms; and (4) Ecosystem for scalable neuromorphic co-design. Breakthroughs in understanding, designing, and prototyping the circuitry and simulation capabilities for a truly neuromorphic computer are essential to enable progress in the field.

97 MATHEMATICS AND COMPUTING↗

Revolutionizing Neuromorphic Computing for Science (Report for the 2024 ASCR Workshop on Neuromorphic Computing for Science)

The ASCR basic research needs for Neuromorphic Computing for Science workshop was held in September 2024. The workshop brochure and report aim to inform and draft a set of grand challenges for advancing the field of neuromorphic computing and developing proof of principle neuromorphic circuits applicable for High Performance Computer (HPC) acceleration for scientific discovery, and brainstorm ideas needed for a successful, robust, and world leading basic research program. The resulting priority research directions are: (1) Neuromorphic computing circuit primitives; (2) Connectivity, communication, and hardware integration; (3) Neuroscience-derived dynamics and algorithms; and (4) Ecosystem for scalable neuromorphic co-design. Breakthroughs in understanding, designing, and prototyping the circuitry and simulation capabilities for a truly neuromorphic computer are essential to enable progress in the field.

97 MATHEMATICS AND COMPUTING↗

ComPort: Rigorous Testing Methods to Safeguard Software Porting (Final Technical Report)

This is a technical report from the lead institution – University of Utah, Kahlert School of Computing – funded under the Department of Energy, Office of Science, Office of Advanced Scientific Computing Research under award number DE-SC0022252. We summarize our work done over the three years of funding received. The relevant papers and software have already been uploaded at the DOE site.

97 MATHEMATICS AND COMPUTING↗

Convergence acceleration of iterative solutions of Euler equations for transonic flow computations

In this paper, two acceleration techniques for Euler calculations are investigated. The first technique is an extrapolation procedure based on the Power Method; it is applicable when the iterative matrix has dominant eigenvalues. Both real and complex conjugate roots are allowed. The second technique is a generalization of the Minimal Residual Method, where the extrapolation step consists of a weighted combination of the corrections at different iteration levels and the weights are chosen to minimize the Lz norm of the residual. Numerical results, using Jameson's Runge-Kutta Multigrid Code, are presented. The extra computational work to apply either technique is negligible and the extra storage is not a problem on current supercomputers.

Hafez, M.↗

Visual and motion cueing in helicopter simulation

Early experience in fixed-cockpit simulators, with limited field of view, demonstrated the basic difficulties of simulating helicopter flight at the level of subjective fidelity required for confident evaluation of vehicle characteristics. More recent programs, utilizing large-amplitude cockpit motion and a multiwindow visual-simulation system have received a much higher degree of pilot acceptance. However, none of these simulations has presented critical visual-flight tasks that have been accepted by the pilots as the full equivalent of flight. In this paper, the visual cues presented in the simulator are compared with those of flight in an attempt to identify deficiencies that contribute significantly to these assessments. For the low-amplitude maneuvering tasks normally associated with the hover mode, the unique motion capabilities of the Vertical Motion Simulator (VMS) at Ames Research Center permit nearly a full representation of vehicle motion. Especially appreciated in these tasks are the vertical-acceleration responses to collective control. For larger-amplitude maneuvering, motion fidelity must suffer diminution through direct attenuation through high-pass filtering washout of the computer cockpit accelerations or both. Experiments were conducted in an attempt to determine the effects of these distortions on pilot performance of height-control tasks.

Bray, R. S.↗

Visual and motion cueing in helicopter simulation

The visual cues presented in the simulator are compared with those of flight in an attempt to identify deficiencies. For the low-amplitude maneuvering tasks normally associated with the hover mode, the unique motion capabilities of the Vertical Motion Simulator (VMS) at Ames Research Center permit nearly a full representation of vehicle motion. Especially appreciated in these tasks are the vertical-acceleration responses to collective control. For larger-amplitude maneuvering, motion fidelity must suffer diminution through direct attenuation through high-pass filtering washout of the computer cockpit accelerations or both. Experiments were conducted in an attempt to determine the effects of these distortions on pilot performance of height-control tasks.

Bray, Richard S.↗

Collaborating CPU and GPU for large-scale high-order CFD simulations with complex grids on the TianHe-1A supercomputer

Programming and optimizing complex, real-world CFD codes on current many-core accelerated HPC systems is very challenging, especially when collaborating CPUs and accelerators to fully tap the potential of heterogeneous systems. In this paper, with a tri-level hybrid and heterogeneous programming model using MPI + OpenMP + CUDA, we port and optimize our high-order multi-block structured CFD software HOSTA on the GPU-accelerated TianHe-1A supercomputer. HOSTA adopts two self-developed high-order compact definite difference schemes WCNS and HDCS that can simulate flows with complex geometries. We present a dual-level parallelization scheme for efficient multi-block computation on GPUs and perform particular kernel optimizations for high-order CFD schemes. The GPU-only approach achieves a speedup of about 1.3 when comparing one Tesla M2050 GPU with two Xeon X5670 CPUs. To achieve a greater speedup, we collaborate CPU and GPU for HOSTA instead of using a naive GPU-only approach. We present a novel scheme to balance the loads between the store-poor GPU and the store-rich CPU. Taking CPU and GPU load balance into account, we improve the maximum simulation problem size per TianHe-1A node for HOSTA by 2.3×, meanwhile the collaborative approach can improve the performance by around 45% compared to the GPU-only approach. Further, to scale HOSTA on TianHe-1A, we propose a gather/scatter optimization to minimize PCI-e data transfer times for ghost and singularity data of 3D grid blocks, and overlap the collaborative computation and communication as far as possible using some advanced CUDA and MPI features. Scalability tests show that HOSTA can achieve a parallel efficiency of above 60% on 1024 TianHe-1A nodes. With our method, we have successfully simulated an EET high-lift airfoil configuration containing 800M cells and China's large civil airplane configuration containing 150M cells. To our best knowledge, those are the largest-scale CPU–GPU collaborative simulations that solve realistic CFD problems with both complex configurations and high-order schemes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

GPU-Accelerated Denoising in 3D (GD3D)

The raw computational power GPU Accelerators enables fast denoising of 3D MR images using bilateral filtering, anisotropic diffusion, and non-local means. This software addresses two facets of this promising application: what tuning is necessary to achieve optimal performance on a modern GPU? And what parameters yield the best denoising results in practice? To answer the first question, the software performs an autotuning step to empirically determine optimal memory blocking on the GPU. To answer the second, it performs a sweep of algorithm parameters to determine the combination that best reduces the mean squared error relative to a noiseless reference image.

Howison, Mark↗

GPU-Accelerated Long-Term Simulations of Beam-Beam Effects in Colliders

We present an update on the development of the new code for long-term simulation of beam-beameffects in particle colliders. The underlying physical model relies on a matrix-based arbitrary-order particle tracking (including a symplectic option) for beam transport and the generalized Bassetti-Erskine approximation for beam-beam interaction. The computations are accelerated through a parallel implementation on a hybrid GPU/CPU platform. With the new code, previously computationally prohibitive longterm simulations become tractable. The new code will be used to model the proposed Medium-energy Electron-Ion Collider (MEIC) at Jefferson Lab.

Terzic, B.↗

Hands-on Performance Tuning of 3D Finite Difference Earthquake Simulation on GPU Fermi Chipset

3D simulation of earthquake ground motion is one of the most challenging computational problems in science. The emergence of graphic processing units (GPU) as an effective alternative to traditional general purpose processors has become increasingly capable in terms of accelerating scientific computing research. In this paper, we describe our experiences in porting AWP-ODC, a 3D finite difference seismic wave propagation code, to the latest GPU Fermi chipset. We completely rewrote this Fortran-based 13-point asymmetric stencil computation code in C and MPI-CUDA in order to take advantage of the powerful GPU computing capabilities. Our new CUDA code implemented the asymmetric 3D stencil on Fermi to make the best use of GPU on-chip memory for an aggressive parallel efficiency. Benchmark on NVIDIA Tesla M2090 demonstrated 10x speedup versus the original fully optimized AWP-ODC FORTRAN MPI code running on a single Intel Nehalem 2.4 GHz CPU socket (4 cores/CPU), and 15x speedup versus the same MPI code running on a single AMD Istanbul 2.6 GHz CPU socket (6 cores/CPU). Sustained single-GPU performance of 143.8 GFLOPS in single precision is benchmarked for the testing case of 128x128x960 mesh size.

3D Stencil Computation↗

Experiences in extending parallware to support OpenACC. In: WACCPD '15 Proceedings of the Second Workshop on Accelerator Programming using Directives, Article No. 4

Porting scientific codes to accelerator-based computers using OpenACC and OpenMP is an important topic for the HPC community. Programmability, performance portability and developer productivity are key issues for the widespread use of these systems. In the scope of general-purpose parallel computing, Parallware is a new commercial OpenMP-enabling source-to-source compiler that automatically adds OpenMP capabilities in scientific programs. Thus, extending Parallware with OpenACC or OpenMP 4.x support would contribute to improve programmability and developer productivity. In contrast, the performance portability of such approach needs to be demonstrated in practice. This paper presents a preliminary study to extend Parallware with OpenACC support for GPU devices. A simple benchmark suite has been designed to mimic important features and computational patterns of real scientific applications. Handcoded OpenACC versions are compared to OpenMP versions automatically generated by Parallware. Performance is evaluated with the PGI OpenACC compiler on systems accelerated with NVIDIA GPUs.

Lobeiras, Jacobo↗