SEARCH · Search NASA

Results for “high performance and distributed computing”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 487 records · Page 27

All sources NASA NTRS DOE OSTI

DOE OSTI2022

PETSc/TAO Users Manual: Revision 3.18

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

PETSc/TAO Users Manual (Rev. 3.19)

This manual describes the use of the Portable, Extensible Toolkit for Scientific Computation (PETSc) and the Toolkit for Advanced Optimization (TAO) for the numerical solution of partial differential equations and related problems on high-performance computers. PETSc/TAO is a suite of data structures and routines that provide the building blocks for the implementation of large-scale application codes on parallel (and serial) computers. PETSc uses the MPI standard for all distributed memory communication. PETSc/TAO includes a large suite of parallel linear solvers, nonlinear solvers, time integrators, and opti mization that may be used in application codes written in Fortran, C, C++, and Python (via petsc4py; see Getting Started). PETSc provides many of the mechanisms needed within parallel application codes, such as parallel matrix and vector assembly routines. The library is organized hierarchically, enabling users to employ the level of abstraction that is most appropriate for a particular problem. By using techniques of object-oriented programming, PETSc provides enormous flexibility for users. PETSc is a sophisticated set of software tools; as such, for some users it initially has a much steeper learning curve than packages such as MATLAB or a simple subroutine library. In particular, for individuals without some computer science background, experience programming in C, C++, python, or Fortran and experience using a debugger such as gdb or lldb, it may require a significant amount of time to take full advantage of the features that enable efficient software use. However, the power of the PETSc design and the algorithms it incorporates may make the efficient implementation of many application codes simpler than “rolling them” yourself. For many tasks a package such as MATLAB is often the best tool; PETSc is not intended for the classes of problems for which effective MATLAB code can be written. There are several packages, built on PETSc, that may satisfy your needs without requiring directly using PETSc. We recommend reviewing these packages functionality before starting to code directly with PETSc. PETSc can be used to provide a “MPI parallel linear solver” in an otherwise sequential, or OpenMP parallel code. This approach cannot provide extremely large improvements in the application time by utilizing large numbers of MPI processes but can still improve the performance. Certainly all parts of a previously sequential code need not be parallelized but the matrix generation portion must be parallelized to expect true scalability to large numbers of MPI processes. See PCMPI for details on how to utilize the PETSc MPI linear solver server. Since PETSc is under continued development, small changes in usage and calling sequences of routines will occur. PETSc has been supported for twenty-five years; see mailing list information on our website for information on contacting support.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

PETSc/TAO Users Manual (Rev. 3.20)

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1980

Performance of computer-optimized tapered-roller bearings to 2.4 million DN

The performance of 120.65 mm bore high speed design tapered roller bearings was investigated at shaft speeds to 20,000 rpm under combined thrust and radial load. The test bearing design was computer optimized for high speed operation. Temperature distribution and bearing heat generation were determined as a function of shaft speed, radial and thrust loads, lubricant flow rates, and lubricant inlet temperature. The roller bearing operated successfully at shaft speeds up to 20,000 rpm under heavy thrust and radial loads. Cup cooling was effective in decreasing the high cup temperatures to levels equal to the cone temperature.

Parker, R. J.↗

NASA NTRS1987

High speed propeller performance and noise predictions at takeoff/landing conditions

The performance and noise of a high speed SR-7A model propeller under takeoff/landing conditions are considered. The blade loading distributions are obtained by solving the three-dimensional Euler equations and the sound pressure levels are computed using a time domain approach. At the nominal takeoff operating point, the blade sections near the hub are lightly or negatively loaded. The chordwise loading distributions are distinctly different from those of cruise conditions. The noise of the SR-7A model propeller at takeoff is dominated by the loading noise, similar to that at cruise conditions. The waveforms of the acoustic pressure signature are nearly sinusoidal in the plane of the propeller. The computed directivity of the blade passing frequency tone agrees fairly well with the data at nominal takeoff blade angle.

Nallasamy, M.↗

NASA NTRS1988

High speed propeller performance and noise predictions at takeoff/landing conditions

Nallasamy, M.↗

NASA NTRS1992

Ring-array processor distribution topology for optical interconnects

