Search NASA⌕ Search

SEARCH · Search NASA

Results for “Node”

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 451 records · Page 25

AdS 6 /CFT 5 with O7-planes

Type IIB AdS6 solutions with orientifold 7-planes are constructed. The geometry is a warped product of AdS 6 and S 2 over a Riemann surface Σ and the O7-planes correspond to a particular type of puncture on Σ. The solutions are identified as near-horizon limits of (p,q) 5-brane webs with O7-planes. The dual 5d SCFTs have relevant deformations to linear quiver gauge theories which have SO(•) or USp(•) nodes or SU(•) nodes with hypermultiplets in symmetric or antisymmetric representations, in addition to SU(•) nodes with fundamental hypermultiplets. The S 5 free energies are obtained holographically and matched to field theory computations using supersymmetric localization to support the proposed dualities.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Activity of Brønsted Acid Sites in UiO-66 for Cyclohexanol Dehydration

Brønsted-acid sites are introduced via –OSO 3 H groups on the coordinatively unsaturated ZrO 2 nodes of UiO-66 metal organic frameworks (MOF). Such groups create strong Brønsted acidic sites that are active for cyclohexanol and ethanol dehydration (in liquid organic phase and gas phase, respectively). The intrinsic activity of Brønsted acid sites at nodes increased by increasing the concentration of sulfur, which is attributed to a shift from isolated µ 3 -OSO 3 H to two groups [(µ 3 -OSO 3 H) 2 ] interacting via hy-drogen bonding. For cyclohexanol dehydration, the relatively low activation enthalpies and negative transition entropies point to an E2 elimination mechanism, similar to dehydration with MFI zeolites in organic solvents. Furthermore, our results, show that the catalytic activity can be manipulated via the functionalization of zirconia nodes of the MOF framework.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Ad Hoc File Systems for High-Performance Computing

Storage backends of parallel compute clusters are still based mostly on magnetic disks, while newer and faster storage technologies such as flash-based SSDs or non-volatile random access memory (NVRAM) are deployed within compute nodes. Including these new storage technologies into scientific workflows is unfortunately today a mostly manual task, and most scientists therefore do not take advantage of the faster storage media. One approach to systematically include nodelocal SSDs or NVRAMs into scientific workflows is to deploy ad hoc file systems over a set of compute nodes, which serve as temporary storage systems for single applications or longer-running campaigns. This paper presents results from the Dagstuhl Seminar 17202 “Challenges and Opportunities of User-Level File Systems for HPC” and discusses application scenarios as well as design strategies for ad hoc file systems using node-local storage media. The discussion includes open research questions, such as how to couple ad hoc file systems with the batch scheduling environment and how to schedule stage-in and stage-out processes of data between the storage backend and the ad hoc file systems. Also presented are strategies to build ad hoc file systems by using reusable components for networking and how to improve storage device compatibility. Various interfaces and semantics are presented, for example those used by the three ad hoc file systems BeeOND, GekkoFS, and BurstFS. Their presentation covers a range from file systems running in production to cutting-edge research focusing on reaching the performance limits of the underlying devices.

97 MATHEMATICS AND COMPUTING↗

A real-time distributed solid oxide electrolysis cell (SOEC) model for cyber-physical simulation

System integration and dynamic operability between SOEC and balance-of-plant (BoP) components are major technical challenges before realizing rapid load following of SOEC systems. Cyber-physical simulation (CPS) is a leading-edge digital engineering approach and is regarded as the next step beyond Digital Twins. CPS approach can be used to research SOEC system integration and develop dynamic controls prior to actual pilot testing without using a real SOEC. To seamlessly couple with BoP hardware and access non-observable operational parameters (e.g., local temperature gradient) during transients, a distributed one-dimensional (1D) real-time SOEC model was developed. Its real-time execution was demonstrated for 20 to 640 nodes at the fixed time step of 5 ms. A higher excess air ratio enabled smaller local temperature gradients on SOEC solid materials and faster transients upon current density step change from 0.15 to 0.55 A cm -2 . During the transients, the magnitude of the peak temperature gradient nearly doubled in 10 s from -3.5 to -5.9 °C cm -1 . This represents a significant operating risk that can impact the dynamic operability of SOEC systems. In addition, the local temperature gradient was found to change directions on all nodes in SOEC solid materials, with the greatest impact on the upstream nodes. The SOEC model was also tested at the thermal neutral voltage using actual process air flow parameters as variable model inputs. Variable process air temperatures were found to induce alternating local temperature gradients on SOEC solid materials. These are new operational mechanisms for SOEC degradation relevant for load following operational modes yet distinct from previous reports. To mitigate these unfavorable features, the SOEC can be operated at voltages that are slightly (±20 mV) deviated from the thermal neutral voltage. Here, the corresponding net thermal energy change was less than 1.6% of the electric power consumption. This 1D real-time SOEC model established the basis of cyber-physical simulation of SOEC hybrid systems.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A hybrid meshfree discretization to improve the numerical performance of peridynamic models

