Search NASA⌕ Search

SEARCH · Search NASA

Results for “Time parallelization”

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,027 records · Page 57
All sourcesNASA NTRSDOE OSTI
NASA NTRS1996

An Evaluation of Architectural Platforms for Parallel Navier-Stokes Computations

We study the computational, communication, and scalability characteristics of a computational fluid dynamics application, which solves the time accurate flow field of a jet using the compressible Navier-Stokes equations, on a variety of parallel architecture platforms. The platforms chosen for this study are a cluster of workstations (the LACE experimental testbed at NASA Lewis), a shared memory multiprocessor (the Cray YMP), and distributed memory multiprocessors with different topologies - the IBM SP and the Cray T3D. We investigate the impact of various networks connecting the cluster of workstations on the performance of the application and the overheads induced by popular message passing libraries used for parallelization. The work also highlights the importance of matching the memory bandwidth to the processor speed for good single processor performance. By studying the performance of an application on a variety of architectures, we are able to point out the strengths and weaknesses of each of the example computing platforms.

Jayasimha, D. N.↗
NASA NTRS1997

The STIS parallel survey: Introduction and first results

The installation of the Space Telescope Imaging Spectrograph (STIS) on the Hubble Space Telescope (HST) allows for the first time two-dimensional optical and ultraviolet slitless spectroscopy of faint objects from space. The STIS Parallel Survey (SPS) routinely obtains broad band images and slitless spectra of random fields in parallel with HST observations using other instruments. The SPS is designed to study a wide variety of astrophysical phenomena, including the rate of star formation in galaxies at intermediate to high redshift through the detection of emission-line galaxies. We present the first results of the SPS, which demonstrate the capability of STIS slitless spectroscopy to detect and identify high-redshift galaxies.

Gardner, Jonathan P.↗
DOE OSTI2025

Optimizing inference of segmentation on high-resolution images in MLExchange

MLExchange is a machine learning (ML) operations platform providing web user-interfaces (UIs) for data visualization and analysis pipelines at synchrotron facilities. Among these UIs is the segmentation app which helps synchrotron users utilize ML algorithms to automatically segment high-resolution scientific images with minimal manual annotation effort. In this work, we share code optimizations that significantly speed up the segmentation inference workflow of large data in short time. By optimizing the sequence of CPU-GPU data transfers and introducing CPU parallelization to key operations, we improve the per-device, per-image frame computational efficiency and observe close to 3×$$\times$$ speedup over the original segmentation inference workflow run time when utilizing a single GPU. Further adaptations enabling multi-GPU inference yield more than 40×$$\times$$ speedup with 100 GPUs compared to the optimized single GPU inference workflow. This acceleration of the segmentation inference workflow will provide MLExchange users with easy access to segmentation results with little wait time.

Lu, Shizhao↗
DOE OSTI2024

Core inductive electric field during sawtooth crashes on DIII-D

Sawtooth crashes on tokamak plasmas exhibit relaxation much faster than resistive time scales via a mechanism not fully understood. Using core magnetic measurements from the Radial Interferometer-Polarimeter (RIP) diagnostic on the DIII-D tokamak, Grad–Shafranov equilibria constrained by internal magnetic measurements that have high time resolution (<1μs) can be computed, allowing analysis of how equilibrium parameters such as safety factor q, current density J, and parallel electric field E ∥ , particularly on-axis, evolve. At the sawtooth crash, on-axis safety factor q 0 is observed to rise by 5% but remain below 1 throughout the cycle, and on-axis current density J 0 is observed to drop by 5%. On-axis parallel electric field E ∥ (0) is found to be balanced by ηJ 0 (resistivity times on-axis current density) except during the 200 µs crash period, where E ∥ (0) reaches 22 V m –1 , exceeding ηJ 0 by a factor of more than 2000. These first measurements in tokamak plasmas verify that generalized Ohm's law is not balanced during the crash by resistive effects alone; this is a finding expected due to the relaxation being much faster than resistive timescales. As a result, measurement of the electric field during the tokamak sawtooth serves to illuminate the physical mechanisms at work.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2019

LP-BNN: Ultra-low-Latency BNN Inference with Layer Parallelism

