Search NASA⌕ Search

SEARCH · Search NASA

Results for “Massive Data Movement”

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 73 records · Page 4

Accelerating and democratizing science through cloud-based services.

Many businesses today save time and money, and increase their agility, by outsourcing mundane IT tasks to cloud providers. The author argues that similar methods can be used to overcome the complexities inherent in increasingly data-intensive, computational, and collaborative scientific research. He describes Globus Online, a system that he and his colleagues are developing to realize this vision. he scientific community today has unprecedented opportunities to effect transformational change in how individuals and teams engage in discovery. The driving force is a set of interrelated new capabilities that, when harnessed, can enable dramatic acceleration in the discovery process: greater availability of massive data, exponentially faster computers, ultra-high-speed networks, and deep interdisciplinary collaboration. The opportunity - and challenge - is to make these capabilities accessible not just to a few 'big science' projects but to every researcher at every level. Here, I argue that the key to seizing this opportunity is embracing software delivery methods that haven't been widely adopted in research, notably software as a service (SaaS) - a technology that forms an important part of what people refer to as the cloud. I also describe projects in the Computation Institute at the University of Chicago and Argonne National Laboratory that aim to realize this vision, focusing initially on data movement and management.

99 GENERAL AND MISCELLANEOUS↗

Joint physics-based and data-driven time-lapse seismic inversion: Mitigating data scarcity

In carbon capture and sequestration (CCS), developing rapid and effective imaging techniques is crucial for real-time monitoring of the spatial and temporal dynamics of CO 2 propagation during/after injection. With continuing improvements in computational power and data storage, data-driven techniques based on machine learning (ML) have been effectively applied to seismic inverse problems. In particular, ML helps alleviate the ill-posedness and high computational cost of full-waveform inversion (FWI). However, such data-driven inversion techniques require massive high-quality training data sets to ensure prediction accuracy, which hinders their application to time-lapse monitoring of CO 2 sequestration. We propose an efficient “hybrid” time-lapse workflow that combines physics-based FWI and data-driven ML inversion. The scarcity of the available training data is addressed by developing a new data-generation technique with physics constraints. The method is vali dated on a synthetic CO 2 -sequestration model based on the Kimberlina storage reservoir in California. The proposed approach is shown to synthesize a large volume of high-quality, physically realistic training data, which is critically important in accurately characterizing the CO 2 movement in the reservoir. In conclusion, the developed hybrid methodology can also simultaneously predict the variations in velocity and saturation and achieve high spatial resolution in the presence of realistic noise in the data.

58 GEOSCIENCES↗

Accelerated Constrained Sparse Tensor Factorization on Massively Parallel Architectures

This study presents the first constrained sparse tensor factorization (cSTF) framework that optimizes and fully offloads computation to massively parallel GPU architectures, and the first performance characterization of cSTF on GPU architectures. In contrast to prior work on tensor factorization, where the matricized tensor times Khatri-Rao product (MTTKRP) is the primary performance bottleneck, our systematic analysis of the cSTF algorithm on GPUs reveals that adding constraints creates an additional bottleneck in the update operation for many real-world sparse tensors. While executing the update operation on the GPU brings significant speedup over its CPU counterpart, it remains a significant bottleneck. To further accelerate the update operation, we propose cuADMM, a new update algorithm that leverages algorithmic and code optimization strategies to minimize both computation and data movement on GPUs. As a result, our framework delivers significantly improved performance compared to prior state-of-the-art. On 10 real-world sparse tensors, our framework achieves geometric mean speedup of 5.1 × (max 41.59 ×) and 7.01 × (max 58.05 ×) on the NIVIDA A100 and H100 GPUs, respectively, over the state-of-the-art SPLATT library running on a 26-core Intel Ice Lake Xeon CPU.

Soh, Yongseok↗

Adoption of AI in the Utility T&D Sector: Use Cases, Consequence, Assessment and Benefits

Digital transformation and utilization of artificial intelligence (AI) in the electric grid are fundamentally changing the industry’s approach to common problems and enabling a broader paradigm shift in grid planning and operations. The change in approach is circularly both enabling and driving modernization, with load growth and reliable management of data center and AI infrastructure shifting away from planning approaches with relatively predictable behaviors and toward a mix of consumer and industrial choices that surpass human cognitive abilities to process. This movement has potential to condition humans to not understand the system on which the AI depends, while requiring it for development of the necessary infrastructure. Approaches which would address most likely grid conditions and events, such as faults, aging of equipment, and weather, now must also account for large loads which shift not based upon weather or time of day, but the computational load. Quantifying computational load is independent of the traditional grid forecasting variables, where a data center’s aggregate load is determined by user and AI system behavior and decoupled from normal grid planning and operations. AI is both the cause and solution for these challenges, with new grid planning tools integrating massive amounts of decisions into frameworks.

