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,405 records · Page 78

Systems Level Regulation of Rhythmic Growth Rate and Biomass Accumulation in Grasses

Several breakthroughs have been recently made in our understanding of plant growth and biomass accumulation. It was found that plant growth is rhythmically controlled throughout the day by the circadian clock through a complex interplay of light and phytohormone signaling pathways. While plants such as the C4 energy crop sorghum (Sorghum bicolor (L.) Moench) and possibly the C3 grass (Brachypodium distachyon) also exhibit daily rhythms in growth rate, the molecular details of its regulation remain to be explored. A better understanding of diurnally regulated growth behavior in grasses may lead to species-specific mechanisms highly relevant to future strategies to optimize energy crop biomass yield. Here we propose to devise a systems approach to identify, in parallel, regulatory hubs associated with rhythmic growth in C3 and C4 plants. We propose to use rhythmicity in daily growth patterns to drive the discovery of regulatory network modules controlling biomass accumulation.

09 BIOMASS FUELS↗

Systems Level Regulation of Rhythmic Growth Rate and Biomass Accumulation in Grasses

Objectives: Several breakthroughs have been recently made in our understanding of plant growth and biomass accumulation. It was found that plant growth is rhythmically controlled throughout the day by the circadian clock through a complex interplay of light and phytohormone signaling pathways. While plants such as the C4 energy crop sorghum (Sorghum bicolor (L.) Moench) and possibly the C3 grass Brachypodium distachyon also exhibit daily rhythms in growth rate, the molecular details of its regulation remain to be explored. A better understanding of diurnally regulated growth behavior in grasses may lead to species-specific mechanisms highly relevant to future strategies to optimize energy crop biomass yield. Here we propose to devise a systems approach to identify, in parallel, regulatory hubs associated with rhythmic growth in C3 and C4 plants. We propose to use rhythmicity in daily growth patterns to drive the discovery of regulatory network modules controlling biomass accumulation. Description: The project is divided in three main parts: 1) Performing time-lapse imaging and growth measurement in B. distachyon and S. bicolor to determine growth rate dynamic during the day/night cycle. Identifying growth-associated genes whose expression patterns follow the observed growth dynamics using deep sequencing technology, 2) identifying regulators of these genes by screening for DNA-binding proteins interacting with the growth-associated gene promoters identified in Aim 1. Screens will be performed using a validated yeast-one hybrid strategy paired with a specifically designed B. distachyon and S. bicolor transcription factor libraries (1000 clones each), and 3) Selecting 50 potential growth regulators from the screen for downstream characterization. The selection will be made by using a sytems biology approach by calculating the connectivity between growth rate, rhythmic gene expression profiles and TF expression profile and determine which TF is likely part of a hub and a potential regulator of plant growth. We will confirme the 50 DNA-protein interactions using transient transcriptional assays in B. distachyon and S. bicolor, and perform further testing in vivo by measuring growth parameters in transgenic loss- or gain-of-function lines for the selected transcription factors (25 B. distachyon and 3 S. bicolor lines). In 2016 the Principal Investigator relocated the laboratory to The Scripps Research Institute (TSRI) where the project has continued with an end date of 08/31/17. Accomplishments: We successfully collected large datasets of gene expression form the model grass Brachypodium. We used and developed bioinformatics analysis tools to investigate the structure, dynamics and robustness of circadian regulated gene expression in Brachypodium. Relevant Discoveries: We were able to determine that the endogenous circadian clock appears to play a much more subdued role in growth regulation in Brachypodium, that has been demonstrated in either Arabidopsis, or crop plants like Rice, Corn and Soybean. This led to our conclusion that Brachypodium unfortunately is unlikely to serve as an informative model for understanding how growth regulation in plants is under the control of circadian network circuitry. However, we were able to leverage our datasets in Brachypodium to inform us and reinforce a large collaborative study on gene networks governing cell wall deposition in Arabidopsis. This led to a major and highly cited publication relevant to improving biomass production.

09 BIOMASS FUELS↗

Research in Structures and Dynamics, 1984

A symposium on advanced and trends in structures and dynamics was held to communicate new insights into physical behavior and to identify trends in the solution procedures for structures and dynamics problems. Pertinent areas of concern were (1) multiprocessors, parallel computation, and database management systems, (2) advances in finite element technology, (3) interactive computing and optimization, (4) mechanics of materials, (5) structural stability, (6) dynamic response of structures, and (7) advanced computer applications.

Robert J Hayduk↗

The design and application of nickel-cadmium batteries in space

