Search NASA⌕ Search

SEARCH · Search NASA

Results for “Parallel Performance Data”

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

Optimization of Microelectronic Devices for Sensor Applications

The NASA/JPL goal to reduce payload in future space missions while increasing mission capability demands miniaturization of active and passive sensors, analytical instruments and communication systems among others. Currently, typical system requirements include the detection of particular spectral lines, associated data processing, and communication of the acquired data to other systems. Advances in lithography and deposition methods result in more advanced devices for space application, while the sub-micron resolution currently available opens a vast design space. Though an experimental exploration of this widening design space-searching for optimized performance by repeated fabrication efforts-is unfeasible, it does motivate the development of reliable software design tools. These tools necessitate models based on fundamental physics and mathematics of the device to accurately model effects such as diffraction and scattering in opto-electronic devices, or bandstructure and scattering in heterostructure devices. The software tools must have convenient turn-around times and interfaces that allow effective usage. The first issue is addressed by the application of high-performance computers and the second by the development of graphical user interfaces driven by properly developed data structures. These tools can then be integrated into an optimization environment, and with the available memory capacity and computational speed of high performance parallel platforms, simulation of optimized components can proceed. In this paper, specific applications of the electromagnetic modeling of infrared filtering, as well as heterostructure device design will be presented using genetic algorithm global optimization methods.

Cwik, Tom↗

Simple Models of the Spatial Distribution of Cloud Radiative Properties for Remote Sensing Studies

This project aimed to assess the degree to which estimates of three-dimensional cloud structure can be inferred from a time series of profiles obtained at a point. The work was motivated by the desire to understand the extent to which high-frequency profiles of the atmosphere (e.g. ARM data streams) can be used to assess the magnitude of non-plane parallel transfer of radiation in thc atmosphere. We accomplished this by performing an observing system simulation using a large-eddy simulation and a Monte Carlo radiative transfer model. We define the 3D effect as the part of the radiative transfer that isn't captured by one-dimensional radiative transfer calculations. We assess the magnitude of the 3D effect in small cumulus clouds by using a fine-scale cloud model to simulate many hours of cloudiness over a continental site. We then use a Monte Carlo radiative transfer model to compute the broadband shortwave fluxes at the surface twice, once using the complete three-dimensional radiative transfer F(sup 3D), and once using the ICA F (sup ICA); the difference between them is the 3D effect given.

Source record↗

Turbulent Aeroheating Testing of Mars Science Laboratory Entry Vehicle in Perfect-Gas Nitrogen

An experimental investigation of turbulent aeroheating on the Mars Science Laboratory entry vehicle heat shield has been conducted in the Arnold Engineering Development Center Hypervelocity Wind Tunnel No. 9. Testing was performed on a 6-in. (0.1524 m) diameter MSL model in pure N2 gas in the tunnel s Mach 8 and Mach 10 nozzles at free stream Reynolds numbers of 4.1x10(exp 6)/ft to 49x10(exp 6)/ft (1.3x10(exp 7)/m to 16x10(exp 7)/m) and 1.2x10(exp 6)/ft to 19x10(exp 6)/ft (0.39x10(exp 7)/m to 62x10(exp 7)/m), respectively. These conditions were sufficient to span the regime of boundary-layer flow from completely laminar to fully-developed turbulent flow over the entire forebody. A supporting aeroheating test was also conducted in the Langley Research Center 20-Inch Mach 6 Air Tunnel at free stream Reynolds number of 1x10(exp 6)/ft to 7x10(exp 6)/ft (0.36x10(exp 7)/m to 2.2x10(exp 7)/m) in order to help corroborate the Tunnel 9 results. A complementary computational fluid dynamics study was conducted in parallel to the wind tunnel testing. Laminar and turbulent predictions were generated for all wind tunnel test conditions and comparisons were performed with the data for the purpose of helping to define uncertainty margins on predictions for aeroheating environments during entry into the Martian atmosphere. Data from both wind tunnel tests and comparisons with the predictions are presented herein. It was concluded from these comparisons that for perfect-gas conditions, the computational tools could predict fully-laminar or fully-turbulent heating conditions to within 10% of the experimental data