24 POWER TRANSMISSION AND DISTRIBUTION↗

An Expanded RXTE Survey of Long-Term X-ray Variability in Seyfert 1 Galaxies

The first seven years of RXTE monitoring of Seyfert 1 active galactic nuclei have been systematically analyzed to yield five homogenous samples of 2-12 keV light curves, probing hard X-ray variability on successively longer durations from approx. 1 day to approx. 3.5 years. 2-10 keV variability on time scales of approx. 1 day, as probed by ASCA, are included. All sources exhibit stronger X-ray variability towards longer time scales, with variability amplitudes saturating at the longest time scales, but the increase is greater for relatively higher luminosity sources. The well-documented anticorrelation between variability amplitude and luminosity is confirmed on all time scales. However, anticorrelations between variability amplitude and black hole mass estimate are evident on only the shortest time scales probed. The data are consistent with the models of power spectral density (PSD) movement described in Markowitz et al. (2003) and McHardy et al. (2004), whereby Seyfert 1 galaxies variability can be described by a single, universal PSD shape whose cutoff frequency scales with black hole mass. The best-fitting scaling relations between variability time scale, black hole mass and X-ray luminosity support an average accretion rate of 2% of the Eddington limit for the sample. Nearly all sources exhibit stronger variability in the relatively soft 2-4 keV band compared to the 7-12 keV band on all time scales. Color-flux diagrams support also Seyfert 1s' softening as they brighten. There are indications that relatively less luminous or less massive sources exhibit a greater degree of spectral variability for a given increase in overall flux.

Markowitz, A.↗

InSAR Detection and Field Evidence for Thermokarst after a Tundra Wildfire, Using ALOS-PALSAR

Thermokarst is the process of ground subsidence caused by either the thawing of ice-rich permafrost or the melting of massive ground ice. The consequences of permafrost degradation associated with thermokarst for surface ecology, landscape evolution, and hydrological processes have been of great scientific interest and social concern. Part of a tundra patch affected by wildfire in northern Alaska (27.5 km 2 ) was investigated here, using remote sensing and in situ surveys to quantify and understand permafrost thaw dynamics after surface disturbances. A two-pass differential InSAR technique using L-band ALOS-PALSAR has been shown capable of capturing thermokarst subsidence triggered by a tundra fire at a spatial resolution of tens of meters, with supporting evidence from field data and optical satellite images. We have introduced a calibration procedure, comparing burned and unburned areas for InSAR subsidence signals, to remove the noise due to seasonal surface movement. In the first year after the fire, an average subsidence rate of 6.2 cm/year (vertical) was measured. Subsidence in the burned area continued over the following two years, with decreased rates. The mean rate of subsidence observed in our interferograms (from 24 July 2008 to 14 September 2010) was 3.3 cm/year, a value comparable to that estimated from field surveys at two plots on average (2.2 cm/year) for the six years after the fire. These results suggest that this InSAR-measured ground subsidence is caused by the development of thermokarst, a thawing process supported by surface change observations from high-resolution optical images and in situ ground level surveys.

54 ENVIRONMENTAL SCIENCES↗

Parthenon—a performance portable block-structured adaptive mesh refinement framework

On the path to exascale the landscape of computer device architectures and corresponding programming models has become much more diverse. While various low-level performance portable programming models are available, support at the application level lacks behind. To address this issue, we present the performance portable block-structured adaptive mesh refinement (AMR) framework Parthenon, derived from the well-tested and widely used Athena++ astrophysical magnetohydrodynamics code, but generalized to serve as the foundation for a variety of downstream multi-physics codes. Parthenon adopts the Kokkos programming model, and provides various levels of abstractions from multidimensional variables, to packages defining and separating components, to launching of parallel compute kernels. Parthenon allocates all data in device memory to reduce data movement, supports the logical packing of variables and mesh blocks to reduce kernel launch overhead, and employs one-sided, asynchronous MPI calls to reduce communication overhead in multi-node simulations. Using a hydrodynamics miniapp, we demonstrate weak and strong scaling on various architectures including AMD and NVIDIA GPUs, Intel and AMD x86 CPUs, IBM Power9 CPUs, as well as Fujitsu A64FX CPUs. At the largest scale on Frontier (the first TOP500 exascale machine), the miniapp reaches a total of 1.7 × 10 13 zone-cycles/s on 9216 nodes (73,728 logical GPUs) at [Formula: see text] weak scaling parallel efficiency (starting from a single node). In combination with being an open, collaborative project, this makes Parthenon an ideal framework to target exascale simulations in which the downstream developers can focus on their specific application rather than on the complexity of handling massively-parallel, device-accelerated AMR.