This paper describes the considerations given to selection of 20 and 50 A h nickel-cadmium cells and batteries for NASA/Goddard's Solar Max and Landsat D missions. Results of cell and battery manufacturer testing and improvements in design required by NASA standard specifications are shown. Operation of three batteries in parallel using a single voltage limit/current taper charge control system is described along with suggestions for optimizing life and uniformity. The results of three years of in-orbit operation is presented.

Halpert, G.↗

Optimal design of structures with multiple design variables per group and multiple loading conditions on the personal computer

A finite element based programming system for minimum weight design of a truss-type structure subjected to displacement, stress, and lower and upper bounds on design variables is presented. The programming system consists of a number of independent processors, each performing a specific task. These processors, however, are interfaced through a well-organized data base, thus making the tasks of modifying, updating, or expanding the programming system much easier in a friendly environment provided by many inexpensive personal computers. The proposed software can be viewed as an important step in achieving a 'dummy' finite element for optimization. The programming system has been implemented on both large and small computers (such as VAX, CYBER, IBM-PC, and APPLE) although the focus is on the latter. Examples are presented to demonstrate the capabilities of the code. The present programming system can be used stand-alone or as part of the multilevel decomposition procedure to obtain optimum design for very large scale structural systems. Furthermore, other related research areas such as developing optimization algorithms (or in the larger level: a structural synthesis program) for future trends in using parallel computers may also benefit from this study.

Nguyen, D. T.↗

Single-Mode Projection Filters for Modal Parameter Identification for Flexible Structures

Single-mode projection filters are developed for eigensystem parameter identification from both analytical results and test data. Explicit formulations of these projection filters are derived using the orthogonal matrices of the controllability and observability matrices in the general sense. A global minimum optimization algorithm is applied to update the filter parameters by using the interval analysis method. The updated modal parameters represent the characteristics of the test data. For illustration of this new approach, a numerical simulation for the MAST beam structure is shown by using a one-dimensional global optimization algorithm to identify modal frequencies and damping. Another numerical simulation of a ten-mode structure is also presented by using a two-dimensional global optimization algorithm to illustrate the feasibility of the new method. The projection filters are practical for parallel processing implementation.

Huang, Jen-Kuang↗

Control of Spacecraft Control Laboratory Experiment (SCOLE) slew maneuvers

This is the second report of a set of two reports on the dynamics and control of slewing maneuvers of NASA Spacecraft Control Laboratory Experiment (SCOLE). The control problem of slewing maneuvers of SCOLE is developed in terms of an arbitrary maneuver about any given axis. The control system is developed for the combined problem of rigid-body slew maneuver and vibration suppression of flexible appendage. The control problem is formulated by incorporating the nonlinear equations derived in the previous report and is expressed in terms of a two-point boundary value problem utilizing a quadratic type of performance index. The two-point boundary value problem is solved as a hierarchical control problem with the overall system being split in terms of two subsystems, namely the slewing of the entire assembly and the vibration suppression of the flexible antenna. The coupling variables between the two dynamical subsystems are identified and these two subsystems for control purposes are treated independently in parallel at the first level. Then the state-space trajectory of the combined problem is optimized at the second level.

Kakad, Y. P.↗

Dynamics and control of flexible spacecraft during and after slewing maneuvers

The dynamics and control of slewing maneuvers of NASA Spacecraft COntrol Laboratory Experiment (SCOLE) are analyzed. The control problem of slewing maneuvers of SCOLE is formulated in terms of an arbitrary maneuver about any given axis. The control system is developed for the combined problem of rigid-body slew maneuver and vibration suppression of the flexible appendage. The control problem formulation incorporates the nonlinear dynamical equations derived previously, and is expressed in terms of a two-point boundary value problem utilizing a quadratic type of performance index. The two-point boundary value problem is solved as a hierarchical control problem with the overall system being split in terms of two subsystems, namely the slewing of the entire assembly and the vibration suppression of the flexible antenna. The coupling variables between the two dynamical subsystems are identified and these two subsystems for control purposes are treated independently in parallel at the first level. Then the state-space trajectory of the combined problem is optimized at the second level.

Kakad, Yogendra P.↗

Discontinuous Galerkin Finite Element Method for Parabolic Problems

In this paper, we develop a time and its corresponding spatial discretization scheme, based upon the assumption of a certain weak singularity of parallel ut(t) parallel Lz(omega) = parallel ut parallel2, for the discontinuous Galerkin finite element method for one-dimensional parabolic problems. Optimal convergence rates in both time and spatial variables are obtained. A discussion of automatic time-step control method is also included.

