SEARCH · Engineering Papers

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 505 records · Page 28

All sources NASA NTRS DOE OSTI

DOE OSTI2022

Proximity Portability and in Transit , M-to-N Data Partitioning and Movement in SENSEI [Book Chapter]

In high-performance parallel in situ processing, the term in transit processing refers to those configurations where data must move from a producer to a consumer that runs on separate resources. In the context of parallel and distributed computing on an HPC platform one of the central challenges is to determine a mapping of data from producer ranks to consumer ranks. This problem is complicated by the heterogeneity that arises in producer-consumer pairs, such as when producer and consumer codes have different levels of concurrency, different scaling characteristics, or different data models. The resulting mapping and movement of data from M producer to N consumer ranks can have a significant impact on aggregate application performance, particularly when the data consumer requires only a subset of the overall data for its task. This chapter focuses on the design considerations that underlie SENSEI’s implementation to this challenging problem. These design considerations extend the core SENSEI architecture and include ideas like the need to accommodate flexibility in the choice of different partitioning methods, the ability for a data consumer to request and receive only the subset of data needed for its particular operation, and the ability to leverage any of several different data transport tools. The idea of proximity portability, being able to use different data transport methods as part of an in transit workflow, is illustrated through the use of three different transport layers where switching from one transport tool to another is accomplished with only a configuration file change. Here, the chapter also includes a performance analysis summary showing the performance gains that are possible in terms of multiple metrics, such as memory footprint, time to solution, and amount of data moved, when using optimized partitioners in an in transit setting, gains that are made possible by the implementation shaped by specific design considerations.

Bethel, E. Wes↗

DOE OSTI2019

Cup-cone structure in spallation of bulk metallic glasses

Not Available

Tang, X. C.↗

DOE OSTI2021

PETSc Users Manual (Revision 3.15)

This manual describes the use of the Portable, Extensible Toolkit for Scientific Computation (PETSc) for the numerical solution of partial differential equations and related problems on high-performance computers. PETSc 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.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

Userspace Squash Filesystem for Launching Linux Containers on HPC Systems [Thesis]

The demand for user defined software stacks (UDSS) has been increasing in the high-performance computing (HPC) community. Container technology has become popular due to the flexibility and isolation it provides to HPC users. Container images must be available to all nodes involved for use in HPC and can be distributed to compute nodes in a variety of ways. A common method for container image distribution is to simply copy the container image to memory on each compute node, which can be time consuming at scale, and uses valuable memory on each node. The kernel mounted squash filesystem (squashfs) has proven fast and efficient for this task but requires root-level access. This paper will show a user space mounted squashfs is an efficient and secure solution for container image distribution.

97 MATHEMATICS AND COMPUTING↗

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↗

DOE OSTI2023

Characterizing the performance of node-aware strategies for irregular point-to-point communication on heterogeneous architectures

Supercomputer architectures are trending toward higher computational throughput due to the inclusion of heterogeneous compute nodes. These multi-GPU nodes increase on-node computational efficiency, while also increasing the amount of data to be communicated and the number of potential data flow paths. In this work, we characterize the performance of irregular point-to-point communication with MPI on heterogeneous compute environments through performance modeling, demonstrating the limitations of standard communication strategies for both device-aware and staging-through-host communication techniques. Presented models suggest staging communicated data through host processes then using node-aware communication strategies for high inter-node message counts. Notably, the models also predict that node-aware communication utilizing all available CPU cores to communicate inter-node data leads to the most performant strategy when communicating with a high number of nodes. Furthermore, model validation is provided via a case study of irregular point-to-point communication patterns in distributed sparse matrix–vector products. Importantly, we include a discussion on the implications model predictions have on communication strategy design for emerging supercomputer architectures.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2017

NPTFit: A Code Package for Non-Poissonian Template Fitting

We present NPTFit, an open-source code package, written in Python and Cython, for performing non-Poissonian template fits (NPTFs). The NPTF is a recently developed statistical procedure for characterizing the contribution of unresolved point sources (PSs) to astrophysical data sets. The NPTF was first applied to Fermi gamma-ray data to provide evidence that the excess of ∼GeV gamma-rays observed in the inner regions of the Milky Way likely arises from a population of sub-threshold point sources, and the NPTF has since found additional applications studying sub-threshold extragalactic sources at high Galactic latitudes. The NPTF generalizes traditional astrophysical template fits to allow for the ability to search for populations of unresolved PSs that may follow a given spatial distribution. NPTFit builds upon the framework of the fluctuation analyses developed in X-ray astronomy, thus it likely has applications beyond those demonstrated with gamma-ray data. The NPTFit package utilizes novel computational methods to perform the NPTF efficiently. The code is available at http://github.com/bsafdi/NPTFit and up-to-date and extensive documentation may be found at http://nptfit.readthedocs.io.

79 ASTRONOMY AND ASTROPHYSICS↗