The existing linear and rectangular processor distribution topologies for optical interconnects, although promising in many respects, cannot solve problems such as clock skews, the lack of supporting elements for efficient optical implementation, etc. The use of a ring-array processor distribution topology, however, can overcome these problems. Here, a study of the ring-array topology is conducted with an aim of implementing various fast clock rate, high-performance, compact optical networks for digital electronic multiprocessor computers. Practical design issues are addressed. Some proof-of-principle experimental results are included.

Li, Yao↗

NASA NTRS2005

Longitudinal Aerodynamic Characteristics and Wing Pressure Distributions of a Blended-Wing-Body Configuration at Low and High Reynolds Numbers

Force balance and wing pressure data were obtained on a 0.017-Scale Model of a blended-wing-body configuration (without a simulated propulsion system installation) to validate the capability of computational fluid dynamic codes to predict the performance of such thick sectioned subsonic transport configurations. The tests were conducted in the National Transonic Facility of the Langley Research Center at Reynolds numbers from 3.5 to 25.0 million at Mach numbers from 0.25 to 0.86. Data were obtained in the pitch plane only at angles of attack from -1 to 8 deg at Mach numbers greater than 0.25. A configuration with winglets was tested at a Reynolds number of 25.0 million at Mach numbers from 0.83 to 0.86.

Re, Richard J.↗

NASA NTRS2019

Preliminary Scale-Resolving Simulations of Laminar-To-Turbulent Transition in Swept-Wing Flow

Swept wings and control surfaces are common elements of modern aircraft, and it has been shown both experimentally and theoretically that laminar-to-turbulent transition of the three-dimensional boundary layer that develops over them is highly sensitive to surface roughness. Numerous studies have been conducted on the effect of discrete roughness elements or distributed roughness elements on swept flow transition, however so far limited computational effort has been dedicated to the study of transition over swept wings with randomly distributed micron-sized roughness. In the present work, we set up to reproduce the extensive experimental data base generated by Dagenhart et al for the infinite swept wing NLF(2)-0415. To this purpose, we perform scale-resolving simulations of flow transition over smooth and rough surfaces using a high-order space-time spectral-element Discontinuous-Galerkin solver. Different types of surface roughnesses are implemented by elastically deforming the original mesh. The study shows that the experimental results cannot be accounted for by a perfectly smooth wing and reveals a strong sensitivity of the transition process to the representation of the surface roughness. The crossflow patterns and transition location approach those measured for some of the surface profiles, however a correlation between the wavenumber spectrum of the surface, grid resolution and boundary layer stability is yet to be established.

Denison, Marie↗

NASA NTRSDate not supplied

Cathode Modeling of Solid-State Batteries

The search for safe, reliable, and compact high-capacity energy storage devices has led to increased interest in all-solid-state battery research. The use of solid electrolytes provides enhanced safety and durability due to their reduced flammability and increased mechanical strength compared to organic liquid electrolytes. Still, the use of solid electrolytes remains challenging. Computational modeling plays a substantial role in addressing these challenges. A particle dynamics electromechanical model for simulating electrochemical processes in a solid-state battery cathode will be presented. The model presents cathode microstructure at the particle level as a mixture of ionically conductive solid electrolyte particles, electrically conductive carbon additives, and cathodic reactant particles. After densification, the particle connectivity is analyzed to reconstruct the complex electric network connecting reactant particles with an anodic and cathodic current collectors through the electrolyte and carbon particles. The Kirchhoff’s matrix equation describing this electric network, is solved to obtain values of various critical parameters, such as the overall conductivity of the cathode for lithium ions and electrons, cathodic reactant material utilization, and the distribution of the electric current and voltages within the cathode. In addition, by representing the reactant particles as electrolyte or galvanic microcells governed by the Butler-Volmer electrochemical equation, the overall performance of battery cells during charge or discharge processes, respectively, can be predicted for a given cathodic powder composition. The presented model, executed on a high-performance computing architecture, essentially provides a valuable guidance in designing and developing future solid-state batteries.

solid-state battery↗

DOE OSTI2022

ConKer: An algorithm for evaluating correlations of arbitrary order