Hollis, Brian R.↗

Turbulent Aeroheating Testing of Mars Science Laboratory Entry Vehicle

An experimental investigation of turbulent aeroheating on the Mars Science Laboratory entry vehicle heat shield has been conducted in the Arnold Engineering Development Center Hypervelocity Wind Tunnel No. 9. Testing was performed on a 6-in. (0.1524 m) diameter MSL model in pure N2 gas in the tunnel's Mach 8 and Mach 10 nozzles at free stream Reynolds numbers of 4.1 x 10(exp 6)/ft to 49 x 10(exp 6)/ft (1.3 x 10(exp 7)/m to 19 x 10(exp 6/ft) and 1.2 x 10(exp 6)/ft to 19 x 10(exp 6)/ft (0.39 x 10(exp 7)/m to 62 x 10(exp 7)/m), respectively. These conditions were sufficient to span the regime of boundary-layer flow from completely laminar to fully-developed turbulent flow over the entire forebody. A supporting aeroheating test was also conducted in the Langley Research Center 20-Inch Mach 6 Air Tunnel at free stream Reynolds number of 1 x 10(exp 6)/ft to 7 x 10(exp 6)/ft (0.36 x 10(exp 7)/m to 2.2 x 10(exp 7)/m) in order to help corroborate the Tunnel 9 results. A complementary computational fluid dynamics study was conducted in parallel to the wind tunnel testing. Laminar and turbulent predictions were generated for the wind tunnel test conditions and comparisons were performed with the data for the purpose of helping to define uncertainty margins on predictions for aeroheating environments during entry into the Martian atmosphere. Data from both wind tunnel tests and comparisons with the predictions are presented herein. It was concluded from these comparisons that for perfect-gas conditions, the computational tools could predict fully-laminar or fully-turbulent heating conditions to within 12% or better of the experimental data.

Hollis, Brian R.↗

A VLSI chip set for real time vector quantization of image sequences

The architecture and implementation of a VLSI chip set that vector quantizes (VQ) image sequences in real time is described. The chip set forms a programmable Single-Instruction, Multiple-Data (SIMD) machine which can implement various vector quantization encoding structures. Its VQ codebook may contain unlimited number of codevectors, N, having dimension up to K = 64. Under a weighted least squared error criterion, the engine locates at video rates the best code vector in full-searched or large tree searched VQ codebooks. The ability to manipulate tree structured codebooks, coupled with parallelism and pipelining, permits searches in as short as O (log N) cycles. A full codebook search results in O(N) performance, compared to O(KN) for a Single-Instruction, Single-Data (SISD) machine. With this VLSI chip set, an entire video code can be built on a single board that permits realtime experimentation with very large codebooks.

Baker, Richard L.↗

The high level trigger and express data production at STAR

To meet the demands of the Beam Energy Scan phase-II (BES-II) program, the STAR experiment at the Relativistic Heavy Ion Collider (RHIC) developed a dual real-time framework consisting of a High Level Trigger (HLT) and an Express Data Production system (xProduction). The HLT operates online within the Data Acquisition (DAQ) chain on a dedicated multi-core CPU cluster with the option to offload compute-intensive kernels to Xeon Phi coprocessors. It uses parallelized algorithms, such as the Cellular Automaton (CA) Track Finder, to perform rapid tracking, vertexing, and event filtering. This allows it to select events of interest in real time and provide immediate feedback on detector and beam conditions. In contrast, the xProduction workflow runs concurrently and independently of the DAQ loop. It applies near offline-quality calibration and reconstruction within hours of data collection. The xProduction input is the express data stream, whose content can be enriched by HLT trigger/priority selections under DAQ/HLT resource constraints, and it uses the STAR calibration/conditions framework, incorporating online calibration/QA information when available. This enables early preliminary physics analysis, including the reconstruction of rare signals, such as hyperons and hypernuclei. It also provides collaboration-wide access to analysis-ready datasets. Together, the HLT and xProduction systems form a complementary architecture: the HLT performs online event selection while the xProduction chain delivers high-quality results within a short amount of time. This integrated framework has enabled the prompt reconstruction of the $^5_Λ$ He hypernucleus with high statistical significance and the efficient processing of hundreds of millions of heavy-ion collision events. In conclusion, its demonstrated scalability and robustness establish a model for future high-luminosity experiments requiring both online event filtering and rapid access to analysis-quality data.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Exploring the Three-Dimensional Momentum Distribution of Longitudinally Polarized Quarks in the Proton

