Search NASA⌕ Search

SEARCH · Search NASA

Results for “Parallel application”

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,675 records · Page 93

PRIMA-X Final Report

The PRIMA-X (Performance Retargeting of Instrumentation, Measurement, and Analysis Technologies for Exascale Computing) project is the successor of the DOE PRIMA (Performance Refactoring of Instrumentation, Measurement, and Analysis Technologies for Petascale Computing) project, which addressed the challenge of creating a core measurement infrastructure that would serve as a common platform for both integrating leading parallel performance systems (notably TAU and Scalasca) and developing next-generation scalable performance tools. The PRIMA-X project shifts the focus away from refactorization of robust performance tools towards a re-targeting of the parallel performance measurement and analysis architecture for extreme scales. The massive concurrency, asynchronous execution dynamics, hardware heterogeneity, and multi-objective prerequisites (performance, power, resilience) that identify exascale systems introduce fundamental constraints on the ability to carry forward existing performance methodologies. In particular, there must be a deemphasis of per-thread observation techniques to significantly reduce the otherwise unsustainable flood of redundant performance data. Instead, it will be necessary to assimilate multi-level resource observations into macroscopic performance views, from which resilient performance metrics can be attributed to the computational features of the application. This requires a scalable framework for node-level and system-wide monitoring and runtime analyses of dynamic performance information. Also, the interest in optimizing parallelism parameters with respect to performance and energy drives the integration of tool capabilities in the exascale environment further. Initially, PRIMA-X was a collaborative project between the University of Oregon (lead institution) and the German Research School for Simulation Sciences (GRS). Because Prof. Wolf, the PI at GRS, accepted a position as full professor at Technische Universität Darmstadt (TU Darmstadt) starting February 1st, 2015, the project ended at GRS on January 31st, 2015. This report reflects the work accomplished at GRS until then. The work of GRS is expected to be continued at TU Darmstadt. The first main accomplishment of GRS is the design of different thread-level aggregation techniques. We created a prototype capable of aggregating the thread-level information in performance profiles using these techniques. The next step will be the integration of the most promising techniques into the Score-P measurement system and their evaluation. The second main accomplishment is a substantial increase of Score-P’s scalability, achieved by improving the design of the system-tree representation in Score-P’s profile format. We developed a new representation and a distributed algorithm to create the scalable system tree representation. Finally, we developed a lightweight approach to MPI wait-state profiling. Former algorithms either needed piggy-backing, which can cause significant runtime overhead, or tracing, which comes with its own set of scaling challenges. Our approach works with local data only and, thus, is scalable and has very little overhead.

97 MATHEMATICS AND COMPUTING↗

Simulation and Controls for Heavy Duty Dual Mode Hybrid Powertrain (Final CRADA Report)

