Results for “data transfer nodes” — Page 6

NASA NTRS1999

Leo Satellite Communication through a LEO Constellation using TCP/IP Over ATM

The simulated performance characteristics for communication between a terrestrial client and a Low Earth Orbit (LEO) satellite server are presented. The client and server nodes consist of a Transmission Control Protocol /Internet Protocol (TCP/IP) over ATM configuration. The ATM cells from the client or the server are transmitted to a gateway, packaged with some header information and transferred to a commercial LEO satellite constellation. These cells are then routed through the constellation to a gateway on the globe that allows the client/server communication to take place. Unspecified Bit Rate (UBR) is specified as the quality of service (QoS). Various data rates are considered.

Foore, Lawrence R.↗

NASA NTRSDate not supplied

Numerical Modeling of No Vent Filling of a Cryogenic Tank

This paper presents a multi-node finite volume model of the chilling and filling of a cryogenic tank using the Generalized Fluid System Simulation Program (GFSSP), a general purpose flow network code. Vented Chill and No Vent Fill (VCNVF) tests were conducted at Marshall Space Flight Center where a flight-like tank was filled with liquid nitrogen from a supply tank. In the VCNVF tests, the tank was partially chilled while the vent valve was open. After the partial chilling, the vent valve was closed and the tank was filled without any venting. An integrated numerical model of the test set up was developed. The model included the transfer line from the supply tank, the target tank with the spray nozzle and solid walls, and the discharge line with the vent valve. The tank was discretized into multiple fluid nodes and branches to represent the ullage and liquid nitrogen and multiple solid nodes to represent the tank wall and structure. The heat transfer between solid to fluid was calculated from pool boiling correlations which include film, transition, and nucleate boiling, as well as natural convection during pre- and post-boiling. The model also accounts for the condensation of vapor in the tank when it comes in contact with the liquid spray. The predicted pressure, resident mass, wall and ullage temperature in the tank were compared with the test data.

Alok Majumdar↗

NASA NTRSDate not supplied

Numerical Modeling of No Vent Filling of a Cryogenic Tank

This paper presents a multi-node finite volume model of the chilling and filling of a cryogenic tank using the Generalized Fluid System Simulation Program (GFSSP), a general purpose flow network code. Vented Chill and No Vent Fill (VCNVF) tests were conducted at Marshall Space Flight Center where a flight-like tank was filled with liquid nitrogen from a supply tank. In the VCNVF tests, the tank was partially chilled while the vent valve was open. After the partial chilling, the vent valve was closed and the tank was filled without any venting. An integrated numerical model of the test set up was developed. The model included the transfer line from the supply tank, the target tank with the spray nozzle and solid walls, and the discharge line with the vent valve. The tank was discretized into multiple fluid nodes and branches to represent the ullage and liquid nitrogen and multiple solid nodes to represent the tank wall and structure. The heat transfer between solid to fluid was calculated from pool boiling correlations which include film, transition, and nucleate boiling, as well as natural convection during pre- and post-boiling. The model also accounts for the condensation of vapor in the tank when it comes in contact with the liquid spray. The predicted pressure, resident mass, wall and ullage temperature in the tank were compared with the test data.

Alok Majumdar↗

DOE OSTI2026

Deflagration to Detonation Transition Update: XDDT Code Modularization