97 MATHEMATICS AND COMPUTING↗

Data Locality Enhancement of Dynamic Simulations for Exascale Computing (Final Report)

The development of modern processors exhibits two trends that complicate the optimizations of modern software. The first is the increasing sensitivity of processors' throughput to irregularities in computation. With more processors produced through a massive integration of simple cores, future systems will increasingly favor regular data-level parallel computations, but deviate from the needs of applications with complex patterns. Some evidences are already shown on Graphic Processing Units (GPU): Irregular data accesses (e.g., indirect references A[D[i]]) and conditional branches are limiting many GPU applications' performance at a level an order of magnitude lower than the peak of GPU. The second hardware trend is the growing gap between memory bandwidth and the aggregate speed—that is, the sum of all cores' computing power—of a Chip Multiprocessor (CMP). Despite the capped growth of the peak CPU speed, the aggregate speed of a CMP keeps increasing as more cores get into a single chip. It is expected that by 2018, node concurrency in an exascale system will increase by hundreds of times, whereas, memory bandwidth will expand by only 10 to 20 times. Consequently, data movement and storage is expected to consume more than 70% of the total system power. Bridging this gap is difficult; the complexities of modern CMP memory hierarchy make it even harder: Data cache becomes shared among computing units, and the sharing is often non-uniform—whether two computing units share a cache depends on their proximity and the level of the cache. On the recent IBM Power7 architecture, for instance, four hardware contexts (or SMT threads) in a core share the entire memory hierarchy, all cores in one chip share an on-chip L3 cache, and cores across chips share L3 and main memory through off-chip connections. These two trends complicate the translation of computing power into performance, especially for a program with either intensive data accesses or complex patterns in data accesses or control flow paths. Unfortunately, both attributes present and will persist in a class of important applications. For instance, many scientific simulations deal with a large volume of data. And meanwhile, as most real-world processes are non-uniform and evolving (e.g., the evolution of a galaxy or the process of a drug injection), both the computations and data accesses of these programs tend to be irregular and dynamically changing. Currently, the lack of support to these applications on modern CMP severely limits their performance. On GPU, as our recent study shows and other studies echo, performance enhancement of a factor of integers is possible when memory accesses or control flows are streamlined for a set of GPU applications. On multicore CPU, our studies show that traditional locality enhancement, for being oblivious to the new features of multicore memory hierarchy, may even cause large slowdown to data-intensive dynamic applications. The severity of the issues is expected to worsen as the two hardware trends continue. Some recent studies try to match software with the trends, but in a limited scope or manner. For irregularities on GPU, most studies focus on irregularities analyzable through static analysis (e.g., data accesses in regular loops). Dynamic irregularities are harder to address because the needed analysis and transformations typically have to happen at run time. Some other research resorts to hardware extensions, an actual adoption of which is unclear for the entailed space cost and complexity. For data locality, recent years have seen some exploitations of the new memory hierarchy on multicore for performance, but most of them are on process or thread scheduling, rather than program transformations. Our recent study reveals that program-level transformations may magnify the scheduling benefits by a factor of seven, concluding that program-level transformation should play a central role for data locality enhancement on modern CMP. But research in this direction has been sparse, and most have focused on data layout or cache performance modeling, rather than program transformations to match with the new memory hierarchy features. Overall, it is still an open question how to bridge the gap between dynamic computations and the two prominent properties of modern processors. The goal of this project is to develop a set of techniques and software tools to enhance the matching between memory accesses in dynamic simulations and the prominent features of modern and future CMP, alleviating the memory performance issues for petascale and exascale computing. This report summarizes the discoveries and products produced throughout this project. It includes free launch, a new software approach to overcoming the shortcomings of both methods; coherence-free multiview, an approach that allows multiple views of a single data object to co-exist on GPU memory during a GPU kernel execution; algorithmic optimizations to data analytics problems, especially those that involve lots of distance calculations. Supporting dynamic parallelism is important for GPU to benefit a broad range of applications. There are currently two fundamental ways for programs to exploit dynamic parallelism on GPU: a software-based approach with software-managed worklists, and a hardware-based approach through dynamic subkernel launches. Neither is satisfactory. The former is complicated to program and is often subject to some load imbalance; the latter suffers large runtime overhead. In this work, we propose free launch, a new software approach to overcoming the shortcomings of both methods. It allows programmers to use subkernel launches to express dynamic parallelism. It employs a novel compiler-based code transformation named subkernel launch removal to replace the subkernel launches with the reuse of parent threads. Coupled with an adaptive task assignment mechanism, the transformation reassigns the tasks in the subkernels to the parent threads with a good load balance. The technique requires no hardware extensions, immediately deployable on existing GPUs. It keeps the programming convenience of the subkernel launch-based approach while avoiding its large runtime overhead. Meanwhile, its superior load balancing makes it outperform manual worklist-based techniques by 3X on average. The work was published at the 48th Annual IEEE/ACM International Symposium on Microarchitecture (Micro'2015). A Graphic Processing Unit (GPU) system is typically equipped with many types of memory (e.g., global, constant, texture, shared, cache). Data placement determines what data are placed on which type of memory, essential for GPU memory performance. Prior optimizations of data placement always require a single view of a data object on memory, which limits the optimization effectiveness. In this work, we propose coherence-free multiview, an approach that allows multiple views of a single data object to co-exist on GPU memory during a GPU kernel execution. We demonstrate that under certain conditions, the multiple views can remain incoherent while facilitating enhanced data placement. We present a theorem and some compiler support to ensure the soundness of the usage of coherence-free multiview. We further develop reference-discerning data placement, a new way to enhance data placements on GPU. It enables more flexible data placements by using coherence-free multiview to leverage the slack in coherence requirement of some GPU programs. Experiments on three types of GPU systems show that, with less than 200KB space cost, the new data placement technique can provide a 1.6X average (up to 4.27X) speedup. In addition, we have examined algorithmic optimizations to data analytics problems, especially those that involve lots of distance calculations. Computing distances among data points is an essential part of many important algorithms in data analytics, graph analysis, and other domains. In each of these domains, developers have spent significant manual effort optimizing algorithms, often through novel applications of the triangle equality, in order to minimize the number of distance computations in the algorithms. In this work, we observe that many algorithms across these domains can be generalized as an instance of a generic distance-related abstraction. Based on this abstraction, we derive seven principles for correctly applying the triangular inequality to optimize distance-related algorithms. Guided by the findings, we develop Triangular OPtimizer (TOP), the first software framework that is able to automatically produce optimized algorithms that either matches or outperforms manually designed algorithms for solving distance-related problems. TOP achieves up to 237x speedups and 2.5X on average. The work has been published at the 32nd International Conference on Machine Learning (ICML'15) and the 41st International Conference on Very Large Data Bases (VLDB'15).