Hybrid powertrains are of considerable interest because of potential reductions in fuel consumption, criteria pollutants and green house gas (GHG) emissions. Parallel hybrids have been applied to light and medium duty trucks, where urban driving cycles are prevalent, while series hybrids have been successfully used for other applications like transit and school buses. Unfortunately, hybridization of the Class 8, heavy-duty (HD) powertrain is inherently challenging due the expected long-haul driving requirements and limited opportunities for regenerative braking. The Participant has conceived and demonstrated a transformational Dual Mode Hybrid Powertrain (DMHP) technology developed specifically for the needs and function of Class 8 line haul trucks. The DMHP system enables a new paradigm in powertrain operational efficiency in the Class 8 truck segment. It decouples the connection between the engine operating point and the truck road load demands over a broad operating range through an innovative hybrid design. The DMHP operation choices include running in full series, full parallel and engine-off modes. The DMHP offers the opportunity for an engine to operate in a narrow range, thus providing a strategy for maximized fuel economy and minimized emissions. Further, it is expected that transient torque and power wheel demands are handled in whole or part by the electric system, thus reducing the frequency and intensity of engine transients and further improving the fuel economy and emissions. Fuel consumption and emissions have been further reduced through the elimination of overnight hoteling and idling at stops. Finally, based on the unique operating profile of an engine integrated into our hybrid powertrain, a transformational HD truck engine design concept next can emerge. Recent research activities by Oak Ridge National Laboratory (ORNL) have yielded significant data in real-life speed and load profiles of Class 8, long haul trucks. In addition, preliminary simulations of the DMHP carried out by ORNL reveal significant optimization opportunities of the DMHP by applying systematic simulation and controls approaches. An improved understanding of the complex interactions offered by the on-board engine, energy storing system, and electric machines is necessary for the development of control methodologies and practical implementation. We will continue to further this understanding through detailed experimentation and modeling, drawing on and expanding ORNL’s core competency in basic engine research and development (R&D) and advanced controls. This knowledge will be used to develop, implement, and evaluate control strategies on an actual DMHP using Meritor’s components and subsystems. Our initial focus will be on optimization of DMHP utilizing a “stock” diesel engine that is commercially available in the market place. A new DMHP-specific engine design concept will be pursued at a later phase of this Cooperative Research and Development Agreement (CRADA). Meritor will develop the experimental setup, conduct sub-system experiments at their facility, and implement and evaluate potential control strategies resulting from this CRADA partnership. Oak Ridge National Laboratory (ORNL) will develop a real-time simulation model for use in real-time control of the DMHP. The model and potential algorithms will be evaluated on a HD, hybrid powertrain dynamometer facility that will also be developed at the ORNL Vehicle Systems Integration facility.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Parallel multiple-chain DRAM MCMC for large-scale geosteering inversion and uncertainty quantification

Geosteering is the proactive control of a wellbore placement based on the downhole measurements, aiming at maximizing economic production from the well. We report the recent development of azimuthal resistivity logging-whiledrilling (LWD) tools have a much larger depth of detection, thus sets higher demands for geosteering inversion as more unknown parameters need to be taken into account in the earth model to be inverted. For complicated nonlinear problems, traditional deterministic inversion methods are more likely to be trapped near local optima. In general, Markov chain Monte Carlo (MCMC) inversion methods are more capable of finding the global optimal solution and providing additional uncertainty analyses by sampling from the target distribution. However, MCMC methods usually have the problem of slow convergence. Even though optimization methods like delayed rejection (DR) and adaptive Metropolis (AM) were proposed to speed up the convergence, using MCMC methods to solve geosteering inversion problems may still incur unacceptable time cost. To reduce the sampling cost of MCMC methods, we use parallel multiple-chain DRAM MCMC methods to solve geosteering inverse problems and estimate the corresponding uncertainty. A clustering method, density-based spatial clustering of applications with noise (DBSCAN), is applied to select the best solution among many results. Lastly, the simulation results show that running many relatively short MCMC chains for one problem can obtain a similar result as running a long single chain. Besides, avoiding communications between multiple Markov chains during the sampling process yields almost linear scalability.

97 MATHEMATICS AND COMPUTING↗

Three-dimensional anisotropic pressure free boundary equilibria

Free boundary three-dimensional anisotropic pressure magnetohydrodynamic equilibria with nested magnetic flux surfaces are computed through the minimisation of the plasma energy functional W = integral(V) d(3)x[B-2/(2 mu(0)) + p(parallel to)/(Gamma - 1)]. The plasma-vacuum interface is varied to guarantee the continuity of the total pressure [p(perpendicular to) + B-2/(2 mu(0))] across it and the vacuum magnetic field must satisfy the Neumann bo undary condition that its component normal to this interfaced surface vanishes. The vacuum magnetic field corresponds to that driven by the plasma current and external coils plus the gradient of a potential function whose solution is obtained using a Green's function method. The energetic particle contributions to the pressure are evaluated analytically from the moments of the variant of a bi-Maxwellian distribution function that satisfies the constraint B . del F-h = 0. Applications to demonstrate the versatility and reliability of the numerical method employed have concentrated on high-beta off-axis energetic particle deposition with large parallel and perpendicular pressure anisotropies in a 2-field period quasiaxisymmetric stellarator reactor system. For large perpendicular pressure anisotropy, the hot particle component of the p(perpendicular to) distribution localises in the regions where the energetic particles are deposited. For large parallel pressure anisotropy. the pressures are more uniform around the flux surfaces. (C) 2009 Elsevier B.V. All rights reserved.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Cabana: A Performance Portable Library for Particle-Based Simulations

