Search NASA⌕ Search

SEARCH · Search NASA

Results for “parallel system”

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 631 records · Page 35
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Misuse Detection for a Generalized SFR Test Reactor

Sodium-cooled Fast Reactors (SFRs) present unique challenges for international safeguards. SFRs possess neutron physics characteristics that if configured appropriately could produce more fissile material than consumed. An adversary state may choose to build an SFR, justified by a lack of domestic natural uranium and limited access or interest to procuring uranium from international markets. Once constructed, the state may choose to misuse the SFR for the purpose of diverting fissile plutonium from declared operation. This work shows that a demonstration SFR does not need to be configured as a plutonium breeder to create one Significant Quantity (SQ) of plutonium in a short amount of time (e.g., one to few years). However, such an extreme case of misuse would change the core reactivity in such a way as to be easily indicated by deviations of control rod position compared to declared operation. In this work a contrived SFR demonstration reactor was modeled for the purpose of exploring proliferation scenarios and how such misuse could be detected using the SFR's Reactor Data Acquisition System (RDAS). Typically, the International Atomic Energy Agency (IAEA) does not have access to the control rod position, power, thermal, pressure sensing and indicating systems of nuclear power plants. However, this work shows that such data streams can be compared against a parallel detailed simulation model (a Digital Twin) to detect possible misuse.

98 NUCLEAR DISARMAMENT, SAFEGUARDS, AND PHYSICAL P↗
DOE OSTI2021

Permutationally Invariant Polynomial Expansions with Unrestricted Complexity

A general strategy is presented for constructing and validating permutationally invariant polynomial (PIP) expansions for chemical systems of any stoichiometry. Demonstrations are made for three categories of gas-phase dynamics and kinetics: collisional energy-transfer trajectories for predicting pressure-dependent kinetics, three-body collisions for describing transient van der Waals adducts relevant to atmospheric chemistry, and nonthermal reactivity via quasiclassical trajectories. In total, 30 systems are considered with up to 15 atoms and 39 degrees of freedom. Permutational invariance is enforced in PIP expansions with as many as 13 million terms and 13 permutationally distinct atom types by taking advantage of petascale computational resources. The quality of the PIP expansions is demonstrated through the systematic convergence of in-sample and out-of-sample errors with respect to both the number of training data and the order of the expansion, and these errors are shown to predict errors in the dynamics for both reactive and nonreactive applications. Here, the parallelized code distributed as part of this work enables the automation of PIP generation for complex systems with multiple channels and flexible user-defined symmetry constraints and for automatically removing unphysical unconnected terms from the basis set expansions, all of which are required for simulating complex reactive systems.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2024

Kinetic simulations comparing quasi-parallel and quasi-perpendicular piston-driven collisionless shock dynamics in magnetized laboratory plasmas

Magnetized collisionless shocks are common in astrophysical systems, and scaled versions can be created in laboratory experiments by utilizing laser-driven piston plasmas to create these shocks in a magnetized background plasma. A key parameter for these experiments is the angle θB between the shock propagation direction and the background magnetic field. We performed quasi-1D piston-driven shock simulations to explore shock formation, evolution, and key observables relevant to laboratory experiments for a range of shock angles between θB=90° to θB=30°. Our results show that the spatial and temporal scales of shock formation for all angles considered are similar when expressed in terms of the perpendicular component of the magnetic field. In a steady state, ion and electron temperatures become more isotropic, and the electron-to-ion temperature ratio is higher for smaller θB. At θB=30°, ion heating parallel to the magnetic field becomes dominant, associated with more ions being reflected at one discontinuity and subsequently trapped by the next discontinuity due to shock reformation.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2022

Thermal Neutron Scattering Cross Sections for Graphitic Amorphous Carbon