42 ENGINEERING↗

Efficient Bulk Data Replication for the Earth System Grid

The Earth System Grid (ESG) community faces the difficult challenge of managing the distribution of massive data sets to thousands of scientists around the world. To move data replicas efficiently, the ESG has developed a data transfer management tool called the Bulk Data Mover (BDM). We describe the performance results of the current system and plans towards extending the techniques developed so far for the up- coming project, in which the ESG will employ advanced networks to move multi-TB datasets with the ulti- mate goal of helping researchers understand climate change and its potential impacts on world ecology and society.

97 MATHEMATICS AND COMPUTING↗

Stable Rate of Slip Along the Karakax Section of the Altyn Tagh Fault from Observation of Interglacial and Postglacial Offset Morphology and Surface Dating

Digital elevation maps obtained using TanDEM-X and Pleiades data combined with newly obtained surface age estimates using cosmogenic radionuclide (CRN) and optically simulated luminescence (OSL) methods are used to quantify the slip rate along the western section of the Altyn Tagh Fault in southern Xinjiang. The reconstruction of the conical shape of massive alluvial fans inferred to be from the Eemian (115±7 ka) from CRN dating shows consistent left-lateral offsets of 300±20 m, yielding a slip rate of 2.6±0.3 mm/year. Successive episodes of incision have left cut terraces inset in wide canyons, 10–25 m below the fans' surface. The incision was followed by the deposition of a broad terrace of early Holocene age, which is reincised by modern stream channels. Near the village of Shanxili, a 200 m wide valley is partially dammed by a shutter ridge displaced by the fault. A fill terrace deposited upstream from the ridge has an OSL age of 8.8±0.6 ka. The 23±2 m offset of the riser incising the terrace indicates a minimum postdepositional movement on the fault, yielding a Holocene rate of 2.6±0.5 mm/year, consistent with the 115-ka average slip rate. Furthermore, scarp degradation analysis using mass diffusion reveals a nonlinear relationship between fault displacement and degradation coefficient along the progressively exposed fault scarp, a pattern suggesting either seismic clustering or variable diffusion rate since the Eemian. Together with the Gozha Co-Longmu Co fault to the south, the Karakax section of the Altyn Tagh Fault contributes to the eastward movement of the western corner of Tibet.