Particle-based simulations are ubiquitous throughout many fields of computational science and engineering, spanning the atomistic level with molecular dynamics (MD), to mesoscale particle-in-cell (PIC) simulations for solid mechanics, device-scale modeling with PIC methods for plasma physics, and massive N-body cosmology simulations of galaxy structures, with many other methods in between (Hockney & Eastwood, 1989). While these methods use particles to represent significantly different entities with completely different physical models, many low-level details are shared including performant algorithms for short- and/or long-range particle interactions, multi-node particle communication patterns, and other data management tasks such as particle sorting and neighbor list construction. Cabana is a performance portable library for particle-based simulations, developed as part of the Co-Design Center for Particle Applications (CoPA) within the Exascale Computing Project (ECP) (Alexander et al., 2020). The CoPA project and its full development scope, including ECP partner applications, algorithm development, and similar software libraries for quantum MD, is described in (Mniszewski et al., 2021). Cabana uses the Kokkos library for on-node parallelism (Edwards et al., 2014; Trott et al., 2022), enabling simulation on multi-core CPU and GPU architectures, and MPI for GPU-aware, multi-node communication. Cabana provides particle simulation capabilities on almost all current Kokkos backends, including serial execution, OpenMP (including OpenMP-Target for GPUs), CUDA (NVIDIA GPUs), HIP (AMD GPUs), and SYCL (Intel GPUs), providing a clear path for the coming generation of accelerator-based exascale hardware. Cabana builds on Kokkos by providing new particle data structures and particle algorithms resulting in a similar execution policy-based, node-level programming model that is intended to be used in addition to the core Kokkos library within an application. Cabana is designed as an application and physics agnostic, but particle-specific toolkit which can either be used to generate a new application, or to be used as needed in existing applications at various levels of invasiveness including through interfaces that wrap user memory in existing data structures.

97 MATHEMATICS AND COMPUTING↗

ICED: An Integrated CGRA Framework Enabling DFVS-Aware Acceleration

oarse-grained reconfigurable arrays (CGRAs) are a promising solution to enable energy-efficient acceleration of applications from different domains. By leveraging reconfiguration at the functional level, they can adapt to significantly different computational patterns. Existing CGRA mapping approaches extract instruction-level parallelism, exploit loop-pipelining opportunities, guarantee the data dependency, and target high throughput of a given loop. However, the recurrence data-dependency in the DFG and the mismatch between required and available computing/communication resources complicate the mapping, and might lead to significant unbalances in the utilization of the CGRA's tiles. This results in wasted power for tiles with low utilization. Applying dynamic voltage and frequency scaling (DVFS) can potentially solve this challenge and improve energy efficiency by adjusting voltage and frequency of different tiles independently. CGRAs have also been successful in accelerating data-dependent streaming applications. However, in these applications, the execution time of each kernel in the pipeline might dynamically vary depending on the characteristics of the input. This also leads to under-utilization of resources for the dynamically changing kernels that do not limit the application throughput. DVFS can also improve energy efficiency for these applications by dynamically changing the voltage and frequency levels of tiles that host non performance-constraining kernels. This paper proposes ICEDTEA -- an integrated DVFS-aware framework to map applications on CGRAs that support power islands. ICEDTEA proposes a CGRA architecture supporting DVFS islands at varying granularity (from a single tile to a group of tiles) and the related DVFS-aware compilation and mapping toolchain. ICEDTEA is the first work that introduces DVFS support for spatio-temporal CGRAs at power-island levels. The experimental evaluation shows that ICEDTEA improves average utilization by 2.3$\times$ and energy-efficiency by 1.32$\times$ over a conventional CGRA. With streaming applications, ICEDTEA improves energy efficiency by 1.12$\times$ over a state-of-the-art CGRA that introduces partial dynamic reconfiguration to adapt to variations in kernels' throughput.

