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,567 records · Page 87

Concurrent processing adaptation of aeroplastic analysis of propfans

Discussed here is a study involving the adaptation of an advanced aeroelastic analysis program to run concurrently on a shared memory multiple processor computer. The program uses a three-dimensional compressible unsteady aerodynamic model and blade normal modes to calculate aeroelastic stability and response of propfan blades. The identification of the computational parallelism within the sequential code and the scheduling of the concurrent subtasks to minimize processor idle time are discussed. Processor idle time in the calculation of the unsteady aerodynamic coefficients was reduced by the simple strategy of appropriately ordering the computations. Speedup and efficiency results are presented for the calculation of the matched flutter point of an experimental propfan model. The results show that efficiencies above 70 percent can be obtained using the present implementation with 7 processors. The parallel computational strategy described here is also applicable to other aeroelastic analysis procedures based on panel methods.

Janetzke, David C.↗

Concurrent processing adaptation of aeroelastic analysis of propfans

This paper reports on a study involving the adaptation of an advanced aeroelastic analysis program to run concurrently on a shared memory multiple processor computer. The program uses a three-dimensional compressible unsteady aerodynamic model and blade normal modes to calculate aeroelastic stability and response of propfan blades. The identification of the computational parallelism within the sequential code and the scheduling of the concurrent subtasks to minimize processor idle time are discussed. Processor idle time in the calculation of the unsteady aerodynamic coefficients was reduced by the simple strategy of appropriately ordering the computations. Speedup and efficiency results are presented for the calculation of the matched flutter point of an experimental propfan model. The results show that efficiencies above 70 percent can be obtained using the present implementation with 7 processors. The parallel computational strategy described here is also applicable to other aeroelastic analysis procedures based on parallel methods.

Murthy, Durbha V.↗

Concurrent processing adaptation of aeroelastic analysis of propfans

Discussed here is a study involving the adaptation of an advanced aeroelastic analysis program to run concurrently on a shared memory multiple processor computer. The program uses a three-dimensional compressible unsteady aerodynamic model and blade normal modes to calculate aeroelastic stability and response of propfan blades. The identification of the computational parallelism within the sequential code and the scheduling of the concurrent subtasks to minimize processor idle time are discussed. Processor idle time in the calculation of the unsteady aerodynamic coefficients was reduced by the simple strategy of appropriately ordering the computations. Speedup and efficiency results are presented for the calculation of the matched flutter point of an experimental propfan model. The results show that efficiencies above 70 percent can be obtained using the present implementation with 7 processors. The parallel computational strategy described here is also applicable to other aeroelastic analysis procedures based on panel methods.

Murthy, D. V.↗

Real-time multi-EC-actuator MHD control on TCV

Real-time control of multiple plasma actuators is a requirement in advanced tokamaks; for example for burn control, plasma current profile control and MHD stabilization - EC wave absorption is ideally suited especially for the latter. For example, on ITER 24 EC sources can be switched between 54 inputs at the torus. In the torus, 5 launchers direct the power to various locations across the plasma profile via 11 steerable mirrors. For optimal usage of the available power, the aiming and polarization of the beams must be adapted to the plasma configuration and the needs of the scenario. Since the EC system performs many competing tasks, present day systems should demonstrate the ability of an EC plant to deal with several targets in parallel and/or to switch smoothly between goals to attain overall satisfaction. Recently TCV has taken a first step towards such a demonstration. Several EC launchers are used simultaneously to regulate the sawtooth period and to preempt m/n = 3/2 NTMs, by controlling the power levels. In parallel, a second algorithm stabilizes any NTM that saturates [1]. These and real-time MHD control experiments on ELMs [2] are presented.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

SWAP-Assembler: scalable and efficient genome assembly towards thousands of cores

Background: There is a widening gap between the throughput of massive parallel sequencing machines and the ability to analyze these sequencing data. Traditional assembly methods requiring long execution time and large amount of memory on a single workstation limit their use on these massive data. Results: This paper presents a highly scalable assembler named as SWAP-Assembler for processing massive sequencing data using thousands of cores, where SWAP is an acronym for Small World Asynchronous Parallel model. In the paper, a mathematical description of multi-step bi-directed graph (MSG) is provided to resolve the computational interdependence on merging edges, and a highly scalable computational framework for SWAP is developed to automatically preform the parallel computation of all operations. Graph cleaning and contig extension are also included for generating contigs with high quality. Experimental results show that SWAP-Assembler scales up to 2048 cores on Yanhuang dataset using only 26 minutes, which is better than several other parallel assemblers, such as ABySS, Ray, and PASHA. Results also show that SWAP-Assembler can generate high quality contigs with good N50 size and low error rate, especially it generated the longest N50 contig sizes for Fish and Yanhuang datasets. Conclusions: In this paper, we presented a highly scalable and efficient genome assembly software, SWAPAssembler. Compared with several other assemblers, it showed very good performance in terms of scalability and contig quality. This software is available at: https://sourceforge.net/projects/swapassembler

