Search NASA⌕ Search

SEARCH · Search NASA

Results for “Parallel 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 1,351 records · Page 75

Multiobjective optimization of hybrid regenerative life support technologies. Topic D: Technology Assessment

We developed simple mathematical models for many of the technologies constituting the water reclamation system in a space station. These models were employed for subsystem optimization and for the evaluation of the performance of individual water reclamation technologies, by quantifying their operational 'cost' as a linear function of weight, volume, and power consumption. Then we performed preliminary investigations on the performance improvements attainable by simple hybrid systems involving parallel combinations of technologies. We are developing a software tool for synthesizing a hybrid water recovery system (WRS) for long term space missions. As conceptual framework, we are employing the state space approach. Given a number of available technologies and the mission specifications, the state space approach would help design flowsheets featuring optimal process configurations, including those that feature stream connections in parallel, series, or recycles. We visualize this software tool to function as follows: given the mission duration, the crew size, water quality specifications, and the cost coefficients, the software will synthesize a water recovery system for the space station. It should require minimal user intervention. The following tasks need to be solved for achieving this goal: (1) formulate a problem statement that will be used to evaluate the advantages of a hybrid WRS over a single technology WBS; (2) model several WRS technologies that can be employed in the space station; (3) propose a recycling network design methodology (since the WRS synthesis task is a recycling network design problem, it is essential to employ a systematic method in synthesizing this network); (4) develop a software implementation for this design methodology, design a hybrid system using this software, and compare the resulting WRS with a base-case WRS; and (5) create a user-friendly interface for this software tool.

Manousiouthakis, Vasilios↗

Fundamental and HOM Coupler Design for the Superconducting Parallel-Bar Cavity

The superconducting parallel-bar cavity is currently being considered as a deflecting system for the Jefferson Lab 12 GeV upgrade and as a crabbing cavity for a possible LHC luminosity upgrade. Currently the designs are optimized to achieve lower surface fields within the dimensional constraints for the above applications. A detailed analysis of the fundamental input power coupler design for the parallel-bar cavity is performed considering beam loading and the effects of microphonics. For higher beam loading the damping of the HOMs is vital to reduce beam instabilities generated due to the wake fields. An analysis of threshold impedances for each application and impedances of the modes that requires damping are presented in this paper with the design of HOM couplers.

43 PARTICLE ACCELERATORS↗

On the Use of CAD and Cartesian Methods for Aerodynamic Optimization

The objective for this paper is to present the development of an optimization capability for Curt3D, a Cartesian inviscid-flow analysis package. We present the construction of a new optimization framework and we focus on the following issues: 1) Component-based geometry parameterization approach using parametric-CAD models and CAPRI. A novel geometry server is introduced that addresses the issue of parallel efficiency while only sparingly consuming CAD resources; 2) The use of genetic and gradient-based algorithms for three-dimensional aerodynamic design problems. The influence of noise on the optimization methods is studied. Our goal is to create a responsive and automated framework that efficiently identifies design modifications that result in substantial performance improvements. In addition, we examine the architectural issues associated with the deployment of a CAD-based approach in a heterogeneous parallel computing environment that contains both CAD workstations and dedicated compute engines. We demonstrate the effectiveness of the framework for a design problem that features topology changes and complex geometry.

Nemec, M.↗

THE BRIGHTEST OF REIONIZING GALAXIES SURVEY: DESIGN AND PRELIMINARY RESULTS

We present the first results on the search for very bright (M{sub AB} {approx} -21) galaxies at redshift z {approx} 8 from the Brightest of Reionizing Galaxies (BoRG) survey. BoRG is a Hubble Space Telescope Wide Field Camera 3 (WFC3) pure-parallel survey that is obtaining images on random lines of sight at high Galactic latitudes in four filters (F606W, F098M, F125W, and F160W), with integration times optimized to identify galaxies at z {approx}> 7.5 as F098M dropouts. We discuss here results from a search area of approximately 130 arcmin{sup 2} over 23 BoRG fields, complemented by six other pure-parallel WFC3 fields with similar filters. This new search area is more than two times wider than previous WFC3 observations at z {approx} 8. We identify four F098M-dropout candidates with high statistical confidence (detected at greater than 8{sigma} confidence in F125W). These sources are among the brightest candidates currently known at z {approx} 8 and approximately 10 times brighter than the z = 8.56 galaxy UDFy-38135539. They thus represent ideal targets for spectroscopic follow-up observations and could potentially lead to a redshift record, as our color selection includes objects up to z {approx} 9. However, the expected contamination rate of our sample is about 30% higher than typical searches for dropout galaxies in legacy fields, such as the GOODS and HUDF, where deeper data and additional optical filters are available to reject contaminants.