Efficient and accurate calculation of spatial integrals is of major interest in the numerical implementation of peridynamics (PD). The standard way to perform this calculation is a particle-based approach that discretizes the strong form of the PD governing equation. This approach has rapidly been adopted by the PD community since it offers some advantages. Additionally, it is computationally cheaper than other available schemes, can conveniently handle material separation, and effectively deals with nonlinear PD models. Nevertheless, PD models are still computationally very expensive compared with those based on the classical continuum mechanics theory, particularly for large-scale problems in three dimensions. This results from the nonlocal nature of the PD theory which leads to interactions of each node of a discretized body with multiple surrounding nodes. Here, we propose a new approach to significantly boost the numerical efficiency of PD models. We propose a discretization scheme that employs a simple collocation procedure and is truly meshfree; i.e., it does not depend on any background integration cells. In contrast to the standard scheme, the proposed scheme requires a much smaller set of neighboring nodes (keeping the same physical length scale) to achieve a specific accuracy and is thus computationally more efficient. Our new scheme is applicable to the case of linear PD models and within neighborhoods where the solution can be approximated by smooth basis functions. Therefore, to fully exploit the advantages of both the standard and the proposed schemes, a hybrid discretization is presented that combines both approaches within an adaptive framework. The high performance of the developed framework is illustrated by several numerical examples, including brittle fracture and corrosion problems in two and three dimensions.

42 ENGINEERING↗

An attention-based neural ordinary differential equation framework for modeling inelastic processes

To preserve strictly conservative behavior as well as model the variety of dissipative behavior displayed by solid materials, we propose a significant enhancement to the internal state variable-neural ordinary differential equation (ISV-NODE) framework. In this data-driven, physics-constrained modeling framework internal states are inferred rather than prescribed. The ISV-NODE consists of: (a) a stress model dependent on observable deformation and inferred internal state, and (b) a model of the evolution of the internal states. The enhancements to ISV-NODE proposed in this work are multifold: (a) a partially input convex neural network stress potential provides polyconvexity in terms of observed strain while leaving the inferred state unconstrained, and (b) an internal state flow model uses common latent features to inform novel attention-based gating and drives the flow of internal state only in dissipative regimes. We demonstrated that this architecture can accurately model dissipative and conservative behavior across an isotropic, isothermal elastic-viscoelastic-elastoplastic spectrum with three exemplars, while maintaining fundamental principles by design.

97 MATHEMATICS AND COMPUTING↗

Learning subgrid-scale models with neural ordinary differential equations

We propose a new approach to learning the subgrid-scale model when simulating partial differential equations (PDEs) solved by the method of lines and their representation in chaotic ordinary differential equations, based on neural ordinary differential equations (NODEs). Solving systems with fine temporal and spatial grid scales is an ongoing computational challenge, and closure models are generally difficult to tune. Machine learning approaches have increased the accuracy and efficiency of computational fluid dynamics solvers. In this approach neural networks are used to learn the coarse- to fine-grid map, which can be viewed as subgrid-scale parameterization. We propose a strategy that uses the NODE and partial knowledge to learn the source dynamics at a continuous level. Our method inherits the advantages of NODEs and can be used to parameterize subgrid scales, approximate coupling operators, and improve the efficiency of low-order solvers. Numerical results with the two-scale Lorenz 96 ODE, the convection-diffusion PDE, and the viscous Burgers' PDE are used to illustrate this approach.