Tan, Cheng↗

Progress on PRONGHORN Application to NGNP Related Problems

We are developing a multiphysics simulation tool for Very High-Temperature gascooled Reactors (VHTR). The simulation tool, PRONGHORN, takes advantages of the Multiphysics Object-Oriented Simulation library, and is capable of solving multidimensional thermal-fluid and neutronics problems implicitly in parallel. Expensive Jacobian matrix formation is alleviated by the Jacobian-free Newton-Krylov method, and physics-based preconditioning is applied to improve the convergence. The initial development of PRONGHORN has been focused on the pebble bed corec concept. However, extensions required to simulate prismatic cores are underway. In this progress report we highlight progress on application of PRONGHORN to PBMR400 benchmark problems, extension and application of PRONGHORN to prismatic core reactors, and progress on simulations of 3-D transients.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Differential evolution Markov chain with snooker updater and fewer chains

Differential Evolution Markov Chain (DE-MC) is an adaptive MCMC algorithm, in which multiple chains are run in parallel. Standard DE-MC requires at least N=2d chains to be run in parallel, where d is the dimensionality of the posterior. This paper extends DE-MC with a snooker updater and shows by simulation and real examples that DE-MC can work for d up to 50--100 with fewer parallel chains (e.g. N=3) by exploiting information from their past by generating jumps from differences of pairs of past states. This approach extends the practical applicability of DE-MC and is shown to be about 5--26 times more efficient than the optimal Normal random walk Metropolis sampler for the 97.5% point of a variable from a 25--50 dimensional Student T{sub 3} distribution. In a nonlinear mixed effects model example the approach outperformed a block-updater geared to the specific features of the model.

97 MATHEMATICS AND COMPUTING↗

TOUGH3: A new efficient version of the TOUGH suite of multiphase flow and transport simulators

The TOUGH suite of nonisothermal multiphase flow and transport simulators has been updated by various developers over many years to address a vast range of challenging subsurface problems. The increasing complexity of the simulated processes as well as the growing size of model domains that need to be handled call for an improvement in the simulator's computational robustness and efficiency. Moreover, modifications have been frequently introduced independently, resulting in multiple versions of TOUGH that (1) led to inconsistencies in feature implementation and usage, (2) made code maintenance and development inefficient, and (3) caused confusion to users and developers. TOUGH3—a new base version of TOUGH—addresses these issues. It consolidates both the serial (TOUGH2 V2.1) and parallel (TOUGH2-MP V2.0) implementations, enabling simulations to be performed on desktop computers and supercomputers using a single code. New PETSc parallel linear solvers are added to the existing serial solvers of TOUGH2 and the Aztec solver used in TOUGH2-MP. The PETSc solvers generally perform better than the Aztec solvers in parallel and the internal TOUGH3 linear solver in serial. TOUGH3 also incorporates many new features, addresses bugs, and improves the flexibility of data handling. So due to the improved capabilities and usability, TOUGH3 is more robust and efficient for solving tough and computationally demanding problems in diverse scientific and practical applications related to subsurface flow modeling.

97 MATHEMATICS AND COMPUTING↗

Synthesis of ZnTe dendrites on multi-walled carbon nanotubes/polyimide nanocomposite membrane by electrochemical atomic layer deposition and photoelectrical property research