Kaneko, Hideaki↗

Efficiency of Mixed-Element USM3D for Benchmark Three-Dimensional Flows

The unstructured, mixed-element, cell-centered, finite-volume flow solver USM3D is enhanced with new capabilities such as line generation for general unstructured grids and optimization of the iterative solver. The efficiency of the new developments is assessed in a massively parallel environment. The assessments are conducted using a baseline method and the recent hierarchical adaptive nonlinear iteration method framework. Three benchmark turbulent flows, namely, a subsonic separated flow around a three-dimensional hemisphere cylinder configuration, a transonic flow around the ONERA M6 wing, and a supersonic flow through a square duct are considered.

Mohagna J Pandya↗

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 an 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, the 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.

Sattar, Naw Safrin↗

MoE-Inference-Bench: Performance Evaluation of Mixture of Expert Large Language and Vision Models

Mixture of Experts (MoE) models have enabled the scaling of Large Language Models (LLMs) and Vision Language Models (VLMs) by achieving massive parameter counts while maintaining computational efficiency. However, MoEs introduce several inference-time challenges, including load imbalance across experts and the additional routing computational overhead. To address these challenges and fully harness the benefits of MoE, a systematic evaluation of hardware acceleration techniques is essential. We present MoE-Inference-Bench, a comprehensive study to evaluate MoE performance across diverse scenarios. We analyze the impact of batch size, sequence length, and critical MoE hyperparameters such as FFN dimensions and number of experts on throughput. We evaluate several optimization techniques on Nvidia H100 GPUs, including pruning, Fused MoE operations, speculative decoding, quantization, and various parallelization strategies. Our evaluation includes MoEs from the Mixtral, DeepSeek, OLMoE and Qwen families. The results reveal performance differences across configurations and provide insights for the efficient deployment of MoEs.

Chitty-Venkata, Krishna Teja↗

Parallel volume rendering on the IBM Blue Gene/P.

Parallel ray casting volume rendering is implemented and tested on an IBM Blue Gene distributed memory parallel architecture. Data are presented from experiments under a number of different conditions, including dataset size, number of processors, low and high quality rendering, offline storage of results, and streaming of images for remote display. Performance is divided into three main sections of the algorithm: disk I/O, rendering, and compositing. The dynamic balance between these tasks varies with the number of processors and other conditions. Lessons learned from the work include understanding the balance between parallel I/O, computation, and communication within the context of visualization on supercomputers, recommendations for tuning and optimization, and opportunities for scaling further in the future. Extrapolating these results to very large data and image sizes suggests that a distributed memory HPC architecture such as the Blue Gene is a viable platform for some types of visualization at very large scales.

97 MATHEMATICS AND COMPUTING↗

GSoFa: Scalable Sparse Symbolic LU Factorization on GPUs

Decomposing a matrix $\mathbf {A}$ into a lower matrix $\mathbf {L}$ and an upper matrix $\mathbf {U}$, which is also known as LU decomposition, is an essential operation in numerical linear algebra. For a sparse matrix, LU decomposition often introduces more nonzero entries in the $\mathbf {L}$ and $\mathbf {U}$ factors than in the original matrix. A symbolic factorization step is needed to identify the nonzero structures of $\mathbf {L}$ and $\mathbf {U}$ matrices. Attracted by the enormous potentials of the Graphics Processing Units (GPUs), an array of efforts have surged to deploy various LU factorization steps except for the symbolic factorization, to the best of our knowledge, on GPUs. This article introduces gSoFa, the first GPU-based symbolic factorization design with the following three optimizations to enable scalable LU symbolic factorization for nonsymmetric pattern sparse matrices on GPUs. First, here we introduce a novel fine-grained parallel symbolic factorization algorithm that is well suited for the Single Instruction Multiple Thread (SIMT) architecture of GPUs. Second, we tailor supernode detection into a SIMT friendly process and strive to balance the workload, minimize the communication and saturate the GPU computing resources during supernode detection. Third, we introduce a three-pronged optimization to reduce the excessive space consumption problem faced by multi-source concurrent symbolic factorization. Taken together, gSoFa achieves up to 31× speedup from 1 to 44 Summit nodes (6 to 264 GPUs) and outperforms the state-of-the-art CPU project, on average, by 5×. Notably, gSoFa also achieves up to 47 percent of the peak memory throughput of a V100 GPU in the Summit Supercomputer.

97 MATHEMATICS AND COMPUTING↗