59 BASIC BIOLOGICAL SCIENCES↗

HipMCL: a high-performance parallel implementation of the Markov clustering algorithm for large-scale networks

Biological networks capture structural or functional properties of relevant entities such as molecules, proteins or genes. Characteristic examples are gene expression networks or protein–protein interaction networks, which hold information about functional affinities or structural similarities. Such networks have been expanding in size due to increasing scale and abundance of biological data. While various clustering algorithms have been proposed to find highly connected regions, Markov Clustering (MCL) has been one of the most successful approaches to cluster sequence similarity or expression networks. Despite its popularity, MCL’s scalability to cluster large datasets still remains a bottleneck due to high running times and memory demands. In this paper, we present High-performance MCL (HipMCL), a parallel implementation of the original MCL algorithm that can run on distributed-memory computers. We show that HipMCL can efficiently utilize 2000 compute nodes and cluster a network of ~70 million nodes with ~68 billion edges in ~2.4 h. By exploiting distributed-memory environments, HipMCL clusters large-scale networks several orders of magnitude faster than MCL and enables clustering of even bigger networks. Finally, HipMCL is based on MPI and OpenMP and is freely available under a modified BSD license.

59 BASIC BIOLOGICAL SCIENCES↗

Real-Time Reed-Solomon Decoder

RS decoder uses dedicated hardware and data pipelining for high-speed operation. Parallel processing techniques provide equivalent of over one billion operations per second at one step in decoding. Decoder finds commercial application in data encoding/decoding, telemetry, and radio communications.

Lahmeyer, C. R.↗

A Faster-Than-Real-Time Framework for Reliability-Oriented Simulation of PV Inverters

Physics-of-Failure (PoF) based reliability assessment for photovoltaic (PV) inverters requires long-duration electrical and electrothermal stress histories, yet generating such stress histories with high-fidelity switching models over year long mission profiles is computationally prohibitive. Conventional methods either sacrifice modeling fidelity for speed or require runtimes that are impractical for design iteration and uncertainty studies. To address this bottleneck, this paper presents a High-Performance Computing (HPC) based simulation frame work for faster-than-real-time reliability-oriented simulation. The proposed framework integrates the Average-to-Switching (A2S) method with parallel computing techniques to accelerate switching-level waveform reconstruction. We further introduce optimization strategies, including cluster merging and sensitivity based mission profile screening, to reduce the computational burden. Evaluated using real-world mission profile inputs and a MATLAB/Simulink switching-model reference, the framework reduces the simulation time for a one-year mission from an intractable multi-year duration to approximately 7.3 minutes while maintaining low waveform error. This acceleration provides a practical reliability-oriented simulation engine that can be coupled with component-specific aging models for subsequent PV inverter PoF assessment.

High-performance Computing↗

Moving target, distributed, real-time simulation using Ada

Research on a precompiler solution is described for the moving target compiler problem encountered when trying to run parallel simulation algorithms on several microcomputers. The precompiler is under development at NASA-Lewis for simulating jet engines. Since the behavior of any component of a jet engine, e.g., the fan inlet, rear duct, forward sensor, etc., depends on the previous behaviors and not the current behaviors of other components, the behaviors can be modeled on different processors provided the outputs of the processors reach other processors in appropriate time intervals. The simulator works in compute and transfer modes. The Ada procedure sets for the behaviors of different components are divided up and routed by the precompiler, which essentially receives a multitasking program. The subroutines are synchronized after each computation cycle.

Collins, W. R.↗

Parallel dispatch: a new paradigm of electrical power system dispatch

Modern power systems are evolving into sociotechnical systems with massive complexity, whose real-time operation and dispatch go beyond human capability. Thus, the need for developing and applying new intelligent power system dispatch tools are of great practical significance. In this paper, we introduce the overall business model of power system dispatch, the top level design approach of an intelligent dispatch system, and the parallel intelligent technology with its dispatch applications. We expect that a new dispatch paradigm, namely the parallel dispatch, can be established by incorporating various intelligent technologies, especially the parallel intelligent technology, to enable secure operation of complex power grids, extend system operators U+02BC capabilities, suggest optimal dispatch strategies, and to provide decision-making recommendations according to power system operational goals.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Local analysis of fast magnetic reconnection

