Search NASA⌕ Search

SEARCH · Search NASA

Results for “parallel cluster”

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 325 records · Page 18
All sourcesNASA NTRSDOE OSTI
NASA NTRS2001

GRC RBCC Concept Multidisciplinary Analysis

This report outlines the GRC RBCC Concept for Multidisciplinary Analysis. The multidisciplinary coupling procedure is presented, along with technique validations and axisymmetric multidisciplinary inlet and structural results. The NPSS (Numerical Propulsion System Simulation) test bed developments and code parallelization are also presented. These include milestones and accomplishments, a discussion of running R4 fan application on the PII cluster as compared to other platforms, and the National Combustor Code speedup.

Suresh, Ambady↗
DOE OSTI2019

Introducing Nonstructural Ligands to Zirconia-like Metal–Organic Framework Nodes To Tune the Activity of Node-Supported Nickel Catalysts for Ethylene Hydrogenation [Introducing Nonstructural Ligands to Zirconia-like MOF Nodes To Tune the Activity of Node-Supported Nickel Catalysts for Ethylene Hydrogenation]

Previous work has shown that introduction of hexafluoroacetylacetone (Facac) units as nonstructural ligands for the zirconia-like nodes of the eight-connected metal-organic framework (MOF), NU-1000, greatly alters the selectivity of node-supported oxy-nickel clusters for ethylene dimerization vs oligomerization. Here we i explore a related concept: tuning of support/catalyst interactions, and therefore, catalyst activity, via parallel installation of organic modifiers on the support itself. As modifiers we focused on para-substituted benzoates (R-BA – ; R = -NH 2 , -OCH 3 , -CH 3 , -H, -F, and -NO 2 ) where the substituents were chosen to present similar steric demand, but varying electron-donating or electron-withdrawing properties. R-benzoate-engendered shifts in the node-based aqua O-H stretching frequency for NU-1000, as measured by DRIFTS (diffuse-reflectance infrared Fourier-transform spectroscopy), together with systematic shifts in Ni 2p peak energies, as measured by X-ray photoelectron spectroscopy, show that the electronic properties of the support can be modulated. The vibrational and electronic peak shifts correlate with the putative electron-withdrawing vs electron-donating strength of the para-substituted benzoate modifiers. Subsequent installation of node-supported, oxy-Ni(II) clusters for ethylene hydrogenation yield a compelling correlation between log (catalyst turnover frequency) and the electron donating or withdrawing character of the substituent of the benzoate units. Single crystal X-ray diffraction measurements reveal that each organic modifier makes use of only one of two available carboxylate oxygens to accomplish grafting. The remaining oxygen atom is, in principle, well positioned to coordinate directly to an installed Ni(II) ion. We postulate that the unanticipated direct coordination of the catalyst by the node-modifier (rather than indirect modifier-based tuning of support(node)/catalyst electronic interactions) is the primary source of the observed systematic tuning of hydrogenation activity. Here we suggest, however, that regardless of mechanism for communication with active-sites of MOF-supported catalysts, intentional elaboration of nodes via grafted, nonstructural organic species could prove to be a valuable general strategy for fine-tuning supported-catalyst activity and/or selectivity.

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

On the Efficient Evaluation of the Exchange Correlation Potential on Graphics Processing Unit Clusters

The predominance of Kohn–Sham density functional theory (KS-DFT) for the theoretical treatment of large experimentally relevant systems in molecular chemistry and materials science relies primarily on the existence of efficient software implementations which are capable of leveraging the latest advances in modern high-performance computing (HPC). With recent trends in HPC leading toward increasing reliance on heterogeneous accelerator-based architectures such as graphics processing units (GPU), existing code bases must embrace these architectural advances to maintain the high levels of performance that have come to be expected for these methods. In this work, we purpose a three-level parallelism scheme for the distributed numerical integration of the exchange-correlation (XC) potential in the Gaussian basis set discretization of the Kohn–Sham equations on large computing clusters consisting of multiple GPUs per compute node. In addition, we purpose and demonstrate the efficacy of the use of batched kernels, including batched level-3 BLAS operations, in achieving high levels of performance on the GPU. We demonstrate the performance and scalability of the implementation of the purposed method in the NWChemEx software package by comparing to the existing scalable CPU XC integration in NWChem.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

