Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Computational demand”

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 289 records · Page 16

CaloTrilogy: Toward a Breakthrough in One-Step, End-to-End, Physics-Guided Shower Generation for Modern Calorimeters

High-precision calorimeter simulation at current and future colliders imposes rapidly growing computational demands, motivating the development of machine-learning surrogates for traditional Monte Carlo tools such as Geant4. Flow matching and diffusion-based generative models have become leading approaches for high-dimensional fast simulation because of their sample quality, but typically require ${\cal O}(100)$ function evaluations at inference and often rely on auxiliary networks to constrain global observables, compromising streamlined end-to-end generation. We introduce a unified framework that improves the balance between speed, shower quality, and physics fidelity. The method combines: (i) an average velocity field integrator that enables sampling in one or a few evaluations; (ii) a learned generative prior in shower space, constructed from data rather than random noise; and (iii) physics-guided loss terms that impose inductive biases on key observables during training. These elements are training time regularizers, preserving end-to-end inference with no additional cost. With only one or a few evaluation steps, the model achieves shower quality competitive with state-of-the-art flow and diffusion approaches, tested on several public high granularity calorimeter datasets. The results demonstrate inter-layer shower structure consistent with the underlying physics, providing a strong candidate for future fast simulation workflows.

Jiang, Cheng [Edinburgh U.]↗

NASA’s Vision for Spaceflight Computing

Future NASA mission applications demand onboard computing performance, power efficiency, and flexibility not available from current products. To address these needs, NASA’s High Performance Spaceflight Computing (HPSC) project is developing a radiation hardened, general purpose multi-core processor. Key HPSC objectives include natural space radiation hardness, fault tolerance, computation performance and extensibility, and power scalability. This presentation will first highlight how advances in spaceflight computing are key to NASA’s envisioned future for advanced avionics. Descriptions will then be provided for NASA mission applications and use cases that demand advanced spaceflight computing. The presentation will then provide an overview of NASA’s HPSC project and how it will address the computational demands of future missions.

Wesley Powell↗

Dynamic remapping of parallel computations with varying resource demands

A large class of computational problems is characterized by frequent synchronization, and computational requirements which change as a function of time. When such a problem must be solved on a message passing multiprocessor machine, the combination of these characteristics lead to system performance which decreases in time. Performance can be improved with periodic redistribution of computational load; however, redistribution can exact a sometimes large delay cost. We study the issue of deciding when to invoke a global load remapping mechanism. Such a decision policy must effectively weigh the costs of remapping against the performance benefits. We treat this problem by constructing two analytic models which exhibit stochastically decreasing performance. One model is quite tractable; we are able to describe the optimal remapping algorithm, and the optimal decision policy governing when to invoke that algorithm. However, computational complexity prohibits the use of the optimal remapping decision policy. We then study the performance of a general remapping policy on both analytic models. This policy attempts to minimize a statistic W(n) which measures the system degradation (including the cost of remapping) per computation step over a period of n steps. We show that as a function of time, the expected value of W(n) has at most one minimum, and that when this minimum exists it defines the optimal fixed-interval remapping policy. Our decision policy appeals to this result by remapping when it estimates that W(n) is minimized. Our performance data suggests that this policy effectively finds the natural frequency of remapping. We also use the analytic models to express the relationship between performance and remapping cost, number of processors, and the computation's stochastic activity.

Nicol, D. M.↗

The Need for Optical Means as an Alternative for Electronic Computing

An increasing demand for faster computers is rapidly growing to encounter the fast growing rate of Internet, space communication, and robotic industry. Unfortunately, the Very Large Scale Integration technology is approaching its fundamental limits beyond which the device will be unreliable. Optical interconnections and optical integrated circuits are strongly believed to provide the way out of the extreme limitations imposed on the growth of speed and complexity of nowadays computations by conventional electronics. This paper demonstrates two ultra-fast, all-optical logic gates and a high-density storage medium, which are essential components in building the future optical computer.

Adbeldayem, Hossin↗

Overview on Basis and Use of Performance Prediction Methods

The lecture outlines the basic methods of component matching which are central to the prediction of gas turbine performance. Steady state prediction of off-design performance must be done at the beginning of an engine development program, to ensure that the engine can satisfy all the mission requirements. The matching techniques can be extended to predict transient performance, which is essential for controls development and to ensure good engine handling. The large amount of computation required demands the use of computer modelling and the role of modelling in the development program and the basic requirements for performance modelling are described.

H I H Saravanamuttoo↗

Implementation of Multispectral Image Classification on a Remote Adaptive Computer

