Search NASA⌕ Search

SEARCH · Search NASA

Results for “Computational optimization”

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 649 records · Page 36

Accelerating matrix-centric graph processing on GPUs through bit-level optimizations

Even though it is well known that binary values are common in graph applications (e.g., adjacency matrix), how to leverage the phenomenon for efficiency has not yet been adequately explored. This paper presents a systematic study on how to unlock the potential of the bit-level optimizations of graph computations that involve binary values. It proposes a two-level representation named Bit-Block Compressed Sparse Row (B2SR) and presents a series of optimizations to the graph operations on B2SR by the intrinsics of modern GPUs. It additionally introduces Deep Reinforcement Learning (DRL) as an efficient way to best configure the bit-level optimizations on the fly. Additionally, the DQN-based adaptive tile size selector with dedicated model training can reach 68% prediction accuracy. Evaluations on NVIDIA Pascal and Volta GPUs show that the optimizations bring up to 40× and 6555× for essential GraphBLAS kernels SpMV and SpGEMM, respectively, making GraphBLAS-based BFS accelerate up to 433×, SSSP, PR, and CC up to 35×, and TC up to 52×.

79 ASTRONOMY AND ASTROPHYSICS↗

Multi-GPU implementation of a VMAT treatment plan optimization algorithm

Purpose: Volumetric modulated arc therapy (VMAT) optimization is a computationally challenging problem due to its large data size, high degrees of freedom, and many hardware constraints. High-performance graphics processing units (GPUs) have been used to speed up the computations. However, GPU’s relatively small memory size cannot handle cases with a large dose-deposition coefficient (DDC) matrix in cases of, e.g., those with a large target size, multiple targets, multiple arcs, and/or small beamlet size. The main purpose of this paper is to report an implementation of a column-generation-based VMAT algorithm, previously developed in the authors’ group, on a multi-GPU platform to solve the memory limitation problem. While the column-generation-based VMAT algorithm has been previously developed, the GPU implementation details have not been reported. Hence, another purpose is to present detailed techniques employed for GPU implementation. The authors also would like to utilize this particular problem as an example problem to study the feasibility of using a multi-GPU platform to solve large-scale problems in medical physics. Methods: The column-generation approach generates VMAT apertures sequentially by solving a pricing problem (PP) and a master problem (MP) iteratively. In the authors’ method, the sparse DDC matrix is first stored on a CPU in coordinate list format (COO). On the GPU side, this matrix is split into four submatrices according to beam angles, which are stored on four GPUs in compressed sparse row format. Computation of beamlet price, the first step in PP, is accomplished using multi-GPUs. A fast inter-GPU data transfer scheme is accomplished using peer-to-peer access. The remaining steps of PP and MP problems are implemented on CPU or a single GPU due to their modest problem scale and computational loads. Barzilai and Borwein algorithm with a subspace step scheme is adopted here to solve the MP problem. A head and neck (H and N) cancer case is then used to validate the authors’ method. The authors also compare their multi-GPU implementation with three different single GPU implementation strategies, i.e., truncating DDC matrix (S1), repeatedly transferring DDC matrix between CPU and GPU (S2), and porting computations involving DDC matrix to CPU (S3), in terms of both plan quality and computational efficiency. Two more H and N patient cases and three prostate cases are used to demonstrate the advantages of the authors’ method. Results: The authors’ multi-GPU implementation can finish the optimization process within ∼1 min for the H and N patient case. S1 leads to an inferior plan quality although its total time was 10 s shorter than the multi-GPU implementation due to the reduced matrix size. S2 and S3 yield the same plan quality as the multi-GPU implementation but take ∼4 and ∼6 min, respectively. High computational efficiency was consistently achieved for the other five patient cases tested, with VMAT plans of clinically acceptable quality obtained within 23–46 s. Conversely, to obtain clinically comparable or acceptable plans for all six of these VMAT cases that the authors have tested in this paper, the optimization time needed in a commercial TPS system on CPU was found to be in an order of several minutes. Conclusions: The results demonstrate that the multi-GPU implementation of the authors’ column-generation-based VMAT optimization can handle the large-scale VMAT optimization problem efficiently without sacrificing plan quality. The authors’ study may serve as an example to shed some light on other large-scale medical physics problems that require multi-GPU techniques.