By analyzing experimental data on semi-inclusive deep inelastic scattering off longitudinally polarized targets, we extract the transverse momentum dependence of the quark helicity distribution, i.e., the difference between the three-dimensional motion of quarks with polarization parallel or antiparallel to the longitudinal polarization of the parent hadron. We perform the analysis at next-to-leading and next-to-next-to-leading perturbative accuracy. The quality of the fit is very good for both cases, reaching a χ 2 per number of data points equal to 1.11 and 1.09, respectively. Although the limited number of data points leads to significant uncertainties, the data are consistent with an interpretation in which the helicity distribution is narrower in transverse momentum than the unpolarized distribution. Published by the American Physical Society 2025

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Compile-time estimation of communication costs in multicomputers

An important problem facing numerous research projects on parallelizing compilers for distributed memory machines is that of automatically determining a suitable data partitioning scheme for a program. Any strategy for automatic data partitioning needs a mechanism for estimating the performance of a program under a given partitioning scheme, the most crucial part of which involves determining the communication costs incurred by the program. A methodology is described for estimating the communication costs at compile-time as functions of the numbers of processors over which various arrays are distributed. A strategy is described along with its theoretical basis, for making program transformations that expose opportunities for combining of messages, leading to considerable savings in the communication costs. For certain loops with regular dependences, the compiler can detect the possibility of pipelining, and thus estimate communication costs more accurately than it could otherwise. These results are of great significance to any parallelization system supporting numeric applications on multicomputers. In particular, they lay down a framework for effective synthesis of communication on multicomputers from sequential program references.

Gupta, Manish↗

Knowledge Oriented Graph Unified Transformer (KOGUT) v0.1

KOGUT — Knowledge Oriented Graph Unified Transformer KOGUT implements the Relational Graph Transformer (RelGT) architecture for knowledge graph link prediction in biological domains, with a primary focus on microbial growth media prediction. While the original RelGT (arXiv:2505.10960) targets relational tables, time series, and multi-table databases, KOGUT adapts this architecture for heterogeneous biological knowledge graphs, providing first-in-class AI predictive models for microbial cultivation. Key Adaptations Beyond Original RelGT: - Knowledge Graph Focus: Applied to biological KGs with semantic node types (taxa, chemicals, media, phenotypes, environments) versus generic relational database tables, trained on the KG-Microbe knowledge graph (1.3M entities, 2.9M edges, 24 relation types). - Multimodal Node Encoding: Integrates node labels, categories, descriptions, and synonyms from KG metadata through learned embedding layers—adapting relational column features to graph node attributes with textual semantics. - Extended K-Hop Subgraph Strategy: Optimized neighborhood sampling (3-hop default, configurable up to 200 nodes) tuned for sparse biological networks, building on the original local-global attention framework with biological relation preservation. - Biolink Predicate Preservation: Type-specific transformations for 24 biological edge semantics (occurs_in, consumes, produces, has_phenotype, subclass_of) beyond standard relational foreign keys, enabling multi-relation link prediction. - Inductive Learning Support: Enables zero-shot predictions for novel taxa through feature-based embeddings (temperature, oxygen requirements, gram stain, cell shape), extending the original transductive relational benchmark scope to uncultured microorganisms. CheapSOTA Performance Optimizations (This Distribution): - VQ-EMA Centroid Attention: Vector quantization with exponential moving average for improved global context modeling (+5-10% MRR improvement). - HDF5 Precomputed Data Loading: One-time preprocessing of k-hop subgraphs to eliminate redundant graph traversals (2-5× training speedup). - Distributed Data Parallel Training: Multi-GPU support for scaling to larger knowledge graphs (tested on 4× NVIDIA A100 GPUs at NERSC Perlmutter). - Mixed Precision Training: Automatic mixed precision (AMP) for memory efficiency and faster training. Advantages Over Standard Knowledge Graph Embedding Models: Combines RelGT's proven multi-element tokenization (features, type, hop, structure) with graph-native biological representations, enabling interpretable link prediction across heterogeneous entities that standard embedding models (TransE, RotatE, ComplEx) and table-based transformers cannot directly model. Achieves near-perfect performance on microbial growth media prediction (MRR: 0.9966, Precision@1: 0.9932, Hit@10: 1.0000) while maintaining explainability through attention-based reasoning over biological pathways. Training Data: - KG-Microbe merged knowledge graph: 1,379,337 nodes, 2,960,472 edges - 24 biological relation types including taxonomic hierarchies, metabolic interactions, phenotype associations, and environmental relationships - Primary prediction task: Growth media suitability for microbial taxa (biolink:occurs_in, 50K edges) - Multi-relation capability: Predicts links for any of the 24 relation types, including chemical consumption/production, phenotype associations, and taxonomic classification Citation: Original RelGT Architecture: Dwivedi et al., "Relational Graph Transformer", arXiv:2505.10960, 2025 KOGUT Implementation: Knowledge Oriented Graph Unified Transformer for Microbial Growth Media Prediction Developed at Lawrence Berkeley National Laboratory (LBNL) Trained on NERSC Perlmutter supercomputer