79 ASTRONOMY AND ASTROPHYSICS↗

DeepHyper: Asynchronous Hyperparameter Search for Deep Neural Networks

Hyperparameters employed by deep learning (DL) methods play a substantial role in the performance and reliability of these methods in practice. Unfortunately, finding performance-optimizing hyperparameter settings is a notoriously difficult task. Hyperparameter search methods typically have limited production-strength implementations or do not target scalability within a highly parallel machine, portability across different machines, experimental comparison between different methods, and tighter integration with workflow systems. In this paper, we present DeepHyper, a Python package that provides a common interface for the implementation and study of scalable hyperparameter search methods. It adopts the Balsam workflow system to hide the complexities of running large numbers of hyperparameter configurations in parallel on high-performance computing (HPC) systems. We implement and study asynchronous model-based search methods that consist of sampling a small number of input hyperparameter configurations and progressively fitting surrogate models over the input-output space until exhausting a user-defined budget of evaluations. We evaluate the efficacy of these methods relative to approaches such as random search, genetic algorithms, Bayesian optimization, and hyperband on DL benchmarks on CPU- and GPU-based HPC systems.

Balaprakash, Prasanna↗

GPU-Accelerated Text Mining

Accelerating hardware devices represent a novel promise for improving the performance for many problem domains but it is not clear for which domains what accelerators are suitable. While there is no room in general-purpose processor design to significantly increase the processor frequency, developers are instead resorting to multi-core chips duplicating conventional computing capabilities on a single die. Yet, accelerators offer more radical designs with a much higher level of parallelism and novel programming environments. This present work assesses the viability of text mining on CUDA. Text mining is one of the key concepts that has become prominent as an effective means to index the Internet, but its applications range beyond this scope and extend to providing document similarity metrics, the subject of this work. We have developed and optimized text search algorithms for GPUs to exploit their potential for massive data processing. We discuss the algorithmic challenges of parallelization for text search problems on GPUs and demonstrate the potential of these devices in experiments by reporting significant speedups. Our study may be one of the first to assess more complex text search problems for suitability for GPU devices, and it may also be one of the first to exploit and report on atomic instruction usage that have recently become available in NVIDIA devices.

43 PARTICLE ACCELERATORS↗

Characteristics of a novel lower hybrid wave antenna for the TST-2 spherical tokamak

A new type of traveling wave antenna which excites the lower hybrid wave directly was developed. This antenna is similar to the inductively-coupled combline antenna in that only the first element of the antenna array is excited externally, and subsequent elements are excited passively by mutual coupling between adjacent elements. The main difference is that whereas the inductively-coupled combline antenna makes use of mutual inductance, the presently proposed antenna makes use of mutual capacitance. The radiating elements are located at the voltage maximum, and the electric field induced in the plasma is in the toroidal direction rather than the poloidal direction, matching the polarization of the lower hybrid wave. Optimization studies were carried out to obtain a band-pass characteristic centered around 200 MHz, and a unidirectional wavenumber spectrum with the parallel index of refraction corresponding to approximately 5. Plasma current ramp-up to 2 kA has been achieved on the TST-2 spherical tokamak with 12 kW of RF power at 200 MHz during the initial experimental period using this antenna. Further optimization studies are being performed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Improved Accuracy for Automated Communication Pattern Characterization Using Communication Graphs and Aggressive Search Space Pruning

