Search NASA⌕ Search

SEARCH · Search NASA

Results for “distributed memory”

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,171 records · Page 65

The OVIS analysis architecture.

This report summarizes the current statistical analysis capability of OVIS and how it works in conjunction with the OVIS data readers and interpolators. It also documents how to extend these capabilities. OVIS is a tool for parallel statistical analysis of sensor data to improve system reliability. Parallelism is achieved using a distributed data model: many sensors on similar components (metaphorically sheep) insert measurements into a series of databases on computers reserved for analyzing the measurements (metaphorically shepherds). Each shepherd node then processes the sheep data stored locally and the results are aggregated across all shepherds. OVIS uses the Visualization Tool Kit (VTK) statistics algorithm class hierarchy to perform analysis of each process's data but avoids VTK's model aggregation stage which uses the Message Passing Interface (MPI); this is because if a single process in an MPI job fails, the entire job will fail. Instead, OVIS uses asynchronous database replication to aggregate statistical models. OVIS has several additional features beyond those present in VTK that, first, accommodate its particular data format and, second, improve the memory and speed of the statistical analyses. First, because many statistical algorithms are multivariate in nature and sensor data is typically univariate, interpolation of data is required to provide simultaneous observations of metrics. Note that in this report, we will refer to a single value obtained from a sensor as a measurement while a collection of multiple sensor values simultaneously present in the system is an observation. A base class for interpolation is provided that abstracts the operation of converting multiple sensor measurements into simultaneous observations. A concrete implementation is provided that performs piecewise constant temporal interpolation of multiple metrics across a single component. Secondly, because calculations may summarize data too large to fit in memory OVIS analyses batches of observations at a time and aggregates these intermediate intra-process models as it goes before storing the final model for inter-process aggregation via database replication. This reduces the memory footprint of the analysis, interpolation, and the database client and server query processing. This also interleaves processing with the disk I/O required to fetch data from the database - also improving speed. This report documents how OVIS performs analyses and how to create additional analysis components that fetch measurements from the database, perform interpolation, or perform operations on streamed observations (such as model updates or assessments). The rest of this section outlines the OVIS analysis algorithm and is followed by sections specific to each subtask. Note that we are limiting our discussion for now to the creation of a model from a set of measurements, and not including the assessment of observations using a model. The same framework can be used for assessment but that use case is not detailed in this report.

97 MATHEMATICS AND COMPUTING↗

A eutectic dual-phase design towards superior mechanical properties of heusler-type ferromagnetic shape memory alloys

Heusler-type ferromagnetic shape memory alloys possess attractive multifunctional properties, including magnetic field induced shape memory effect, magnetoresistance and magnetocaloric effect, owing to the unique concurrent magnetic and martensitic transformations. However, these intermetallics generally exhibit intrinsic high brittleness and low strength, which severely impede their workability for processing and applicability in real use. In this study, we demonstrate a new grain refining strategy by means of eutectic solidification to improve the mechanical properties in Ni-Mn-Sn-Fe alloys. In a fully eutectic microstructure, the average γ lamellae thickness was refined to ~170 nm and the composite showed a compressive strength of 1950 MPa, ductility of 19.5%, Young’s Modulus of 38 GPa, pseudoelasticity of 3.2% and high mechanical cyclic stability. The high mechanical performance is attributed to the effect of departmentalization of the brittle Heusler alloy by the densely distributed γ phase fine lamellae in resisting crack propagation. The eutectic Heusler composite exhibited a metamagnetic phase transformation, with a magnetic entropy change of 10.2 J/kg·K and a refrigeration capacity of 168 J/kg in a field change of 5 T.

36 MATERIALS SCIENCE↗

Grouper: A Compact, Streamable Triangle Mesh Data Structure

