Search NASA⌕ Search

SEARCH · Search NASA

Results for “concurrent data structure”

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 145 records · Page 8
All sourcesNASA NTRSDOE OSTI
NASA NTRS1987

Applications considerations in the system design of highly concurrent multiprocessors

A flow model processor approach to parallel processing is described, using very-high-performance individual processors, high-speed circuit switched interconnection networks, and a high-speed synchronization capability to minimize the effect of the inherently serial portions of applications on performance. Design studies related to the determination of the number of processors, the memory organization, and the structure of the networks used to interconnect the processor and memory resources are discussed. Simulations indicate that applications centered on the large shared data memory should be able to sustain over 500 million floating point operations per second.

Lundstrom, Stephen F.↗
DOE OSTI2025

Enriched immersed finite element and isogeometric analysis: algorithms and data structures

Immersed finite element methods provide a convenient analysis framework for problems involving geometrically complex domains, such as those found in topology optimization and microstructures for engineered materials. However, their implementation remains a major challenge due to, among other things, the need to apply nontrivial stabilization schemes and generate custom quadrature rules. This article introduces the robust and computationally efficient algorithms and data structures comprising an immersed finite element preprocessing framework. The input to the preprocessor consists of a background mesh and one or more geometries defined on its domain. The output is structured into groups of elements with custom quadrature rules formatted such that common finite element assembly routines may be used without or with only minimal modifications. The key to the preprocessing framework is the construction of material topology information, concurrently with the generation of a quadrature rule, which is then used to perform enrichment and generate stabilization rules. While the algorithmic framework applies to a wide range of immersed finite element methods using different types of meshes, integration, and stabilization schemes, the preprocessor is presented within the context of the extended isogeometric analysis. This method utilizes a structured B-spline mesh, a generalized Heaviside enrichment strategy considering the material layout within individual basis functions’ supports, and face-oriented ghost stabilization. Using a set of examples, the effectiveness of the enrichment and stabilization strategies is demonstrated alongside the preprocessor’s robustness in geometric edge cases. Additionally, the performance and parallel scalability of the implementation are evaluated.

Computer implementation↗
DOE OSTI2024

ECP libraries and tools: An overview

The Exascale Computing Project (ECP) Software Technology and Co-Design teams addressed the growing complexities in high-performance computing (HPC) by developing scalable software libraries and tools that leverage exascale system capabilities. As we enter the exascale era, the need for reusable, optimized software solutions that can handle the unique challenges posed by these systems becomes increasingly important. The primary challenges the ECP teams faced were to create software libraries and tools that are performant on exascale architectures and portable and usable across diverse hardware platforms. Efforts addressed issues related to concurrent execution, memory management, and the integration of heterogeneous computing resources, such as GPUs from multiple vendors. The ECP’s strategy involved a structured development process encompassing the creation, optimization, and deployment of software in collaboration with industry, academia, and national laboratories. The project was organized into several technical areas: co-design of domain-specific suites with target applications, programming models and runtimes, development tools, mathematical libraries, data and visualization tools, and software ecosystem and delivery mechanisms. ECP has successfully developed a large portfolio of software libraries and tools that demonstrate significant improvements in performance and scalability on exascale systems. These products have been integrated into the Department of Energy’s computing facilities, supporting various scientific applications and ensuring robust performance across different hardware setups. ECP advancements in software development for exascale computing highlight the importance of a collaborative and adaptive approach to handling next-generation HPC systems complexities. The lessons learned emphasize the need for continuous engagement with end-users and vendors, and the importance of maintaining a balance between innovation and practical implementation. Future efforts will focus on ensuring scalability, keeping pace with rapid hardware advancements, and further enhancing the interoperability and usability of the software ecosystem. In conclusion, subsequent articles in this special issue provide in-depth discussions and case studies into specific library and tool efforts.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2003

Update on Integrated Optical Design Analyzer