A network approach for multiscale catchment classification using traits

Abstract. The classification of river catchments into groups with similar biophysical characteristics is useful to understand and predict their hydrological behavior. The increasing availability of remote sensing and other large-scale geospatial datasets has enabled the use of advanced data-driven approaches to classify catchments using traits such as topography, geology, climate, land cover, land use, and human influence. Unsupervised clustering algorithms based on the Euclidean distance are commonly used for trait-based classification but are not suitable for highly dimensional data. In this study we present a new network-based method for multi-scale catchment classification, which can be applied to large datasets and used to determine the traits associated with different catchment groups. In this framework, two networks are analyzed in parallel: the first being where the nodes are traits and the second being where the nodes are catchments. In both cases, edges represent pairwise similarity, and a network cluster detection algorithm is used for the classification. The trait network is used to investigate redundancy in the trait data and to condense this information into a small number of interpretable categories. The catchments network is used to classify the catchments into clusters and to identify representative catchments for the different groups using the degree centrality metric. We apply this method to classify 9067 river catchments across the contiguous United States at both regional and continental scales using 274 non-categorical traits. At the continental scale, we identify 25 interpretable trait categories and 34 catchment clusters of sizes greater than 50. We find that catchments with similar trait categories are typically located in the same region, with different spatial patterns emerging among clusters dominated by natural and anthropogenic traits. We also find that the catchment clusters exhibit distinct hydrological behavior based on an analysis of streamflow indices. This network approach provides several advantages over traditional means of classification, including better separation of clusters, the use of alternate similarity metrics that are more suitable for highly dimensional data, and reducing redundancy in the trait information. The paired catchment–trait networks enable analysis of hydrological behavior using the dominant trait categories for each catchment cluster. The approach can be used at multiple spatial scales since the network topologies adjust automatically to reflect the trait patterns at the scale of investigation. Finally, the representative catchments identified as hub nodes in the network can be used to guide transferable observational and modeling strategies. The method is broadly applicable beyond hydrology for classification of other complex systems that utilize different types of trait datasets.

54 ENVIRONMENTAL SCIENCES↗
NASA NTRS1997

Parallel ALLSPD-3D: Speeding Up Combustor Analysis Via Parallel Processing

The ALLSPD-3D Computational Fluid Dynamics code for reacting flow simulation was run on a set of benchmark test cases to determine its parallel efficiency. These test cases included non-reacting and reacting flow simulations with varying numbers of processors. Also, the tests explored the effects of scaling the simulation with the number of processors in addition to distributing a constant size problem over an increasing number of processors. The test cases were run on a cluster of IBM RS/6000 Model 590 workstations with ethernet and ATM networking plus a shared memory SGI Power Challenge L workstation. The results indicate that the network capabilities significantly influence the parallel efficiency, i.e., a shared memory machine is fastest and ATM networking provides acceptable performance. The limitations of ethernet greatly hamper the rapid calculation of flows using ALLSPD-3D.

Fricker, David M.↗
NASA NTRS1981

Prime agricultural land monitoring and assessment component of the California Integrated Remote Sensing System

The use of digital LANDSAT techniques for monitoring agricultural land use conversions was studied. Two study areas were investigated: one in Ventura County and the other in Fresno County (California). Ventura test site investigations included the use of three dates of LANDSAT data to improve classification performance beyond that previously obtained using single data techniques. The 9% improvement is considered highly significant. Also developed and demonstrated using Ventura County data is an automated cluster labeling procedure, considered a useful example of vertical data integration. Fresno County results for a single data LANDSAT classification paralleled those found in Ventura, demonstrating that the urban/rural fringe zone of most interest is a difficult environment to classify using LANDSAT data. A general raster to vector conversion program was developed to allow LANDSAT classification products to be transferred to an operational county level geographic information system in Fresno.

Estes, J. E.↗
NASA NTRS2006

Bragg Curve, Biological Bragg Curve and Biological Issues in Space Radiation Protection with Shielding