We report on the electrochemical atomic layer deposition (EC-ALD) of ZnTe dendrites on the carboxyl-functionalized multi-walled carbon nanotubes/polyimide (COOH-MWCNTs/PI) membrane. Electrochemical characteristics were studied by cyclic voltammetry (CV) and the deposition of ZnTe dendrites was completed using amperometric method (I-t). The prepared ZnTe dendrites were characterized by X-ray diffraction (XRD), scanning electron microscopy (SEM) and transmission electron microscopy (TEM). The growth mechanism of ZnTe dendrites was elucidated to give a deep understanding of crystal growth. The concentration of reagents and deposition cycle had a significant effect on the morphology and structure of deposits. UV-vis transmission study indicated a direct band gap of 2.26 eV. Photoelectrical measurement confirmed the p-type conductivity of ZnTe dendrites, which indicated that the dendritic ZnTe crystals may have potential practical application in optoelectronic devices. - Graphical abstract: Representative SEM images of ZnTe dendrites. (a) Panorama of ZnTe dendrites; (b) a single dendrite. The regular branches appeared like leaves and showed a parallel arrangement layer upon layer between each other. Highlights: Black-Right-Pointing-Pointer ZnTe dendrites were successfully synthesized on CNTs/PI membrane by electrodeposition. Black-Right-Pointing-Pointer The growth mechanism of ZnTe dendritic structures was investigated in detail. Black-Right-Pointing-Pointer The concentration and deposition cycle greatly affected the morphology of ZnTe. Black-Right-Pointing-Pointer OCP and I-t studies showed that ZnTe can be beneficial to photoelectric applications.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

2016 High Performance Computing Annual Report

Sandia National Laboratories’ California site is celebrating its 60th anniversary (1956 to 2016), and high performance computing has been a key enabler for its scientists and engineers throughout much of its history. Since its founding, Sandia California has helped pioneer the use of HPC platforms including hosting Sandia’s first Cray-1 supercomputer in the 1970s and supporting development of scalable cluster computing platforms to create a new paradigm for cost-effective supercomputing in the 1990s. Recent decades of investment in creation of scalable application frameworks for scientific computing have also enabled new generations of modeling and simulation codes. These resources have facilitated computational analysis of complex phenomena in diverse applications spanning national defense, energy, and homeland security. Today, Sandia California researchers work with partners in academia, industry, and national labs to evolve the state-of-the-art in HPC, modeling, and data analysis (including foundational capabilities for exascale computing platforms) and apply them in transformational ways. Research efforts include mitigating the effects of silent hardware failures that can jeopardize the results of large-scale computations, developing exascale-capable asynchronous task-parallel programming models and runtime systems, formulating new techniques to better explore and analyze extreme-scale data sets, and increasing our understanding of materials and chemical sciences which has applications spanning nuclear weapons stockpile stewardship to more efficient automobile engines. The following section highlights some of these research and applications projects and further illustrates the breadth of our HPC capabilities.

97 MATHEMATICS AND COMPUTING↗

Lightweight storage and overlay networks for fault tolerance.

The next generation of capability-class, massively parallel processing (MPP) systems is expected to have hundreds of thousands to millions of processors, In such environments, it is critical to have fault-tolerance mechanisms, including checkpoint/restart, that scale with the size of applications and the percentage of the system on which the applications execute. For application-driven, periodic checkpoint operations, the state-of-the-art does not provide a scalable solution. For example, on today's massive-scale systems that execute applications which consume most of the memory of the employed compute nodes, checkpoint operations generate I/O that consumes nearly 80% of the total I/O usage. Motivated by this observation, this project aims to improve I/O performance for application-directed checkpoints through the use of lightweight storage architectures and overlay networks. Lightweight storage provide direct access to underlying storage devices. Overlay networks provide caching and processing capabilities in the compute-node fabric. The combination has potential to signifcantly reduce I/O overhead for large-scale applications. This report describes our combined efforts to model and understand overheads for application-directed checkpoints, as well as implementation and performance analysis of a checkpoint service that uses available compute nodes as a network cache for checkpoint operations.

99 GENERAL AND MISCELLANEOUS↗

Design for Recycling Principles Applicable to Selected Clean Energy Technologies: Crystalline-Silicon Photovoltaic Modules, Electric Vehicle Batteries, and Wind Turbine Blades