Parallel CFD Algorithms for Aerodynamical Flow Solvers on Unstructured Meshes

The Advisory Group for Aerospace Research and Development (AGARD) has requested my participation in the lecture series entitled Parallel Computing in Computational Fluid Dynamics to be held at the von Karman Institute in Brussels, Belgium on May 15-19, 1995. In addition, a request has been made from the US Coordinator for AGARD at the Pentagon for NASA Ames to hold a repetition of the lecture series on October 16-20, 1995. I have been asked to be a local coordinator for the Ames event. All AGARD lecture series events have attendance limited to NATO allied countries. A brief of the lecture series is provided in the attached enclosure. Specifically, I have been asked to give two lectures of approximately 75 minutes each on the subject of parallel solution techniques for the fluid flow equations on unstructured meshes. The title of my lectures is "Parallel CFD Algorithms for Aerodynamical Flow Solvers on Unstructured Meshes" (Parts I-II). The contents of these lectures will be largely review in nature and will draw upon previously published work in this area. Topics of my lectures will include: (1) Mesh partitioning algorithms. Recursive techniques based on coordinate bisection, Cuthill-McKee level structures, and spectral bisection. (2) Newton's method for large scale CFD problems. Size and complexity estimates for Newton's method, modifications for insuring global convergence. (3) Techniques for constructing the Jacobian matrix. Analytic and numerical techniques for Jacobian matrix-vector products, constructing the transposed matrix, extensions to optimization and homotopy theories. (4) Iterative solution algorithms. Practical experience with GIVIRES and BICG-STAB matrix solvers. (5) Parallel matrix preconditioning. Incomplete Lower-Upper (ILU) factorization, domain-decomposed ILU, approximate Schur complement strategies.

Barth, Timothy J.↗

Algorithm 1028: VTMOP: Solver for Blackbox Multiobjective Optimization Problems

VTMOP is a Fortran 2008 software package containing two Fortran modules for solving computationally expensive bound-constrained blackbox multiobjective optimization problems. VTMOP implements the algorithm of [32], which handles two or more objectives, does not require any derivatives, and produces well-distributed points over the Pareto front. The first module contains a general framework for solving multiobjective optimization problems by combining response surface methodology, trust region methodology, and an adaptive weighting scheme. The second module features a driver subroutine that implements this framework when the objective functions can be wrapped as a Fortran subroutine. Lastly, support is provided for both serial and parallel execution paradigms, and VTMOP is demonstrated on several test problems as well as one real-world problem in the area of particle accelerator optimization.

97 MATHEMATICS AND COMPUTING↗

Optimizing I/O Forwarding Techniques for Extreme-Scale Event Tracing

Programming development tools are a vital com- ponent for understanding the behavior of parallel applica- tions. Event tracing is a principal ingredient to these tools, but new and serious challenges place event tracing at risk on extreme-scale machines. As the quantity of captured events increases with concurrency, the additional data can over- load the parallel file system and perturb the application be- ing observed. In this work we present a solution for event tracing on extreme-scale machines. We enhance an I/O for- warding software layer to aggregate and reorganize log data prior to writing to the storage system, significantly reduc- ing the burden on the underlying file system. Furthermore, we introduce a sophisticated write buffering capability to limit the impact. To validate the approach, we employ the Vampir tracing toolset using these new capabilities. Our re- sults demonstrate that the approach increases the maximum traced application size by a factor of 5x to more than 200,000 processes.

atomic append↗

Center for Programming Models for Scalable Parallel Computing - Towards Enhancing OpenMP for Manycore and Heterogeneous Nodes (Final Report)

OpenMP was not well recognized at the beginning of the project, around year 2003, because of its limited use in DoE production applications and the inmature hardware support for an efficient implementation. Yet in the recent years, it has been graduately adopted both in HPC applications, mostly in the form of MPI+OpenMP hybrid code, and in mid-scale desktop applications for scientific and experimental studies. We have observed this trend and worked deligiently to improve our OpenMP compiler and runtimes, as well as to work with the OpenMP standard organization to make sure OpenMP are evolved in the direction close to DoE missions. In the Center for Programming Models for Scalable Parallel Computing project, the HPCTools team at the University of Houston (UH), directed by Dr. Barbara Chapman, has been working with project partners, external collaborators and hardware vendors to increase the scalability and applicability of OpenMP for multi-core (and future manycore) platforms and for distributed memory systems by exploring different programming models, language extensions, compiler optimizations, as well as runtime library support.

97 MATHEMATICS AND COMPUTING↗