Here, we present Grouper: an all-in-one compact file format, random-access data structure, and streamable representation for large triangle meshes. Similarly to the recently published SQuad representation, Grouper represents the geometry and connectivity of a mesh by grouping vertices and triangles into fixed-size records, most of which store two adjacent triangles and a shared vertex. Unlike SQuad, however, Grouper interleaves geometry with connectivity and uses a new connectivity representation to ensure that vertices and triangles can be stored in a coherent order that enables memory-efficient sequential stream processing. We also present a linear-time construction algorithm that allows streaming out Grouper meshes using a small memory footprint while preserving the initial ordering of vertices. In this construction, we show how the problem of assigning vertices and triangles to groups reduces to a well-known NP-hard optimization problem, and present a simple yet effective heuristic solution that performs well in practice. Our array-based Grouper representation also doubles as a triangle mesh data structure that allows direct access to vertices and triangles. Storing only about two integer references per triangle-i.e., less than the three vertex references stored with each triangle in a conventional indexed mesh format-Grouper answers both incidence and adjacency queries in amortized constant time. Our compact representation enables data-parallel processing on multicore computers, instant partitioning and fast transmission for distributed processing, as well as efficient out-of-core access. We demonstrate the versatility and performance benefits of Grouper using a suite of example meshes and processing kernels.

97 MATHEMATICS AND COMPUTING↗

Imaging of voltage-controlled switching of magnetization in highly magnetostrictive epitaxial Fe–Ga microstructures

The magnetoelectric behavior of epitaxial Fe–Ga microstructures on top of a (001)-oriented PMN–PT piezoelectric substrate is imaged with magnetic X-ray microscopy. Additionally, the micron-scale strain distribution in PMN–PT is characterized by X-ray microdiffraction and examined with respect to the results of the Fe–Ga magnetoelectric switching. The magnetic reorientation of Fe–Ga is found to be strongly correlated with size, shape, and crystallographic orientation of the microstructures. In the case of square-shaped structures, size dictates the influence of the strain distribution on both the initialization of the ground state and on the magnetic reorientation during application of voltage. On the other hand, elliptical microstructures demonstrate completely different magnetic responses depending on the relative orientation of their long axis with respect to the crystallographic directions of the PMN–PT. This study demonstrates that engineering the behavior of highly magnetostrictive epitaxial microdevices is possible. It further elucidates that voltage-induced actuation can be largely tuned to achieve the desired type of magnetic switching ranging from vortex circulation reversal, domain wall motion, to a large rotation of magnetization. Because of the outstanding properties of the investigated material system, the reported findings are expected to be of great interest for the realization of next-generation energy-efficient magnetic memory and logic devices.

42 ENGINEERING↗

Application of Deep Learning on Integrating Prediction, Provenance, and Optimization

In this research, we investigated two approaches to detect job anoma- lies and/or contention for large scale computing efforts: 1. Preemptive job scheduling using binomial classification long short-term memory networks 2. Forecasting intra-node computing loads from the active jobs and addi- tional job(s) For approach 1, we achieved a 14% improvement in computational resources utilization and an overall classification accuracy of 85% on real tasks executed in a High Energy Physics computing workflow. For this paper, we present the preliminary results used in second approach.

Anomaly Detection, Belle II Computing, data proven↗

Efficient and generalizable nested Fourier-DeepONet for three-dimensional geological carbon sequestration

Geological carbon sequestration (GCS) involves injecting CO2 into subsurface geological formationsfor permanent storage. Numerical simulations could guide decisions in GCS projects by predictingCO 2 migration pathways and the pressure distribution in storage formation. However, these simula-tions are often computationally expensive due to highly coupled physics and large spatial-temporalsimulation domains. Surrogate modelling with data-driven machine learning has become a promis-ing alternative to accelerate physics-based simulations. Among these, the Fourier neural operator(FNO) has been applied to three-dimensional synthetic subsurface models. Despite its good accuracyin simulating CO 2 plume migration, it requires large computational resources in training and alsolacks generalizability. Here, to further improve performance, we have developed a nested Fourier-DeepONet by combining the expressiveness of the FNO with the modularity of a deep operatornetwork (DeepONet). This new framework is twice as efficient as a nested FNO for training and has atleast 80% lower GPU memory requirement due to its flexibility to treat temporal coordinates sepa-rately. These performance improvements are achieved without compromising prediction accuracy.In addition, the generalization and extrapolation ability of nested Fourier-DeepONet beyond thetraining range has been thoroughly evaluated. Nested Fourier-DeepONet outperformed the nestedFNO for extrapolation in time with more than 50% reduced error. It also exhibited good extrapolationaccuracy beyond the training range in terms of reservoir properties, number of wells, and injectionrate.