Abstract The global growth of clean energy technology deployment will be followed by parallel growth in end-of-life (EOL) products, bringing both challenges and opportunities. Cumulatively, by 2050, estimates project 78 million tonnes of raw materials embodied in the mass of EOL photovoltaic (PV) modules, 12 billion tonnes of wind turbine blades, and by 2030, 11 million tonnes of lithium-ion batteries. Owing partly to concern that the projected growth of these technologies could become constrained by raw material availability, processes for recycling them at EOL continue to be developed. However, none of these technologies are typically designed with recycling in mind, and all of them present challenges to efficient recycling. This article synthesizes and extends design for recycling (DfR) principles based on a review of published industrial and academic best practices as well as consultation with experts in the field. Specific principles developed herein apply to crystalline-silicon PV modules, batteries like those used in electric vehicles, and wind turbine blades, while a set of broader principles applies to all three of these technologies and potentially others. These principles are meant to be useful for stakeholders—such as research and development managers, analysts, and policymakers—in informing and promoting decisions that facilitate DfR and, ultimately, increase recycling rates as a way to enhance the circularity of the clean energy economy. The article also discusses some commercial implications of DfR. Graphical Abstract

36 MATERIALS SCIENCE↗

Proceedings of ISEC 2008, International Solvent Extraction Conference - Solvent Extraction: Fundamentals to Industrial Applications

The North American industry has employed major solvent-extraction processes to support a wide range of separations including but not limited to chemical, metallurgical, nuclear, biochemical, pharmaceutical, and petroleum applications. The knowledge enabling these separations has been obtained through fundamental studies in academe, government and industry. The International Solvent Extraction Conferences have been and continue to be a major gathering of scientists, engineers, operators, and vendors from around the world, who present new findings since the last meeting, exchange ideas, make business contacts, and conduct collegial discussions. The ISEC 2008 program emphasizes fundamentals to industrial applications of solvent extraction, particularly how this broad spectrum of activities is interconnected and has led to the implementation of novel processes. The oral and poster sessions have been organized into seven topics: Fundamentals; Novel Reagents, Materials and Techniques; Nuclear Fuel Reprocessing; Hydrometallurgy and Metals Extraction; Analytical and Preparative Applications; Biotechnology, Pharmaceuticals, Life-Science Products, and Organic Products; and Process Chemistry and Engineering. Over 350 abstracts were received, resulting in more than 260 manuscripts published in these proceedings. Five outstanding plenary presentations have been identified, with five parallel sessions for oral presentations and posters. In recognition of the major role solvent extraction (SX) plays in the hydrometallurgical and nuclear industries, these proceedings begin with sections focusing on hydrometallurgy, process chemistry, and engineering. More fundamental topics follow, including sections on novel reagents, materials, and techniques, featuring novel applications in analytical and biotechnology areas. Despite the diversity of topics and ideas represented, however, the primary focus of the ISEC community continues to be metals extraction. Four papers from these proceedings have been entered already in INIS in the form of individual reports. Among the remaining papers, 60 have been selected from the following sessions: Plenary Lectures, Hydrometallurgy and Metals Extraction, Nuclear Fuel Reprocessing, Analytical and Preparative Applications, Fundamentals, and Novel Reagents, Materials, and Techniques.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Task Parallel Incomplete Cholesky Factorization using 2D Partitioned-Block Layout

We introduce a task-parallel algorithm for sparse incomplete Cholesky factorization that utilizes a 2D sparse partitioned-block layout of a matrix. Our factorization algorithm follows the idea of algorithms-by-blocks by using the block layout. The algorithm-byblocks approach induces a task graph for the factorization. These tasks are inter-related to each other through their data dependences in the factorization algorithm. To process the tasks on various manycore architectures in a portable manner, we also present a portable tasking API that incorporates different tasking backends and device-specific features using an open-source framework for manycore platforms i.e., Kokkos. A performance evaluation is presented on both Intel Sandybridge and Xeon Phi platforms for matrices from the University of Florida sparse matrix collection to illustrate merits of the proposed task-based factorization. Experimental results demonstrate that our task-parallel implementation delivers about 26.6x speedup (geometric mean) over single-threaded incomplete Choleskyby- blocks and 19.2x speedup over serial Cholesky performance which does not carry tasking overhead using 56 threads on the Intel Xeon Phi processor for sparse matrices arising from various application problems.