As the demand for higher performance computers for the processing of remote sensing science algorithms increases, the need to investigate new computing paradigms its justified. Field Programmable Gate Arrays enable the implementation of algorithms at the hardware gate level, leading to orders of m a,gnitude performance increase over microprocessor based systems. The automatic classification of spaceborne multispectral images is an example of a computation intensive application, that, can benefit from implementation on an FPGA - based custom computing machine (adaptive or reconfigurable computer). A probabilistic neural network is used here to classify pixels of of a multispectral LANDSAT-2 image. The implementation described utilizes Java client/server application programs to access the adaptive computer from a remote site. Results verify that a remote hardware version of the algorithm (implemented on an adaptive computer) is significantly faster than a local software version of the same algorithm implemented on a typical general - purpose computer).

Figueiredo, Marco A.↗

Fluid learning: Mimicking brain computing with neuromorphic nanofluidic devices

Relentlessly rising energy demands in computing call for rethinking hardware paradigms with energy efficiency in mind. Nature’s example—the brain—raises the question: How can these natural computers achieve remarkable feats with minimal energy compared to supercomputers? Neuromorphic computing mimics the brain’s principles, but current neuromorphic concepts using electronic components face scalability and their own power consumption challenges. A potentially revolutionary approach is emerging: computing with ion transport in water through nanochannels. This field offers energy-efficient possibilities by imitating brain-like information processing with different types of ions as carriers. Finally, the goal is to converge advanced nanoscale architectures with brain-inspired efficiency, heralding a new era of computing.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

Remote Sensing of Snow Fields from Earth Satellites

Considerable effort has gone into snow line delineation using available satellite data. Furthermore, increasing emphasis is being put on automated extraction of such information and generation of a useable product for hydrologists. Implications are clear that the impact from future satellite and sensors systems will create an increased demand for computer processing before the data can be used by the hydrologist. If the coarse-resolution, broad spectral band data available from current satellites already create a demand by hydrologists for computer processing of the data, it is obvious there will be an even greater demand for computer analysis and evaluation when the future ERTS data become available.

Baker, D. R.↗

Dynamic remapping of parallel computations with varying resource demands

The issue of deciding when to invoke a global load remapping mechanism is studied. Such a decision policy must effectively weigh the costs of remapping against the performance benefits, and should be general enough to apply automatically to a wide range of computations. The authors propose a general mapping decision heuristic, then study its effectiveness and its anticipated behavior on two very different models of load evolution. Assuming only that the remapping cost is known, this policy dynamically minimizes system degradation (including the cost of remapping) for each computation step. This policy is quite simple, choosing to remap when the first local minimum in the degradation function is detected. Simulations show that the decision obtained provides significantly better performance than that achieved by never remapping. The authors also observe that the average intermapping frequency is quite close to the optimal fixed remapping frequency.

Nicol, David M.↗

Gigaflop architecture, a hardware perspective

Any super computer built in the early 1980s will use components that are available by fall 1978. The architecture of such a system cannot depart radically from current super computers if the software experience painfully acquired from these computers in the 70's is to apply. Given the above constraints, 10 billion floating point operations per second (BFLOPS) are attainable and a problem memory of 512 million (64 bit) words could be supported by the technology of the time. In contrast to this, industry is likely to respond with commercially available machines with a performance of less than 150 MFLOPS. This is due to self-imposed constraints on the manufacturers to provide upward compatible architectures (same instruction set) and systems which can be sold in significant volumes. Since this computing speed is inadequate to meet the demands of computational fluid dynamics, a special processor is required. Issues which are felt to be significant in the pursuit of maximum compute capability in this special processor are discussed.

Feierbach, G. F.↗

Reliability models for dataflow computer systems

The demands for concurrent operation within a computer system and the representation of parallelism in programming languages have yielded a new form of program representation known as data flow (DENN 74, DENN 75, TREL 82a). A new model based on data flow principles for parallel computations and parallel computer systems is presented. Necessary conditions for liveness and deadlock freeness in data flow graphs are derived. The data flow graph is used as a model to represent asynchronous concurrent computer architectures including data flow computers.

Kavi, K. M.↗

A Visual Analytics Framework for Reviewing Streaming Performance Data