An understanding of a parallel application’s communication behavior is useful for a range of activities including debugging and optimization, job scheduling, target system selection, and system design. Because it can be challenging to understand communication behavior, especially for those who lack expertise or who are not familiar with the application, I and two colleagues recently developed an automated, search-based approach for recognizing and parameterizing application communication behavior using a library of common communication patterns. This initial approach was effective for characterizing the behavior of many workloads, but I identified some combinations of communication patterns for which the method was inefficient or would fail. In this paper, I discuss one such troublesome pattern combination and propose modifications to the recognition method to handle it. Specifically, I propose an alternative approach that uses communication graphs instead of traditional communication matrices to improve recognition accuracy for collective communication operations, and that uses a non-greedy recognition technique to avoid search space dead-ends that trap the original greedy recognition approach. My modified approach uses aggressive search space pruning and heuristics to control the potential for state explosion caused by its non-greedy pattern recognition method. I demonstrate the improved recognition accuracy and pruning efficacy of the modified approach using several synthetic and real-world communication pattern combinations.

Roth, Philip↗

Massively parallel first-principles simulation of electron dynamics in materials

Here we present a highly scalable, parallel implementation of first-principles electron dynamics coupled with molecular dynamics (MD). By using optimized kernels, network topology aware communication, and by fully distributing all terms in the time-dependent Kohn–Sham equation, we demonstrate unprecedented time to solution for disordered aluminum systems of 2000 atoms (22,000 electrons) and 5400 atoms (59,400 electrons), with wall clock time as low as 7.5 s per MD time step. Despite a significant amount of non-local communication required in every iteration, we achieved excellent strong scaling and sustained performance on the Sequoia Blue Gene/Q supercomputer at LLNL. We obtained up to 59% of the theoretical sustained peak performance on 16,384 nodes and performance of 8.75 Petaflop/s (43% of theoretical peak) on the full 98,304 node machine (1,572,864 cores). Lastly, scalable explicit electron dynamics allows for the study of phenomena beyond the reach of standard first-principles MD, in particular, materials subject to strong or rapid perturbations, such as pulsed electromagnetic radiation, particle irradiation, or strong electric currents.

36 MATERIALS SCIENCE↗

Automated “Cells-To-Peptides” Sample Preparation Workflow for High-Throughput, Quantitative Proteomic Assays of Microbes

Mass spectrometry-based quantitative proteomic analysis has proven valuable for clinical and biotechnology-related research and development. Improvements in sensitivity, resolution, and robustness of mass analyzers have also added value. However, manual sample preparation protocols are often a bottleneck for sample throughput and can lead to poor reproducibility, especially for applications where thousands of samples per month must be analyzed. To alleviate these issues, we developed a “cells-to-peptides” automated workflow for Gram-negative bacteria and fungi that includes cell lysis, protein precipitation, resuspension, quantification, normalization, and tryptic digestion. The workflow takes 2 h to process 96 samples from cell pellets to the initiation of the tryptic digestion step and can process 384 samples in parallel. We measured the efficiency of protein extraction from various amounts of cell biomass and optimized the process for standard liquid chromatography–mass spectrometry systems. The automated workflow was tested by preparing 96 Escherichia coli samples and quantifying over 600 peptides that resulted in a median coefficient of variation of 15.8%. Similar technical variance was observed for three other organisms as measured by highly multiplexed LC-MRM–MS acquisition methods. These results show that this automated sample preparation workflow provides robust, reproducible proteomic samples for high-throughput applications.

59 BASIC BIOLOGICAL SCIENCES↗

Unassisted solar water splitting with 9.8% efficiency and over 100 h stability based on Si solar cells and photoelectrodes catalyzed by bifunctional Ni–Mo/Ni

Designing a highly efficient and stable photoelectrochemical (PEC) tandem cell for unassisted solar water splitting is considered a promising approach for large-scale solar energy storage. To date, various tandem device configurations have been reported. However, the achievement of a solar-to-hydrogen conversion efficiency (η STH ) of 10% is still full of challenges, due to the incompatibility between the two photoelectrode materials. Here, we report a highly efficient and stable photovoltaic (PV)–PEC tandem device composed of a dual Si photoelectrode and two series-connected ordinary Si PV cells. The dual-photoelectrode device consists of an n + np + -Si photocathode and p + pn + -Si photoanode, which allow back illumination from the Si substrate, spatially and functionally decoupling the optical absorption and the catalytic activity. By further employing a Ni protective layer together with a bifunctional Ni–Mo catalyst for both the Si photocathode and photoanode, the PV–PEC tandem cell can perform spontaneous water splitting without any applied bias. A high η STH of 9.8% with a stability of over 100 h was achieved in alkaline solution under parallel AM 1.5G 1 sun illumination. Furthermore, this work essentially allows a modular independent optimization of each component which can enhance the efficiency and stability of the PV–PEC cells.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Final Stage in the Design of a Boron Neutron Capture Therapy facility at CEADEN, Cuba