The space environment consists of a varying field of radiation particles including high-energy ions, with spacecraft shielding material providing the major protection to astronauts from harmful exposure. Unlike low-LET gamma or X-rays, the presence of shielding does not always reduce the radiation risks for energetic charged particle exposure. Since the dose delivered by the charged particle increases sharply as the particle approaches the end of its range, a position known as the Bragg peak, the Bragg curve does not necessarily represent the biological damage along the particle traversal since biological effects are influenced by the track structure of both primary and secondary particles. Therefore, the biological Bragg curve is dependent on the energy and the type of the primary particle, and may vary for different biological endpoints. To achieve a Bragg curve distribution, we exposed cells to energetic heavy ions with the beam geometry parallel to a monolayer of fibroblasts. Qualitative analyses of gamma-H2AX fluorescence, a known marker of DSBs, indicated increased clustering of DNA damage before the Bragg peak, enhanced homogenous distribution at the peak, and provided visual evidence of high linear energy transfer (LET) particle traversal of cells beyond the Bragg peak. A quantitative biological response curve generated for micronuclei (MN) induction across the Bragg curve did not reveal an increased yield of MN at the location of the Bragg peak. However, the ratio of mono-to bi-nucleated cells, which indicates inhibition in cell progression, increased at the Bragg peak location. These results, along with other biological concerns, show that space radiation protection with shielding can be a complicated issue.

Honglu, Wu↗
NASA NTRS2019

Leveraging STARE for Co-aligned Data Locality with netCDF and Python MPI

We have leveraged STARE indexing to package partitioned data chunks from diverse datasets into netCDF files, distributed them on a cluster of 16 lightweight nodes with their placements spatiotemporally co-aligned, and demonstrated a few integrative analyses using netCDF parallel I/O and Python MPI, with single-user performance and scalability comparable to, or even better than, that of a parallel array database management system (ADBMS) such as SciDB. However, records of the node location and STARE index ranges for each data chunk, similar to the chunk maps of SciDB, must be maintained and consulted by the I/O and analysis code for coordinating the analytic operations in parallel, in order to achieve the good performance and scalability.

Kwo-Sen Kuo↗
DOE OSTI2020

Scalable All-pairs Shortest Paths for Huge Graphs on Multi-GPU Clusters

We present an optimized Floyd-Warshall (Floyd-Warshall) algorithm that computes the All-pairs shortest path (APSP) for GPU accelerated clusters. The Floyd-Warshall algorithm due to its structural similarities to matrix-multiplication is well suited for highly parallel GPU architectures. To achieve high parallel efficiency, we address two key algorithmic challenges: reducing high communication overhead and addressing limited GPU memory. To reduce high communication costs, we redesign the parallel (a) to expose more parallelism, (b) aggressively overlap communication and computation with pipelined and asynchronous scheduling of operations, and (c) tailored MPI-collective. To cope with limited GPU memory, we employ an offload model, where the data resides on the host and is transferred to GPU on-demand. The proposed optimizations are supported with detailed performance models for tuning. Our optimized parallel Floyd-Warshall implementation is up to 5x faster than a strong baseline and achieves 8.1 PetaFLOPS/sec on 256~nodes of the Summit supercomputer at Oak Ridge National Laboratory. This performance represents 70% of the theoretical peak and 80% parallel efficiency. The offload algorithm can handle 2.5x larger graphs with a 20% increase in overall running time.

Sao, Piyush↗
DOE OSTI2020

Unidirectional growth of graphene nano-islands from carbon cluster seeds on Ge(1 1 0)

The anisotropic twofold symmetry of Ge(1 1 0) makes it a unique substrate for the growth of single-crystalline graphene. However, the underlying mechanism during the initial stage of growth of graphene on Ge(1 1 0) surface is not well understood. Here, we use in-situ cryogenic scanning tunneling microscopy (STM) and spectroscopy (STS), to study the initial growth properties of graphene synthesized on Ge(1 1 0) surface with ethylene precursor gases. The STM results reveal that the unidirectional growth of the graphene nanoribbons (GNRs) initiates from carbon cluster seeds on terraces during the early stage of the growth. The orientations of the GNRs show the same directions which are nearly parallel to the direction of the Ge(1 1 0) surface. This orientation is the same as that of the wafer-scale graphene grown on Ge(1 1 0). Subsequent growth, transformed the GNRs to graphene nanoislands (GNIs), which eventually coalesced to form single crystalline monolayer graphene. STS measurements demonstrated that the GNRs have small bandgaps induced by the confinement effect of graphene. Furthermore, this study provides an in-depth understanding of the growth mechanism of graphene on Ge(1 1 0) surface in various synthesis conditions.