High inference latency seriously limits the deployment of DNNs in real-time domains such as autonomous driving, robotic control, and many others. To address this emerging challenge, researchers have proposed approximate DNNs with reduced precision, e.g., Binarized Neural Networks (BNNs). While BNNs can be built to have little loss in accuracy, latency reduction still has much room for improvement. In this paper, we propose a single-FPGA-based BNN accelerator that achieves microsecond-level ultra-low-latency inference of ImageNet, LP- BNN. We obtain this performance via several design optimizations. First, we optimize the network structure by removing Batch Normalization (BN) functions which leads to significant latency in BNNs without any loss on accuracy. Second, we propose a parameterized architecture which is based on layer parallelism and supports nearly perfect load balancing for various types of BNNs. Third, we fuse all the convolution layers and the first fully connected layer. We process them in parallel through fine- grained inter-layer pipelining. With our proposed accelerator, the inference of binarized AlexNet, VGGNet, and ResNet are completed within 21.5µs, 355µs, and 67.8µs respectively, with no loss in accuracy as compared with other BNN implementations.

Geng, Tong↗
NASA NTRS1990

Ion Beam Heating in the Auroral Zone

Recent satellite observations at high altitudes (greater than 5000 km) in the auroral zone have shown the existence of hybrid or bimodal ion beam distributions that are evidence of both parallel and perpendicular ion acceleration. Acceleration parallel to the magnetic field is most likely due to quasi-static electric fields (double layers) which can create outflowing ion beams; since ions of different mass will have different drift speeds due to this acceleration, a plasma configuration unstable to the ion-ion two-stream acoustic mode develops. When the net drift velocity (U) between the two ion species is greater than the sound speed (C(sub 0)), the ion-ion instability has maximum growth at oblique wave propagation. To study the nonlinear effects of the ion-ion instability in terms of plasma heating, a numerical simulation parametric study has been performed. It was found that the parallel acceleration that forms the ion beams occurs on a time scale faster than ion- ion wave growth at low drifts; thus ion-ion wave growth is expected to occur primarily for higher drift speeds (U greater than C(sub 0)) which results in strong oblique heating of the ions (both hydrogen and oxygen) forming elevated ion conics (sometimes called 'bowl' distributions). Also, strong parallel electron heating in the direction of the ion beams can occur, and electrons near the top of the acceleration region may attain a net upward drift along with the elevated ion conics. Variation of the oxygen density greatly affects the ion heating due to the ion-ion instability; as the oxygen density decreases, oxygen heating increases, in agreement with observations (Collin et al., 1987). Ion-ion electrostatic wave properties and the plasma heating that results over a wide range of auroral zone parameters are included.

Schriver, David↗
NASA NTRS1994

A high-speed linear algebra library with automatic parallelism

Parallel or distributed processing is key to getting highest performance workstations. However, designing and implementing efficient parallel algorithms is difficult and error-prone. It is even more difficult to write code that is both portable to and efficient on many different computers. Finally, it is harder still to satisfy the above requirements and include the reliability and ease of use required of commercial software intended for use in a production environment. As a result, the application of parallel processing technology to commercial software has been extremely small even though there are numerous computationally demanding programs that would significantly benefit from application of parallel processing. This paper describes DSSLIB, which is a library of subroutines that perform many of the time-consuming computations in engineering and scientific software. DSSLIB combines the high efficiency and speed of parallel computation with a serial programming model that eliminates many undesirable side-effects of typical parallel code. The result is a simple way to incorporate the power of parallel processing into commercial software without compromising maintainability, reliability, or ease of use. This gives significant advantages over less powerful non-parallel entries in the market.

Boucher, Michael L.↗
NASA NTRS2002

National Combustion Code Parallel Performance Enhancements

The National Combustion Code (NCC) is being developed by an industry-government team for the design and analysis of combustion systems. The unstructured grid, reacting flow code uses a distributed memory, message passing model for its parallel implementation. The focus of the present effort has been to improve the performance of the NCC code to meet combustor designer requirements for model accuracy and analysis turnaround time. Improving the performance of this code contributes significantly to the overall reduction in time and cost of the combustor design cycle. This report describes recent parallel processing modifications to NCC that have improved the parallel scalability of the code, enabling a two hour turnaround for a 1.3 million element fully reacting combustion simulation on an SGI Origin 2000.

Quealy, Angela↗
DOE OSTI2016

Comparison of Hybrid K-Edge Densitometer (HKED) Performance Operating with the Canberra Lynx MCA and the Canberra ICB-NIM Electronics