Lee, Jonathan E. [Department of Chemical and Envir↗

Constant Overhead Entanglement Distillation via Scrambling

High-fidelity quantum entanglement enables key quantum networking capabilities such as secure communication and distributed quantum computing, but long-distance entanglement distribution is limited by noise and loss. Entanglement distillation protocols address this problem by extracting high-fidelity Bell pairs from multiple noisy ones. The primary objective is minimizing the resource overhead: the number of noisy input pairs needed to distill each high-fidelity output pair. While protocols achieving optimal overhead are known in theory, they often require complex decoding operations that make practical implementation challenging. We circumvent this challenge by introducing protocols that use quantum scrambling—the spreading of quantum information under chaotic dynamics—through random Clifford operations. Based on this scrambling mechanism, our protocol maintains asymptotically constant overhead, independent of the desired output error rate $\bar{𝜖}$ , and can be implemented with shallow quantum circuits of depth 𝑂⁡(poly log log⁡ $\bar{𝜖}$ −1 ) and memory 𝑂⁡(poly log⁡ $\bar{𝜖}$ −1 ). Our protocol remains effective even with noisy quantum gates. By incorporating error correction, our protocol achieves state-of-the-art performance: starting with pairs of 10% initial infidelity, we require only seven noisy inputs per output pair to distill a single Bell pair with infidelity $\bar{𝜖}$ =10 −12 , substantially outperforming existing schemes. We demonstrate the utility of our protocols for quantum repeater networks.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Machine learning-based interatomic potential development and phase transition analysis of ferroelectric hafnium dioxide

The ferroelectric phase (𝑃⁢𝑐⁢𝑎⁢2 1 , which is in orthorhombic symmetry) of hafnium dioxide (HfO 2 ) has gained much attention due to its potential applications in nanoelectronics and advanced memory devices. However, its complex phase behavior under external stimuli, such as pressure and temperature, remains a subject of intense investigation. This study focuses on developing a machine learning-based interatomic potential (MLIP) that is trained with data from density-functional theory (DFT) calculations to simulate phase transitions and mechanical properties of HfO 2 . The developed MLIP predicts lattice parameters, equations of state, bulk and shear moduli, and elastic constants that closely align with DFT predictions for several phases and at various pressures. Once validated, the MLIP is used to investigate the phase transitions of ferroelectric HfO 2 (𝑃⁢𝑐⁢𝑎⁢2 1 ) under both isobaric and constant stress conditions at elevated temperatures ranging from 200 to 2500 K. We used several complementary methods, including local symmetry identification, radial distribution function, and x-ray diffraction characterization, to identify interesting phase transitions among several competitive hafnia phases predicted from our simulations. The suggested methods uniformly reveal that under pure deviatoric condition, the system favors a transition from the orthorhombic 𝑃⁢𝑐⁢𝑎⁢2 1 phase to a tetragonal (𝑃⁢4 2 /𝑛⁢𝑚⁢𝑐) phase, whereas a zero stress condition drives the system from the 𝑃⁢𝑐⁢𝑎⁢2 1 phase to another orthorhombic (𝑃⁢𝑏⁢𝑐⁢𝑛) phase. These findings provide crucial insights into stress and temperature-induced phase behavior of hafnia, guiding future experimental and theoretical studies for optimizing hafnia-based ferroelectric devices.

Ferroelectric HfO2↗

Spin-Torque in Systems with Inhomogeneous Magnetization

The work performed during the grant period focused on the phenomenon of spin-transfer torque. This is a quantum mechanical effect whereby the angular momentum of conduction electrons is transferred to the magnetization of ferromagnetic structures. Our work on this subject began with phenomenological drift-diffusion and Landau-Lifshitz-Gilbert equations to demonstrate unambiguously that unpolarized current flow from a nonmagnet into a ferromagnet can produce a precession-type instability of the magnetization. We then used Boltzmann calculations appropriate to spin-valve type magnetic heterostructures composed of a non-magnetic thin film sandwiched between two thin film layers with uniform magnetization. Perhaps our most important paper dealt with quantum and semi-classical calculations of spin-transfer torque in systems with domain walls and other inhomogeneous distributions of magnetization. The latter work caused us to suggest that the Landau-Lifshitz approach to magnetic damping provided a clearer picture of the physics than the more popular (but formally equivalent) Gilbert approach to damping. Finally, we returned to our Boltzmann calculations and made a serious effort to analyze experimental data on current-induced magnetization in switching in magnetic spin-valve structures. Our work was part of a world-wide effort to study and harness the transport of the electron's spin and was one of the first sustained theoretical efforts in this direction in the United States. The payoff is just now being seen. In November of 2012, the Everspin Corporation announced the release of the first commercial spin-torque magnetoresistive random access memory.

36 MATERIALS SCIENCE↗

Event-related brain potentials reveal how multiple aspects of semantic processing unfold across parafoveal and foveal vision during sentence reading

Recent event–related brain potential (ERP) experiments have demonstrated parafoveal N400 expectancy and congruity effects, showing that semantic information can be accessed from words in parafoveal vision (a conclusion also supported by some eye–tracking work). At the same time, it is unclear how higher–order integrative aspects of language comprehension unfold across the visual field during reading. In the current study, we recorded ERPs in a parafoveal flanker paradigm, while readers were instructed to read passively for comprehension or to judge the plausibility of sentences in which target words varied in their semantic expectancy and congruity. We directly replicated prior work showing graded N400 effects for parafoveal viewing, which are then not duplicated when the target words are processed foveally. Critically, although N400 effects were not modulated by task goals, a posteriorly distributed late positive component thought to reflect semantic integration processes was observed to semantic incongruities only in the plausibility judgment task. Furthermore, this effect was observed at a considerable delay, appearing only after words had moved into foveal vision. Our findings thus suggest that semantic access can be initiated in parafoveal vision, whereas central foveal vision may be necessary to enact higher–order (and task–dependent) integrative processing.

60 APPLIED LIFE SCIENCES↗

WarpIV: In situ visualization and analysis of ion accelerator simulations

The generation of short pulses of ion beams through the interaction of an intense laser with a plasma sheath offers the possibility of compact and cheaper ion sources for many applications--from fast ignition and radiography of dense targets to hadron therapy and injection into conventional accelerators. To enable the efficient analysis of large-scale, high-fidelity particle accelerator simulations using the Warp simulation suite, the authors introduce the Warp In situ Visualization Toolkit (WarpIV). WarpIV integrates state-of-the-art in situ visualization and analysis using VisIt with Warp, supports management and control of complex in situ visualization and analysis workflows, and implements integrated analytics to facilitate query- and feature-based data analytics and efficient large-scale data analysis. WarpIV enables for the first time distributed parallel, in situ visualization of the full simulation data using high-performance compute resources as the data is being generated by Warp. The authors describe the application of WarpIV to study and compare large 2D and 3D ion accelerator simulations, demonstrating significant differences in the acceleration process in 2D and 3D simulations. WarpIV is available to the public via https://bitbucket.org/berkeleylab/warpiv. The Warp In situ Visualization Toolkit (WarpIV) supports large-scale, parallel, in situ visualization and analysis and facilitates query- and feature-based analytics, enabling for the first time high-performance analysis of large-scale, high-fidelity particle accelerator simulations while the data is being generated by the Warp simulation suite. Furthermore, this supplemental material https://extras.computer.org/extra/mcg2016030022s1.pdf provides more details regarding the memory profiling and optimization and the Yee grid recentering optimization results discussed in the main article.

43 PARTICLE ACCELERATORS↗

MPACT 4.4 Theory Manual

MPACT is a three-dimensional (3D) full-core neutron transport code capable of calculating subpin power distributions. Calculations are based on the Boltzmann transport equation for neutron fluxes for problems in which the detailed geometrical configuration of fuel components such as the pellet and cladding are explicitly retained. The cross-section data needed for the neutron transport calculation are obtained directly from a multigroup cross section library, which has traditionally been used by lattice physics codes to generate few-group homogenized cross sections for nodal core simulators. Hence, MPACT assumes neither a priori homogenization nor group condensation for the full core spatial solution. The 3D MPACT transport solution can be obtained using the method of characteristics (MOC), which employs discrete ray tracing within each fuel pin. However, for practical reactor applications, the direct application of MOC to 3D core configurations requires an excessive amount of memory and computing time due to the very large number of rays. For practical 3D full-core calculations, MPACT commonly uses an approximate “2D/1D” method that treats the radial (x and y) variables differently from the axial (z) variable. In particular, the radial dependence of the solution is calculated using transport theory, and the axial dependence is calculated using diffusion or P 3 theory. The 2D/1D method requires the core to be divided into a vertical stack of axial slices with a thickness of Δ z ≈ 5–10 cm. Each axial slice is divided radially into coarse spatial cells with boundaries that usually constitute the pin cell boundaries, for which Δ x = Δ y ≈ 1.5 cm. Then, each coarse radial cell (pin cell) is divided into 50–100 fine radial cells, which resolve the angular flux in the fuel, cladding, and moderator regions.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

QCOR; A Language Extension Specification for the Heterogeneous Quantum-Classical Model of Computation

Quantum computing (QC) is an emerging computational paradigm that leverages the laws of quantum mechanics to perform elementary logic operations. Existing programming models for QC were designed with fault-tolerant hardware in mind, envisioning stand-alone applications. However, the susceptibility of near-term quantum computers to noise limits their stand-alone utility. To better leverage limited computational strengths of noisy quantum devices, hybrid algorithms have been suggested whereby quantum computers are used in tandem with their classical counterparts in a heterogeneous fashion. This modus operandi calls out for a programming model and a high-level programming language that natively and seamlessly supports heterogeneous quantum-classical hardware architectures in a single-source-code paradigm. Motivated by the lack of such a model, we introduce a language extension specification, called QCOR, which enables single-source quantum-classical programming. Programs written using the QCOR library–based language extensions can be compiled to produce functional hybrid binary executables. After defining QCOR’s programming model, memory model, and execution model, we discuss how QCOR enables variational, iterative, and feed-forward QC. Additionally, QCOR approaches quantum-classical computation in a hardware-agnostic heterogeneous fashion and strives to build on best practices of high-performance computing. The high level of abstraction in the language extension is intended to accelerate the adoption of QC by researchers familiar with classical high-performance computing.

97 MATHEMATICS AND COMPUTING↗

Spontaneous Valley Polarization of Itinerant Electrons

Memory or transistor devices based on an electron’s spin rather than its charge degree of freedom offer certain distinct advantages and comprise a cornerstone of spintronics. Recent years have witnessed the emergence of a new field, valleytronics, which seeks to exploit an electron’s valley index rather than its spin. An important component in this quest would be the ability to control the valley index in a convenient fashion. Here we show that the valley polarization can be switched from zero to 1 by a small reduction in density, simply tuned by a gate bias, in a two-dimensional electron system. This phenomenon, which is akin to Bloch spin ferromagnetism, arises fundamentally as a result of electron-electron interaction in an itinerant, dilute electron system. Essentially, the kinetic energy favors an equal distribution of electrons over the available valleys, whereas the interaction between electrons prefers single-valley occupancy below a critical density. The gate-bias-tuned transition we observe is accompanied by a sudden, twofold change in sample resistance, making the phenomenon of interest for potential valleytronic transistor device applications. Finally, our observation constitutes a quintessential demonstration of valleytronics in a very simple experiment.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Implementation of the direct S ( α , β ) method in the KENO Monte Carlo code

The Monte Carlo code KENO contains thermal scattering data for a wide variety of thermal moderators. These data are processed from Evaluated Nuclear Data Files (ENDF) by AMPX and stored as double differential probability distribution functions. The method examined in this study uses S(α,β) probability distribution functions derived from the ENDF data files directly instead of being converted to double differential cross sections. This allows the size of the cross section data on the disk to be reduced substantially amount. KENO has also been updated to allow interpolation in temperature on these data so that problems can be run at any temperature. Results are shown for several simplified problems for a variety of moderators. In addition, benchmark models based on the KRITZ reactor in Sweden were run, and the results are compared with the previous versions of KENO without the direct S(α,β) method. Results from the direct S(α,β) method compare favorably with the original results obtained using the double differential cross sections. Finally, sampling the data increases the run-time of the Monte Carlo calculation, but memory usage is decreased substantially.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

A Comparison of Linear Solvers for Resolving Flow in Three-Dimensional Discrete Fracture Networks

We compare various methods for resolving steady flow within three-dimensional discrete fracture networks, including direct methods, Krylov subspace methods with and without preconditioning, and multi-grid methods. We compared the performance of the methods based on compute times and scaling of the solution as a function of the number of grid nodes and log-variance of the hydraulic aperture. The methods are applied to three test cases: (a) variable density of networks with a truncated power-law distribution of fracture lengths, (b) a fixed network composed of monodisperse fracture sizes but varied permeability/aperture heterogeneity, (c) and a network based on field site in Nevada, US. We chose these cases to allow us to study the impact of the mesh size and flow properties, as well as to demonstrate our conclusions on a large-scale, realistic problem (more than 40 million mesh nodes). A direct solution using Cholesky factorization outperformed other methods for every example but was closely followed in performance by some algebraic multigrid (AMG) preconditioned Krylov subspace methods. Among the Krylov methods, conjugate gradients (CG) with an AMG preconditioner performs the best. Generally, Cholesky factorization is recommended, but CG with an AMG preconditioner may be suitable for very large problems beyond 40 million nodes where the entire linear system cannot reside in memory.

58 GEOSCIENCES↗

SMC 2021 : Analyzing Resource Utilization and User Behavior on Titan Supercomputer

Resource utilization statistics of submitted jobs on a supercomputer can help us understand how users from various scientific domains use HPC platforms and better design a job scheduler. We explore to generate insight regarding workload distribution and usage pattern domains from job scheduler trace, GPU failure information, and project-specific information collected from Titan supercomputer. Furthermore, we want to know how the scheduler performance varies over time and how the users' scheduling behavior changes following a system failure. These observations have the potential to provide valuable insight, which is helpful to prepare for system failures. These practices will help us develop and apply novel machine learning algorithms in understanding system behavior, requirement, and better scheduling of HPC systems. There are two datasets, RUR and GPU. RUR: This dataset is the job scheduler traces collected from the Titan supercomputerfrom 01/01/2015 to 07/31/2019 (2015.csv - 2019.csv). These were collected usingResource Utilization Report (RUR), a Cray-developed resource-usage data collectionand reporting system. It contains the usage information of its critical resources (CPU,Memory, GPU, and I/O) of each running job on Titan during that period [2]. ProjectAreas: Every job is associated with a project ID. TheProjectAreas.csvdatasetprovides a mapping of the project ID to its domain science. GPU: There have been some hardware-related issues in the GPUs in Titan that caused some GPUs to fail, sometimes irrecoverably during some job runs. This dataset provides information regarding these failures during the execution of the submitted jobs. GPUs on Titan are uniquely identified by a serial number (SN), and they are installed in a location. A GPU can be installed in a location, then removed from that location following a failure, and then re-installed in a different location after fixing the problem. If the failure can't be recovered, the GPU might be removed entirely from Titan. There are two prominent types of failures that resulted in the removal of GPUs from Titan: Double Bit Error (DBE) and Out of the Bus (OTB). The dataset (gc_full.csv) has the following fields: 1. SN : Serial number of a GPU 2. location : The location where it is installed 3. insert : The time when it was inserted into that location 4. remove : The time when it was removed from that location 5. duration : Amount of time the GPU spent in this location 6. out : If the device was taken out entirely w/o a re-installment into a new location. 7. event : If the GPU was taken out entirely, the reason for its removal. To learn more about this dataset, please refer to the git repositoryhttps://github.com/olcf/TitanGPULifeand the related publication [1]. References [1] George Ostrouchov, Don Maxwell, Rizwan A Ashraf, Christian Engelmann, MallikarjunShankar, and James H Rogers. Gpu lifetimes on titan supercomputer: Survival analysisand reliability. InSC20: International Conference for High Performance Computing,Networking, Storage and Analysis, pages 1-14. IEEE, 2020. [2] Feiyi Wang, Sarp Oral, Satyabrata Sen, and Neena Imam. Learning from five-yearresource-utilization data of titan system. In2019 IEEE International Conference onCluster Computing (CLUSTER), pages 1-6. IEEE, 2019.

42 ENGINEERING↗

Snake River Fall Chinook Salmon Life History Investigations, Annual Report 2007.

In 2007, we used radio and acoustic telemetry to evaluate the migratory behavior, survival, mortality, and delay of subyearling fall Chinook salmon in the Clearwater River and Lower Granite Reservoir. Monthly releases of radio-tagged fish ({approx}95/month) were made from May through October and releases of 122-149/month acoustic-tagged fish per month were made from August through October. We compared the size at release of our tagged fish to that which could have been obtained at the same time from in-river, beach seine collections made by the Nez Perce Tribe. Had we relied on in-river collections to obtain our fish, we would have obtained very few in June from the free-flowing river but by late July and August over 90% of collected fish in the transition zone were large enough for tagging. Detection probabilities of radio-tagged subyearlings were generally high ranging from 0.60 (SE=0.22) to 1.0 (SE=0) in the different study reaches and months. Lower detection probabilities were observed in the confluence and upper reservoir reaches where fewer fish were detected. Detection probabilities of acoustic-tagged subyearlings were also high and ranged from 0.86 (SE=0.09) to 1.0 (SE=0) in the confluence and upper reservoir reaches during August through October. Estimates of the joint probability of migration and survival generally declined in a downstream direction for fish released from June through August. Estimates were lowest in the transition zone (the lower 7 km of the Clearwater River) for the June release and lowest in the confluence area for July and August releases. The joint probability of migration and survival in these reaches was higher for the September and October releases, and were similar to those of fish released in May. Both fish weight and length at tagging were significantly correlated with the joint probability of migrating and surviving for both radio-tagged and acoustic-tagged fish. For both tag types, fish that were heavier at tagging had a higher probability of successfully passing through the confluence (P=0.0050 for radio-tagged fish; P=0.0038 for acoustic-tagged fish). Radio-tagged fish with greater weight at tagging also had a higher probability of migrating and surviving through both the lower free-flowing reach (P=0.0497) and the transition zone (P=0.0007). Downstream movement rates of radio-tagged subyearlings were highest in free-flowing reaches in every month and decreased considerably with impoundment. Movement rates were slowest in the transition zone for the June and August release groups, and in the confluence reach for the July release group. For acoustic-tagged subyearlings, the slowest movement rates through the confluence and upper reservoir reaches were observed for the September release group. Radio-tagged fish released in August showed the greatest delay in the transition zone, while acoustic-tagged fish released in September showed the greatest delay in the transition zone and confluence reaches. Across the monthly release groups from July through September, the probability of delaying in the transition zone and surviving there declined throughout the study. All monthly release groups of radio-tagged subyearlings showed evidence of mortality within the transition zone, with final estimates (across the full 45-d detection period) ranging from 0.12 (SE not available) for the May release group to 0.58 (SE = 0.06) for the June release group. The May and September release groups tended to have lower mortality in the transition zone than the June, July, and August release groups. Live fish were primarily detected away from shore in the channel, whereas all dead fish were located along shorelines with most being located in the vicinity of the Memorial Bridge and immediately upstream. During the May detection period, before the implementation of summer flow augmentation, temperatures in the Clearwater River and Snake River arms of Lower Granite Reservoir and the downstream boundary of the confluence ranged from 8 to 17 C. During the June-August detection periods, however, temperatures in the Clearwater River arm ranged from 10-16 C down to 7 m and the Snake River arm was above 20 C down to a depth of 9 m. Incomplete mixing between the two water sources resulted in significant vertical temperature variation at the downstream boundary of the confluence during a large portion of the June-August detection periods. This variation diminished during the September and October detection periods when temperatures once again fell to 17 C and lower and eventually became uniformly distributed throughout the water column in the confluence.

13 HYDRO ENERGY↗