Carbon materials are commonly found in both nuclear reactors and experimental systems. Various carbon structures occur in nuclear applications ranging from crystalline and nuclear graphite to the amorphous carbon seen in next-generation advanced reactor designs. Amorphous carbon is based on a randomized graphite-like structure and offers the unique ability to disperse impurities throughout the bulk composition. A graphite-like amorphous carbon system was modeled using the classical molecular dynamics (MD) code LAMMPS (Large-scale Atomic/Molecular Massively Parallel Simulator). An improved version of the temperature-dependent Adaptive Intermolecular Reactive Empirical Bond Order (AIREBO) potential was used to model the carbon-carbon atomic interactions for the temperature at 300 K along with densities 1.60, 1.70, 1.85, and 2.23 g/cm 3 . From the normalized velocity autocorrelation function (VACF), the phonon density of state (DOS) was then calculated as the Fourier transform of the normalized VACF. This DOS was then used as the primary input for the evaluation of the thermal scattering law (TSL, i.e. S(α,β)) and associated neutron thermal scattering cross sections. The TSL was analyzed using the Full Law Analysis Scattering System Hub (FLASSH). The amorphous structure results in shifts of the phonon DOS to lower energy modes than typically displayed for ideal crystalline graphite. This impact on the DOS is directly reflected in the TSL. Furthermore, the typical features and the optical graphitic peak at 0.25 eV for the ideal graphite DOS disappear for graphite-like amorphous carbon, which shows good agreement with the expected structure.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2022

Thermal neutron scattering cross sections for amorphous carbon

Carbon materials are commonly found in both nuclear reactors and experimental systems. Various carbon structures occur in nuclear applications ranging from crystalline and nuclear graphite to the amorphous carbon seen in next-generation advanced reactor designs. Amorphous carbon is based on a randomized graphite-like structure and offers the unique ability to disperse impurities throughout the bulk composition. A graphite-like amorphous carbon system was modeled using the classical molecular dynamics (MD) code LAMMPS (Large-scale Atomic/Molecular Massively Parallel Simulator). An improved version of the temperature-dependent Adaptive Intermolecular Reactive Empirical Bond Order (AIREBO) potential was used to model the carbon-carbon atomic interactions for the temperature at 300 K along with densities 1.60, 1.70, 1.85, and 2.23 g/cm{sup 3}. From the normalized velocity autocorrelation function (VACF), the phonon density of state (DOS) was then calculated as the Fourier transform of the normalized VACF. This DOS was then used as the primary input for the evaluation of the thermal scattering law (TSL, i.e. S(α,β)) and associated neutron thermal scattering cross sections. The TSL was analyzed using the Full Law Analysis Scattering System Hub (FLASSH). The amorphous structure results in shifts of the phonon DOS to lower energy modes than typically displayed for ideal crystalline graphite. This impact on the DOS is directly reflected in the TSL. Furthermore, the typical optical peak at 0.25 eV for the ideal graphite disappears for amorphous carbon, in good agreement with the expected structure. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2026

MFC 5.0: An exascale many-physics flow solver

Many problems of interest in engineering, medicine, and the fundamental sciences rely on high-fidelity flow simulation, making performant computational fluid dynamics solvers a mainstay of the open-source software community. Previous work MFC 3.0 was made a published, documented, and open-source solver via Bryngelson et al. Comp. Phys. Comm. (2021) with numerous physical features, numerical methods, and scalable infrastructure. MFC 5.0 is a significant update to MFC 3.0, featuring a broad set of well-established and novel physical models and numerical methods, as well as the introduction of GPU and APU (or superchip) acceleration. Here, we exhibit state-of-the-art performance and ideal scaling on the first two exascale supercomputers, OLCF Frontier and LLNL El Capitan. Combined with MFC’s single-accelerator performance, MFC achieves exascale computation in practice, and achieved the largest-to-date public CFD simulation at 200 trillion grid points as a 2025 ACM Gordon Bell Prize finalist. New physical features include the immersed boundary method, N-fluid phase change, Euler–Euler and Euler–Lagrange sub-grid bubble models, fluid-structure interaction, hypo- and hyper-elastic materials, chemically reacting flow, two-material surface tension, magnetohydrodynamics (MHD), and more. Numerical techniques now represent the current state-of-the-art, including general relaxation characteristic boundary conditions, WENO variants, Strang splitting for stiff sub-grid flow features, and low Mach number treatments. Weak scaling to tens of thousands of GPUs on OLCF Summit and Frontier and LLNL El Capitan achieves efficiencies within 5% of ideal to over 90% of their respective system sizes. Strong scaling results for a 16-times increase in device count show parallel efficiencies over 90% on OLCF Frontier. MFC’s software stack has undergone further improvements, including continuous integration, which ensures code resilience and correctness through over 300 regression tests; metaprogramming, which reduces code length while maintaining performance portability; and code generation for computing chemical reactions