Fast magnetic reconnection is defined by the topology of the magnetic field lines changing on a timescale that is approximately an order of magnitude longer than the topology-conserving ideal-evolution timescale. Fast reconnection is an intrinsic property of Faraday's law when the evolving magnetic field depends non-trivially on all three spatial coordinates and is commonly observed—even when the effects that allow topology breaking are arbitrarily small. The associated current density need only be enhanced by a factor of approximately ten and flows in thin but broad ribbons along the magnetic field. These results follow from the variation in the separation of neighboring pairs of magnetic field lines, which in an ideal evolution typically increases exponentially with time, and the existence of a spatial scale below which magnetic field lines freely change their identities due to non-ideal effects, such as resistivity. Traditional reconnection theory ignores exponentially large variations and relies on the current density reaching a magnitude that is exponentially larger than is actually required. Here, an analysis of the behavior of magnetic field lines in the neighborhood of an arbitrarily chosen line is used to obtain more precise and rigorous results on intrinsic reconnection. The maximum parallel kinetic energy of collisionless charged particles is shown to have an exponential increase in time during a generic magnetic evolution.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Integrable multistate Landau–Zener models with parallel energy levels

In this paper, we discuss solvable multistate Landau–Zener (MLZ) models whose Hamiltonians have commuting partner operators with ~1/τ-time-dependent parameters. Many already known solvable MLZ models belong precisely to this class. We derive the integrability conditions on the parameters of such commuting operators, and demonstrate how to use such conditions in order to derive new solvable cases. We show that MLZ models from this class must contain bands of parallel diabatic energy levels. The structure of the scattering matrix and other properties are found to be the same as in the previously discussed completely solvable MLZ Hamiltonians.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Near Real-Time Two and Three-Dimensional Electrical Geophysical Monitoring of Natural and Engineered Processes Associated with Subsurface Remediation - 16052

Legacy soil and groundwater contamination associated with nuclear weapons production is projected to be one of the largest cleanup liabilities to the U.S. Department of Energy for the foreseeable future. Remediation of subsurface contaminants is complicated by the combined effects of geochemical heterogeneity, geological heterogeneity, and the difficulty and expense of adequate borehole access. Each of these complications contributes to uncertainty in the distribution of contaminants and the performance of in situ treatments, which increases risk to human health and the environment and cost to closure in general. Electrical resistivity tomography (ERT) is a method of remotely imaging the electrical properties of the subsurface, which are governed by both geochemical and geological structure, thereby providing useful proxies for understanding contaminant distribution and the behavior in situ remediation processes. Recent advancements in both data collection and data processing capabilities are enabling ERT monitoring to be executed and provided to site operators in near real-time. To summarize the process, ERT surveys are rapidly and continuously collected during a time-sensitive operation such as an amendment injection. At the completion of each survey, data are transferred by wireless internet to offsite supercomputing resources for parallel tomographic inversion. Inversion results are then transferred back to onsite operators and/or other locations for visualization. In this paper, we demonstrate the utility of time-lapse ERT for monitoring fluid transport (both gas and liquid phase). We then demonstrate two real-time imaging applications for monitoring both natural and engineered processes at the Hanford Site within the vadose and the saturated zones. We expect this new capability for autonomous real-time imaging to enable ERT to be used as a cost-effective, short-term rapid feedback mechanism for guiding subsurface remediation injections, in addition to longer term monitoring of post-injection performance and environmental impact, all using the same electrode array and instrumentation. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Online multimedia retrieval on CPU–GPU platforms with adaptive work partition

Nearest neighbors search is a core operation found in several online multimedia services. These services have to handle very large databases, while, at the same time, they must minimize the query response times observed by users. This is specially complex because those services deal with fluctuating query workloads (rates). Consequently, they must adapt at run-time to minimize the response times as the load varies. In this paper, we address the aforementioned challenges with a distributed memory parallelization of the product quantization nearest neighbor search, also known as IVFADC, for hybrid CPU–GPU machines. Overall, our parallel IVFADC implements an out-of-GPU memory execution scheme to use the GPU for databases in which the index does not fit in its memory, which is crucial for searching in very large databases. The careful use of CPU and GPU with work stealing led to an average response time reduction of 2.4 as compared to using the GPU only. Also, our approach to adapt the system to fluctuating loads, called Dynamic Query Processing Policy (DQPP), attained a response time reduction of up to 5 vs. the best static (BS) policy for moderate loads. The system has attained high query processing rates and near-linear scalability in all experiments. We have evaluated our system on a machine with up to 256 NVIDIA V100 GPUs processing a database of 256 billion SIFT features vectors.

97 MATHEMATICS AND COMPUTING↗

MLP: A Parallel Programming Alternative to MPI for New Shared Memory Parallel Systems

