Search NASA⌕ Search

SEARCH · Search NASA

Results for “parallel parameters 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 289 records · Page 16

Dynamic remapping decisions in multi-phase parallel computations

The effectiveness of any given mapping of workload to processors in a parallel system is dependent on the stochastic behavior of the workload. Program behavior is often characterized by a sequence of phases, with phase changes occurring unpredictably. During a phase, the behavior is fairly stable, but may become quite different during the next phase. Thus a workload assignment generated for one phase may hinder performance during the next phase. We consider the problem of deciding whether to remap a paralled computation in the face of uncertainty in remapping's utility. Fundamentally, it is necessary to balance the expected remapping performance gain against the delay cost of remapping. This paper treats this problem formally by constructing a probabilistic model of a computation with at most two phases. We use stochastic dynamic programming to show that the remapping decision policy which minimizes the expected running time of the computation has an extremely simple structure: the optimal decision at any step is followed by comparing the probability of remapping gain against a threshold. This theoretical result stresses the importance of detecting a phase change, and assessing the possibility of gain from remapping. We also empirically study the sensitivity of optimal performance to imprecise decision threshold. Under a wide range of model parameter values, we find nearly optimal performance if remapping is chosen simply when the gain probability is high. These results strongly suggest that except in extreme cases, the remapping decision problem is essentially that of dynamically determining whether gain can be achieved by remapping after a phase change; precise quantification of the decision model parameters is not necessary.

Nicol, D. M.↗

High-Performance Computing Optimization for Aladyn – Adaptive Neural Network Molecular Dynamics Mini-Application