60 APPLIED LIFE SCIENCES↗

TORCH Computational Reference Kernels - A Testbed for Computer Science Research

For decades, computer scientists have sought guidance on how to evolve architectures, languages, and programming models in order to improve application performance, efficiency, and productivity. Unfortunately, without overarching advice about future directions in these areas, individual guidance is inferred from the existing software/hardware ecosystem, and each discipline often conducts their research independently assuming all other technologies remain fixed. In today's rapidly evolving world of on-chip parallelism, isolated and iterative improvements to performance may miss superior solutions in the same way gradient descent optimization techniques may get stuck in local minima. To combat this, we present TORCH: A Testbed for Optimization ResearCH. These computational reference kernels define the core problems of interest in scientific computing without mandating a specific language, algorithm, programming model, or implementation. To compliment the kernel (problem) definitions, we provide a set of algorithmically-expressed verification tests that can be used to verify a hardware/software co-designed solution produces an acceptable answer. Finally, to provide some illumination as to how researchers have implemented solutions to these problems in the past, we provide a set of reference implementations in C and MATLAB.

97 MATHEMATICS AND COMPUTING↗

Neural network accelerator for quantum control

Efficient quantum control is necessary for practical quantum computing implementations with current technologies. Conventional algorithms for determining optimal control parameters are computationally expensive, largely excluding them from use outside of the simulation. Existing hardware solutions structured as lookup tables are imprecise and costly. By designing a machine learning model to approximate the results of traditional tools, a more efficient method can be produced. Such a model can then be synthesized into a hardware accelerator for use in quantum systems. In this study, we demonstrate a machine learning algorithm for predicting optimal pulse parameters. This algorithm is lightweight enough to fit on a low-resource FPGA and perform inference with a latency of 175 ns and pipeline interval of 5 ns with > 0.99 gate fidelity. In the long term, such an accelerator could be used near quantum computing hardware where traditional computers cannot operate, enabling quantum control at a reasonable cost at low latencies without incurring large data bandwidths outside of the cryogenic environment.

43 PARTICLE ACCELERATORS↗

Deliver Signal Phase and Timing (SPAT) for Energy Optimization of Vehicle Cohort Via Cloud-Computing and LTE Communications

Predictive Signal Phase and Timing (SPAT) message set is one fundamental building block for vehicle-to-infrastructure (V2I) applications such as Eco-Approach and Departure (EAD) at traffic signal controlled urban intersections. Among the two complementary communication methods namely short-range sidelink (PC5) and long-range cellular radio link (Uu), this paper documents the work with long-range link: the complete data chain includes connecting to the traffic signals via existing backhaul communication network, collecting the raw signal phase state data, predicting the signal state changes and delivering the SPAT data via a geofenced service to requests over HTTP protocols. An Application Programming Interface (API) library is developed to support various cellular data transmission reduction and latency improvement techniques. An emulation-based algorithm is applied to predict the traffic signal state changes to provide adequate prediction horizon (e.g., at minimum 2 minutes) for the cohort energy optimization. In fact, the same connectivity and SPAT delivery methodology has been applied to traffic signalized intersections nationwide in the United States upon public agency approvals for access to their firewalled traffic control network and signal control systems or directly to individual controllers. This methodology proves its effectiveness and potential for rapid growth of such SPAT deliveries at mass production scale without needing infrastructure hardware retrofit or excessive communication means. To support the energy optimization of light and heavy-duty vehicle cohorts of mixed automation and propulsion systems (EV, ICE and hybrid), the connection and SPAT deliveries at two sites were completed, including public roads in Washtenaw County, Michigan and closed track test sites at American Center for Mobility (ACM) in Ypsilanti, Michigan. However, only closed test track results at ACM will be presented in this paper. A neuroevolution based optimizer is developed and implemented to control the speed of a vehicle cohort with different propulsion systems and automation levels. Closed track tests showed significant energy savings of the cohort operation.

99 GENERAL AND MISCELLANEOUS↗

Alchemy: A Model-Based Approach for 2D to 3D Autonomous Nuclear System Design