Context. High order correlations in the cosmic matter density have become increasingly valuable in cosmological analyses. However, computing these correlation functions is computationally expensive. Aims. We aim to circumvent these challenges by developing a new algorithm called ConKer for estimating correlation functions. Methods. This algorithm performs convolutions of matter distributions with spherical kernels using FFT. Since matter distributions and kernels are defined on a grid, it results in some loss of accuracy in the distance and angle definitions. We study the algorithm setting at which these limitations become critical and suggest ways to minimize them. Results. ConKer is applied to the CMASS sample of the SDSS DR12 galaxy survey and corresponding mock catalogs, and is used to compute the correlation functions up to correlation order n = 5. We compare the n = 2 and n = 3 cases to traditional algorithms to verify the accuracy of the new algorithm. We perform a timing study of the algorithm and find that three of the four distinct processes within the algorithm are nearly independent of the catalog size N , while one subdominant component scales as O ( N ). The dominant portion of the calculation has complexity of O ( N c 4/3 log N c ), where N c is the of cells in a three-dimensional grid corresponding to the matter density. Conclusions. We find ConKer to be a fast and accurate method of probing high order correlations in the cosmic matter density, then discuss its application to upcoming surveys of large-scale structure.

79 ASTRONOMY AND ASTROPHYSICS↗

NASA NTRS2017

Aeroelastic Uncertainty Quantification Studies Using the S4T Wind Tunnel Model

This paper originates from the joint efforts of an aeroelastic study team in the Applied Vehicle Technology Panel from NATO Science and Technology Organization, with the Task Group number AVT-191, titled "Application of Sensitivity Analysis and Uncertainty Quantification to Military Vehicle Design." We present aeroelastic uncertainty quantification studies using the SemiSpan Supersonic Transport wind tunnel model at the NASA Langley Research Center. The aeroelastic study team decided treat both structural and aerodynamic input parameters as uncertain and represent them as samples drawn from statistical distributions, propagating them through aeroelastic analysis frameworks. Uncertainty quantification processes require many function evaluations to asses the impact of variations in numerous parameters on the vehicle characteristics, rapidly increasing the computational time requirement relative to that required to assess a system deterministically. The increased computational time is particularly prohibitive if high-fidelity analyses are employed. As a remedy, the Istanbul Technical University team employed an Euler solver in an aeroelastic analysis framework, and implemented reduced order modeling with Polynomial Chaos Expansion and Proper Orthogonal Decomposition to perform the uncertainty propagation. The NASA team chose to reduce the prohibitive computational time by employing linear solution processes. The NASA team also focused on determining input sample distributions.

Nikbay, Melike↗

NASA NTRS1987

Computer hardware and software for robotic control

The KSC has implemented an integrated system that coordinates state-of-the-art robotic subsystems. It is a sensor based real-time robotic control system performing operations beyond the capability of an off-the-shelf robot. The integrated system provides real-time closed loop adaptive path control of position and orientation of all six axes of a large robot; enables the implementation of a highly configurable, expandable testbed for sensor system development; and makes several smart distributed control subsystems (robot arm controller, process controller, graphics display, and vision tracking) appear as intelligent peripherals to a supervisory computer coordinating the overall systems.

Davis, Virgil Leon↗

DOE OSTI2020

Multi-GPU immersed boundary method hemodynamics simulations

Large-scale simulations of blood flow that resolve the 3D deformation of each comprising cell are increasingly popular owing to algorithmic developments in conjunction with advances in compute capability. Among different approaches for modeling cell-resolved hemodynamics, fluid structure interaction (FSI) algorithms based on the immersed boundary method are frequently employed for coupling separate solvers for the background fluid and the cells within one framework. GPUs can accelerate these simulations; however, both current pre-exascale and future exascale CPU-GPU heterogeneous systems face communication challenges critical to performance and scalability. In this paper, we describe, to our knowledge, the largest distributed GPU-accelerated FSI simulations of high hematocrit cell-resolved flows with over 17 million red blood cells. We compare scaling on a fat node system with six GPUs per node and on a system with a single GPU per node. Through comparison between the CPU- and GPU-based implementations, we identify the costs of data movement in multiscale multi-grid FSI simulations on heterogeneous systems and show it to be the greatest performance bottleneck on the GPU.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

Evaluation of Graph Analytics Frameworks Using the GAP Benchmark Suite