Joachimiak, Marcin [Lawrence Berkeley National Lab↗

Automatic Data Distribution for CFD Applications on Structured Grids

Development of HPF versions of NPB and ARC3D showed that HPF has potential to be a high level language for parallelization of CFD applications. The use of HPF requires an intimate knowledge of the applications and a detailed analysis of data affinity, data movement and data granularity. Since HPF hides data movement from the user even with this knowledge it is easy to overlook pieces of the code causing low performance of the application. In order to simplify and accelerate the task of developing HPF versions of existing CFD applications we have designed and partially implemented ADAPT (Automatic Data Distribution and Placement Tool). The ADAPT analyzes a CFD application working on a single structured grid and generates HPF TEMPLATE, (RE)DISTRIBUTION, ALIGNMENT and INDEPENDENT directives. The directives can be generated on the nest level, subroutine level, application level or inter application level. ADAPT is designed to annotate existing CFD FORTRAN application performing computations on single or multiple grids. On each grid the application can considered as a sequence of operators each applied to a set of variables defined in a particular grid domain. The operators can be classified as implicit, having data dependences, and explicit, without data dependences. In order to parallelize an explicit operator it is sufficient to create a template for the domain of the operator, align arrays used in the operator with the template, distribute the template, and declare the loops over the distributed dimensions as INDEPENDENT. In order to parallelize an implicit operator, the distribution of the operator's domain should be consistent with the operator's dependences. Any dependence between sections distributed on different processors would preclude parallelization if compiler does not have an ability to pipeline computations. If a data distribution is "orthogonal" to the dependences of an implicit operator then the loop which implements the operator can be declared as INDEPENDENT.

Frumkin, Michael↗

Controlling Infrastructure Costs: Right-Sizing the Mission Control Facility

Johnson Space Center's Mission Control Center is a space vehicle, space program agnostic facility. The current operational design is essentially identical to the original facility architecture that was developed and deployed in the mid-90's. In an effort to streamline the support costs of the mission critical facility, the Mission Operations Division (MOD) of Johnson Space Center (JSC) has sponsored an exploratory project to evaluate and inject current state-of-the-practice Information Technology (IT) tools, processes and technology into legacy operations. The general push in the IT industry has been trending towards a data-centric computer infrastructure for the past several years. Organizations facing challenges with facility operations costs are turning to creative solutions combining hardware consolidation, virtualization and remote access to meet and exceed performance, security, and availability requirements. The Operations Technology Facility (OTF) organization at the Johnson Space Center has been chartered to build and evaluate a parallel Mission Control infrastructure, replacing the existing, thick-client distributed computing model and network architecture with a data center model utilizing virtualization to provide the MCC Infrastructure as a Service. The OTF will design a replacement architecture for the Mission Control Facility, leveraging hardware consolidation through the use of blade servers, increasing utilization rates for compute platforms through virtualization while expanding connectivity options through the deployment of secure remote access. The architecture demonstrates the maturity of the technologies generally available in industry today and the ability to successfully abstract the tightly coupled relationship between thick-client software and legacy hardware into a hardware agnostic "Infrastructure as a Service" capability that can scale to meet future requirements of new space programs and spacecraft. This paper discusses the benefits and difficulties that a migration to cloud-based computing philosophies has uncovered when compared to the legacy Mission Control Center architecture. The team consists of system and software engineers with extensive experience with the MCC infrastructure and software currently used to support the International Space Station (ISS) and Space Shuttle program (SSP).

Martin, Keith↗

Evaluation of existing and proposed computer architectures for future ground-based systems

Parallel processing architectures and techniques used in current supercomputers are described and projections are made of future advances. Presently, the von Neumann sequential processing pattern has been accelerated by having separate I/O processors, interleaved memories, wide memories, independent functional units and pipelining. Recent supercomputers have featured single-input, multiple data stream architectures, which have different processors for performing various operations (vector or pipeline processors). Multiple input, multiple data stream machines have also been developed. Data flow techniques, wherein program instructions are activated only when data are available, are expected to play a large role in future supercomputers, along with increased parallel processor arrays. The enhanced operational speeds are essential for adequately treating data from future spacecraft remote sensing instruments such as the Thematic Mapper.

Schulbach, C.↗

Twelve Channel Optical Fiber Connector Assembly: From Commercial Off the Shelf to Space Flight Use

The commercial off the shelf (COTS) twelve channel optical fiber MTP array connector and ribbon cable assembly is being validated for space flight use and the results of this study to date are presented here. The interconnection system implemented for the Parallel Fiber Optic Data Bus (PFODB) physical layer will include a 100/140 micron diameter optical fiber in the cable configuration among other enhancements. As part of this investigation, the COTS 62.5/125 microns optical fiber cable assembly has been characterized for space environment performance as a baseline for improving the performance of the 100/140 micron diameter ribbon cable for the Parallel FODB application. Presented here are the testing and results of random vibration and thermal environmental characterization of this commercial off the shelf (COTS) MTP twelve channel ribbon cable assembly. This paper is the first in a series of papers which will characterize and document the performance of Parallel FODB's physical layer from COTS to space flight worthy.

Ott, Melaine N.↗

A Parallel Cartesian Approach for External Aerodynamics of Vehicles with Complex Geometry

This workshop paper presents the current status in the development of a new approach for the solution of the Euler equations on Cartesian meshes with embedded boundaries in three dimensions on distributed and shared memory architectures. The approach uses adaptively refined Cartesian hexahedra to fill the computational domain. Where these cells intersect the geometry, they are cut by the boundary into arbitrarily shaped polyhedra which receive special treatment by the solver. The presentation documents a newly developed multilevel upwind solver based on a flexible domain-decomposition strategy. One novel aspect of the work is its use of space-filling curves (SFC) for memory efficient on-the-fly parallelization, dynamic re-partitioning and automatic coarse mesh generation. Within each subdomain the approach employs a variety reordering techniques so that relevant data are on the same page in memory permitting high-performance on cache-based processors. Details of the on-the-fly SFC based partitioning are presented as are construction rules for the automatic coarse mesh generation. After describing the approach, the paper uses model problems and 3- D configurations to both verify and validate the solver. The model problems demonstrate that second-order accuracy is maintained despite the presence of the irregular cut-cells in the mesh. In addition, it examines both parallel efficiency and convergence behavior. These investigations demonstrate a parallel speed-up in excess of 28 on 32 processors of an SGI Origin 2000 system and confirm that mesh partitioning has no effect on convergence behavior.

Aftosmis, M. J.↗

A Parallelized Oxidation-Driven Surface Recession Framework in DSMC Code, SPARTA

Spacecrafts rely on ablative thermal protection systems (TPS) made of composites consisting of a carbon-based reinforcement and a polymeric matrix. These materials are designed to withstand high-temperature oxidation and surface recession during re-entry into the Earth's atmosphere. However, ablation occurs due to a complex interplay of thermal, mechanical, and chemical factors, making it challenging to determine the individual impact of each on the TPS's overall degradation. In this study, we have developed an ablation model that can leverage a finite rate carbon oxidation model to predict material recession and surface states more accurately. Stochastic PArallel Rarified-gas Time-accurate Analyzer (SPARTA), a direct-simulation Monte Carlo (DSMC) code, is modified to allow oxidation-driven ablation of implicitly defined carbon surfaces. In SPARTA, implicit surfaces are generated from the grid corner point values via a marching cubes algorithm, therefore creating a new set of surface elements every time ablation is performed. The finite-rate oxidation model developed by Gopalan et. al can perform both gas-surface and pure-surface reactions and is now adapted to tally surface data on a per grid cell basis. The ablation functionality was also adjusted so once the reactions have occurred, the number of reactions leading to CO formation can be converted to corner point reduction values; therefore, carbon removal is directly proportional to surface recession. We also briefly discuss some unique challenges associated with parallelizing this dynamic surface state and geometry. Finally, we analyze the performance of this parallelized implicit chemistry model with simple 2D and 3D benchmark cases by producing surface state statistics, area changes over time, and visualization across a range of surface temperatures and processors with and without load-balancing.

DSMC↗

Skylab task and work performance /Experiment M-151 - Time and motion study/

The primary objective of Experiment M151 was to study the inflight adaptation of Skylab crewmen to a variety of task situations involving different types of activity. A parallel objective was to examine astronaut inflight performance for any behavioral stress effects associated with the working and living conditions of the Skylab environment. Training data provided the basis for comparison of preflight and inflight performance. Efficiency was evaluated through the adaptation function, namely, the relation of performance time over task trials. The results indicate that the initial changeover from preflight to inflight was accompanied by a substantial increase in performance time for most work and task activities. Equally important was the finding that crewmen adjusted rapidly to the weightless environment and became proficient in developing techniques with which to optimize task performance. By the end of the second inflight trial, most of the activities were performed almost as efficiently as on the last preflight trial. The analysis demonstrated the sensitivity of the adaptation function to differences in task and hardware configurations. The function was found to be more regular and less variable inflight than preflight. Translation and control of masses were accomplished easily and efficiently through the rapid development of the arms and legs as subtle guidance and restraint systems.

Kubis, J. F.↗

Novel techniques for data decomposition and load balancing for parallel processing of vision systems: Implementation and evaluation using a motion estimation system

Computer vision systems employ a sequence of vision algorithms in which the output of an algorithm is the input of the next algorithm in the sequence. Algorithms that constitute such systems exhibit vastly different computational characteristics, and therefore, require different data decomposition techniques and efficient load balancing techniques for parallel implementation. However, since the input data for a task is produced as the output data of the previous task, this information can be exploited to perform knowledge based data decomposition and load balancing. Presented here are algorithms for a motion estimation system. The motion estimation is based on the point correspondence between the involved images which are a sequence of stereo image pairs. Researchers propose algorithms to obtain point correspondences by matching feature points among stereo image pairs at any two consecutive time instants. Furthermore, the proposed algorithms employ non-iterative procedures, which results in saving considerable amounts of computation time. The system consists of the following steps: (1) extraction of features; (2) stereo match of images in one time instant; (3) time match of images from consecutive time instants; (4) stereo match to compute final unambiguous points; and (5) computation of motion parameters.

Choudhary, Alok Nidhi↗

Parallel Finite Element Solution of 3D Rayleigh-Benard-Marangoni Flows

A domain decomposition strategy and parallel gradient-type iterative solution scheme have been developed and implemented for computation of complex 3D viscous flow problems involving heat transfer and surface tension effects. Details of the implementation issues are described together with associated performance and scalability studies. Representative Rayleigh-Benard and microgravity Marangoni flow calculations and performance results on the Cray T3D and T3E are presented. The work is currently being extended to tightly-coupled parallel "Beowulf-type" PC clusters and we present some preliminary performance results on this platform. We also describe progress on related work on hierarchic data extraction for visualization.

Carey, G. F.↗