A neutron beam simulation study is carried out to determine the most suitable neutron energy for treatment of shallow and deep-seated brain tumors in the context of Boron Neutron Capture Therapy (BNCT). Two figures-of-merit, the therapeutic gain and the neutron fluence are utilized as beam assessment parameters. An irradiation cavity is used instead of a parallel beam port for the therapy. Calculations are performed using the MCNP5 code. After the optimization of our beam-shaper a study of the dose distribution in the head, neck, tyroids, lungs and upper and middle spine had been made. The therapeutic gain is increased while the current required for one hour treatment is decreased in comparison with the trading prototypes of NG used for BNCT.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

A Step towards Energy Efficient Computing: Redesigning a Hydrodynamic Application on CPU-GPU, In: 2014 IEEE 28th International Parallel and Distributed Processing Symposium

Power and energy consumption are becoming an increasing concern in high performance computing. Compared to multi-core CPUs, GPUs have a much better performance per watt. In this paper we discuss efforts to redesign the most computation intensive parts of BLAST, an application that solves the equations for compressible hydrodynamics with high order finite elements, using GPUs BLAST, Dobrev. In order to exploit the hardware parallelism of GPUs and achieve high performance, we implemented custom linear algebra kernels. We intensively optimized our CUDA kernels by exploiting the memory hierarchy, which exceed the vendor's library routines substantially in performance. We proposed an auto tuning technique to adapt our CUDA kernels to the orders of the finite element method. Compared to a previous base implementation, our redesign and optimization lowered the energy consumption of the GPU in two aspects: 60% less time to solution and 10% less power required. Compared to the CPU-only solution, our GPU accelerated BLAST obtained a 2.5× overall speedup and 1.42× energy efficiency (green up) using 4th order (Q_4) finite elements, and a 1.9× speedup and 1.27× green up using 2nd order (Q2) finite elements.

Computer Science↗

Distributed Multi-GPU Community Detection on Exascale Computing Platforms

Community detection is a fundamental operation in graph mining, and by uncovering hidden structures and patterns within complex systems it helps solve fundamental problems pertaining to social networks, such as information diffusion, epidemics, and recommender systems. Scaling graph algorithms for massive networks becomes challenging on modern distributed-memory multi-GPU (Graphics Processing Unit) systems due to limitations such as irregular memory access patterns, load imbalances, higher communication-computation ratios, and cross-platform support. We present a novel algorithm HiPDPL-GPU (distributed parallel Louvain) to address these challenges. We conduct experiments involving different partitioning techniques to achieve optimized performance of HiPDPL-GPU on the two largest supercomputers: Frontier and Summit. Remarkably, HiPDPL-GPU processes a graph with 4.2 billion edges in less than 3 minutes using 1024 GPUs. Qualitatively performance of HiPDPL-GPU is similar or better compared to other state-of-the-art CPU- and GPU-based implementations. While prior GPU implementations have predominantly employed CUDA, our first-of-its-kind implementation for community detection is cross-platform, accommodating both AMD and NVIDIA GPUs.

graph algorithms, high performance comptuing↗

Quantum Simulators and Applications on Quantum Framework

Simulating quantum circuits is essential for validating quantum algorithms. However, no single simulator consistently performs best - efficiency depends on circuit structure, entanglement, and depth. In this work, we integrate Qiskit-Aer (state-vector and matrix product state) and QTensor, a tree-tensor-network based simulator, into the Quantum Framework (QFw), a modular platform that supports multiple quantum backends via a unified interface. We also enable distributed quantum approximate optimization algorithm (DQAOA) application compatibility with QFw, allowing sub-problems to be solved in parallel at scale. We then benchmark DQAOA and TFIM (transverse field Ising model) circuits across supported simulators, showing how performance varies significantly with problem type. All simulations are deployed on the Frontier supercomputer using QFw's MPI-based orchestration for distributed, multinode execution. These results underscore the need for simulatoragnostic infrastructure to enable systematic evaluation and highperformance scaling of quantum workloads. QFw provides a practical and extensible path toward reproducible quantum algorithm development across diverse application domains.