Computational fluid dynamics↗
DOE OSTI2020

Efficient Treatment of Large Active Spaces through Multi-GPU Parallel Implementation of Direct Configuration Interaction

In this study, we have extended our graphical processing unit (GPU)-accelerated direct configuration interaction program to multiple devices, reducing iteration times for configuration spaces of 165 million determinants to only 3 s using NVIDIA P100 GPUs. Similar improvements in the one- and two-particle reduced density matrix formation allow for fast analytical energy gradients and electronic properties. Our parallel algorithm enables the calculation of arbitrarily large configuration spaces (limited only by available system memory), with iteration times of 13 min for an active space of 18 electrons in 18 orbitals (2.4 billion determinants) using six consumer grade NVIDIA 1080Ti GPUs. These advances enable routine molecular dynamics simulations, geometry optimizations, and absorption spectrum calculations for molecules with large configuration spaces, a task that has heretofore required massive computational effort. In this work, we demonstrate the utility of our program by generating the absorption spectrum for diphenyl acetylene at the floating occupation molecular orbital complete active space configuration interaction level of theory. Lastly, several active spaces were investigated to assess the dependence of spectral features on orbital space dimension.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2024

Monte Carlo Explicitly Correlated Second-Order Many-Body Green’s Function Calculations of Semiconductor Band Gaps

A systematically converging series of ab initio, post-density-functional, size-consistent, electron-correlated approximations is desired for predictive computing of felectronic band structures of insulating, semiconducting, and metallic solids. A series that meets all of these desiderata (except the applicability to metals) is ab initio many-body Green's function theory based on Gaussian-type-orbital (GTO) basis sets. Here, its leading-order approximation, the second-order Green's function (GF2) method in the diagonal and frequency-independent approximations with the aug-cc-pVDZ basis set, is applied to the fundamental band gaps of three semiconductors (diamond, silicon, and silicon carbide in the zincblende structure) using cluster models. Corrections are made to the basis-set-incompleteness errors by the explicit-correlation (F12) ansatz (GF2-F12) for the valence band edges. The crystals are modeled as surface-passivated clusters of increasing sizes, whose wave functions are expanded by up to 2709 GTO basis functions. Immense computational costs of these calculations are overcome by the highly scalable stochastic algorithm of the Monte Carlo GF2-F12 method, whose operation cost per state increases only as a cubic power of system size, which has a tiny memory footprint and easily achieves near-perfect parallel efficiency on thousands of CPUs or on hundreds of GPUs. The correlated, F12-corrected highest-occupied and lowest-unoccupied molecular-orbital energy (HOMO-LUMO) gap is 5.78 ± 0.07 eV for C 87 H 76 as compared with the experimental value of the fundamental (indirect) band gap of bulk diamond at 5.48 eV. The correlated, F12-corrected HOMO-LUMO gaps for Si 75 H 76 and Si 32 C 43 H 76 are 2.56 ± 0.15 eV and 3.50 ± 0.12 eV, respectively, which are expected to decrease further with increasing cluster sizes. As a result, the experimental fundamental (indirect) band gaps of bulk silicon and silicon carbide are 1.17 eV and 2.42 eV, respectively.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2020

A broadband wavelet implementation for rapid ultrasound pulse-echo time-of-flight measurements

A broadband wavelet approach to ultrasonic pulse-echo time-of-flight measurements is described. The broadband approach significantly reduces the time required for frequency-dependent pulse-echo measurements, enabling studies of dynamic systems ranging from biological systems to solid-state phase transitions. The described broadband approach is demonstrated in parallel with the more traditional frequency stepping approach to perform ultrasound time-of-flight measurements inside a large volume Paris-Edinburgh press in-situ at a synchrotron source. The broadband wavelet data acquisition process was found to be 1-2 orders of magnitude faster than the steppedfrequency approach, with no compromise in data quality or determined results.