2D layout↗

Scalable load-balance measurement for SPMD codes

Good load balance is crucial on very large parallel systems, but the most sophisticated algorithms introduce dynamic imbalances through adaptation in domain decomposition or use of adaptive solvers. To observe and diagnose imbalance, developers need system-wide, temporally-ordered measurements from full-scale runs. This potentially requires data collection from multiple code regions on all processors over the entire execution. Doing this instrumentation naively can, in combination with the application itself, exceed available I/O bandwidth and storage capacity, and can induce severe behavioral perturbations. We present and evaluate a novel technique for scalable, low-error load balance measurement. This uses a parallel wavelet transform and other parallel encoding methods. We show that our technique collects and reconstructs system-wide measurements with low error. Compression time scales sublinearly with system size and data volume is several orders of magnitude smaller than the raw data. The overhead is low enough for online use in a production environment.

99 GENERAL AND MISCELLANEOUS↗

Array-based Hierarchical Mesh Generation in Parallel

In this paper, we describe an array-based hierarchical mesh generation capability through uniform refinement of unstructured meshes for efficient solution of PDE's using finite element methods and multigrid solvers. A multi-degree, multi-dimensional and multi-level framework is designed to generate the nested hierarchies from an initial mesh that can be used for a number of purposes such as multi-level methods to generating large meshes. The capability is developed under the parallel mesh framework “Mesh Oriented dAtaBase” a.k.a MOAB. We describe the underlying data structures and algorithms to generate such hierarchies and present numerical results for computational efficiency and mesh quality. In conclusion, we also present results to demonstrate the applicability of the developed capability to a multigrid finite-element solver.

97 MATHEMATICS AND COMPUTING↗

Monte Carlo Techniques for Nuclear Systems - Theory Lectures

These are lecture notes for a Monte Carlo class given at the University of New Mexico. The following topics are covered: course information; nuclear eng. review & MC; random numbers and sampling; computational geometry; collision physics; tallies and statistics; eigenvalue calculations I; eigenvalue calculations II; eigenvalue calculations III; variance reduction; parallel Monte Carlo; parameter studies; fission matrix and higher eigenmodes; doppler broadening; Monte Carlo depletion; HTGR modeling; coupled MC and T/H calculations; fission energy deposition. Solving particle transport problems with the Monte Carlo method is simple - just simulate the particle behavior. The devil is in the details, however. These lectures provide a balanced approach to the theory and practice of Monte Carlo simulation codes. The first lectures provide an overview of Monte Carlo simulation methods, covering the transport equation, random sampling, computational geometry, collision physics, and statistics. The next lectures focus on the state-of-the-art in Monte Carlo criticality simulations, covering the theory of eigenvalue calculations, convergence analysis, dominance ratio calculations, bias in Keff and tallies, bias in uncertainties, a case study of a realistic calculation, and Wielandt acceleration techniques. The remaining lectures cover advanced topics, including HTGR modeling and stochastic geometry, temperature dependence, fission energy deposition, depletion calculations, parallel calculations, and parameter studies. This portion of the class focuses on using MCNP to perform criticality calculations for reactor physics and criticality safety applications. It is an intermediate level class, intended for those with at least some familiarity with MCNP. Class examples provide hands-on experience at running the code, plotting both geometry and results, and understanding the code output. The class includes lectures & hands-on computer use for a variety of Monte Carlo calculations. Beginning MCNP users are encouraged to review LA-UR-09-00380, "Criticality Calculations with MCNP: A Primer (3nd Edition)" (available at http:// mcnp.lanl.gov under "Reference Collection") prior to the class. No Monte Carlo class can be complete without having students write their own simple Monte Carlo routines for basic random sampling, use of the random number generator, and simplified particle transport simulation.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