From the 1991 until 2008 the Canberra Hybrid K-Edge Densitometer systems were provided with ICB-NIM (Integrated Control Bus – Nuclear Instrument Module) acquisition electronics. Newer electronics modules, such as the Lynx, were not supported under the VMS based operating system. The LYNX module was provided as the standard acquisition electronics following the release of the Windows based CHKED software. This report compares the electronics dead-time, gain shifts, detector resolution and measurement performance of the HKED system operated with the two types of acquisition modules. The comparison was performed using measurements obtained with the ORNL HKED system. The original intent of this study was to take advantage of both the timing and energy outputs from the HPGE detector to acquire data with both sets of electronics in parallel. Although this approach has been applied successfully with other systems, in this case we found the timing output produced a significant amount of noise such that a comparison between the electronics would be invalid. So the comparative measurements were performed sequentially. The ICB-NIM data was acquired over the course of 12 months with 255 measurements while the LYNX data was acquired over a period of 10 months with 75 measurements. To simplify the comparison, all data used in this study was acquired using the Canberra CHKED (V1.0) software package. The performance analysis was based primarily on the peak locations, peak widths and concentration values reported by the CHKED software. The raw spectra from the XRF measurements were also examined to extract additional 109Cd peak location and width data for the hybrid measurements (the standard hybrid report template does not report these values).

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
NASA NTRS1988

Parallel discrete event simulation using shared memory

With traditional event-list techniques, evaluating a detailed discrete-event simulation-model can often require hours or even days of computation time. By eliminating the event list and maintaining only sufficient synchronization to ensure causality, parallel simulation can potentially provide speedups that are linear in the numbers of processors. A set of shared-memory experiments, using the Chandy-Misra distributed-simulation algorithm, to simulate networks of queues is presented. Parameters of the study include queueing network topology and routing probabilities, number of processors, and assignment of network nodes to processors. These experiments show that Chandy-Misra distributed simulation is a questionable alternative to sequential-simulation of most queueing network models.

Reed, Daniel A.↗
NASA NTRS2015

2nd-Order CESE Results For C1.4: Vortex Transport by Uniform Flow

The Conservation Element and Solution Element (CESE) method was used as implemented in the NASA research code ez4d. The CESE method is a time accurate formulation with flux-conservation in both space and time. The method treats the discretized derivatives of space and time identically and while the 2nd-order accurate version was used, high-order versions exist, the 2nd-order accurate version was used. In regards to the ez4d code, it is an unstructured Navier-Stokes solver coded in C++ with serial and parallel versions available. As part of its architecture, ez4d has the capability to utilize multi-thread and Messaging Passage Interface (MPI) for parallel runs.

Space-time CE/SE method↗
NASA NTRS1985

Parallel processor programs in the Federal Government

In 1982, a report dealing with the nation's research needs in high-speed computing called for increased access to supercomputing resources for the research community, research in computational mathematics, and increased research in the technology base needed for the next generation of supercomputers. Since that time a number of programs addressing future generations of computers, particularly parallel processors, have been started by U.S. government agencies. The present paper provides a description of the largest government programs in parallel processing. Established in fiscal year 1985 by the Institute for Defense Analyses for the National Security Agency, the Supercomputing Research Center will pursue research to advance the state of the art in supercomputing. Attention is also given to the DOE applied mathematical sciences research program, the NYU Ultracomputer project, the DARPA multiprocessor system architectures program, NSF research on multiprocessor systems, ONR activities in parallel computing, and NASA parallel processor projects.

Schneck, P. B.↗
NASA NTRS1991

Asynchronous and corrected-asynchronous numerical solutions of parabolic PDES on MIMD multiprocessors

A major problem in achieving significant speed-up on parallel machines is the overhead involved with synchronizing the concurrent process. Removing the synchronization constraint has the potential of speeding up the computation. The authors present asynchronous (AS) and corrected-asynchronous (CA) finite difference schemes for the multi-dimensional heat equation. Although the discussion concentrates on the Euler scheme for the solution of the heat equation, it has the potential for being extended to other schemes and other parabolic partial differential equations (PDEs). These schemes are analyzed and implemented on the shared memory multi-user Sequent Balance machine. Numerical results for one and two dimensional problems are presented. It is shown experimentally that the synchronization penalty can be about 50 percent of run time: in most cases, the asynchronous scheme runs twice as fast as the parallel synchronous scheme. In general, the efficiency of the parallel schemes increases with processor load, with the time level, and with the problem dimension. The efficiency of the AS may reach 90 percent and over, but it provides accurate results only for steady-state values. The CA, on the other hand, is less efficient, but provides more accurate results for intermediate (non steady-state) values.

Amitai, Dganit↗
NASA NTRS2000

National Combustion Code: Parallel Implementation and Performance