Updated information on the Integrated Optical Design Analyzer (IODA) computer program has become available. IODA was described in Software for Multidisciplinary Concurrent Optical Design (MFS-31452), NASA Tech Briefs, Vol. 25, No. 10 (October 2001), page 8a. To recapitulate: IODA facilitates multidisciplinary concurrent engineering of highly precise optical instruments. The architecture of IODA was developed by reviewing design processes and software in an effort to automate design procedures. IODA significantly reduces design iteration cycle time and eliminates many potential sources of error. IODA integrates the modeling efforts of a team of experts in different disciplines (e.g., optics, structural analysis, and heat transfer) working at different locations and provides seamless fusion of data among thermal, structural, and optical models used to design an instrument. IODA is compatible with data files generated by the NASTRAN structural-analysis program and the Code V (Registered Trademark) optical-analysis program, and can be used to couple analyses performed by these two programs. IODA supports multiple-load-case analysis for quickly accomplishing trade studies. IODA can also model the transient response of an instrument under the influence of dynamic loads and disturbances.

Moore, James D., Jr.↗
NASA NTRS2024

Shape Servoing of Deformable Objects Using Model Estimation and Barrier Lyapunov Function

An adaptive shape servoing control method is presented in this article to manipulate a deformable object into a desired shape in 3-D. A finite-point-based representation of the deformable object is used and the deformation Jacobian matrix is approximated using Fourier series basis functions. The unknown parameters of the deformation Jacobian are learned by using the velocity applied to a control point on the object and corresponding change of positions of the points describing the entire object. An integral concurrent learning (ICL)-based parameter update law is designed along with a constrained controller to satisfy the state constraints on the motion of the control point using Barrier Lyapunov function analysis. ICL-based parameter update law uses data history of velocity and corresponding positions of the points along with their current values. An efficient algorithm to update the history stack using singular value maximization is proposed based on the structure of the regressor matrix. Simulations using a physical simulator and experiments using a robot platform are performed to validate the performance of the proposed controller on two different deformable objects.

Vrithik Raj Guthikonda↗
NASA NTRS1992

Design of potent substrate-analogue inhibitors of canine renin

Through a systematic study of structure-activity relationships, we designed potent renin inhibitors for use in dog models. In assays against dog plasma renin at neutral pH, we found that, as in previous studies of rat renin inhibitors, the structure at the P2 position appears to be important for potency. The substitution of Val for His at this position increases potency by one order of magnitude. At the P3 position, potency appears to depend on a hydrophobic side chain that does not necessarily have to be aromatic. Our results also support the approach of optimizing potency in a renin inhibitor by introducing a moiety that promotes aqueous solubility (an amino group) at the C-terminus of the substrate analogue. In the design of potent dog plasma renin inhibitors, the influence of the transition-state residue 4(S)-amino-3(S)-hydroxy-5-cyclohexylpentanoic acid (ACHPA)-commonly used as a substitute for the scissile-bond dipeptide to boost potency-is not obvious, and appears to be sequence dependent. The canine renin inhibitor Ac-paF-Pro-Phe-Val-statine-Leu-Phe-paF-NH2 (compound 15; IC50 of 1.7 nM against dog plasma renin at pH 7.4; statine, 4(S)-amino-3(S)-hydroxy-6-methylheptanoic acid; paF, para-aminophenylalanine) had a potent hypotensive effect when infused intravenously into conscious, sodium-depleted, normotensive dogs. Also, compound 15 concurrently inhibited plasma renin activity and had a profound diuretic effect.

Non-NASA Center↗
NASA NTRS1994

A comparative study of serial and parallel aeroelastic computations of wings

A procedure for computing the aeroelasticity of wings on parallel multiple-instruction, multiple-data (MIMD) computers is presented. In this procedure, fluids are modeled using Euler equations, and structures are modeled using modal or finite element equations. The procedure is designed in such a way that each discipline can be developed and maintained independently by using a domain decomposition approach. In the present parallel procedure, each computational domain is scalable. A parallel integration scheme is used to compute aeroelastic responses by solving fluid and structural equations concurrently. The computational efficiency issues of parallel integration of both fluid and structural equations are investigated in detail. This approach, which reduces the total computational time by a factor of almost 2, is demonstrated for a typical aeroelastic wing by using various numbers of processors on the Intel iPSC/860.

