Search NASA⌕ Search

SEARCH · Search NASA

Results for “Parallel in Time”

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,171 records · Page 65

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↗

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.↗

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.↗

Minimizing System Noise Effects For Extreme-Scale Scientific Simulation Through Function Delegation

The primary goal of the Minimizing System Noise Effects For Extreme-Scale Scientific Simulation through Function Delegation project is to eliminate or at best strongly minimize the impact of the noise introduced by the operating system, during large scale parallel applications runs. Collective communication operations are a basic building block for parallel programing models and scientific applications. These operations often dominate execution time of applications and tend to limit their scalability. In order to address this challenge, we evaluated different strategies to adapt the collective communications underlying topologies to the hardware architecture in order to provide increased levels of performance to the parallel applications.

97 MATHEMATICS AND COMPUTING↗

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.↗

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.↗

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.↗

Scheduling message processing for reducing rollback propagation

Traditional checkpointing and rollback recovery techniques for parallel systems have typically assumed the communication pattern is specified by program behavior. In this paper we exploit the property that the communication pattern can often be changed at run-time without affecting program correctness. A scheduling algorithm for message processing and its implementation for reducing rollback propagation are described. The algorithm incorporates a user-transparent prioritized scheme based upon the run-time communication and checkpointing history. Communication trace-driven simulation for several parallel programs written in the Chare Kernel language demonstrates that the probability of rollback propagation can be reduced at the cost of slight additional performance degradation.

Wang, Yi-Min↗

A parallel pipelined architecture for a digital multicarrier demodulator

A parallel pipelined architecture is presented for demultiplexing and demodulating SCPC/FDMA channels in real time. Specific algorithms are selected for each of the operations necessary for multicarrier demodulation. The selection is made based on their suitability for implementation into parallel-pipelined and sharing schemes. The demodulator is programmable and uses a single hardware module which is shared among all the channels for the recovery of clock, carrier, and data, resulting in large savings of power and hardware. The system is suitable for onboard processing of signals in satellites where power and area requirements are critical. The design is illustrated for the specific case of processing 800 FDMA channels at 64 kb/s each.

Fernandes, P. J.↗

Visualization of Unsteady Computational Fluid Dynamics

The current compute environment that most researchers are using for the calculation of 3D unsteady Computational Fluid Dynamic (CFD) results is a super-computer class machine. The Massively Parallel Processors (MPP's) such as the 160 node IBM SP2 at NAS and clusters of workstations acting as a single MPP (like NAS's SGI Power-Challenge array and the J90 cluster) provide the required computation bandwidth for CFD calculations of transient problems. If we follow the traditional computational analysis steps for CFD (and we wish to construct an interactive visualizer) we need to be aware of the following: (1) Disk space requirements. A single snap-shot must contain at least the values (primitive variables) stored at the appropriate locations within the mesh. For most simple 3D Euler solvers that means 5 floating point words. Navier-Stokes solutions with turbulence models may contain 7 state-variables. (2) Disk speed vs. Computational speeds. The time required to read the complete solution of a saved time frame from disk is now longer than the compute time for a set number of iterations from an explicit solver. Depending, on the hardware and solver an iteration of an implicit code may also take less time than reading the solution from disk. If one examines the performance improvements in the last decade or two, it is easy to see that depending on disk performance (vs. CPU improvement) may not be the best method for enhancing interactivity. (3) Cluster and Parallel Machine I/O problems. Disk access time is much worse within current parallel machines and cluster of workstations that are acting in concert to solve a single problem. In this case we are not trying to read the volume of data, but are running the solver and the solver outputs the solution. These traditional network interfaces must be used for the file system. (4) Numerics of particle traces. Most visualization tools can work upon a single snap shot of the data but some visualization tools for transient problems require dealing with time.

Haimes, Robert↗

Defining Lipidomic Responses to Coronavirus Infection