Chundury, Srikar [ORNL] (ORCID:0009000183359259)↗

Scaling Structured Multigrid to 500K+ Cores Through Coarse-Grid Redistribution

The effcient solution of sparse, linear systems resulting from the discretization of partial differential equations is crucial to the performance of many physics-based simulations. The algorithmic optimality of multilevel approaches for common discretizations makes them a good candidate for an efficient parallel solver. Yet, modern architectures for high-performance computing systems continue to challenge the parallel scalability of multilevel solvers. While algebraic multigrid methods are robust for solving a variety of problems, the increasing importance of data locality and cost of data movement in modern architectures motivates the need to carefully exploit structure in the problem. Robust logically structured variational multigrid methods, such as Black Box Multigrid (BoxMG), maintain structure throughout the multigrid hierarchy. This avoids indirection and increased coarse- grid communication costs typical in parallel algebraic multigrid. Nevertheless, the parallel scalability of structured multigrid is challenged by coarse-grid problems where the overhead in communication dominates computation. In this paper, an algorithm is introduced for redistributing coarse-grid problems through incremental agglomeration. Guided by a predictive performance model, this algorithm provides robust redistribution decisions for structured multilevel solvers. A two-dimensional diffusion problem is used to demonstrate the significant gain in performance of this algorithm over the previous approach that used agglomeration to one processor. In addition, the parallel scalability of this approach

97 MATHEMATICS AND COMPUTING↗

Integrated Network Decompositions and Dynamic Programming for Graph Optimization (INDDGO)

The INDDGO software package offers a set of tools for finding exact solutions to graph optimization problems via tree decompositions and dynamic programming algorithms. Currently the framework offers serial and parallel (distributed memory) algorithms for finding tree decompositions and solving the maximum weighted independent set problem. The parallel dynamic programming algorithm is implemented on top of the MADNESS task-based runtime.

Source record↗

Novel insights into iron metabolism by integrating deletome and transcriptome analysis in an iron deficiency model of the yeast Saccharomyces cerevisiae

Background: Iron-deficiency anemia is the most prevalent form of anemia world-wide. The yeast Saccharomyces cerevisiae has been used as a model of cellular iron deficiency, in part because many of its cellular pathways are conserved. To better understand how cells respond to changes in iron availability, we profiled the yeast genome with a parallel analysis of homozygous deletion mutants to identify essential components and cellular processes required for optimal growth under ironlimited conditions. To complement this analysis, we compared those genes identified as important for fitness to those that were differentially-expressed in the same conditions. The resulting analysis provides a global perspective on the cellular processes involved in iron metabolism. Results: Using functional profiling, we identified several genes known to be involved in high affinity iron uptake, in addition to novel genes that may play a role in iron metabolism. Our results provide support for the primary involvement in iron homeostasis of vacuolar and endosomal compartments, as well as vesicular transport to and from these compartments. We also observed an unexpected importance of the peroxisome for growth in iron-limited media. Although these components were essential for growth in low-iron conditions, most of them were not differentially-expressed. Genes with altered expression in iron deficiency were mainly associated with iron uptake and transport mechanisms, with little overlap with those that were functionally required. To better understand this relationship, we used expression-profiling of selected mutants that exhibited slow growth in iron-deficient conditions, and as a result, obtained additional insight into the roles of CTI6, DAP1, MRS4 and YHR045W in iron metabolism. Conclusion: Comparison between functional and gene expression data in iron deficiency highlighted the complementary utility of these two approaches to identify important functional components. This should be taken into consideration when designing and analyzing data from these type of studies. We used this and other published data to develop a molecular interaction network of iron metabolism in yeast.

59 BASIC BIOLOGICAL SCIENCES↗