Byun, Chansup↗
DOE OSTI2016

Efficient Synthesis of Graph Methods: a Dynamically Scheduled Architecture

RDF databases naturally map to a graph representation and employ languages, such as SPARQL, that implements queries as graph pattern matching routines. Graph methods exhibit an irregular behavior: they present unpredictable, fine-grained data accesses, and are synchronization inten- sive. Graph data structures expose large amounts of dy- namic parallelism, but are difficult to partition without gen- erating load unbalance. In this paper, we present a novel ar- chitecture to improve the synthesis of graph methods. Our design addresses the issues of these algorithms with two com- ponents: a Dynamic Task Scheduler (DTS), which reduces load unbalance and maximize resource utilization, and a Hi- erarchical Memory Interface controller (HMI), which pro- vides support for concurrent memory operations on multi- ported/multi-banked shared memories. We evaluate our ap- proach by generating the accelerators for a set of SPARQL queries from the Lehigh University Benchmark (LUBM). We first analyze the load unbalance of these queries, showing that execution time among tasks can differ even of order of magnitudes. We then synthesize the queries and com- pare the performance of the resulting accelerators against the current state of the art. Experimental results show that our solution provides a speedup over the serial implementa- tion close to the theoretical maximum and a speedup up to 3.45 over a baseline parallel implementation. We conclude our study by exploring the design space to achieve maximum memory channels utilization. The best design used at least three of the four memory channels for more than 90% of the execution time.

architecture↗
NASA NTRS1986

Simultaneous rocket and MST radar observation of an internal gravity wave breaking in the mesosphere

In June, 1983, the Structure and Atmospheric Turbulence Environment (STATE) rocket and Poker Flat Mesophere-Stratosphere-Troposphere radar campaign was conducted to measure the interaction between turbulence, electron density and electron density gradient that has produced unusually strong MST radar echoes from the summer mesosphere over Poker Flat, Alaska. Analysis or radar wind measurements and a concurrent wind and temperature profile obtained from a rocket probe carrying a three-axis accelerometer are given. The two data sets provide a fairly complete (and in some cases, redundant) picture of the breaking (or more correctly, the saturation) of a large-amplitude, low-frequency, long-wavelength internal gravity wave. The data show that small-scale turbulence and small-scale wave intensity is greatest at those altitudes where the large-scale wave-induced temperature lapse rate is most negative or most nearly unstable, but the wind shear due to the large-scale wave is a minimum. A brief review of linear gravity-wave theory is presented as an aid to the identification of the gravity-wave signature in the radar and rocket data. Analysis of the time and height cross sections of wind speed and turbulence intensity observed by the Poker Flat MST radar follows. Then, the vertical profile of temperature and winds measured by a rocket probe examined. Finally, the use of the independent data sets provided by the rocket and the radar are discussed and implications for theories of wave saturation are presented.

Smith, S. A.↗
NASA NTRS2003

High-Level Data Races

Data races are a common problem in concurrent and multi-threaded programming. They are hard to detect without proper tool support. Despite the successful application of these tools, experience shows that the notion of data race is not powerful enough to capture certain types of inconsistencies occurring in practice. In this paper we investigate data races on a higher abstraction layer. This enables us to detect inconsistent uses of shared variables, even if no classical race condition occurs. For example, a data structure representing a coordinate pair may have to be treated atomically. By lifting the meaning of a data race to a higher level, such problems can now be covered. The paper defines the concepts view and view consistency to give a notation for this novel kind of property. It describes what kinds of errors can be detected with this new definition, and where its limitations are. It also gives a formal guideline for using data structures in a multi-threading environment.

Artho, Cyrille↗
NASA NTRS1997

A Comparison of PETSC Library and HPF Implementations of an Archetypal PDE Computation