36 MATERIALS SCIENCE↗
DOE OSTI2020

Parallel performance of algebraic multigrid domain decomposition

Algebraic multigrid (AMG) is a widely used scalable solver and preconditioner for large-scale linear systems resulting from the discretization of a wide class of elliptic PDEs. While AMG has optimal computational complexity, the cost of communication has become a significant bottleneck that limits its scalability as processor counts continue to grow on modern machines. This article examines the design, implementation, and parallel performance of a novel algorithm, algebraic multigrid domain decomposition (AMG-DD), designed specifically to limit communication. The goal of AMG-DD is to provide a low-communication alternative to standard AMG V-cycles by trading some additional computational overhead for a significant reduction in communication cost. Numerical results show that AMG-DD achieves superior accuracy per communication cost compared with AMG, and speedup over AMG is demonstrated on a large GPU cluster.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Local Distortions and Metal–Semiconductor–Metal Transition in Quasi-One-Dimensional Nanowire Compounds AV 3 Q 3 O δ (A = K, Rb, Cs and Q = Se, Te)

Metal cluster compounds have garnered renewed interest in the search for novel superconductors and topological semimetals owing to structural instabilities of metal-cluster geometries and broken symmetries. Here we synthesized needle-like crystals of the V-cluster-based quasi-one-dimensional (Q1D) materials AV 3 Q 3 O δ (A = K, Rb, Cs, Q= Se, Te) which can also be viewed as being composed of parallel nanowires. We examine how changes in their average and local structure control their electronic properties. All compounds crystallize in the TIFe 3 Te 3 -type structure (P6 3 /m space group) with infinite (V 3 )Q 3 ) - double-walled columnar chains separated by A + cations. Our single-crystal and synchrotron powder diffraction studies indicate oxygen atoms partially occupy the center site of the V 6 octahedral metal cluster cages in KV 3 Te 3 O 0.33 , RbV 3 Te 3 O 0.32 , and CsV 3 Te 3 O 0.35 , whereas KV 3 Se 3 is structurally oxygen-free. Our synchrotron X-ray pair distribution function (PDF) analyses indicate that the oxygen-free V 6 cluster octahedra in KV 3 Se 3 are highly distorted perpendicular to the chain direction even at room temperature, reducing the symmetry of the average structure from hexagonal P6 3 /m to monoclinic P2 1 /m. Our theoretical calculation supports this P2 1 /m distortion and suggests the structure further distorts to P2 1 or P2 1 /c at lower temperatures. In contrast, the oxygen-centered V-cluster in KV 3 Te 3 O 0.33 exhibits a V-3-triangle-trimerization along the chain direction. This feature is discernible from the local PDF and is consistent with lattice dynamical calculations based on density functional theory. Resistivity measurements indicate that KV 3 Se 3 exhibits metallic behavior, whereas a dramatic metal-semiconductor-metal transition emerges in KV 3 Te 3 O 6.33 , RbV 3 Te 3 O 0.32 , and CsV 3 Te 3 O 0.35 because of oxygen disorder and changes in local structure captured from our electronic structure analyses of the Fermi surface. Our investigation of the AV 3 Q 3 O 6 family demonstrates the importance of understanding local changes in structure driven by electronic instabilities, which can guide the search for new quantum materials in other low-dimensional cluster-compound materials.

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

EJFAT: Towards Intelligent Compute Destination Load Balancing