47 OTHER INSTRUMENTATION↗
DOE OSTI2023

Combining Sparse Approximate Factorizations with Mixed-precision Iterative Refinement

The standard LU factorization-based solution process for linear systems can be enhanced in speed or accuracy by employing mixed-precision iterative refinement. Most recent work has focused on dense systems. We investigate the potential of mixed-precision iterative refinement to enhance methods for sparse systems based on approximate sparse factorizations. In doing so, we first develop a new error analysis for LU- and GMRES-based iterative refinement under a general model of LU factorization that accounts for the approximation methods typically used by modern sparse solvers, such as low-rank approximations or relaxed pivoting strategies. We then provide a detailed performance analysis of both the execution time and memory consumption of different algorithms, based on a selected set of iterative refinement variants and approximate sparse factorizations. Our performance study uses the multifrontal solver MUMPS, which can exploit block low-rank factorization and static pivoting. We evaluate the performance of the algorithms on large, sparse problems coming from a variety of real-life and industrial applications showing that mixed-precision iterative refinement combined with approximate sparse factorization can lead to considerable reductions of both the time and memory consumption.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Compressed basis GMRES on high-performance graphics processing units

Krylov methods provide a fast and highly parallel numerical tool for the iterative solution of many large-scale sparse linear systems. To a large extent, the performance of practical realizations of these methods is constrained by the communication bandwidth in current computer architectures, motivating the investigation of sophisticated techniques to avoid, reduce, and/or hide the message-passing costs (in distributed platforms) and the memory accesses (in all architectures). This article leverages Ginkgo’s memory accessor in order to integrate a communication-reduction strategy into the (Krylov) GMRES solver that decouples the storage format (i.e., the data representation in memory) of the orthogonal basis from the arithmetic precision that is employed during the operations with that basis. Given that the execution time of the GMRES solver is largely determined by the memory accesses, the cost of the datatype transforms can be mostly hidden, resulting in the acceleration of the iterative step via a decrease in the volume of bits being retrieved from memory. Together with the special properties of the orthonormal basis (whose elements are all bounded by 1), this paves the road toward the aggressive customization of the storage format, which includes some floating-point as well as fixed-point formats with mild impact on the convergence of the iterative process. We develop a high-performance implementation of the “compressed basis GMRES” solver in the Ginkgo sparse linear algebra library using a large set of test problems from the SuiteSparse Matrix Collection. We demonstrate robustness and performance advantages on a modern NVIDIA V100 graphics processing unit (GPU) of up to 50% over the standard GMRES solver that stores all data in IEEE double-precision.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Requirements Description of GAMSOR and GAMSRC

This report presents the modeling and simulation capabilities of Argonne National Laboratory’s GAMSOR and GAMSRC code that is used in present reactor analysis activities. These capabilities will then be used to establish the set of verification tasks necessary to verify GAMSOR for use on commercial projects. A similar approach was taken for the PERSENT, REBUS and DIF3D software packages. The GAMSOR program is a modified version of DIF3D used to obtain the coupled neutron gamma flux distributions for a given reactor system. GAMSOR was first developed in the 1980s and its work has progressed in parallel with DIF3D throughout its various development phases. While GAMSOR is compatible with DIF3D-FD and DIF3D-Nodal, DIF3D-VARIANT is most commonly used today and will be the focus of the present verification effort. As covered in [1], GAMSOR was built to provide more accurate heating distributions by explicitly solving for both the gamma and neutron heating distributions. Without this consideration, gamma heat is normally assumed to be deposited locally at the site of gamma production. This is acceptable for modeling some phenomena because the total energy production is preserved, but it can lead to inaccurate approximations of fluence-dependent behaviors such as fuel performance, swelling, cladding embrittlement, radiation induced creep, and power peaking. The outputs from GAMSOR are contained in multiple intermediate and final output files: FIXSRC, VARSRC, GTFLUX, GHFLUX, PWDINT, NPDINT, and GPDINT. DIF3D normally produces a PWDINT file containing power density results, with the assumption that gamma rays are absorbed where they are emitted (i.e., energy deposition is local with no modeled transport). With GAMSOR, neutron power density (NPDINT) and gamma power density (GPDINT) are both produced, with their summed power densities replacing the results in PWDINT for total heating (i.e., recoverable) power density.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2025