Two paradigms for distributed-memory parallel computation that free the application programmer from the details of message passing are compared for an archetypal structured scientific computation a nonlinear, structured-grid partial differential equation boundary value problem using the same algorithm on the same hardware. Both paradigms, parallel libraries represented by Argonne's PETSC, and parallel languages represented by the Portland Group's HPF, are found to be easy to use for this problem class, and both are reasonably effective in exploiting concurrency after a short learning curve. The level of involvement required by the application programmer under either paradigm includes specification of the data partitioning (corresponding to a geometrically simple decomposition of the domain of the PDE). Programming in SPAM style for the PETSC library requires writing the routines that discretize the PDE and its Jacobian, managing subdomain-to-processor mappings (affine global- to-local index mappings), and interfacing to library solver routines. Programming for HPF requires a complete sequential implementation of the same algorithm, introducing concurrency through subdomain blocking (an effort similar to the index mapping), and modest experimentation with rewriting loops to elucidate to the compiler the latent concurrency. Correctness and scalability are cross-validated on up to 32 nodes of an IBM SP2.

Hayder, M. Ehtesham↗
DOE OSTI2025

High temporal frequency data from a four turbine, blade-resolved wind farm simulation with ExaWind

The data was generated with ExaWind (https://github.com/Exawind) which couples AMR-Wind (https://github.com/Exawind/amr-wind/), Nalu-Wind (https://github.com/Exawind/nalu-wind), TIOGA (https://github.com/Exawind/tioga), and OpenFAST (https://github.com/OpenFAST/openfast). This is a large-scale simulation of a blade-resolved wind farm using the ExaWind software stack. ExaWind couples together a background flow solver, AMR-Wind, and a near-body solver, Nalu-Wind, through an overset technique from the TIOGA application. Another application, OpenFAST, handles the structural dynamics of the turbine blades and towers, which informs the fluid-structure interaction of the wind turbines with the flow solvers. This particular simulation includes four blade-resolved wind turbines operating in a turbulent atmospheric boundary layer. The AMR-Wind solver uses 500 million cells and is being solved on 256 AMD GPUs of the Oakridge Leadership Computing Facility Frontier supercomputer. Each turbine is assigned its own Nalu-Wind solver with over 13 million elements per turbine and solved using 448 CPU cores, for a total of 1792 CPU cores. For each node, 56 cores contain Nalu-Wind, while 8 cores correspond to AMR-Wind operations on the GPUs. Consequently, ExaWind is entirely utilizing the CPUs and the GPUs of the nodes concurrently. The data used in the visualization is full flow field data output from the simulation. It is lossy-compressed to a specific accuracy using ZFP and written to disk every 16 time-steps to enable real-time flow visualization. The flow fields are sampled at a high temporal frequency to enable real-time, 24fps visualization. The flow fields are sampled every 12 simulation time steps (every 0.04132s).

17 WIND ENERGY↗
DOE OSTI2021

Coordination Sphere of Lanthanide Aqua Ions Resolved with Ab Initio Molecular Dynamics and X-ray Absorption Spectroscopy

To resolve the fleeting structures of lanthanide Ln 3+ aqua ions in solution, we (i) performed the first ab initio molecular dynamics (AIMD) simulations of the entire series of Ln 3+ aqua ions in explicit water solvent using pseudopotentials and basis sets recently optimized for lanthanides and (ii) measured the symmetry of the hydrating waters about Ln 3+ ions (Nd 3+ , Dy 3+ , Er 3+ , Lu 3+ ) for the first time with extended X-ray absorption fine structure (EXAFS). EXAFS spectra were measured experimentally and generated from AIMD trajectories to directly compare simulation, which concurrently considers the electronic structure and the atomic dynamics in solution, with experiment. In this study, we performed a comprehensive evaluation of EXAFS multiple-scattering analysis (up to 6.5 Å) to measure Ln–O distances and angular correlations (i.e., symmetry) and elucidate the molecular geometry of the first hydration shell. This evaluation, in combination with symmetry-dependent L 3 - and L 1 -edge spectral analysis, shows that the AIMD simulations remarkably reproduces the experimental EXAFS data. The error in the predicted Ln–O distances is less than 0.07 Å for the later lanthanides, while we observed excellent agreement with predicted distances within experimental uncertainty for the early lanthanides. Our analysis revealed a dynamic, symmetrically disordered first coordination shell, which does not conform to a single molecular geometry for most lanthanides. This work sheds critical light on the highly elusive coordination geometry of the Ln 3+ aqua ions.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2021

Analysis of mobility data to build contact networks for COVID-19

As social distancing policies and recommendations went into effect in response to COVID-19, people made rapid changes to the places they visit. These changes are clearly seen in mobility data, which records foot traffic using location trackers in cell phones. While mobility data is often used to extract the number of customers that visit a particular business or business type, it is the frequency and duration of concurrent occupancy at those sites that governs transmission. Understanding the way people interact at different locations can help target policies and inform contact tracing and prevention strategies. This paper outlines methods to extract interactions from mobility data and build networks that can be used in epidemiological models. Several measures of interaction are extracted: interactions between people, the cumulative interactions for a single person, and cumulative interactions that occur at particular businesses. Network metrics are computed to identify structural trends which show clear changes based on the timing of stay-at-home orders. Measures of interaction and structural trends in the resulting networks can be used to better understand potential spreading events, the percent of interactions that can be classified as close contacts, and the impact of policy choices to control transmission.

60 APPLIED LIFE SCIENCES↗
NASA NTRS1992

Deep Hubble Space Telescope imaging of a compact radio galaxy at z = 2.390

The radio galaxy with the highest redshift in the Leiden-Berkeley Deep Survey, 53W002, is described and examined in terms of UV profile in relation to an early-type galaxy. The HST WFC images have a resolution of 0.2 arcsec FWHM, and the I- and V-band structures are assessed. The source is elongated in a manner similar to the Ly alpha cloud in V, and the structure is highly compact in I. The present object with a young starburst has very high central UV surface brightnesses relative to nearby luminous early-type galaxies, while the light profiles are similar. The data are concluded to suggest that 53W002 is a young galaxy that has a regular light profile at z = 2.390 even though it has been forming stars since not more than about 0.5 Gyr before z = 2.390. Such a scenario is consistent with concurrent dynamical collapse and star formation in the compact radio galaxy.

Windhorst, Rogier↗
NASA NTRS2009

Model Checking - My 27-Year Quest to Overcome the State Explosion Problem

Model Checking is an automatic verification technique for state-transition systems that are finite=state or that have finite-state abstractions. In the early 1980 s in a series of joint papers with my graduate students E.A. Emerson and A.P. Sistla, we proposed that Model Checking could be used for verifying concurrent systems and gave algorithms for this purpose. At roughly the same time, Joseph Sifakis and his student J.P. Queille at the University of Grenoble independently developed a similar technique. Model Checking has been used successfully to reason about computer hardware and communication protocols and is beginning to be used for verifying computer software. Specifications are written in temporal logic, which is particularly valuable for expressing concurrency properties. An intelligent, exhaustive search is used to determine if the specification is true or not. If the specification is not true, the Model Checker will produce a counterexample execution trace that shows why the specification does not hold. This feature is extremely useful for finding obscure errors in complex systems. The main disadvantage of Model Checking is the state-explosion problem, which can occur if the system under verification has many processes or complex data structures. Although the state-explosion problem is inevitable in worst case, over the past 27 years considerable progress has been made on the problem for certain classes of state-transition systems that occur often in practice. In this talk, I will describe what Model Checking is, how it works, and the main techniques that have been developed for combating the state explosion problem.

Clarke, Ed↗
DOE OSTI2021

UNH TDP - Concurrent Measurements of Inflow, Power Performance, and Loads for a Grid-Synchronized Vertical Axis Cross-Flow Turbine Operating in a Tidal Estuary

This data was collected between October 12 and December 15 of 2021 at the University of New Hampshire (UNH) and Atlantic Marine Energy Center (AMEC) turbine deployment platform (TDP). This data set includes over 29 days of grid connected turbine operation during this 65 day time frame. The priority for this measurement campaign was to collect data while the turbine was electrically connected to the grid by means of a rectifier and inverter. The Fall_2021_UNH_Measurement_Timeline.png highlights when each instrument was functioning and the Fall_2021_UNH_Test_Log.jpg indicates the four main regions for analysis available from this measurement campaign. The TDP is a floating structure moored on the Portsmouth facing side of Memorial Bridge pier #2, which spans the Piscataqua River between Portsmouth, NH and Kittery, ME. The Piscataqua River connects the Great Bay Estuary to the Gulf of Maine and the river currents are dominated by tidal forcing with water velocities exceeding 2.5 m/s during spring ebb tides at this site which were previously characterized by Kaelin Chancey (Assessment Of The Localized Flow And Tidal Energy Conversion System At An Estuarine Bridge - UNH MS Thesis 2019). The turbine under test was a modified New Energy Corporation (Calgary, CA) model EVG-025 4-blade H-Darrius type vertical axis cross flow turbine that rotates in the clockwise direction with a rotor diameter of 3.2m and blade length of 1.7m. The hydro-foil profile was a NACA 0021 with a 10 inch chord length and a blade preset pitch angle of +4deg with a positive angle corresponding with the toe in direction. The standard EVG-025 has a rotor diameter of 3.4m and its rated power output is 25kW at 3 m/s. The rotor diameter was reduced to accommodate the size of the existing TDP moon-pool. This project was pursued to quantify device performance for cross flow turbines operating in a marine environment. Accurate physical models, to characterize cross flow turbine performance, require real operational data sets due to the complexity of blade fluid interactions. This data can help support model development which will help predict turbine performance when analyzing perspective project locations in the future. Instrumentation was deployed to measure; water speed/direction, electrical power output, turbine shaft speed, turbine thrust force, and platform motion. Concurrent measurements of these parameters allow for correlations (cause and affect) to be inferred, allowing for characterization of device performance over a range of operating conditions. Water currents were measured using Acoustic Doppler Current Profilers (ADCP's) and Acoustic Doppler Velocimeters (ADV's) directly upstream and downstream of the turbine for inflow, wake and turbulence measurements. Electrical power output was measured using the Voltsys rectifier and the Shark power meter. Shaft speed was calculated based on the Voltsys measurements of the permanent magnet three phase generator AC generation frequency, coupled directly to the cross flow turbine under test (i.e., no gear box). Platform motions were captured using a Yost IMU (inertial measurement unit). Turbine thrust loading was measured using a reaction arm about the turbine deployment platform spanning beam, where two bi-directional load cells were connected to the system via a pinned connection. This submission includes zipped folders for each instrument containing quality controlled (QC'd) data in daily .csv files for the relevant duration specific to each instrument, along with separate .csv file that contains the units for each variable. Some instrument daily files are quite large and can pose a challenge for a visual spreadsheet editor to open. A processing software like MATLAB or Python is recommended. Note the degree of QC varied between each instrument due to time constraints. Particular time and attention was given to perform quality control tests on the acoustic based instruments that are particularly suscep...

16 TIDAL AND WAVE POWER↗
NASA NTRS1990

A scheme for supporting distributed data structures on multicomputers

A data migration mechanism is proposed that allows an explicit and controlled mapping of data to memory. While read or write copies of each data element can be assigned to any processor's memory, longer term storage of each data element is assigned to a specific location in the memory of a particular processor. The proposed integration of a data migration scheme with a compiler is able to eliminate the migration of unneeded data that can occur in multiprocessor paging or caching. The overhead of adjudicating multiple concurrent writes to the same page or cache line is also eliminated. Data is presented that suggests that the scheme may be a pratical method for efficiently supporting data migration.

Hiranandani, Seema↗