97 MATHEMATICS AND COMPUTING↗

Resilient information and inference networks under mixed-trust sensing

With ubiquitous digitization, sensing, and computational intelligence deployed in increasingly more and broader domains, including critical infrastructure, potentially misleading and destabilizing effects of multimodal anomalies and adversarial behavior are growing in importance. Here, we develop randomized and reinforcement learning-based strategies for strategically recruiting and utilizing deployed (and, thus, vulnerable and potentially faulty and/or compromised) nodes from information and inference networks, while defending against adversaries that attempt to misguide assessments of inferred variables. Recognizing that, besides communication and other costs, sampling from any observable node can either provide true data or dangerously expose our inference to misinformation (without being easily distinguishable what actually happens), the proposed strategies proceed by progressively recruiting nodes and cautiously scaling their information contribution based on assumed, or, in our reinforcement learning approach, intelligently weighed trustworthiness, with the learning approach also considering network-wide, threat-inclusive risk/value tradeoffs. While avoiding the hardware, communication, analytical and computational burden of explicit redundancy, the proposed defensive schemes enable on-the-fly assessments of underlying processes, and system-wide situational awareness with demonstrable resilience against adversarial activities.

97 - MATHEMATICS AND COMPUTING↗

Multiscale graph neural network autoencoders for interpretable scientific machine learning

The goal of this work is to address two limitations in autoencoder-based models: latent space interpretability and compatibility with unstructured meshes. This is accomplished here with the development of a novel graph neural network (GNN) autoencoding architecture with demonstrations on complex fluid flow applications. To address the first goal of interpretability, the GNN autoencoder achieves reduction in the number nodes in the encoding stage through an adaptive graph reduction procedure. Further, this reduction procedure essentially amounts to flowfieldconditioned node sampling and sensor identification, and produces interpretable latent graph representations tailored to the flowfield reconstruction task in the form of so-called masked fields. These masked fields allow the user to (a) visualize where in physical space a given latent graph is active, and (b) interpret the time-evolution of the latent graph connectivity in accordance with the time-evolution of unsteady flow features (e.g. recirculation zones, shear layers) in the domain. To address the goal of unstructured mesh compatibility, the autoencoding architecture utilizes a series of multi-scale message passing (MMP) layers, each of which models information exchange among node neighborhoods at various lengthscales. The MMP layer, which augments standard single-scale message passing with learnable coarsening operations, allows the decoder to more efficiently reconstruct the flowfield from the identified regions in the masked fields. Analysis of latent graphs produced by the autoencoder for various model settings are conducted using unstructured snapshot data sourced from large-eddy simulations in a backward-facing step (BFS) flow configuration with an OpenFOAM-based flow solver at high Reynolds numbers.

97 MATHEMATICS AND COMPUTING↗

A face-upwinded spectral element method

Here we present a new high-order accurate discretisation on unstructured meshes of quadrilateral elements. Our Face Upwinded Spectral Element (FUSE) method uses the same node distribution as a high-order continuous Galerkin (CG) method, but with a particular choice of node locations within each element and an upwinded stencil on the face nodes. This results in a number of benefits, including fewer degrees of freedom and straight-forward integration with CG. We present the derivation of the scheme and the analysis of its properties, in particular showing stability using von Neumann analysis. We show numerical evidence for its accuracy and efficiency on multiple classes of problems including convection-dominated flows, Poisson's equation, and the incompressible Navier-Stokes equations.

97 MATHEMATICS AND COMPUTING↗

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↗

Optically connected memory for disaggregated data centers

Recent advances in integrated photonics enable the implementation of reconfigurable, high-bandwidth, and low energy-per-bit interconnects in next-generation data centers. We propose and evaluate an Optically Connected Memory (OCM) architecture that disaggregates the main memory from the computation nodes in data centers. OCM is based on micro-ring resonators (MRRs), and it does not require any modification to the DRAM memory modules. We calculate energy consumption from real photonic devices and integrate them into a system simulator to evaluate performance. Here, our results show that (1) OCM is capable of interconnecting four DDR4 memory channels to a computing node using two fibers with 1.02 pJ energy-per-bit consumption and (2) OCM performs up to 5.5× faster than a disaggregated memory with 40G PCIe NIC connectors to computing nodes.