Highly pathogenic human coronavirus infection can cause a severe atypical, rapid onset pneumonia with a mortality rate of up to 10% for severe acute respiratory syndrome coronavirus 1 (SARS-CoV 1), 35% for Middle East respiratory syndrome coronavirus (MERS-CoV), or 1% for severe acute respiratory syndrome coronavirus 2 (SARS-CoV 2 causative agent of COVID 19). While medical countermeasures successfully controlled the worldwide SARS-CoV epidemic, the MERS-CoV epidemic is still ongoing and continues to be a concern for travelers in the Middle East and the multi-year SARS-CoV 2 pandemic underscore the importance of defining biomarkers that are diagnostic and/or predictive of severe disease outcomes for respiratory viruses. Systems biology approaches provide global snapshots of infection induced changes in host cells/tissues and provide extremely rich datasets for understanding host pathogen interactions. Metabolites, especially lipids, are critical for viral replication but less is understood about infection induced changes to lipids due to limits in lipid species detection and identification. To characterize how individual lipid species and proteins with lipid associated functions contribute to highly pathogenic human coronavirus replication and disease severity, existing datasets were probed to determine cell type specific lipid responses to MERS-CoV infection and verification studies were performed to determine if modification of the host lipid signature (by inhibiting enzymatic functions that produce specific lipid species) can perturb CoV replication in human lung cells. MERS-CoV infects human lung epithelial, endothelial and fibroblast cells. All three cell types were infected with MERS-CoV and samples collected to analyze lipids, proteins, metabolites, and transcripts from 12 to 48 hours post infection. Time matched mock-infected cells were collected in parallel for each cell type. Following sample and statistical analysis, functional enrichment and bioinformatic analysis was performed to identify differentially expressed lipids and proteins. Two lipid species were found to be significantly upregulated following MERS-CoV infection, ceramides, and triacylglycerol both of which are indicative of cells undergoing apoptotic cell death. In contrast, sphingomyelins (lipid molecules that can serve as a precursor for one pathway for ceramide synthesis) had significantly decreased expression in MERS-CoV infected cells. An inhibitor of acid sphingomyelinase (that converts sphingomyelin to ceramides and phosphorylcholine) reduced MERS-CoV replication suggesting that production of ceramides is key for successful viral replication and transmission. Acyl-CoA-synthetase 3 (ACSL3), the only protein whose function is lipid associated and had increased differential expression in our dataset, regulates the synthesis of triacylglycerol (increased expression). Inhibitors that directly block ACSL3 (Triacsin C) but not steps later in the triacylglycerol synthesis pathway (Etomoxir) inhibit MERS-CoV replication suggesting that triacylglycerol production and/or ACSL3 activity is also key for viral replication. ACSL3 expression is also upregulated in lung cancer cells and is predicted to promote continued cell viability which would also enhance viral replication. The differentially expressed lipid and lipid-associated protein species identified in our studies suggest that MERS-CoV infection is activating cellular death pathways to limit the number of cells that become infected but also stimulating the production of lipid-associated enzymes that can prolong host cell viability and the amount of time progeny virions can be produced and released. As the inhibitors that worked against MERS-CoV infection were also efficacious against SARS-CoV 2 infection, countermeasures that target these host pathways may provide novel ways to block highly pathogenic human coronavirus infection and/or prevent severe disease outcomes.

59 BASIC BIOLOGICAL SCIENCES↗

On-board landmark navigation and attitude reference parallel processor system

An approach to autonomous navigation and attitude reference for earth observing spacecraft is described along with the landmark identification technique based on a sequential similarity detection algorithm (SSDA). Laboratory experiments undertaken to determine if better than one pixel accuracy in registration can be achieved consistent with onboard processor timing and capacity constraints are included. The SSDA is implemented using a multi-microprocessor system including synchronization logic and chip library. The data is processed in parallel stages, effectively reducing the time to match the small known image within a larger image as seen by the onboard image system. Shared memory is incorporated in the system to help communicate intermediate results among microprocessors. The functions include finding mean values and summation of absolute differences over the image search area. The hardware is a low power, compact unit suitable to onboard application with the flexibility to provide for different parameters depending upon the environment.

Gilbert, L. E.↗

High-Performance Computing Optimization for Aladyn – Adaptive Neural Network Molecular Dynamics Mini-Application