Recent developments at the NASA AMES Research Center's NAS Division have demonstrated that the new generation of NUMA based Symmetric Multi-Processing systems (SMPs), such as the Silicon Graphics Origin 2000, can successfully execute legacy vector oriented CFD production codes at sustained rates far exceeding processing rates possible on dedicated 16 CPU Cray C90 systems. This high level of performance is achieved via shared memory based Multi-Level Parallelism (MLP). This programming approach, developed at NAS and outlined below, is distinct from the message passing paradigm of MPI. It offers parallelism at both the fine and coarse grained level, with communication latencies that are approximately 50-100 times lower than typical MPI implementations on the same platform. Such latency reductions offer the promise of performance scaling to very large CPU counts. The method draws on, but is also distinct from, the newly defined OpenMP specification, which uses compiler directives to support a limited subset of multi-level parallel operations. The NAS MLP method is general, and applicable to a large class of NASA CFD codes.

Taft, James R.↗

Analysis of composite ablators using massively parallel computation

In this work, the feasibility of using massively parallel computation to study the response of ablative materials is investigated. Explicit and implicit finite difference methods are used on a massively parallel computer, the Thinking Machines CM-5. The governing equations are a set of nonlinear partial differential equations. The governing equations are developed for three sample problems: (1) transpiration cooling, (2) ablative composite plate, and (3) restrained thermal growth testing. The transpiration cooling problem is solved using a solution scheme based solely on the explicit finite difference method. The results are compared with available analytical steady-state through-thickness temperature and pressure distributions and good agreement between the numerical and analytical solutions is found. It is also found that a solution scheme based on the explicit finite difference method has the following advantages: incorporates complex physics easily, results in a simple algorithm, and is easily parallelizable. However, a solution scheme of this kind needs very small time steps to maintain stability. A solution scheme based on the implicit finite difference method has the advantage that it does not require very small times steps to maintain stability. However, this kind of solution scheme has the disadvantages that complex physics cannot be easily incorporated into the algorithm and that the solution scheme is difficult to parallelize. A hybrid solution scheme is then developed to combine the strengths of the explicit and implicit finite difference methods and minimize their weaknesses. This is achieved by identifying the critical time scale associated with the governing equations and applying the appropriate finite difference method according to this critical time scale. The hybrid solution scheme is then applied to the ablative composite plate and restrained thermal growth problems. The gas storage term is included in the explicit pressure calculation of both problems. Results from ablative composite plate problems are compared with previous numerical results which did not include the gas storage term. It is found that the through-thickness temperature distribution is not affected much by the gas storage term. However, the through-thickness pressure and stress distributions, and the extent of chemical reactions are different from the previous numerical results. Two types of chemical reaction models are used in the restrained thermal growth testing problem: (1) pressure-independent Arrhenius type rate equations and (2) pressure-dependent Arrhenius type rate equations. The numerical results are compared to experimental results and the pressure-dependent model is able to capture the trend better than the pressure-independent one. Finally, a performance study is done on the hybrid algorithm using the ablative composite plate problem. It is found that there is a good speedup of performance on the CM-5. For 32 CPU's, the speedup of performance is 20. The efficiency of the algorithm is found to be a function of the size and execution time of a given problem and the effective parallelization of the algorithm. It also seems that there is an optimum number of CPU's to use for a given problem.

Shia, David↗

Numerical study of transition to supersonic flows in the edge plasma

The plasma scrape-off layer (SOL) in a tokamak is characterized by ion flow down a long narrow flux tube terminating on a solid surface. The ion flow velocity along a magnetic field line can be equal to or greater than sonic at the entrance of a Debye sheath or upstream in the presheath. This paper presents a numerical study of the transition between subsonic and supersonics flows. A quasineutral one-dimensional (1D) fluid code has been used for modeling of plasma transport in the SOL along magnetic field lines, both in steady state and under transient conditions. The model uses coupled equations for continuity, momentum, and energy balance with ionization, radiation, charge exchange, and recombination processes. The recycled neutrals are described in the diffusion approximation. Standard Bohm sheath criterion is used as boundary conditions at the material surface. Three conditions conducive for the generation of supersonic flows in SOL plasmas have been explored. It is found that in steady state high (attached) and low (detached) divertor temperatures cases, the role of particle, momentum, and energy loss is critical. For attached case, the appearance of shock waves in the divertor region if the incoming plasma flow is supersonic and its effect on impurity retention is presented. In the third case, plasma expansion along the magnetic field can yield time-dependent supersonic solutions in the quasineutral rarefaction wave. Such situations can arise in the parallel transport of intermittent structures such as blobs and edge localized mode filaments along field lines.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