A legacy FORTRAN 77 implementation of the Baer–Nunziato two-phase mixture theory for deflagration-to-detonation transition (DDT) in reactive granular materials—hereafter the XDDT (eXplosive DDT) code—has been modularized to Fortran 90 with modular structure, external input files, and adaptive mesh capability. During validation, two code defects were identified and corrected: an inconsistency in the nodal solid pressure evaluation and a nonphysical burn-front tracking criterion. The ignition criterion was also corrected to use the granular surface temperature from the interface heat transfer model, matching the original Baer implementation. An initial attempt to validate against Figure 3 of the original Baer and Nunziato (1986) paper revealed that the code’s detonation velocity on a 201-node mesh (5.5 km/s) was approximately 21% below the expected Chapman–Jouguet value for 70% TMD HMX (∼7 km/s). Validation was redirected to the piston-driven DDT experiments of McAfee et al. (1989), Shot B-9036, for which well-characterized ionization-pin data are available. With the compaction-burn coefficient calibrated to 𝐶 𝛼 = 75, the XDDT code reproduces the DDT transition time to within 0.4% and produces a steady-state detonation velocity within 4% of the McAfee experimental value of 6.36 km/s. The burn model was generalized to support pressure-dependent exponents, enabling application to nitrocellulose-based ball propellants (TS3659) with a cube-root pressure dependence. Validation against the Sandusky/Baer PDC82 piston-impact experiment yielded a reactive wave velocity of 2.3–2.8 km/s, in good agreement with the experimental value of ∼2.2 km/s, and wave coalescence within 5% of the experimental timing. The mathematical model, input parameter requirements, and a roadmap for extending XDDT to PETN with an autocatalytic burn model are presented.

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗

NASA NTRS1992

On-orbit cryogenic fluid transfer research at NASA Lewis Research Center

A summary of research into on-orbit cryogenic fluid transfer at the NASA Lewis Research Center (LRC) is presented. Variable test parameters and liquid injection configurations elucidated the conditions necessary for a successful transfer of liquid hydrogen by the no-vent fill method. The model is based on conservation of mass and a first-law energy balance for a control volume. The ullage, the bulk liquid, and the tank wall are each represented by a single node. The magnitude of the maximum receiver tank pressure was found to be dependent on the liquid inlet temperature, the inlet mass flow rate, and the initial temperature. A comparison of the test data and the analytical results for a no-vent fill test with a small receiver tank is presented.

Taylor, W. J.↗

NASA NTRS2005

Navier-Stokes Simulation of Airconditioning Facility of a Large Modem Computer Room

NASA recently assembled one of the world's fastest operational supercomputers to meet the agency's new high performance computing needs. This large-scale system, named Columbia, consists of 20 interconnected SGI Altix 512-processor systems, for a total of 10,240 Intel Itanium-2 processors. High-fidelity CFD simulations were performed for the NASA Advanced Supercomputing (NAS) computer room at Ames Research Center. The purpose of the simulations was to assess the adequacy of the existing air handling and conditioning system and make recommendations for changes in the design of the system if needed. The simulations were performed with NASA's OVERFLOW-2 CFD code which utilizes overset structured grids. A new set of boundary conditions were developed and added to the flow solver for modeling the roomls air-conditioning and proper cooling of the equipment. Boundary condition parameters for the flow solver are based on cooler CFM (flow rate) ratings and some reasonable assumptions of flow and heat transfer data for the floor and central processing units (CPU) . The geometry modeling from blue prints and grid generation were handled by the NASA Ames software package Chimera Grid Tools (CGT). This geometric model was developed as a CGT-scripted template, which can be easily modified to accommodate any changes in shape and size of the room, locations and dimensions of the CPU racks, disk racks, coolers, power distribution units, and mass-storage system. The compute nodes are grouped in pairs of racks with an aisle in the middle. High-speed connection cables connect the racks with overhead cable trays. The cool air from the cooling units is pumped into the computer room from a sub-floor through perforated floor tiles. The CPU cooling fans draw cool air from the floor tiles, which run along the outside length of each rack, and eject warm air into the center isle between the racks. This warm air is eventually drawn into the cooling units located near the walls of the room. One major concern is that the hot air ejected to the middle isle might recirculate back into the cool rack side and cause thermal short-cycling. The simulations analyzed and addressed the following important elements of the computer room: 1) High-temperature build-up in certain regions of the room; 2) Areas of low air circulation in the room; 3) Potential short-cycling of the computer rack cooling system; 4) Effectiveness of the perforated cooling floor tiles; 5) Effect of changes in various aspects of the cooling units. Detailed flow visualization is performed to show temperature distribution, air-flow streamlines and velocities in the computer room.

Source record↗

NASA NTRSDate not supplied