Mahakala: A Python-based Modular Ray-tracing and Radiative Transfer Algorithm for Curved Spacetimes

We introduce Mahakala, a Python-based, modular, radiative ray-tracing code for curved spacetimes. We employ Google's JAX framework for accelerated automatic differentiation, which can efficiently compute Christoffel symbols directly from the metric, allowing the user to easily and quickly simulate photon trajectories through non-Kerr spacetimes. JAX also enables Mahakala to run in parallel on both CPUs and GPUs. Mahakala natively uses the Cartesian Kerr–Schild coordinate system, which avoids numerical issues caused by the pole in spherical coordinate systems. We demonstrate Mahakala's capabilities by simulating 1.3 mm wavelength images (the wavelength of Event Horizon Telescope observations) of general relativistic magnetohydrodynamic simulations of low-accretion rate supermassive black holes. The modular nature of Mahakala allows us to quantitatively explore how different regions of the flow influence different image features. We show that most of the emission seen in 1.3 mm images originates close to the black hole and peaks near the photon orbit. We also quantify the relative contribution of the disk, forward jet, and counterjet to 1.3 mm images.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2020

Sage: parallel semi-asymmtric graph algorithms for NVRAMs

Non-volatile main memory (NVRAM) technologies provide an attractive set of features for large-scale graph analytics, including byte-addressability, low idle power, and improved memory-density. NVRAM systems today have an order of magnitude more NVRAM than traditional memory (DRAM). NVRAM systems could therefore potentially allow very large graph problems to be solved on a single machine, at a modest cost. However, a significant challenge in achieving high performance is in accounting for the fact that NVRAM writes can be much more expensive than NVRAM reads. In this paper, we propose an approach to parallel graph analytics using the Parallel Semi-Asymmetric Model (PSAM), in which the graph is stored as a read-only data structure (in NVRAM), and the amount of mutable memory is kept proportional to the number of vertices. Similar to the popular semi-external and semi-streaming models for graph analytics, the PSAM approach assumes that the vertices of the graph fit in a fast read-write memory (DRAM), but the edges do not. In NVRAM systems, our approach eliminates writes to the NVRAM, among other benefits. To experimentally study this new setting, we develop Sage, a parallel semi-asymmetric graph engine with which we implement provably-efficient (and often work-optimal) PSAM algorithms for over a dozen fundamental graph problems. We experimentally study Sage using a 48--core machine on the largest publicly-available real-world graph (the Hyperlink Web graph with over 3.5 billion vertices and 128 billion edges) equipped with Optane DC Persistent Memory, and show that Sage outperforms the fastest prior systems designed for NVRAM. Importantly, we also show that Sage nearly matches the fastest prior systems running solely in DRAM, by effectively hiding the costs of repeatedly accessing NVRAM versus DRAM.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Analysis of Threading Libraries for High Performance Computing

With the appearance of multi-/many core machines, applications and runtime systems have evolved in order to exploit the new on-node concurrency brought by new software paradigms. POSIX threads (Pthreads) was widely-adopted for that purpose and it remains as the most used threading solution in current hardware. Lightweight thread (LWT) libraries emerged as an alternative offering lighter mechanisms to tackle the massive concurrency of current hardware. In this article, we analyze in detail the most representative threading libraries including Pthread- and LWT-based solutions. In addition, to examine the suitability of LWTs for different use cases, we develop a set of microbenchmarks consisting of OpenMP patterns commonly found in current parallel codes, and we compare the results using threading libraries and OpenMP implementations. Moreover, we study the semantics offered by threading libraries in order to expose the similarities among different LWT application programming interfaces and their advantages over Pthreads. This article exposes that LWT libraries outperform solutions based on operating system threads when tasks and nested parallelism are required.

GLT↗
DOE OSTI2020

Scalable Knowledge Graph Analytics at 136 Petaflop/s