The National Combustion Code (NCC) is being developed by an industry-government team for the design and analysis of combustion systems. CORSAIR-CCD is the current baseline reacting flow solver for NCC. This is a parallel, unstructured grid code which uses a distributed memory, message passing model for its parallel implementation. The focus of the present effort has been to improve the performance of the NCC flow solver to meet combustor designer requirements for model accuracy and analysis turnaround time. Improving the performance of this code contributes significantly to the overall reduction in time and cost of the combustor design cycle. This paper describes the parallel implementation of the NCC flow solver and summarizes its current parallel performance on an SGI Origin 2000. Earlier parallel performance results on an IBM SP-2 are also included. The performance improvements which have enabled a turnaround of less than 15 hours for a 1.3 million element fully reacting combustion simulation are described.

Quealy, A.↗
DOE OSTI2018

Numerical Prediction of Cyclic Variability in a Spark Ignition Engine Using a Parallel Large Eddy Simulation Approach

Cycle-to-cycle variability (CCV) is detrimental to IC engine operation and can lead to partial burn, misfire, and knock. Predicting CCV numerically is extremely challenging due to two key reasons. First, high-fidelity methods such as large eddy simulation (LES) are required to accurately resolve the in-cylinder turbulent flow field both spatially and temporally. Second, CCV is experienced over long timescales and hence the simulations need to be performed for hundreds of consecutive cycles. Ameen et al. (2017, "Parallel Methodology to Capture Cyclic Variability in Motored Engines,"Int. J. Engine Res., 18(4), pp. 366-377.) developed a parallel perturbation model (PPM) approach to dissociate this long time-scale problem into several shorter time-scale problems. This strategy was demonstrated for motored engine and it was shown that the mean and variance of the in-cylinder flow field was captured reasonably well by this approach. In the present study, this PPM approach is extended to simulate the CCV in a fired port-fuel injected (PFI) spark ignition (SI) engine. The predictions from this approach are also shown to be similar to the consecutive LES cycles. It is shown that the parallel approach is able to predict the coefficient of variation (COV) of the in-cylinder pressure and burn raterelated parameters with sufficient accuracy, and is also able to predict the qualitative trends in CCV with changing operating conditions. It is shown that this new approach is able to give accurate predictions of the CCV in fired engines in less than one-tenth of the time required for the conventional approach of simulating consecutive engine cycles.

Ameen, Muhsin M.↗
NASA NTRS1989

The paradigm compiler: Mapping a functional language for the connection machine

The Paradigm Compiler implements a new approach to compiling programs written in high level languages for execution on highly parallel computers. The general approach is to identify the principal data structures constructed by the program and to map these structures onto the processing elements of the target machine. The mapping is chosen to maximize performance as determined through compile time global analysis of the source program. The source language is Sisal, a functional language designed for scientific computations, and the target language is Paris, the published low level interface to the Connection Machine. The data structures considered are multidimensional arrays whose dimensions are known at compile time. Computations that build such arrays usually offer opportunities for highly parallel execution; they are data parallel. The Connection Machine is an attractive target for these computations, and the parallel for construct of the Sisal language is a convenient high level notation for data parallel algorithms. The principles and organization of the Paradigm Compiler are discussed.

Dennis, Jack B.↗
NASA NTRS1976

Sun angle calculator

A circular computer and system is disclosed for determining the sun angle relative to the horizon from any given place and at any time. The computer includes transparent, rotatably mounted discs on both sides of the circular disc member. Printed on one side of the circular disc member are outer and inner circular sets of indicia respectively representative of site longitude and Greenwich Mean Time. Printed on an associated one of the rotatable discs is a set of indicia representative of Solar Time. Printed on the other side of the circular disc member are parallel lines representative of latitude between diametral representations of North and South poles. Elliptical lines extending between the North and South poles are proportionally disposed on the surface to scale Solar Time in hours.

Flippin, A.↗
NASA NTRS1991

Modelling parallel programs and multiprocessor architectures with AXE

AXE, An Experimental Environment for Parallel Systems, was designed to model and simulate for parallel systems at the process level. It provides an integrated environment for specifying computation models, multiprocessor architectures, data collection, and performance visualization. AXE is being used at NASA-Ames for developing resource management strategies, parallel problem formulation, multiprocessor architectures, and operating system issues related to the High Performance Computing and Communications Program. AXE's simple, structured user-interface enables the user to model parallel programs and machines precisely and efficiently. Its quick turn-around time keeps the user interested and productive. AXE models multicomputers. The user may easily modify various architectural parameters including the number of sites, connection topologies, and overhead for operating system activities. Parallel computations in AXE are represented as collections of autonomous computing objects known as players. Their use and behavior is described. Performance data of the multiprocessor model can be observed on a color screen. These include CPU and message routing bottlenecks, and the dynamic status of the software.

Yan, Jerry C.↗