97 MATHEMATICS AND COMPUTING↗

Distributed Tomographic Reconstruction with Quantization

Conventional tomographic reconstruction typically depends on centralized servers for both data storage and computation, leading to concerns about memory limitations and data privacy. Distributed reconstruction algorithms mitigate these issues by partitioning data across multiple nodes, reducing server load and enhancing privacy. However, these algorithms often encounter challenges related to memory constraints and communication overhead between nodes. In this paper, we introduce a decentralized Alternating Directions Method of Multipliers (ADMM) with configurable quantization. By distributing local objectives across nodes, our approach is highly scalable and can efficiently reconstruct images while adapting to available resources. To overcome communication bottlenecks, we propose two quantization techniques based on K-means clustering and JPEG compression. Numerical experiments with benchmark images illustrate the tradeoffs between communication efficiency, memory use, and reconstruction accuracy.

Miao, Runxuan↗

Evaluating adaptive and predictive power management strategies for optimizing visualization performance on supercomputers

Power is becoming an increasingly scarce resource on the next generation of supercomputers, and should be used wisely to improve overall performance. One strategy for improving power usage is hardware overprovisioning, i.e., systems with more nodes than can be run at full power simultaneously without exceeding the system-wide power limit. With this study, we compare two strategies for allocating power throughout an overprovisioned system – adaptation and prediction – in the context of visualization workloads. While adaptation has been suitable for workloads with more regular execution behaviors, it may not be as suitable on visualization workloads, since they can have variable execution behaviors. This study considers a total of 104 experiments, which vary the rendering workload, power budget, allocation strategy, and node concurrency, including tests processing data sets up to 1 billion cells and using up to 18,432 cores across 512 nodes. Overall, we find that prediction is a superior strategy for this use case, improving performance up to 27% compared to an adaptive strategy.

97 MATHEMATICS AND COMPUTING↗

Immortal rays: Rethinking random ray neutron transport on GPU architectures

The Random Ray Method (TRRM) is a recently developed adaptation of the Method of Characteristics for neutral particle transport simulations. TRRM has demonstrated excellent performance on 3D nuclear reactor benchmark problems using CPU-based compute systems. When porting to GPU-based systems, however, new performance challenges arise that are unique to processors targeting massive fine-grained parallelism. For smaller problems, or for large problems that are domain decomposed across many computational nodes, the problem size per node has insufficient parallelism to saturate GPU node resources, thus greatly limiting speedup. In this study, we report on a newly developed “immortal ray” variant of TRRM. Here, the immortal ray technique exposes significantly more fine-grained parallelism by fundamentally reformulating the numerical details of ray discretization, resulting in performance tradeoffs with significant overall benefit on GPUs. For very small 2D simulation problems we found the new immortal ray variant allowed for up to a 4.4x speedup when run on a single GPU. For larger 3D simulation problems we found the new variant improved strong scaling by 3x when run on the Summit supercomputer.

97 MATHEMATICS AND COMPUTING↗

Porting hypre to heterogeneous computer architectures: Strategies and experiences

We report that linear systems are occurring in many applications, and solving them can take a large amount of the total simulation time. The high performance library hypre provides a variety of interfaces and linear solvers, including various multigrid methods, that have achieved good scalability on a variety of homogeneous parallel computer architectures. Heterogeneous architectures with nodes that have both CPUs and accelerators provide new challenges, since they require more fine-grained parallelism and reduced data movement between different memories on a single node as well as across nodes. We will discuss our experiences and strategies to port hypre to heterogeneous computers with accelerators, including the design of a new memory model, the use of abstractions, the BoxLoop macros in the structured and semi-structured interfaces, and the restructuring of algebraic multigrid (AMG) into modular components. We present numerical experiments comparing CPU and GPU performance for several test problems.

97 MATHEMATICS AND COMPUTING↗

Time-series learning of latent-space dynamics for reduced-order model closure