Engineering design of nuclear power plant (NPP) piping and equipment systems frequently bypasses crucial 2D system planning, instead moving straight to 3D modeling. This often leads to designs that exceed building envelope constraints, forcing expensive and time-consuming redesigns. When 2D modeling is employed, it typically involves labor-intensive manual workflows that convert 2D drawings into 3D models, resulting in inefficiencies and errors across design iterations. These workflows further suffer from poor software interoperability and dependence on proprietary software ecosystems, thereby contributing to schedule delays and cost overruns. This paper presents Alchemy, an autonomous framework that transforms 2D system definitions into Industry Foundation Classes (IFC)-compliant 3D building information models (BIMs) for expediting nuclear facility design at the conceptual preliminary phase. Using a model-based approach, the framework treats the 2D system diagram as the central reference model employed to automatically generate all subsequent outputs, ensuring consistency between the system definition and the resulting physical design. A web-based interface enables engineers to define hierarchical system topologies including associated equipment, geometric properties, and connectivity requirements. A two-phase equipment layout optimization algorithm automatically computes collision-free spatial configurations within predefined building envelopes. An artificial intelligence (AI)-assisted pipe routing module then generates orthogonal, collision-free routing paths, allowing the user to select either an A* search-based method or an Ant Colony Optimization (ACO)-based method. All outputs are authored natively in IFC format, relying on open-source technologies and standardized formats in order to ensure extensibility and eliminate proprietary software dependencies. The proposed framework is validated on two representative pressurized-water reactor (PWR)-based case studies, for which it autonomously generates IFC-compliant 3D models in minutes, drastically reducing workflows that typically require hours of manual effort. The generated model demonstrates topologically correct equipment placement, physically plausible spatial relationships, and collision-free pipe routing consistent with known PWR loop configurations. This work represents a foundational step toward digital engineering for nuclear facility preliminary design, with future ongoing development targeting design code compliance and expanded system complexity.

97 - MATHEMATICS AND COMPUTING↗

Entropy distance: New quantum phenomena

We study a curve of Gibbsian families of complex 3 Multiplication-Sign 3-matrices and point out new features, absent in commutative finite-dimensional algebras: a discontinuous maximum-entropy inference, a discontinuous entropy distance, and non-exposed faces of the mean value set. We analyze these problems from various aspects including convex geometry, topology, and information geometry. This research is motivated by a theory of infomax principles, where we contribute by computing first order optimality conditions of the entropy distance.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

High Performance Descriptive Semantic Analysis of Semantic Graph Databases

As semantic graph database technology grows to address components ranging from extant large triple stores to SPARQL endpoints over SQL-structured relational databases, it will become increasingly important to be able to understand their inherent semantic structure, whether codified in explicit ontologies or not. Our group is researching novel methods for what we call descriptive semantic analysis of RDF triplestores, to serve purposes of analysis, interpretation, visualization, and optimization. But data size and computational complexity makes it increasingly necessary to bring high performance computational resources to bear on this task. Our research group built a novel high performance hybrid system comprising computational capability for semantic graph database processing utilizing the large multi-threaded architecture of the Cray XMT platform, conventional servers, and large data stores. In this paper we describe that architecture and our methods, and present the results of our analyses of basic properties, connected components, namespace interaction, and typed paths such for the Billion Triple Challenge 2010 dataset.

99 GENERAL AND MISCELLANEOUS↗

Measure This, Not That: Pareto Optimal Trade-Offs between Model-Based Information Content and Measurements Cost

The slides present a novel convex optimization formulation to compute the best set of measurements for multi-response dynamical systems with asynchronous time steps that maximize the Fisher information content subject to budget constraints. The trace (A-optimality) or determinant (D-optimality) of the Fisher Information Matrix (FIM) quantifies the information content. The framework supports arbitrary (positive semi-definite) variance and covariances between every pair of responses and their time steps.

Wang, Jialu↗

Modeling, analysis, and optimization of complex nuclear processes and facilities via computational methods: The HALEU process case study