58 GEOSCIENCES↗

A Pervasive Parallel Processing Framework for Data Visualization and Analysis at Extreme Scale

Most of today’s visualization libraries and applications are based off of what is known today as the visualization pipeline. In the visualization pipeline model, algorithms are encapsulated as “filtering” components with inputs and outputs. These components can be combined by connecting the outputs of one filter to the inputs of another filter. The visualization pipeline model is popular because it provides a convenient abstraction that allows users to combine algorithms in powerful ways. Unfortunately, the visualization pipeline cannot run effectively on exascale computers. Experts agree that the exascale machine will comprise processors that contain many cores. Furthermore, physical limitations will prevent data movement in and out of the chip (that is, between main memory and the processing cores) from keeping pace with improvements in overall compute performance. To use these processors to their fullest capability, it is essential to carefully consider memory access. This is where the visualization pipeline fails. Each filtering component in the visualization library is expected to take a data set in its entirety, perform some computation across all of the elements, and output the complete results. The process of iterating over all elements must be repeated in each filter, which is one of the worst possible ways to traverse memory when trying to maximize the number of executions per memory access. This project investigates a new type of visualization framework that exhibits a pervasive parallelism necessary to run on exascale machines. Our framework achieves this by defining algorithms in terms of functors, which are localized, stateless operations. Functors can be composited in much the same way as filters in the visualization pipeline. But, functors’ design allows them to be concurrently running on massive amounts of lightweight threads. Only with such fine-grained parallelism can we hope to fill the billions of threads we expect will be necessary for efficient computation on an exascale computer. This project concludes with a functional prototype containing pervasively parallel algorithms that perform demonstratively well on many-core processors. These algorithms are fundamental for performing data analysis and visualization at extreme scale.

97 MATHEMATICS AND COMPUTING↗

Assessing the geomechanical stability of interbedded hydrate-bearing sediments under gas production by depressurization at NGHP-02 Site 16

Establishing the geomechanical stability of marine sediments in the vicinity of a production well is one of the key design considerations in planning offshore gas production from marine hydrate reservoirs. This work presents an assessment of the sediment stability at India's National Gas Hydrate Program, Expedition 2 (NGHP-02) Site 16 Area B offshore eastern India, for which gas production is to be carried out by depressurization. One important feature of the study is that extensive calibration of constitutive model parameters has been conducted based on laboratory test data from pressured core samples. From analysis perspective, the site is challenging because the hydrate reservoir consists of thin layers of hydrate-bearing sands interbedded with mud. Moreover, depressurization at the depth of a reservoir more than 2750 m below sea surface will lead to a pore pressure drop, and accordingly an effective confining stress increase as high as 25 MPa. In dealing with thin interbedded hydrate-bearing strata, meshing requirements for flow and geomechanical analysis are quite different from those for reservoirs with thicker massive layers, An axisymmetric model and one-way coupling simulations were thus adopted for this study, in which the geomechanical study utilizes pore pressure and hydrate saturation output from the flow study, but the flow study does not takes the porosity changes from the geomechanical analysis. Instead, the reduction of porosity due to sediment deformation in the flow study is based on a pressure-dependent pore compressibility relationship derived from geomechanical modeling. The rationality is validated through back computing the pore compressibility from the geomechanical deformation results. Finally, the study shows that large compression in the reservoir will result in movement of the sediments from above and below, as well as laterally in smaller magnitudes; and the sediment is deemed stable during the gas production period.