In this work, we study the performance of long short-term memory networks (LSTMs) and neural ordinary differential equations (NODEs) in learning latent-space representations of dynamical equations for an advection-dominated problem given by the viscous Burgers equation. Our formulation is devised in a nonintrusive manner with an equation-free evolution of dynamics in a reduced space with the latter being obtained through a proper orthogonal decomposition. In addition, we leverage the sequential nature of learning for both LSTMs and NODEs to demonstrate their capability for closure in systems that are not completely resolved in the reduced space. We assess our hypothesis for two advection-dominated problems given by the viscous Burgers equation. We observe that both LSTMs and NODEs are able to reproduce the effects of the absent scales for our test cases more effectively than does intrusive dynamics evolution through a Galerkin projection. This result empirically suggests that time-series learning techniques implicitly leverage a memory kernel for coarse-grained system closure as is suggested through the Mori–Zwanzig formalism.

97 MATHEMATICS AND COMPUTING↗

Charge Transport in Zirconium-Based Metal–Organic Frameworks

Metal–organic frameworks (MOFs) are a class of crystalline porous materials characterized by inorganic nodes and multitopic organic linkers. Because of their molecular-scale porosity and periodic intraframework chemical functionality, MOFs are attractive scaffolds for supporting and/or organizing catalysts, photocatalysts, chemical-sensing elements, small enzymes, and numerous other functional-property-imparting, nanometer-scale objects. Notably, these objects can be installed after the synthesis of the MOF, eliminating the need for chemical and thermal compatibility of the objects with the synthesis milieu. Thus, postsynthetically functionalized MOFs can present three-dimensional arrays of high-density, yet well-separated, active sites. Depending on the application and corresponding morphological requirements, MOF materials can be prepared in thin-film form, pelletized form, isolated single-crystal form, polycrystalline powder form, mixed-matrix membrane form, or other forms. For certain applications, most obviously catalytic hydrolysis and electro- or photocatalytic water splitting, but also many others, an additional requirement is water stability. MOFs featuring hexa-zirconium(IV)-oxy nodes satisfy this requirement. For applications involving electrocatalysis, charge storage, photoelectrochemical energy conversion, and chemiresistive sensing, a further requirement is electrical conductivity, as embodied in electron or hole transport. As most MOFs, under most conditions, are electrically insulating, imparting controllable charge-transport behavior is both a chemically intriguing and chemically compelling challenge. Herein, we describe three strategies to render zirconium-based metal–organic frameworks (MOFs) tunably electrically conductive and, therefore, capable of transporting charge on the few nanometers (i.e., several molecular units) to few micrometers (i.e., typical dimensions for MOF microcrystallites) scale. The first strategy centers on redox-hopping between periodically arranged, chemically equivalent sites, essentially repetitive electron (or hole) self-exchange. Zirconium nodes are electrically insulating, but they can function as grafting sites for (a) redox-active inorganic clusters or (b) molecular redox couples. Alternatively, charge hopping based on linker redox properties can be exploited. Marcus’s theory of electron transfer has proven useful for understanding/predicting trends in redox-hopping based conductivity, most notably, in accounting for variations as great as 3000-fold depending on the direction of charge propagation through structurally anisotropic MOFs. In MOF environments, propagation of electronic charge via redox hopping is necessarily accompanied by movement of charge-compensating ions. Consequently, rates of redox hopping can depend on both the identity and concentration of ions permeating the MOF. In the context of electrocatalysis, an important goal is to transport electronic charge fast enough to match or exceed the inherent activity of MOF-based or MOF-immobilized catalysts. Bandlike electronic conductivity is the focus of an alternative strategy: one based on the introduction of molecular guests capable of forming donor–acceptor charge transfer complexes with the host framework. Theory again can be applied predictively to alter conductivity. A third strategy similarly emphasizes electronic conductivity, but it makes use of added bridges in the form of molecular oligomers or inorganic clusters that can then be linked to span the length of a MOF crystallite. For all strategies, retention of molecular-scale porosity is emphasized, as this property is key to many applications. Lastly, while our focus is on Zr-MOFs, the described approaches clearly are extendable to other MOF compositions, as has already been demonstrated, in part, in studies by others.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