Improving and adapting industrial systems to timely meet changing programmatic and market demands is an important goal to achieve, including when operating and maintaining complex nuclear processes and facilities. However, changes to these complex systems are costly, particularly when they are already in place and bounded to stringent requirements and constraints such as when handling radioactive material and contaminated equipment. These conditions often exist when treating spent nuclear fuel remotely within shielded nuclear radiation chambers, commonly referred as hot cells, to condition nuclear material and/or fabricate products for utilization in other nuclear enterprises such as in the manufacture of advanced nuclear fuel. The illustrative case considered here is the production of high assay low enriched uranium (HALEU) products supporting the deployment of advanced nuclear reactors. For the HALEU program, resources invested were and are being systematically analyzed so that these investments are maximized in a facility that is nearly 60 years old. A methodology that has effectively enabled optimized and improvements in the Spent Fuel Treatment (SFT) program, and consequently the HALEU program, involves discrete event simulation as addressed in this article. Here, the quantification of multiple productivity metrics, including material processing rates, cycle times, bottlenecks, number of material transfers as well as equipment, workstation, and material handling utilization, has resulted in a myriad of diverse discoveries and data-informed decisions regarding process layout and constituent, labor levels and schedules, selection of new process units, storage needs, and other critical process configurations. This article describes such a computational capability being applied for decision-making, illustrates its application to an actual process and program, provides illustrative results, and argues how computational methods for the modeling, analysis, and optimization of complex processes and facilities does lead to informed decisions derived from data and not only from intuition.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Constant-Envelope Waveform Design for Optimal Target-Detection and Autocorrelation Performances

We propose an algorithm to directly synthesize in time-domain a constant-envelope transmit waveform that achieves the optimal performance in detecting an extended target in the presence of signal-dependent interference. This approach is in contrast to the traditional indirect methods that synthesize the transmit signal following the computation of the optimal energy spectral density. Additionally, we aim to maintain a good autocorrelation property of the designed signal. Therefore, our waveform design technique solves a bi-objective optimization problem in order to simultaneously improve the detection and autocorrelation performances, which are in general conflicting in nature. We demonstrate this compromising characteristics of the detection and autocorrelation performances with numerical examples. Furthermore, in the absence of the autocorrelation criterion, our designed signal is shown to achieve a near-optimum detection performance.

Sen, Satyabrata↗

An evaluation of parallel optimization for OpenSolaris Network Stack

Computing is now shifting towards multiprocessing. The fundamental goal of multiprocessing is improved performance through the introduction of additional hardware threads or cores (referred to as 'cores' for simplicity). Modern network stacks can exploit parallel cores to allow either message-based parallelism or connection-based parallelism as a means to enhance performance. OpenSolaris has redesigned and parallelized to better utilize additional cores. Three special technologies, named Softring Set, Soft ring and Squeue are introduced in OpenSolaris for stack parallelization. In this paper, we study the OpenSolaris packet receiving process and its core parallelism optimization techniques. Experiment results show that these techniques allow OpenSolaris to achieve better network I/O performance in multiprocessing environments; however, network stack parallelization has also brought extra overheads for system. An effective and efficient network I/O optimization in multiprocessing environments is required to cross all levers of the network stack from network interface to application.

99 GENERAL AND MISCELLANEOUS↗

Optimizing multigrid reduction-in-time and Parareal coarse-grid operators for linear advection

Parallel-in-time methods, such as multigrid reduction-in-time (MGRIT) and Parareal, provide an attractive option for increasing concurrency when simulating time-dependent partial differential equations (PDEs) in modern high-performance computing environments. While these techniques have been very successful for parabolic equations, it has often been observed that their performance suffers dramatically when applied to advection-dominated problems or purely hyperbolic PDEs using standard rediscretization approaches on coarse grids. In this paper, we apply MGRIT or Parareal to the constant-coefficient linear advection equation, appealing to existing convergence theory to provide insight into the typically nonscalable or even divergent behavior of these solvers for this problem. To overcome these failings, we replace rediscretization on coarse grids with improved coarse-grid operators that are computed by applying optimization techniques to approximately minimize error estimates from the convergence theory. Therefore, one of our main findings is that, in order to obtain fast convergence as for parabolic problems, coarse-grid operators should take into account the behavior of the hyperbolic problem by tracking the characteristic curves. Our approach is tested for schemes of various orders using explicit or implicit Runge–Kutta methods combined with upwind-finite-difference spatial discretizations. In all cases, we obtain scalable convergence in just a handful of iterations, with parallel tests also showing significant speed-ups over sequential time-stepping.