Numerical Modeling of No Vent Filling of a Cryogenic Tank with Thermo-dynamic Vent System Assisted Injector

This paper presents a multi-node finite volume model of No Vent Filling (NVF) of a cryogenic tank with Thermo-dynamic Vent System (TVS) assisted injector, using the Generalized Fluid System Simulation Program (GFSSP), a general purpose flow network code. NVF tests were conducted in a CRYOgenic Orbital Testbed (CRYOTE) tank which was filled by liquid nitrogen using a TVS assisted injector with vent valve closed during the entire filling process. In TVS assisted injector, the liquid flow splits into two streams: one stream is routed to a Joule-Thomson (J-T) orifice where the flow immediately flashes from liquid to vapor or two phase mixture because the downstream to J-T leg is maintained at vacuum level.; the other stream is injected into the tank after being cooled by cold vapor of J-T leg in a heat exchanger. The flow through J-T leg is also used to cool the outer metal matrix of the injector which in turn cools the vapor in the tank ullage. The cooling of vapor in the ullage by cold injector surface reduces ullage pressure that allows liquid to enter and fill the tank. An integrated numerical model of the test set up was developed. The model included the dual lines of TVS assisted injector, tank and tank wall. The tank was discretized into multiple fluid nodes and branches to represent the ullage and liquid nitrogen and multiple solid nodes to represent the tank wall and structure. The heat transfer between solid to fluid was calculated from pool boiling correlations which include film, transition, and nucleate boiling, as well as natural convection during pre- and post-boiling. The model also accounts for the condensation of vapor at ullage-injector interface and when it comes in contact with the liquid spray. The predicted pressure, resident mass, wall temperature in the tank were compared with the test data.

Alok Majumdar↗

DOE OSTI2020

Opportunities for Cost Savings with In-Transit Visualization

We analyze the opportunities for in-transit visualization to provide cost savings compared to in-line visualization. We begin by developing a cost model that includes factors related to both in-line and in-transit which allows comparisons to be made between the two methods. We then run a series of studies to create a corpus of data for our model. We run two different visualization algorithms, one that is computation heavy and one that is communication heavy with concurrencies up to 32, 768 cores. Our primary results are in exploring the cost model within the context of our corpus. Our findings show that in-transit consistently achieves significant cost efficiencies by running visualization algorithms at lower concurrency, and that in many cases these efficiencies are enough to offset other costs (transfer, blocking, and additional nodes) to be cost effective overall. Finally, this work informs future studies, which can focus on choosing ideal configurations for in-transit processing that can consistently achieve cost efficiencies.

Kress, James↗

DOE OSTI2025

Accelerating high-order continuum kinetic plasma simulations using multiple GPUs

Kinetic plasma simulations solve the Vlasov-Poisson or Vlasov-Maxwell equations to evolve scalar-variable distribution functions in position-velocity phase space and vector-variable electromagnetic fields in configuration space. The immense computational cost of evolving high-dimensional variables, and their large number of degrees of freedom, often limits the utility of continuum kinetic simulations and presents a challenge when it comes to accurately simulating real-world physical phenomena. To address this challenge, we present techniques that accelerate and minimize the computational work required for a scalable Vlasov-Poisson solver. We show theoretical hardware compute and communication bounds for solving a fourth-order finite-volume Vlasov-Poisson system. These bounds are then used to inform and evaluate the design of performance portable algorithms for a multiple graphics processing unit (GPU) accelerated version of the Vlasov-Poisson solver VCK-CPU [1]. We demonstrate that the multi-GPU Vlasov solver implementation, VCK-GPU, simultaneously minimizes required inter-process data transfer while also being bounded by the machine network performance limits. This results in an overall strong scaling speedup per timestep of up to 40x in three-dimensional phase space (one position, two velocity coordinates) and 54x in four dimensional phase space (two position, two velocity coordinates) and a 341x increase in simulation throughput of the GPU accelerated code over the existing CPU code. The GPU code is also able to weak scale up to 256 compute nodes and 1024 GPUs. In conclusion, we demonstrate that the improved compute performance enables exploring configurations which were previously computationally infeasible, including resolving fine-scale distribution function filamentation and multi-species dynamics with realistic electron-proton mass ratios.