58 GEOSCIENCES↗

Climatic and Demographic Consequences of the Massive Volcanic Eruption of 1258

Somewhere in the tropics, a volcano exploded violently during the year 1258, producing a massive stratospheric aerosol veil that eventually blanketed the globe. Arctic and Antarctic ice cores suggest that this was the world's largest volcanic eruption of the past millennium. According to contemporary chronicles, the stratospheric dry fog possibly manifested itself in Europe as a persistently cloudy aspect of the sky and also through an apparently total darkening of the eclipsed Moon. Based on a sudden temperature drop for several months in England, the eruption's initiation date can be inferred to have been probably January 1258. The frequent cold and rain that year led to severe crop damage and famine throughout much of Europe. Pestilence repeatedly broke out in 1258 and 1259; it occurred also in the Middle East, reportedly there as plague. Another very cold winter followed in 1260-1261. The troubled period's wars, famines, pestilences, and earthquakes appear to have contributed in part to the rise of the European flagellant movement of 1260, one of the most bizarre social phenomena of the Middle Ages. Analogies can be drawn with the climatic aftereffects and European social unrest following another great tropical eruption, Tambora in 1815. Some generalizations about the climatic impacts of tropical eruptions are made from these and other data.

Stothers, Richard B.↗

Atmospheres of low-mass planets: The “boil-off”

We show that, for a low-mass planet that orbits its host star within a few tenths of an AU (like the majority of the Kepler planets), the atmosphere it was able to accumulate while embedded in the protoplanetary disk may not survive unscathed after the disk disperses. This gas envelope, if more massive than a few percent of the core (with a mass below 10M{sub ⊕}), has a cooling time that is much longer than the timescale on which the planet exits the disk. As such, it could not have contracted significantly from its original size, of the order of the Bondi radius. So a newly exposed protoplanet would be losing mass via a Parker wind that is catalyzed by the stellar continuum radiation. This represents an intermediate stage of mass-loss, occurring soon after the disk has dispersed, but before the EUV/X-ray driven photoevaporation becomes relevant. The surface mass-loss induces a mass movement within the envelope that advects internal heat outward. As a result, the planet atmosphere rapidly cools down and contracts, until it has reached a radius of the order of 0.1 Bondi radius, at which time the mass-loss effectively shuts down. Within a million years after the disk disperses, we find a planet that has only about 10% of its original envelope, and a Kelvin–Helmholtz time that is much longer than its actual age. We suggest that this “boil-off” process may be partially responsible for the lack of planets above a radius of 2.5R{sub ⊕} in the Kepler data, provided planet formation results in initial envelope masses of tens of percent.

79 ASTRONOMY AND ASTROPHYSICS↗

Expansion of the Fuel Motion Monitoring System

The Idaho National Laboratory (INL) Transient Reactor Test Facility (TREAT) Fuel Motion Monitoring System (FMMS) is a diagnostic tool used to visualize the movement and location of fuel within the nuclear reactor during transient experiments. TREAT is designed to test the behavior of nuclear fuel under accident conditions, such as a rapid power increase. The TREAT FMMS, also referred to as the “hodoscope” because of the system’s massive steel collimator component, is located on the North beam port of the reactor. While the FMMS system is capable of incorporating a total of 360 sensors, initial refurbishment efforts resulted in a array of 96 fast neutron detectors. This initial array was configured to provide a narrow (2 channels) full-length view of experiment vessels with an extended 4-channel–wide region in the center of the array capable of providing a full view of all initially planned experiments. Planning and efforts to expand the FMMS array began immediately following the restart of TREAT. An additional 96 detectors were evaluated, characterized, and prepared for installation at TREAT during the summer of 2018. Unfortunately, funding reductions forced the project towards a 5-year hiatus. In October of 2023 funding from the Department of Energy’s Nuclear Science User Facilities enabled the expansion to recommence. This report serves to document the activities performed to expand the FMMS detector array to 192 channels in order to provide a broader view of the larger and more sophisticated test capsules currently planned for future irradiation in the TREAT reactor. This expansion also included doubling the data acquisition capability, addressing the new heat load on the system, and synchronizing the time for all digital components.

11 - NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Terascale direct numerical simulations of turbulent combustion using S3D.