Understanding and tuning the performance of extreme-scale parallel computing systems demands a streaming approach due to the computational cost of applying offline algorithms to vast amounts of performance log data. Analyzing large streaming data is challenging because the rate of receiving data and limited time to comprehend data make it difficult for the analysts to sufficiently examine the data without missing important changes or patterns. To support streaming data analysis, we introduce a visual analytic framework comprising of three modules: data management, analysis, and interactive visualization. The data management module collects various computing and communication performance metrics from the monitored system using streaming data processing techniques and feeds the data to the other two modules. The analysis module automatically identifies important changes and patterns at the required latency. In particular, we introduce a set of online and progressive analysis methods for not only controlling the computational costs but also helping analysts better follow the critical aspects of the analysis results. Finally, the interactive visualization module provides the analysts with a coherent view of the changes and patterns in the continuously captured performance data. Through a multi-faceted case study on performance analysis of parallel discrete-event simulation, we demonstrate the effectiveness of our framework for identifying bottlenecks and locating outliers.

Human-centered computing↗

Computer program documentation: ODRC demand plotting program user's guide

The Orbital Data Reduction Center (ODRC) Demand Plotting Program provides the user with three main options, each of which provides the additional option of generating a numerical summary and/or plots for the Measurement ID's (MID) on the Measurement Node Correlation (MNC) list. Option one reads MID data from word addressable ODRC files, stores the data on a temporary file, and uses it to build the numerical summary and/or plots, according to user input instructions. Options two and three read MID data from a word addressable ODRC file and component node data from a word addressable HSTFLO or HISTRY file. The component node data is used to calculate a predicted MID. Then, for option two, the MID and predicted MID data is used to generate a numerical summary and/or plots. For option three, the component node data itself is used in generating the numerical summary and/or plots. The numerical summary is sent to the BRKPT file, RELOCOK, and can be viewed after the execution of the program using the edit mode to find the desired section of the summary.

Damico, S. J.↗

Lightweight Metal Stamping Optimization Enabled by Artificial Intelligence

Successfully manufacturing an automotive body structure made via the sheet metal stamping process depends upon simultaneous consideration of component design, tooling design, stamping process control, and material properties. In many cases, introducing lightweight sheet materials (e.g., aluminum alloys, magnesium alloys, advanced high strength steels) holds the potential to significantly reduce vehicle weight, but challenges the stamping process by introducing materials with inherently less ductility. Successful and repeatable applications require co-developing the stamping process controls with the varying material properties, including formability. During the stamping process, as soon as the forming limit of the sheet is exceeded, the material shows localized necking which quickly leads to splits. Controlling process variability to avoid these material splits will enable deployment of less formable, lighter, and stronger materials for stamped automotive components. A typical optimization procedure for manufacturing requires an iterative process involving parameter setting, execution of computational simulations, and modifying the parameters. The entire process demands substantial computational time, making it impractical for real-time feedback towards rapid corrective actions required for in-line control for running production processes. To overcome this challenge, artificial intelligence (AI) can be leveraged to determine optimal manufacturing parameters within a single manufacturing cycle time. This research proposes an in-line optimization framework incorporating a trained AI model to predict kidney-shaped die forming. Preliminary results indicate that the AI framework can accurately predict draw-in values based on a given parameter set, a process referred to as forward prediction. Furthermore, the AI framework can also predict the optimal parameter set that leads to the desired draw-in values, referred to as inverse optimization (or backward prediction). This research has been performed in collaborations with USCAR (US Council for Automotive Research) and AutoForm. The members of USCAR are Ford, GM, and Stellantis.

36 MATERIALS SCIENCE↗

Computational Basis for On-Demand Production of Diversified Therapeutic Phage Cocktails

New therapies are necessary to combat increasingly antibiotic-resistant bacterial pathogens. We have developed a technology platform of computational, molecular biology, and microbiology tools which together enable on-demand production of phages that target virtually any given bacterial isolate. Two complementary computational tools that identify and precisely map prophages and other integrative genetic elements in bacterial genomes are used to identify prophage-laden bacteria that are close relatives of the target strain. Phage genomes are engineered to disable lysogeny, through use of long amplicon PCR and Gibson assembly. Finally, the engineered phage genomes are introduced into host bacteria for phage production. As an initial demonstration, we used this approach to produce a phage cocktail against the opportunistic pathogen Pseudomonas aeruginosa PAO1. Two prophageladen P. aeruginosa strains closely related to PAO1 were identified, ATCC 39324 and ATCC 27853. Deep sequencing revealed that mitomycin C treatment of these strains induced seven phages that grow on P. aeruginosa PAO1. The most diverse five phages were engineered for nonlysogeny by deleting the integrase gene (int), which is readily identifiable and typically conveniently located at one end of the prophage. The Δint phages, individually and in cocktails, killed P. aeruginosa PAO1 in liquid culture as well as in a waxworm (Galleria mellonella) model of infection.

59 BASIC BIOLOGICAL SCIENCES↗