We are motivated by newly proposed methods for data mining large-scale corpora of scholarly publications, such as the full biomedical literature, which may consist of tens of millions of papers spanning decades of research. In this setting, analysts seek to discover how concepts relate to one another. They construct graph representations from annotated text databases and then formulate the relationship-mining problem as one of computing all-pairs shortest paths (APSP), which becomes a significant bottleneck. In this context, we present a new high-performance algorithm and implementation of the Floyd-Warshall algorithm for distributed-memory parallel computers accelerated by GPUs, which we call DSNAPSHOT (Distributed Accelerated Semiring All-Pairs Shortest Path). For our largest experiments, we ran DSNAPSHOT on a connected input graph with millions of vertices using 4, 096nodes (24,576GPUs) of the Oak Ridge National Laboratory's Summit supercomputer system. We find DSNAPSHOT achieves a sustained performance of 136×1015 floating-point operations per second (136petaflop/s) at a parallel efficiency of 90% under weak scaling and, in absolute speed, 70% of the best possible performance given our computation (in the single-precision tropical semiring or “min-plus” algebra). Looking forward, we believe this novel capability will enable the mining of scholarly knowledge corpora when embedded and integrated into artificial intelligence-driven natural language processing workflows at scale.

Kannan, Ramakrishnan {ramki}↗
DOE OSTI2024

Automated Calibration of Parallel and Distributed Computing Simulators: A Case Study

Many parallel and distributed computing research results are obtained in simulation, using simulators that mimic real-world executions on some target system. Each such simulator is configured by picking values for parameters that define the behavior of the underlying simulation models it implements. The main concern for a simulator is accuracy: simulated behaviors should be as close as possible to those observed in the real-world target system. This requires that values for each of the simulator's parameters be carefully picked, or “calibrated,” based on ground-truth real-world executions. Examining the current state of the art shows that simulator calibration, at least in the field of parallel and distributed computing, is often undocumented (and thus perhaps often not performed) and, when documented, is described as a labor-intensive, manual process. In this work we evaluate the benefit of automating simulation calibration using simple algorithms. Specifically, we use a real-world case study from the field of High Energy Physics and compare automated calibration to calibration performed by a domain scientist. Our main finding is that automated calibration is on par with or significantly outperforms the calibration performed by the domain scientist. Furthermore, automated calibration makes it straightforward to operate desirable tradeoffs between simulation accuracy and simulation speed.

Mc donald, Jesse↗
DOE OSTI2022

Effects of Intrusive Confining Units on Groundwater Flow at Pahute Mesa, Nevada National Security Site

Geological, geophysical, hydrogeological, and hydrological evidence indicates that feeder dikes to lava flows play a role as confining units in the groundwater flow system underlying the Pahute Mesa area of underground nuclear testing at the Nevada National Security Site (NNSS). Of geological significance, the Pahute Mesa testing area is largely situated within the Silent Canyon caldera, which includes both tuffs and lavas that were fed by (and are connected to) intrusive rock units such as feeder dikes prior to and during volcanic eruptions (Orkild et al., 1968; Byers et al., 1976). Groundwater modeling results presented in this report support extension of “pool-dam” and “breach scenario” concepts presented in Jackson and Fenelon (2018) and Jackson et al. (2021) to low-permeability intrusive confining units (ICUs) such as feeder dikes that are expected to dissect and ring the caldera. As laterally extensive, steeply-dipping, and sub-parallel planar structures, ICUs can be expected to further compartmentalize groundwater flow in the volcanic aquifers systems at Pahute Mesa beyond the stratigraphically-defined tuff confining units (TCUs). ICUs provide an explanation for changes in water levels before and after the Cheshire test, detonated 2/14/76 (USDOE, 2015), and the unusually high horizontal gradient southwest of Cheshire. These ICU concepts are supported by groundwater modeling results presented in this report. The evidence and groundwater modeling results indicate that the downgradient extent of radionuclide contamination in some areas of Pahute Mesa could be overestimated by ignoring the confining effects of ICUs. On the other hand, contaminant extent could be underestimated by not considering transient flow effects and/or the re-equilibrated flow field caused by breaching of an ICU by an underground nuclear test.

54 ENVIRONMENTAL SCIENCES↗