The analysis of connected data is an increasingly important application in high-performance computing. Such analyses can reveal fraudulent patterns in financial transactions, optimize telecommunications networks, predict information flow in social networks, etc. However, the landscape of graph analytics is highly diverse. Graph algorithms stress processor architectures differently, and no one graph can represent all topologies. Consequently, no single approach or framework is expected to be optimal for all graph analytics problems. To help make sense of this diverse landscape, we evaluated four approaches to graph analytics: GraphBLAS, Galois, BGL17, GraphIt; and compare them against hand-tuned implementations that take advantage of hardware features on our test platform. Graph- BLAS formulates graph analytics as sparse linear algebra. Galois provides syntactic constructs for data parallelism over irregular data structures. BGL17 is a generic C++ template library for implementing graph algorithms. GraphIt provides a domain- specific language to describe and optimize graph algorithms. We use the GAP Benchmark Suite to establish baseline performance and guide the side-by-side evaluation of each framework. GAP consists of 30 tests: six graph analytics algorithms (breadth- first search, single-source shortest path, PageRank, betweenness centrality, connected components, and triangle counting) run on five graphs, each with different topological characteristics (e.g., high diameter, skewed degree distribution, high average degree). High-performance reference implementations are included for each benchmark algorithm. Because a graph can be loaded into memory a number of ways (e.g., flat file on disk, compressed sparse format, data frames, retrieved from SQL or NoSQL databases), our evaluation focused on computational performance rather than I/O. Our results show the relative strengths of each framework.

Graph algorithms, Benchmarking, shared-memory prog↗

DOE OSTI2026

Distributed quantum approximate optimization algorithm on a quantum-centric supercomputing architecture

Quantum approximate optimization algorithm (QAOA) has shown promise in solving combinatorial optimization problems by providing quantum speedup on near-term gate-based quantum computing systems. However, QAOA faces challenges for high-dimensional problems due to the large number of qubits required and the complexity of deep circuits, limiting its scalability for real-world applications. In this study, we present a distributed QAOA (DQAOA), which leverages distributed computing strategies to decompose a large computational workload into smaller tasks that require fewer qubits and shallower circuits than are necessary to solve the original problem. These sub-problems are processed using a combination of high-performance and quantum computing resources. The global solution is iteratively updated by aggregating sub-solutions, allowing convergence toward the optimal solution. We demonstrate that DQAOA can handle considerably large-scale optimization problems (e.g., 1000-bit problem), achieving a high solution quality and short time-to-solution, outperforming existing strategies. Furthermore, we realize DQAOA on a quantum-centric supercomputing architecture, paving the way for practical applications of gate-based quantum computers in real-world optimization tasks. To extend DQAOA’s applicability to materials science, we further develop an active learning algorithm integrated with our DQAOA (AL-DQAOA), which involves machine learning, DQAOA, and active data production in an iterative loop. We successfully optimize photonic structures using AL-DQAOA, indicating that solving real-world optimization problems using gate-based quantum computing is feasible. We expect the proposed DQAOA to be applicable to a wide range of optimization problems and AL-DQAOA to find broader applications in material design.

Kim, Seongmin [ORNL] (ORCID:0000000159063004)↗

DOE OSTI2024

Asymptotic-state prediction for fast flavor transformation in neutron star mergers

Neutrino flavor instabilities appear to be omnipresent in dense astrophysical environments, thus presenting a challenge to large-scale simulations of core-collapse supernovae and neutron star mergers (NSMs). Subgrid models offer a path forward, but require an accurate determination of the local outcome of such conversion phenomena. Focusing on “fast” instabilities, related to the existence of a crossing between neutrino and antineutrino angular distributions, we consider a range of analytical mixing schemes, including a new, fully three-dimensional one, and also introduce a new machine learning (ML) model. We compare the accuracy of these models with the results of several thousands of local dynamical calculations of neutrino evolution from the conditions extracted from classical NSM simulations. Our ML model shows good overall performance, but struggles to generalize to conditions from a NSM simulation not used for training. The multidimensional analytic model performs and generalizes even better, while other analytic models (which assume axisymmetric neutrino distributions) do not have reliably high performances, as they notably fail as expected to account for effects resulting from strong anisotropies. As a result, the ML and analytic subgrid models extensively tested here are both promising, with different computational requirements and sources of systematic errors.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2020

FPDeep: Scalable Acceleration of CNN Training on Deeply-Pipelined FPGA Clusters

In this paper, we propose a framework called FPDeep, which uses a hybrid of model and layer paral- lelism to configure distributed reconfigurable clusters to train DNNs. This approach has numerous benefits. First, the design does not suffer from batch size growth. Second, novel workload and weight partitioning leads to balanced loads of both among nodes. And third, the entire system is fine-grained pipeline. This leads to high parallelism and utilization and also minimizes the time features need to be cached while waiting for back-propagation.

Wang, Tianqi↗