Continuum kinetics↗

DOE OSTI2021

Enabling Scalable and Extensible Memory-mapped Datastores in Userspace

Exascale workloads are expected to incorporate data-intensive processing in close coordination with traditional physics simulations. These emerging scientific, data-analytics and machine learning applications need to access a wide variety of datastores in flat files and structured databases. Programmer productivity is greatly enhanced by mapping datastores into the application process's virtual memory space to provide a unified “in-memory” interface. Currently, memory mapping is provided by system software primarily designed for generality and reliability. However, scalability at high concurrency is a formidable challenge on exascale systems. Also, there is a need for extensibility to support new datastores potentially requiring HPC data transfer services. In this article, we present UMap , a scalable and extensible userspace service for memory-mapping datastores. Furthermore, through decoupled queue management, concurrency aware adaptation, and dynamic load balancing, UMap enables application performance to scale even at high concurrency. We evaluate UMap in data-intensive applications, including sorting, graph traversal, database operations, and metagenomic analytics. Our results show that UMap as a userspace service outperforms an optimized kernel-based service across a wide range of intra-node concurrency by 1.22-1.9 × . We performed two case studies to demonstrate UMap 's extensibility. First, a new datastore residing in remote memory is incorporated into UMap as an application-specific plugin. Second, we present a persistent memory allocator Metall built atop UMap for unified storage/memory.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS2024

Nodal Modeling of Liquid Propellant Feed and Pressurization System

Nodal or network flow modeling plays an important role in the design and operation of the feed and pressurization system of a liquid rocket engine. Model development and execution time is relatively short for nodal codes in comparison to the Navier-Stokes based CFD codes. Nodal models also allow the inclusion of several components into one model to predict the behavior of a larger system. Unlike CFD models, the nodal models do not need very fine discretization of the flow field because they use empirical correlations to model fluid friction and heat transfer. This paper presents several applications of nodal modeling of liquid propellant feed and pressurization systems using the Generalized Fluid System Simulation Program (GFSSP), a nodal code developed at NASA/ Marshall Space Flight Center. GFSSP discretizes the flow field into nodes which are connected by branches. The mass and energy conservation equations and the equation of state are solved to calculate pressure, temperature, and resident mass at the nodes. The momentum equations are solved at the branches to calculate flow rates. Applications include a) tank pressurization by inert gas as well as autogenous pressurization by gaseous propellant, b) submerged pressurization by helium, c) self-pressurization due to boil-off of cryogenic propellant, d) chilldown of a transfer line of a cryogenic propellant feed system, and e) chilldown and filling of a cryogenic tank. Each of the above-mentioned models was verified and validated by comparing with test data.

Nodal Model↗

NASA NTRS2024

Nodal Modeling of Liquid Propellant Feed and Pressurization System

Nodal or network flow modeling plays an important role in the design and operation of the feed and pressurization system of a liquid rocket engine. Model development and execution time is relatively short for nodal codes in comparison to the Navier-Stokes based CFD codes. Nodal models also allow the inclusion of several components into one model to predict the behavior of a larger system. Unlike CFD models, the nodal models do not need very fine discretization of the flow field because they use empirical correlations to model fluid friction and heat transfer. This paper presents several applications of nodal modeling of liquid propellant feed and pressurization systems using the Generalized Fluid System Simulation Program (GFSSP), a nodal code developed at NASA/ Marshall Space Flight Center. GFSSP discretizes the flow field into nodes which are connected by branches. The mass and energy conservation equations and the equation of state are solved to calculate pressure, temperature, and resident mass at the nodes. The momentum equations are solved at the branches to calculate flow rates. Applications include a) tank pressurization by inert gas as well as autogenous pressurization by gaseous propellant, b) submerged pressurization by helium, c) self-pressurization due to boil-off of cryogenic propellant, d) chilldown of a transfer line of a cryogenic propellant feed system, and e) chilldown and filling of a cryogenic tank. Each of the above-mentioned models was verified and validated by comparing with test data.