This report provides a description and performance evaluation of the optimization techniques for high performance computing (HPC) implementation of the open source Computational Materials mini-application Aladyn (https://github.com/nasa/aladyn). Aladyn is a basic molecular dynamics code written in FORTRAN 2003, which is designed to demonstrate the use of adaptive neural networks (ANNs) in atomistic simulations. The role of ANNs is to efficiently reproduce the very complex energy landscape resulting from the atomic interactions in materials with the accuracy of the more expensive quantum mechanics-based calculations. The ANN is trained on a large set of atomic structures calculated using the density functional theory (DFT) method. While achieving orders of magnitude faster computational performance than DFT, the ANN-based approach was still very computationally demanding compared to the conventional approach of using empirically fitted energy functions. After its initial development, Aladyn was evaluated and optimized by experts at the NASA Advanced Supercomputing (NAS) division to exploit modern supercomputer architectures. The code has been optimized for execution on multicore central processing units (CPUs), including Intel® Skylake microarchitecture, and on graphic accelerators, such as Nvidia® V100 graphic processing units (GPUs), using Open Multi-Processing (OpenMP) and Open Accelerators (OpenACC) programming interfaces. The optimization achieved a speedup of 4.7 times the baseline version on CPU performance and an additional 2.4 times on CPU+GPU performance. Atomistic computer simulations are a fundamental tool in materials research to model material properties form physics-based first principles. Atomic interaction, governed by Quantum Mechanics (QM) require sophisticated and highly computationally demanding mathematical models to calculate [1]. Classical methods use approximate functional forms, empirically fitted through a set of variable parameters to emulate atomic energies as direct functions of atomic coordinates [2]. While empirical potentials are computationally much simpler, allowing simulations of large-scale systems of up to a trillion (1012) atoms [3], they are substantially less accurate compared to quantum calculations and applicable only to very specific atomic configurations or predefined crystallographic phases. A recently suggested approach is to use heuristic machine learning methods [4], such as those based on Adaptive Neural Networks (ANNs) to predict atomic energies, after being trained on a sufficiently large database of QM-calculated structures [5,6]. This approach reduces significantly the computational complexity, allowing for simulations of orders of magnitude larger systems compared to QM-based methods without compromising accuracy. Still, compared to classical methods using empirical energy functions, ANN methods remain two- to three orders of magnitude more computationally demanding. Hence, the computational cost of simulations, together with the need for extensive training of ANNs, still makes the practical implementation of ANN-based methods quite challenging. The purpose of the Aladyn mini-application software [7], available as open source at https://github.com/nasa/aladyn, is to be a testbed for exploring possible optimization strategies to develop highly scalable parallel algorithms for ANN-based atomistic simulations. Aladyn is aimed at utilizing the architecture of the high-end modern highperformance computing (HPC) hardware based on multicore central processing units (CPUs) equipped with graphic processing unit (GPU) accelerators. Specifically, the goal is to optimize the performance on a single HPC compute node, before implementing scaling to multi-node parallelization using message passing interface (MPI). At the same time, the open source code of Aladyn can serve as a training model for students and professors in academia.

Yamakov, Vesselin I.↗

Scalability Tests of a Finite Element Code on Hundreds of Thousands Cores and Heterogeneous Architecture

A multi-scale finite element method code, msFEM, is tested on Jaguar and Nebulae, two petaflops computers that were listed as #1 and #2 on the Top500 list of June 2010 at the time of the tests. The flat MPI version of msFEM is scaled from 20K up to 200K CPU cores on Jaguar, delivering 70% parallel efficiency at the 200K cores with a finite element model of eight millions of degrees of freedom. GPU versions, in both double precision and mixed precision coded through MPI+OpenMP+CUDA hybrid programming, 900 GPU nodes on Jaguar and 1500 GPU nodes on Nebulae, achieving remarkable 90 + % parallel efficiency on the systems. The mixed-precision GPU version delivers further 1.5 times of speedup over the fully double precision version with no significant implementational cost. The large-scale tests support that the msFEM runs efficiently on petaflops computers and is highly potential for domain applications at extreme-scale.

finite element method↗

A broadband wavelet implementation for rapid ultrasound pulse-echo time-of-flight measurements

A broadband wavelet approach to ultrasonic pulse-echo time-of-flight measurements is described. The broadband approach significantly reduces the time required for frequency-dependent pulse-echo measurements, enabling studies of dynamic systems ranging from biological systems to solid-state phase transitions. The described broadband approach is demonstrated in parallel with the more traditional frequency stepping approach to perform ultrasound time-of-flight measurements inside a large volume Paris-Edinburgh press in-situ at a synchrotron source. The broadband wavelet data acquisition process was found to be 1-2 orders of magnitude faster than the steppedfrequency approach, with no compromise in data quality or determined results.

47 OTHER INSTRUMENTATION↗

A Parallel Processing Algorithm for Remote Sensing Classification

A current thread in parallel computation is the use of cluster computers created by networking a few to thousands of commodity general-purpose workstation-level commuters using the Linux operating system. For example on the Medusa cluster at NASA/GSFC, this provides for super computing performance, 130 G(sub flops) (Linpack Benchmark) at moderate cost, $370K. However, to be useful for scientific computing in the area of Earth science, issues of ease of programming, access to existing scientific libraries, and portability of existing code need to be considered. In this paper, I address these issues in the context of tools for rendering earth science remote sensing data into useful products. In particular, I focus on a problem that can be decomposed into a set of independent tasks, which on a serial computer would be performed sequentially, but with a cluster computer can be performed in parallel, giving an obvious speedup. To make the ideas concrete, I consider the problem of classifying hyperspectral imagery where some ground truth is available to train the classifier. In particular I will use the Support Vector Machine (SVM) approach as applied to hyperspectral imagery. The approach will be to introduce notions about parallel computation and then to restrict the development to the SVM problem. Pseudocode (an outline of the computation) will be described and then details specific to the implementation will be given. Then timing results will be reported to show what speedups are possible using parallel computation. The paper will close with a discussion of the results.

Gualtieri, J. Anthony↗

Collimator design for a dedicated molecular breast imaging-guided biopsy system: Proof-of-concept

Purpose: Molecular breast imaging (MBI) is a dedicated nuclear medicine breast imaging modality that employs dual-head cadmium zinc telluride (CZT) gamma cameras to functionally detect breast cancer. MBI has been shown to detect breast cancers otherwise occult on mammography and ultrasound. Currently, a MBI-guided biopsy system does not exist to biopsy such lesions. Our objective was to consider the utility of a novel conical slant-hole (CSH) collimator for rapid (<1 min) and accurate monitoring of lesion position to serve as part of a MBI-guided biopsy system. Methods: An initial CSH collimator design was derived from the dimensions of a parallel-hole collimator optimized for MBI performed with dual-head CZT gamma cameras. The parameters of the CSH collimator included the collimator height, cone slant angle, thickness of septa and cones of the collimator, and the annular areas exposed at the base of the cones. These parameters were varied within the geometric constraints of the MBI system to create several potential CSH collimator designs. The CSH collimator designs were evaluated using Monte Carlo simulations. The model included a breast compressed to a thickness of 6 cm with a 1-cm diameter lesion located 3 cm from the collimator face. The number of particles simulated was chosen to represent the count density of a low-dose, screening MBI study acquired with the parallel-hole collimator for 10 min after a {approx}150 MBq (4 mCi) injection of Tc-99m sestamibi. The same number of particles was used for the CSH collimator simulations. In the resulting simulated images, the count sensitivity, spatial resolution, and accuracy of the lesion depth determined from the lesion profile width were evaluated. Results: The CSH collimator design with default parameters derived from the optimal parallel-hole collimator provided 1-min images with error in the lesion depth estimation of 1.1 {+-} 0.7 mm and over 21 times the lesion count sensitivity relative to 1-min images acquired with the current parallel-hole collimator. Sensitivity was increased via more vertical cone slant angles, larger annular areas, thinner cone walls, shorter cone heights, and thinner radiating septa. Full width at half maximum trended in the opposite direction as sensitivity for all parameters. There was less error in the depth estimates for less vertical slant angles, smaller annular areas, thinner cone walls, cone heights near 1 cm, and generally thinner radiating septa. Conclusions: A Monte Carlo model was used to demonstrate the feasibility of a CSH collimator design for rapid biopsy application in molecular breast imaging. Specifically, lesion depth of a 1-cm diameter lesion positioned in the center of a typical breast can be estimated with error of less than 2 mm using circumferential count profiles of images acquired in 1 min.

60 APPLIED LIFE SCIENCES↗

Efficient parallel algorithms for string editing and related problems

The string editing problem for input strings x and y consists of transforming x into y by performing a series of weighted edit operations on x of overall minimum cost. An edit operation on x can be the deletion of a symbol from x, the insertion of a symbol in x or the substitution of a symbol x with another symbol. This problem has a well known O((absolute value of x)(absolute value of y)) time sequential solution (25). The efficient Program Requirements Analysis Methods (PRAM) parallel algorithms for the string editing problem are given. If m = ((absolute value of x),(absolute value of y)) and n = max((absolute value of x),(absolute value of y)), then the CREW bound is O (log m log n) time with O (mn/log m) processors. In all algorithms, space is O (mn).

Apostolico, Alberto↗