To handle increased data flow, Jefferson Lab (JLab) is partnering with ESnet for development of an AI/ML directed compute work Load Balancer (LB) of UDP streamed data. The LB is FPGA based featuring dynamically configurable, low latency and high throughput destination address switching. The LB provides integration of edge and core computing to support JLab experimental programs, the Electron-Ion Collider, as well as data centers of the future. In the ESnet/JLab FPGA Accelerated Transport (EJFAT) initiative, the function of the LB Data Plane (DP) is to redirect data streams to selectable (but unknown to sender) destination hosts based on current worload and within that host to destination ports as a function of sub- stream id. This effects hierarchical scaling, first across compute machines for processing over a series of events and second, across ports so different data source sub-streams may be assigned to different processors for further parallelization. The LB Control Plane (CP) programs the DP using compute farm telemetry to direct and balance workloads across a compute cluster as the operating conditions require. While Proportional/Integrative/Derivative (PID) controllers are often seen in similar applications, here we investigate the feasibility of a Reinforcement Learning (RL) based schedule manager running in the CP to provide dynamic updates to the DP scheduling policy.

Lawrence, David↗
DOE OSTI2025

Unraveling the Determinant Mechanisms in Flow-Mediated Crystal Growth and Phase Behaviors

To uncover the critical mechanisms responsible for mesoscopic level development during flow-mediated crystal growth, we develop a semi-two-way hydrodynamic coupled structural phase-field crystal formalism (HXPFC-s2). The new formalism, inspired by previous attempts at coupling hydrodynamic and phase-field crystal (PFC) equations, allows for studying mesoscopic flow-mediated crystallization at diffusive timescales pertinent to industrial applications. Unlike previous efforts, the devised coupling to the structural PFC (XPFC) equations allows generalization to more complex crystal structures through explicit parameterization of the direct correlation function (DCF). Utilizing the HXPFC-s2 formalism, we seek to uncover the determinant physical mechanisms in crystallization under simple shear flows by comparing temperature-driven crystallization to flow-mediated crystallization under varying flow-strengths. Parallels and deviations of under-cooling and flow-strength effects on crystal growth are drawn using the crystal cluster-size and system ordering time evolutions. In doing so, we identify scaling behaviors with a Peclet-like number, Pe∼, a critical Peclet-like number, Pe∼*, and flow-field-crystal plane-dependent interactions. Our findings may be relevant for controlling crystal growth and phase behaviors in flow applications.

Willis, L. Connor (ORCID:0009000961321848)↗
NASA NTRS1980

Basic cluster compression algorithm

Feature extraction and data compression of LANDSAT data is accomplished by BCCA program which reduces costs associated with transmitting, storing, distributing, and interpreting multispectral image data. Algorithm uses spatially local clustering to extract features from image data to describe spectral characteristics of data set. Approach requires only simple repetitive computations, and parallel processing can be used for very high data rates. Program is written in FORTRAN IV for batch execution and has been implemented on SEL 32/55.

Hilbert, E. E.↗
NASA NTRS1979

X-ray measurements of stresses and defects in EFG and large grained polycrystalline silicon ribbons

The Bond method was employed to measure the lattice parameter in an area of 0.4 mm in diameter of EFG Si-ribbons to an accuracy of + or - 0.00008 A. A Bond goniometer was built which included a goniostat with a special specimen holder to mount ribbons 1 m in length and 75 mm in width which could be rotated about two orthogonal axes, and a Leitz microscope for precision alignment of a particular area into the center of the goniostat and the small primary X-ray beam. The (321) planes were found to be parallel to the surface of the ribbons with an angular spread of about 15 deg. The poles of the (111) planes clustered about an angle of 25 deg away from the surface normal, again with a spread of 10 deg. The lattice parameter of a small piece of ribbon material was found to be a sub o = 5.43075 A. A maximum stress of 115 MPa was observed in a fractured ribbon which corresponded to the fracture stress of single crystals of Si.

Wagner, C. N. J.↗
NASA NTRS2000

Parallel performance investigations of an unstructured mesh Navier-Stokes solver

A Reynolds-averaged Navier-Stokes solver based on unstructured mesh techniques for analysis of high-lift configurations is described. The method makes use of an agglomeration multigrid solver for convergence acceleration. Implicit line-smoothing is employed to relieve the stiffness associated with highly stretched meshes. A GMRES technique is also implemented to speed convergence at the expense of additional memory usage. The solver is cache efficient and fully vectorizable, and is parallelized using a two-level hybrid MPI-OpenMP implementation suitable for shared and/or distributed memory architectures, as well as clusters of shared memory machines. Convergence and scalability results are illustrated for various high-lift cases.

Mavriplis, Dimitri J.↗