Computational science is paramount to the understanding of underlying processes in internal combustion engines of the future that will utilize non-petroleum-based alternative fuels, including carbon-neutral biofuels, and burn in new combustion regimes that will attain high efficiency while minimizing emissions of particulates and nitrogen oxides. Next-generation engines will likely operate at higher pressures, with greater amounts of dilution and utilize alternative fuels that exhibit a wide range of chemical and physical properties. Therefore, there is a significant role for high-fidelity simulations, direct numerical simulations (DNS), specifically designed to capture key turbulence-chemistry interactions in these relatively uncharted combustion regimes, and in particular, that can discriminate the effects of differences in fuel properties. In DNS, all of the relevant turbulence and flame scales are resolved numerically using high-order accurate numerical algorithms. As a consequence terascale DNS are computationally intensive, require massive amounts of computing power and generate tens of terabytes of data. Recent results from terascale DNS of turbulent flames are presented here, illustrating its role in elucidating flame stabilization mechanisms in a lifted turbulent hydrogen/air jet flame in a hot air co-flow, and the flame structure of a fuel-lean turbulent premixed jet flame. Computing at this scale requires close collaborations between computer and combustion scientists to provide optimized scaleable algorithms and software for terascale simulations, efficient collective parallel I/O, tools for volume visualization of multiscale, multivariate data and automating the combustion workflow. The enabling computer science, applied to combustion science, is also required in many other terascale physics and engineering simulations. In particular, performance monitoring is used to identify the performance of key kernels in the DNS code, S3D and especially memory intensive loops in the code. Through the careful application of loop transformations, data reuse in cache is exploited thereby reducing memory bandwidth needs, and hence, improving S3D's nodal performance. To enhance collective parallel I/O in S3D, an MPI-I/O caching design is used to construct a two-stage write-behind method for improving the performance of write-only operations. The simulations generate tens of terabytes of data requiring analysis. Interactive exploration of the simulation data is enabled by multivariate time-varying volume visualization. The visualization highlights spatial and temporal correlations between multiple reactive scalar fields using an intuitive user interface based on parallel coordinates and time histogram. Finally, an automated combustion workflow is designed using Kepler to manage large-scale data movement, data morphing, and archival and to provide a graphical display of run-time diagnostics.

33 ADVANCED PROPULSION SYSTEMS↗

Airborne Radar Observations of Hurricane Georges during Landfall over the Dominican Republic

On 22 September 1998 hurricane Georges made landfall on the Dominican Republic (DR). Georges cost the DR at least 500 lives, made more than 155,000 people homeless and caused extensive damage to the country's main industries, tourism and agriculture. There was considerable wind damage, with wind gusts up to 58 m/s in Santa Domingo on the south coast, but most of the damage and deaths resulted from mudslides and the flooding of rivers. While this may have been the worst natural disaster to strike the DR, the sustained rapid storm movement saved the island from worse damage. Georges had previously affected several islands in the Lesser Antilles and Puerto Rico, but it had retained much of its circulation strength. Forty raingauge stations across the DR measured rainfall totals from Georges between 0.7 and 41 cm, the latter at the capital Santo Domingo, located on the south coast. At Herrera the maximum 1 h rainfall rate was 72 mm/h. It is suspected that much higher rain rates occurred in DR's mountainous interior. Before landfall the eye was clearly evident in satellite imagery. When the eye moved over southeastern DR, it filled rapidly, and the cloud top height decreased in all storm sectors except in the southern inflow sector, where a long-lived MCS, with a diameter larger than that of the eyewall, slowly became enwrapped in the hurricane circulation. The eye closure was most rapid between 16-18 UTC, when the eyewall circulation felt the mountainous terrain of the Cordillera Central, which rises up to 3,093 m. The estimated central pressure increased from 962 hPa at 15 UTC to 986 hPa at 03Z on 23 Sept, and the maximum sustained surface wind speed decreased from 54 to 36 in s-1 during the same period. The island of Hispaniola has a cross-track width of about 250 km, much wider than the diameter of the eyewall anvil (about 100 km before landfall). So the event can truly be considered to be a landfalling case, even though Georges recovered after crossing Hispaniola, albeit never to the same strength. This talk will summarize satellite and ground observations of Georges, as it passed the DR, and it will focus on EDOP data. In particular, we will try to estimate the rainfall rate over the mountainous terrain of the DR. And we will use detailed sounding data to explain the presence and characteristics of the massive MCS to the south, as well as the upper-level updrafts apparent over this MCS and over the mountains of the DR.

Geerts, B.↗