97 MATHEMATICS AND COMPUTING↗

Preliminary study of auto-differentiation algorithm in beam dynamics with stochastic process

Modern particle accelerator optimization requires sophisticated computational methods to address the inherently stochastic nature of beam dynamics. This research develops a framework applying AD to SDEs that specifically addresses beam dynamics challenges in particle accelerators, focusing on accurately modeling and optimizing beam behavior in regimes dominated by stochastic processes. By incorporating key physical phenomena such as synchrotron radiation, wakefield effects, and quantum excitation, the framework aims to provide auto differentiation on the figure of merit of the phase space evolution and beam dynamics. The methodology will enable effective optimization method in a dynamic system with stochastic process.

Accelerator Physics↗

High-throughput cancer hypothesis testing with an integrated PhysiCell-EMEWS workflow

BackgroundCancer is a complex, multiscale dynamical system, with interactions between tumor cells and non-cancerous host systems. Therapies act on this combined cancer-host system, sometimes with unexpected results. Systematic investigation of mechanistic computational models can augment traditional laboratory and clinical studies, helping identify the factors driving a treatment's success or failure. However, given the uncertainties regarding the underlying biology, these multiscale computational models can take many potential forms, in addition to encompassing high-dimensional parameter spaces. Therefore, the exploration of these models is computationally challenging. We propose that integrating two existing technologiesone to aid the construction of multiscale agent-based models, the other developed to enhance model exploration and optimizationcan provide a computational means for high-throughput hypothesis testing, and eventually, optimization.ResultsIn this paper, we introduce a high throughput computing (HTC) framework that integrates a mechanistic 3-D multicellular simulator (PhysiCell) with an extreme-scale model exploration platform (EMEWS) to investigate high-dimensional parameter spaces. We show early results in applying PhysiCell-EMEWS to 3-D cancer immunotherapy and show insights on therapeutic failure. We describe a generalized PhysiCell-EMEWS workflow for high-throughput cancer hypothesis testing, where hundreds or thousands of mechanistic simulations are compared against data-driven error metrics to perform hypothesis optimization.ConclusionsWhile key notational and computational challenges remain, mechanistic agent-based models and high-throughput model exploration environments can be combined to systematically and rapidly explore key problems in cancer. These high-throughput computational experiments can improve our understanding of the underlying biology, drive future experiments, and ultimately inform clinical practice.

Agent-based model↗

Real-Time and Adaptive Reservoir Computing With Application to Profile Prediction in Fusion Plasma

Nuclear fusion is a promising alternative to address the problem of sustainable energy production. The tokamak is an approach to fusion based on magnetic plasma confinement, constituting a complex physical system with many control challenges. Here we study the characteristics and optimization of reservoir computing (RC) for real-time and adaptive prediction of plasma profiles in the DIII-D tokamak. Our experiments demonstrate that RC achieves comparable results to state-of-the-art (deep) convolutional neural networks (CNNs) and long short-term memory (LSTM) models, with a significantly easier and faster training procedure. This efficient approach allows for fast and frequent adaptation of the model to new situations, such as changing plasma conditions or different fusion devices.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Characterization of the mean flow field in the far wake region behind ocean current turbines

Herein this paper forms, optimizes, and evaluates three numerical approaches for characterizing mean velocities in far wake region behind ocean current turbines. These approaches are derived from wake models originally developed for wind turbines and are referred here as the Larsen/Larsen, Larsen/Ainslie, and Jensen/Ainslie approaches based on the researchers originally credited with developing the expressions for dependence of the mean wake velocity on centerline and/or radial locations. The numerical coefficients utilized by these approaches are optimized to best match Computational fluid dynamics (CFD) generated wake velocity data. After optimizing the coefficients, this study finds that the Larsen/Ainslie and Jensen/Ainslie approaches best match the CFD generated flow data, with Larsen/Ainslie being the best match for an ambient turbulence intensity (TI) of 3% and Jensen/Ainslie being the best match for TIs of 6 and 9%.

16 TIDAL AND WAVE POWER↗