Nodal Model↗

DOE OSTI2021

Coding the Computing Continuum: Fluid Function Execution in Heterogeneous Computing Environments

Advances in network technologies have greatly decreased barriers to accessing physically distributed computers. This newfound accessibility coincides with increasing hardware specialization, creating exciting new opportunities to dispatch workloads to the best resource for a specific purpose, rather than those that are closest or most easily accessible. We present Delta, a service designed to intelligently schedule function-based workloads across a distributed set of heterogeneous computing resources. Delta implements an extensible architecture in which different predictors and scheduling algorithms can be integrated to provide dynamically evolving estimates of function execution times on different resources-estimates that can be used to determine the most appropriate location for execution. We describe predictors for function runtime, data transfer time, and cold-start resource provisioning and configuration delay; dynamic learning methods that update predictor models over time; and scheduling strategies that take into account both function and endpoint information. We show that these methods can halve workload makespan when compared with a strategy that selects the fastest resource, and decrease makespan by a factor of five when compared to a round robin strategy, when deployed on a heterogeneous testbed with resources ranging from a Raspberry Pi to a GPU node in an academic cloud.

Computing continuum↗

DOE OSTI2023

Porting the WAVEWATCH III (v6.07) wave action source terms to GPU

Abstract. Surface gravity waves play a critical role in several processes, including mixing, coastal inundation, and surface fluxes. Despite the growing literature on the importance of ocean surface waves, wind–wave processes have traditionally been excluded from Earth system models (ESMs) due to the high computational costs of running spectral wave models. The development of the Next Generation Ocean Model for the DOE’s (Department of Energy) E3SM (Energy Exascale Earth System Model) Project partly focuses on the inclusion of a wave model, WAVEWATCH III (WW3), into E3SM. WW3, which was originally developed for operational wave forecasting, needs to be computationally less expensive before it can be integrated into ESMs. To accomplish this, we take advantage of heterogeneous architectures at DOE leadership computing facilities and the increasing computing power of general-purpose graphics processing units (GPUs). This paper identifies the wave action source terms, W3SRCEMD, as the most computationally intensive module in WW3 and then accelerates them via GPU. Our experiments on two computing platforms, Kodiak (P100 GPU and Intel(R) Xeon(R) central processing unit, CPU, E5-2695 v4) and Summit (V100 GPU and IBM POWER9 CPU) show respective average speedups of 2× and 4× when mapping one Message Passing Interface (MPI) per GPU. An average speedup of 1.4× was achieved using all 42 CPU cores and 6 GPUs on a Summit node (with 7 MPI ranks per GPU). However, the GPU speedup over the 42 CPU cores remains relatively unchanged (∼ 1.3×) even when using 4 MPI ranks per GPU (24 ranks in total) and 3 MPI ranks per GPU (18 ranks in total). This corresponds to a 35 %–40 % decrease in both simulation time and usage of resources. Due to too many local scalars and arrays in the W3SRCEMD subroutine and the huge WW3 memory requirement, GPU performance is currently limited by the data transfer bandwidth between the CPU and the GPU. Ideally, OpenACC routine directives could be used to further improve performance. However, W3SRCEMD would require significant code refactoring to make this possible. We also discuss how the trade-off between the occupancy, register, and latency affects the GPU performance of WW3.

58 GEOSCIENCES↗

NASA NTRS2019

Multi-Node Modeling of Cryogenic Tank Pressurization System using Generalized Fluid System Simulation Program

This paper presents a multi-node model of autogenous pressurization of cryogenic propellant in a flight tank using the Generalized Fluid System Simulation Program (GFSSP), a general purpose flow network code developed at NASA/Marshall Space Flight Center. Tests were conducted to measure the pressure and temperatures at the various axial locations of the stratified ullage at 75% and 45% fill level. Liquid nitrogen was pressurized by gaseous nitrogen from a supply tank while the drain valve from the tank remained closed during the pressurization process. The ullage was discretized into 25 uniformly distributed nodes: 5 in the radial direction and 5 in the axial direction assuming the flow to be axisymmetric. Heat and mass transfer between the liquid and vapor has been modeled at the liquid vapor interface. Heat transfer between wall and vapor at the ullage has been accounted for by assuming heat transfer occurs by natural convection. The model also accounts for heat leak to the tank through the insulation and metal wall by heat conduction. The predicted pressures and temperatures are compared with the measured data.