This report provides a description and performance evaluation of the optimization techniques for high performance computing (HPC) implementation of the open source Computational Materials mini-application Aladyn (https://github.com/nasa/aladyn). Aladyn is a basic molecular dynamics code written in FORTRAN 2003, which is designed to demonstrate the use of adaptive neural networks (ANNs) in atomistic simulations. The role of ANNs is to efficiently reproduce the very complex energy landscape resulting from the atomic interactions in materials with the accuracy of the more expensive quantum mechanics-based calculations. The ANN is trained on a large set of atomic structures calculated using the density functional theory (DFT) method. While achieving orders of magnitude faster computational performance than DFT, the ANN-based approach was still very computationally demanding compared to the conventional approach of using empirically fitted energy functions. After its initial development, Aladyn was evaluated and optimized by experts at the NASA Advanced Supercomputing (NAS) division to exploit modern supercomputer architectures. The code has been optimized for execution on multicore central processing units (CPUs), including Intel® Skylake microarchitecture, and on graphic accelerators, such as Nvidia® V100 graphic processing units (GPUs), using Open Multi-Processing (OpenMP) and Open Accelerators (OpenACC) programming interfaces. The optimization achieved a speedup of 4.7 times the baseline version on CPU performance and an additional 2.4 times on CPU+GPU performance. Atomistic computer simulations are a fundamental tool in materials research to model material properties form physics-based first principles. Atomic interaction, governed by Quantum Mechanics (QM) require sophisticated and highly computationally demanding mathematical models to calculate [1]. Classical methods use approximate functional forms, empirically fitted through a set of variable parameters to emulate atomic energies as direct functions of atomic coordinates [2]. While empirical potentials are computationally much simpler, allowing simulations of large-scale systems of up to a trillion (1012) atoms [3], they are substantially less accurate compared to quantum calculations and applicable only to very specific atomic configurations or predefined crystallographic phases. A recently suggested approach is to use heuristic machine learning methods [4], such as those based on Adaptive Neural Networks (ANNs) to predict atomic energies, after being trained on a sufficiently large database of QM-calculated structures [5,6]. This approach reduces significantly the computational complexity, allowing for simulations of orders of magnitude larger systems compared to QM-based methods without compromising accuracy. Still, compared to classical methods using empirical energy functions, ANN methods remain two- to three orders of magnitude more computationally demanding. Hence, the computational cost of simulations, together with the need for extensive training of ANNs, still makes the practical implementation of ANN-based methods quite challenging. The purpose of the Aladyn mini-application software [7], available as open source at https://github.com/nasa/aladyn, is to be a testbed for exploring possible optimization strategies to develop highly scalable parallel algorithms for ANN-based atomistic simulations. Aladyn is aimed at utilizing the architecture of the high-end modern highperformance computing (HPC) hardware based on multicore central processing units (CPUs) equipped with graphic processing unit (GPU) accelerators. Specifically, the goal is to optimize the performance on a single HPC compute node, before implementing scaling to multi-node parallelization using message passing interface (MPI). At the same time, the open source code of Aladyn can serve as a training model for students and professors in academia.

Yamakov, Vesselin I.↗

Accelerated Simulation of Air Pollution Using NVIDIA RAPIDS

Atmospheric chemistry models are a central tool to study and forecast the impact of air pollution on the environment, vegetation, and human health. However, the numerical simulation of chemical kinetics is computationally expensive due to the stiffness of the system of ordinary differential equations that describes atmospheric chemistry. Here we present an alternative approach to the computation of atmospheric chemistry based on machine learning. Our training data set is produced using the NASA Goddard Earth Observing System (GEOS) model with GEOS-Chem chemistry, run on the NASA Center for Climate Simulation (NCCS) Discover supercomputing cluster on 384 Intel Xeon Haswell cores. This model spends more than 50% of total run time on solving atmospheric chemistry. The data set contains as input features the air pollution concentrations before solving the differential equations, together with some key physical parameters such as temperature and sun intensity. As target variables we define the air pollution concentrations after solving the differential equations. Using Dask-cuDF and Dask-XGBoost on the NVIDIA RAPIDS platform on 8 Tesla V100 GPUs, we generate from this training set gradient boosted decision tree models that can reproduce the simulation of chemical kinetics. We do this on the NCCS Advanced Data Analytics Platform (ADAPT) science cloud environment. Our application takes full advantage of recent advances in Dask-XGBoost, such as multi-node and multi-GPU scaling for distributed training with large data sets. The increase in training data size enabled by this is critical to capture the full range of chemical environments encountered across the globe and all annual seasons.The boosted tree models offer good predictability and show many of the features of the full chemistry reference simulation. Further improvements can be achieved through mass balance considerations and by accounting for error correlations. We incorporate the boosted tree models into the GEOS reference model using XGBoost's C API. This enables a seamless integration of the GPU trained models into GEOS-Chem, which is written in Fortran and optimized for use in a massively parallel CPU environment. We show the benefits of this approach and discuss the potential speedup of this machine learning accelerated atmospheric chemistry model.

Keller, Christoph A.↗

The role of the spatial heterogeneity and correlation length of surface wettability on two-phase flow in a CO 2 -water-rock system

This study characterized and modeled heterogeneous surface wettability in sandstone and investigated the role of spatial heterogeneity and correlation length of surface wettability on relative permeability in a supercritical CO 2 (scCO 2 )-brine-rock system. Understanding the role of wettability heterogeneity on relative permeability is essential to geological CO 2 sequestration, oil and gas recovery, and contaminated groundwater remediation. Although numerous studies have attempted to understand the influences of surface wettability, capillary number (Ca), and viscosity ratio, the role of the spatial variation and correlation length of surface wettability on two-phase flow in three-dimensional (3D) porous media has not been unraveled due to the challenges in the measurement and representation of realistic rock surface wettability. In this work, we conducted in-situ measurements of surface contact angle (CA) in a Bentheimer sandstone after CO 2 flooding using micro-computed tomography (micro-CT), and found that the pore-scale CA distribution on rock surfaces followed a log-normal distribution associated with a spatial correlation length. Based on the statistical information from CT scanning, a Gaussian random field was used to model CA distributions that had desired standard deviations and spatial correlation lengths, which were then adjusted within a certain range of values for sensitivity analyses to study their combined effects on the two-phase flow in the porous medium using the lattice Boltzmann (LB) method. The LB two-phase flow simulation was accelerated using hybrid, multicore parallel computing to overcome the challenges in simulating multiphase flow in a large 3D domain having 800 × 800 × 600 nodes. The simulation results showed that the surface wettability heterogeneity (i.e., standard deviation of CA) had a lesser effect on the relative permeability of the wetting fluid (water) but a more significant impact on the relative permeability of the non-wetting fluid (scCO 2 ). The Corey model was used to fit the LB-simulated relative permeability curves of water and scCO 2 and showed that the variations in the relative permeability curves for both water and scCO 2 increased as the standard deviation and spatial correlation length of CA increased. This study illustrated that the assumption of homogeneous surface wettability may cause errors in multiphase flow simulations. Furthermore, the impacts of both the standard deviation and spatial correlation length of CAs should be accounted for. This is the first study that explored the spatial correlation lengths associated with CA distributions on sandstone surfaces and comprehensively investigated the roles of both spatial variation and correlation length of CA on two-phase flow properties in 3D porous media. The optimized LB multiphase flow model was proved a powerful tool to study the interplays and combined effects of these statistical parameters, which had critical applications in numerous natural and engineering processes that involved multiphase flow in porous media.

58 GEOSCIENCES↗

Divergence Reduction in Monte Carlo Neutron Transport with On-GPU Asynchronous Scheduling

While Monte Carlo Neutron Transport (MCNT) is near-embarrasingly parallel, the effectively unpredictable lifetime of neutrons can lead to divergence when MCNT is evaluated on GPUs. Divergence is the phenomenon of adjacent threads in a warp executing different control flow paths; on GPUS, it reduces performance because each work group may only execute one path at a time. The process of Thread Data Remapping (TDR) resolves these discrepancies by moving data across hardware such that data in the same warp will be processed through similar paths. A common issue among prior implementations of TDR is the synchronous nature of its remapping and processing cycles, which exhaustively sort data produced by prior processing passes and exhaustively evaluate the sorted data. In another work, we defined a method of remapping data through an asynchronous scheduler which allows for work to be stored in shared memory and deferred arbitrarily until that work is a viable option for low-divergence evaluation. This article surveys a wider set of cases, with the goal of characterizing performance trends across a more comprehensive set of parameters. These parameters include cross sections of scattering/capturing/fission, use of implicit capture, source neutron counts, simulation time spans, and tuned memory allocations. Across these cases, we have recorded minimum and average execution times, as well as a heuristically tuned near-optimal memory allocation size for both synchronous and asynchronous scheduling. Across the collected data, it is shown that the asynchronous method is faster and more memory efficient in the majority of cases, and that it requires less tuning to achieve competitive performance.

Computer Science↗

Solid-propellant rocket motor internal ballistics performance variation analysis, phase 5

The results of research aimed at improving the predictability of internal ballistics performance of solid-propellant rocket motors (SRM's) including thrust imbalance between two SRM's firing in parallel are presented. Static test data from the first six Space Shuttle SRM's is analyzed using a computer program previously developed for this purpose. The program permits intentional minor design biases affecting the imbalance between any two SMR's to be removed. Results for the last four of the six SRM's, with only the propellant bulk temperature as a non-random variable, are generally within limits predicted by theory. Extended studies of internal ballistic performance of single SRM's are presented based on an earlier developed mathematical model which includes an assessment of grain deformation. The erosive burning rate law used in the model is upgraded and made more general. Excellent results are obtained in predictions of the performances of five different SRM's of quite different sizes and configurations. These SRM's all employ PBAN type propellants with ammonium perchlorate oxidizer and 16 to 20% aluminum except one which uses carboxyl terminated butadiene binder. The only non-calculated parameters in the burning rate equations that are changed for the different SRM's are the zero crossflow velocity burning rate coefficients and exponents. The results, in general, confirm the importance of grain deformation. The improved internal ballistic model makes practical development of an effective computer program for application of an optimization technique to SRM design which is also demonstrated. The program uses a pattern search technique to minimize the difference between a desired thrust-time trace and one calculated based on the internal ballistic model.

Sforzini, R. H.↗

Simulations of edge and SOL turbulence in diverted negative and positive triangularity plasmas

Optimizing the performance of magnetic confinement fusion devices is critical to achieving an attractive fusion reactor design. Negative triangularity (NT) scenarios have been shown to achieve excellent levels of energy confinement, while avoiding edge localized modes. Modeling turbulent transport in the edge and SOL is key in understanding the impact of NT on turbulence and extrapolating the results to future devices and regimes. Previous gyrokinetic turbulence studies have reported beneficial effects of NT across a broad range of parameters. However, most simulations have focused on the inner plasma region, neglecting the impact of NT on the outermost edge. In this work, we investigate the effect of NT in edge and scrape-off layer simulations, including the magnetic X-point and separatrix. For the first time, we employ a multi-fidelity approach, combining global, non-linear gyrokinetic simulations with drift-reduced fluid simulations, to gain a deeper understanding of the underlying physics at play. First-principles simulations using the GENE-X code demonstrate that in comparable NT and PT geometries, similar profiles are achieved, while the turbulent heat flux is reduced by more than 50% in NT. Comparisons with results from the drift-reduced fluid turbulence code GRILLIX suggest that the turbulence is driven by trapped electron modes. The parallel heat flux width on the divertor targets is reduced in NT, primarily due to a lower spreading factor S.

GENE-X↗

Parallel Eclipse Project Checkout

Parallel Eclipse Project Checkout (PEPC) is a program written to leverage parallelism and to automate the checkout process of plug-ins created in Eclipse RCP (Rich Client Platform). Eclipse plug-ins can be aggregated in a feature project. This innovation digests a feature description (xml file) and automatically checks out all of the plug-ins listed in the feature. This resolves the issue of manually checking out each plug-in required to work on the project. To minimize the amount of time necessary to checkout the plug-ins, this program makes the plug-in checkouts parallel. After parsing the feature, a request to checkout for each plug-in in the feature has been inserted. These requests are handled by a thread pool with a configurable number of threads. By checking out the plug-ins in parallel, the checkout process is streamlined before getting started on the project. For instance, projects that took 30 minutes to checkout now take less than 5 minutes. The effect is especially clear on a Mac, which has a network monitor displaying the bandwidth use. When running the client from a developer s home, the checkout process now saturates the bandwidth in order to get all the plug-ins checked out as fast as possible. For comparison, a checkout process that ranged from 8-200 Kbps from a developer s home is now able to saturate a pipe of 1.3 Mbps, resulting in significantly faster checkouts. Eclipse IDE (integrated development environment) tries to build a project as soon as it is downloaded. As part of another optimization, this innovation programmatically tells Eclipse to stop building while checkouts are happening, which dramatically reduces lock contention and enables plug-ins to continue downloading until all of them finish. Furthermore, the software re-enables automatic building, and forces Eclipse to do a clean build once it finishes checking out all of the plug-ins. This software is fully generic and does not contain any NASA-specific code. It can be applied to any Eclipse-based repository with a similar structure. It also can apply build parameters and preferences automatically at the end of the checkout.

Crockett, Thomas M.↗

Exploring performance and energy tradeoffs for irregular applications: A case study on the Tilera many-core architecture

High performance, parallel applications with irregular data accesses are becoming a critical workload class for modern systems. In particular, the execution of such workloads on emerging many-core systems is expected to be a significant component of applications in data mining, machine learning, scientific computing and graph analytics. However, power and energy constraints limit the capabilities of individual cores, memory hierarchy and on-chip interconnect of such systems, thus leading to architectural and software trade-os that must be understood in the context of the intended application’s behavior. Irregular applications are notoriously hard to optimize given their data-dependent access patterns, lack of structured locality and complex data structures and code patterns. We have ported two irregular applications, graph community detection using the Louvain method (Grappolo) and high-performance conjugate gradient (HPCCG), to the Tilera many-core system and have conducted a detailed study of platform-independent and platform-specific optimizations that improve their performance as well as reduce their overall energy consumption. To conduct this study, we employ an auto-tuning based approach that explores the optimization design space along three dimensions - memory layout schemes, GCC compiler flag choices and OpenMP loop scheduling options. We leverage MIT’s OpenTuner auto-tuning framework to explore and recommend energy optimal choices for different combinations of parameters. We then conduct an in-depth architectural characterization to understand the memory behavior of the selected workloads. Finally, we perform a correlation study to demonstrate the interplay between the hardware behavior and application characteristics. Using auto-tuning, we demonstrate whole-node energy savings and performance improvements of up to 49:6% and 60% relative to a baseline instantiation, and up to 31% and 45:4% relative to manually optimized variants.

auto tuning↗

Temporal Stability of Surface Roughness Effects on Radar Based Soil Moisture Retrieval During the Corn Growth Cycle

A representative soil surface roughness parameterization needed for the retrieval of soil moisture from active microwave satellite observation is difficult to obtain through either in-situ measurements or remote sensing-based inversion techniques. Typically, for the retrieval of soil moisture, temporal variations in surface roughness are assumed to be negligible. Although previous investigations have suggested that this assumption might be reasonable for natural vegetation covers (Moran et al. 2002, Thoma et al. 2006), insitu measurements over plowed agricultural fields (Callens et al. 2006) have shown that the soil surface roughness can change considerably over time. This paper reports on the temporal stability of surface roughness effects on radar observations and soil moisture retrieved from these radar observations collected once a week during a corn growth cycle (May 10th - October 2002). The data set employed was collected during the Optimizing Production Inputs for Economic and Environmental Enhancement (OPE3) field campaign covering this 2002 corn growth cycle and consists of dual-polarized (HH and VV) L-band (1.6 GHz) acquired at view angles of 15, 35, and 55 degrees. Cross-polarized L baud radar data were also collected as part of this experiment, but are not used in the analysis reported on here. After accounting for vegetation effects on radar observations, time-invariant optimum roughness parameters were determined using the Integral Equation Method (IEM) and radar observations acquired over bare soil and cropped conditions (the complete radar data set includes entire corn growth cycle). The optimum roughness parameters, soil moisture retrieval uncertainty, temporal distribution of retrieval errors and its relationship with the weather conditions (e.g. rainfall and wind speed) have been analyzed. It is shown that over the corn growth cycle, temporal roughness variations due to weathering by rain are responsible for almost 50% of soil moisture retrieval uncertainty depending on the sensing configuration. The effects of surface roughness variations are found to be smallest for observations acquired at a view angle of 55 degrees and HH polarization. A possible explanation for this result is that at 55 degrees and HH polarization the effect of vertical surface height changes on the observed radar response are limited because the microwaves travel parallel to the incident plane and as a result will not interact directly with vertically oriented soil structures.

Joseph, A.T.↗

PyJMAK: An Open-Source Python Toolkit for Modeling Solid-State Metallurgical Phase Transformations

Accurate prediction of metallurgical phase transformations is an essential basis for autonomous optimization and rapid part qualification. Several methods can be used to estimate the evolution of phase fractions such as JMAK kinetics-based models, phase-field models, thermodynamic models, and data-driven machine learning models. Thermodynamic and phase-field-based methodologies solve multiphysics equations requiring numerous calibration parameters and significant computational resources. As a result, the computation domain is limited to a point or on order of micron-meters. The data-driven models rely on large datasets from experiments and simulations. While the JMAK model only provides information about phase fraction evolution, it can predict this evolution in near real-time using thermal history and thermodynamic data without restriction on the domain. JMAK models have been popularly used by researchers to model phase transformations occuring during additive manufacturing or over arbitrary temperature profiles. Commercial proprietary software such as Abaqus and Ansys or closed-source in-house implementations offer the ability to model JMAK based kinetics to predict phase transformation. However, these software packages are not open-source or freely available for use and development in conjunction with manufacturing machines, sensors, and machine learning algorithms. In addition, the use of the model is restricted by a license token. In contrast, given temperature profiles at multiple points in the domain, this Python-based PyJMAK model can compute phase evolution in parallel due to its stand-alone modular, voxel-based structure, and it can be executed on high-performance computing resources without any license restrictions.

Prabhune, Bhagya [Oak Ridge National Laboratory (O↗

Follow on Researches for X-56A Aircraft at NASA Dryden Flight Research Center (Progress Report)

A lot of composite materials are used for the modern aircraft to reduce its weight. Aircraft aeroservoelastic models are typically characterized by significant levels of model parameter uncertainty due to composite manufacturing process. Small modeling errors in the finite element model will eventually induce errors in the structural flexibility and mass, thus propagating into unpredictable errors in the unsteady aerodynamics and the control law design. One of the primary objectives of X-56A aircraft is the flight demonstration of active flutter suppression, and therefore in this study, the identification of the primary and secondary modes is based on the flutter analysis of X-56A aircraft. It should be noted that for all three Mach number cases rigid body modes and mode numbers seven and nine are participated 89.1 92.4 % of the first flutter mode. Modal participation of the rigid body mode and mode numbers seven and nine for the second flutter mode are 94.6 96.4%. Rigid body mode and the first two anti-symmetric modes, eighth and tenth modes, are participated 93.2 94.6% of the third flutter mode. Therefore, rigid body modes and the first four flexible modes of X-56A aircraft are the primary modes during the model tuning procedure. The ground vibration test-validated structural dynamic finite element model of the X-56A aircraft is to obtain in this study. The structural dynamics finite element model of X-56A aircraft is improved using the parallelized big-bang big-crunch algorithm together with a hybrid optimization technique.

Structural Dynamic Model Tuning↗

From Competence to Efficiency: A Tale of GA Progress

Genetic algorithms (GAs) - search procedures based on the mechanics of natural selection and genetics - have grown in popularity for the solution of difficult optimization problems. Concomitant with this growth has been a rising cacaphony of complaint asserting that too much time must be spent by the GA practitioner diddling with codes, operators, and GA parameters; and even then these GA cassandras continue, and the user is still unsure that the effort will meet with success. At the same time, there has been a rising interest in GA theory by a growing community - a theorocracy - of mathematicians and theoretical computer scientists, and these individuals have turned their efforts increasingly toward elegant abstract theorems and proofs that seem to the practitioner to offer little in the way of answers for GA design or practice. What both groups seem to have missed is the largely unheralded 1993 assembly of integrated, applicable theory and its experimental confirmation. This theory has done two key things. First, it has predicted that simple GAs are severely limited in the difficulty of problems they can solve, and these limitations have been confirmed experimentally. Second, it has shown the path to circumventing these limitations in nontraditional GA designs such as the fast messy GA. This talk surveys the history, methodology, and accomplishment of the 1993 applicable theory revolution. After arguing that these accomplishments open the door to universal GA competence, the paper shifts the discussion to the possibility of universal GA efficiency in the utilization of time and real estate through effective parallelization, temporal decomposition, hybridization, and relaxed function evaluation. The presentation concludes by suggesting that these research directions are quickly taking us to a golden age of adaptation.

Goldberg, David E.↗

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↗

Hybrid Solar System (Final Scientific/Technical Report)

GTI Energy (GTI) teamed with the University of California at Merced (UCM) to scaleup the hybrid solar system (HSS) technology for demonstrating its performance at the US Gypsum (USG) plant in Plaster City, California. The technology integrates two-stage concentrating solar collector with matching particle thermal transport and storage (TSS) system to deliver cost-effective, and on-demand distributed high temperature industrial process heat up to 600°C with solar thermal, in this case to a gypsum kettle, to reduce its fuel use and carbon footprint. Current solar technologies, which reach these temperatures, are not distributable (towers) or cost-effective (dish). The research team developed a conceptual system design for host site retrofit, including preliminary heat balance, process flow diagram, particle to process heat exchanger and equipment placements at the site. Subsequently, parallel efforts were carried out at UCM to design, build and test a 12 m long commercial scale prototype concentrating thermal-only collector system and at GTI to design, build and test a matching 650°C capable particle TTS system. The nominal 50 kWth collector consists of a parabolic trough and three 4 m long two-stage receivers in series. Prior to on-sun testing, a 4 m long receiver was fabricated and successfully tested at 650 °C in a laboratory setting for 100 hrs of continuous operation showing less than 15% radiation loss. A 7 m wide x 17 m long parabolic trough was then installed at UCM for on-sun testing of the 12 m long receiver, and concurrently several 4 m long receivers were built. The optics of the parabolic trough were calibrated, and on-sun test were carried out on 12 m long receivers. During tests, the intense solar radiation (53x) caused the absorber tubes in the receivers to bend, reducing the overall optical efficiency. To address the bending issue, a self-consistent algorithm that includes ray tracing, thermal and deformation models was developed to perform thermal stress analysis on absorbers for parabolic solar collectors. Results obtained with this algorithm showed a dramatic rise in deformation as absorber tube length increases. A combined efficiency parameter that includes the occluded area for the mounts was developed to obtain an optimized tube length obtained. Based on the results, a length of 2.7 m for the absorber + 0.2 m for the coupler was chosen to minimize any bending and optimize optical efficiency while maintaining ease of mounting. The associated particle TTS system was designed, built and successfully tested at GTI. It includes storage, receiving and lock hoppers and piping that simulates the transfer of captured solar energy to an actual industrial furnace. Tests over 77 charge-discharge cycles demonstrated <2% particle degradation, with no problematic particle accumulations and no flow interruptions. The piping pressure drop was about 5 psi. The team also worked with Stanley Consultants (Stanley) to prepare conceptual and preliminary engineering packages to facilitate follow-on development and commercialization efforts. These include process and instrumentation diagram’s (P&ID’s), general arrangements, electrical one-line, project definitions document, equipment data sheets, schedule, and construction cost estimate for 2 MWth system. Updated HSS technology commercialization and customer engagement plans and detailed costs and evaluated market trade-offs and manufacturing.

03 NATURAL GAS↗

Balancing Contention and Synchronization on the Intel Paragon

The Intel Paragon is a mesh-connected distributed memory parallel computer. It uses an oblivious and deterministic message routing algorithm: this permits us to develop highly optimized schedules for frequently needed communication patterns. The complete exchange is one such pattern. Several approaches are available for carrying it out on the mesh. We study an algorithm developed by Scott. This algorithm assumes that a communication link can carry one message at a time and that a node can only transmit one message at a time. It requires global synchronization to enforce a schedule of transmissions. Unfortunately global synchronization has substantial overhead on the Paragon. At the same time the powerful interconnection mechanism of this machine permits 2 or 3 messages to share a communication link with minor overhead. It can also overlap multiple message transmission from the same node to some extent. We develop a generalization of Scott's algorithm that executes complete exchange with a prescribed contention. Schedules that incur greater contention require fewer synchronization steps. This permits us to tradeoff contention against synchronization overhead. We describe the performance of this algorithm and compare it with Scott's original algorithm as well as with a naive algorithm that does not take interconnection structure into account. The Bounded contention algorithm is always better than Scott's algorithm and outperforms the naive algorithm for all but the smallest message sizes. The naive algorithm fails to work on meshes larger than 12 x 12. These results show that due consideration of processor interconnect and machine performance parameters is necessary to obtain peak performance from the Paragon and its successor mesh machines.

Bokhari, Shahid H.↗

Pool and flow boiling in variable and microgravity

As is well known, boiling is an effective mode of heat transfer in that high heat flux levels are possible with relatively small temperature differences. Its optimal application requires that the process be adequately understood. A measure of the understanding of any physical event lies in the ability to predict its behavior in terms of the relevant parameters. Despite many years of research the predictability of boiling is currently possible only for quite specialized circumstances, e.g., the critical heat flux and film boiling for the pool boiling case, and then only with special geometries. Variable gravity down to microgravity provides the opportunity to test this understanding, but possibly more important, by changing the dimensional and time scales involved permits more detailed observations of elements involved in the boiling process, and perhaps discloses phenomena heretofore unknown. The focus here is on nucleate boiling although, as will be demonstrated below, under but certain circumstances in microgravity it can take place concurrently with the dryout process. In the presence of earth gravity or forced convection effects, the latter process is usually referred to as film boiling. However, no vapor film as such forms with pool boiling in microgravity, only dryout. Initial results are presented here for pool boiling in microgravity, and were made possible at such an early date by the availability of the Get-Away-Specials (GAS). Also presented here are some results of ground testing of a flow loop for the study of low velocity boiling, eventually to take place also in microgravity. In the interim, variable buoyancy normal to the heater surface is achieved by rotation of the entire loop relative to earth gravity. Of course, this is at the expense of varying the buoyancy parallel to the heater surface. Two questions which must be resolved early in the study of flow boiling in microgravity are (1) the lower limits of liquid flow velocity where buoyancy effects become significant to the boiling process (2) the effect of lower liquid flow velocities on the Critical Heat Flux when buoyancy is removed. Results of initial efforts in these directions are presented, albeit restricted currently to the ever present earth gravity.

Merte, Herman, Jr.↗

Solving Upwind-Biased Discretizations: Multigrid Solver Using Semicoarsening - 2

This paper studies a novel multigrid approach to the solution for a second order upwind biased discretization of the convection equation in two dimensions. This approach is based on semi-coarsening and well balanced explicit correction terms added to coarse-grid operators to maintain on coarse-grid the same cross-characteristic interaction as on the target (fine) grid. Colored relaxation schemes are used on all the levels allowing a very efficient parallel implementation. The results of the numerical tests can be summarized as follows: 1) The residual asymptotic convergence rate of the proposed V(0, 2) multigrid cycle is about 3 per cycle. This convergence rate far surpasses the theoretical limit (4/3) predicted for standard multigrid algorithms using full coarsening. The reported efficiency does not deteriorate with increasing the cycle, depth (number of levels) and/or refining the target-grid mesh spacing. 2) The full multi-grid algorithm (FMG) with two V(0, 2) cycles on the target grid and just one V(0, 2) cycle on all the coarse grids always provides an approximate solution with the algebraic error less than the discretization error. Estimates of the total work in the FMG algorithm are ranged between 18 and 30 minimal work units (depending on the target (discretizatioin). Thus, the overall efficiency of the FMG solver closely approaches (if does not achieve) the goal of the textbook multigrid efficiency. 3) A novel approach to deriving a discrete solution approximating the true continuous solution with a relative accuracy given in advance is developed. An adaptive multigrid algorithm (AMA) using comparison of the solutions on two successive target grids to estimate the accuracy of the current target-grid solution is defined. A desired relative accuracy is accepted as an input parameter. The final target grid on which this accuracy can be achieved is chosen automatically in the solution process. the actual relative accuracy of the discrete solution approximation obtained by AMA is always better than the required accuracy; the computational complexity of the AMA algorithm is (nearly) optimal (comparable with the complexity of the FMG algorithm applied to solve the problem on the optimally spaced target grid).

Diskin, Boris↗