Bandyopadhyay, Alak↗

DOE OSTI2021

Accelerating Multigrid-based Hierarchical Scientific Data Refactoring on GPUs

Rapid growth in scientific data and a widening gap between computational speed and I/O bandwidth make it increasingly infeasible to store and share all data produced by scientific simulations. Instead, we need methods for reducing data volumes: ideally, methods that can scale data volumes adaptively so as to enable negotiation of performance and fidelity tradeoffs in different situations. Multigrid-based hierarchical data representations hold promise as a solution to this problem, allowing for flexible conversion between different fidelities so that, for example, data can be created at high fidelity and then transferred or stored at lower fidelity via logically simple and mathematically sound operations. However, the effective use of such representations has been hindered until now by the relatively high costs of creating, accessing, reducing, and otherwise operating on such representations. We describe here highly optimized data refactoring kernels for GPU accelerators that enable efficient creation and manipulation of data in multigrid-based hierarchical forms. We demonstrate that our optimized design can achieve up to 250 TB/s aggregated data refactoring throughput—83% of theoretical peak—on 1024 nodes of the Summit supercomputer. We showcase our optimized design by applying it to a large-scale scientific visualization workflow and the MGARD lossy compression software.

Data refactoring↗

DOE OSTI2021

Accelerating Multigrid-based Hierarchical Scientific Data Refactoring on GPUs

Rapid growth in scientific data and a widening gap between computational speed and I/O bandwidth make it increasingly infeasible to store and share all data produced by scientific simulations. Instead, we need methods for reducing data volumes: ideally, methods that can scale data volumes adaptively so as to enable negotiation of performance and fidelity tradeoffs in different situations. Multigrid-based hierarchical data representations hold promise as a solution to this problem, allowing for flexible conversion between different fidelities so that, for example, data can be created at high fidelity and then transferred or stored at lower fidelity via logically simple and mathematically sound operations. However, the effective use of such representations has been hindered until now by the relatively high costs of creating, accessing, reducing, and otherwise operating on such representations. We describe here highly optimized data refactoring kernels for GPU accelerators that enable efficient creation and manipulation of data in multigrid-based hierarchical forms. We demonstrate that our optimized design can achieve up to 250 TB/s aggregated data refactoring throughput—83% of theoretical peak—on 1024 nodes of the Summit supercomputer. We showcase our optimized design by applying it to a large-scale scientific visualization workflow and the MGARD lossy compression software.

Chen, Jieyang↗

NASA NTRS2016

Multi-Disciplinary, Multi-Fidelity Discrete Data Transfer Using Degenerate Geometry Forms

In a typical multi-fidelity design process, different levels of geometric abstraction are used for different analysis methods, and transitioning from one phase of design to the next often requires a complete re-creation of the geometry. To maintain consistency between lower-order and higher-order analysis results, Vehicle Sketch Pad (OpenVSP) recently introduced the ability to generate and export several degenerate forms of the geometry, representing the type of abstraction required to perform low- to medium-order analysis for a range of aeronautical disciplines. In this research, the functionality of these degenerate models was extended, so that in addition to serving as repositories for the geometric information that is required as input to an analysis, the degenerate models can also store the results of that analysis mapped back onto the geometric nodes. At the same time, the results are also mapped indirectly onto the nodes of lower-order degenerate models using a process called aggregation, and onto higher-order models using a process called disaggregation. The mapped analysis results are available for use by any subsequent analysis in an integrated design and analysis process. A simple multi-fidelity analysis process for a single-aisle subsonic transport aircraft is used as an example case to demonstrate the value of the approach.

Olson, Erik D.↗