Noble-metal dark-edge fermiology: Centrifugal barriers, core-hole memory, and the Zeeman Auger effect
Explore the source record for details and available documents.
99 GENERAL AND MISCELLANEOUS↗
SEARCH · Engineering Papers
Results for “core 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.
Partial densities of states from x-ray absorption and Auger electron spectroscopy: Use of core-hole memory
Ag L 3 edge x-ray absorption and L 3 −M 4,5 M 4,5 Auger electron spectra have been measured and simulated for a variety of x-ray electric-field polarization and Auger electron emission directions. The theory relies on density-functional theory, use of the Bethe–Salpeter equation, atomic multiplet theory, and a simplified model for the Auger line shape and its dependence on photon energy. We also demonstrate that partial densities of states for dT 2g , dE g , and sA g symmetry partial-wave channels at the Ag site in the solid can be deduced from the experimental measurements with only atomic theoretical input, i.e., with no solid-state theory other than assuming a Fermi edge.
36 MATERIALS SCIENCE↗
Partial densities of states from x-ray absorption and Auger electron spectroscopy: Use of core-hole memory
Explore the source record for details and available documents.
99 GENERAL AND MISCELLANEOUS↗
Programming Strategies for Irregular Algorithms on the Emu Chick
The Emu Chick prototype implements migratory memory-side processing in a novel hardware system. Rather than transferring large amounts of data across the system interconnect, the Emu Chick moves lightweight thread contexts to near-memory cores before the beginning of each remote memory read. Previous work has characterized the performance of the Chick prototype in terms of memory bandwidth and programming differences from more typical, non-migratory platforms, but there has not yet been an analysis of algorithms on this system. This work evaluates irregular algorithms that could benefit from the lightweight, memory-side processing of the Chick and demonstrates techniques and optimization strategies for achieving performance in sparse matrix-vector multiply operation (SpMV), breadth-first search (BFS), and graph alignment across up to eight distributed nodes encompassing 64 nodelets in the Chick system. We also define and justify relative metrics to compare prototype FPGA-based hardware with established ASIC architectures. The Chick currently supports up to 68x scaling for graph alignment, 80 MTEPS for BFS on balanced graphs, and 50% of measured STREAM bandwidth for SpMV.
Hein, Eric↗
Online randomized interpolative decomposition with a posteriori error estimator for temporal PDE data reduction
Traditional low-rank approximation is a powerful tool for compressing large data matrices that arise in simulations of partial differential equations (PDEs), but suffers from high computational cost and requires several passes over the PDE data. The compressed data may also lack interpretability thus making it difficult to identify feature patterns from the original data. Here, to address these issues, we present an online randomized algorithm to compute the interpolative decomposition (ID) of large-scale data matrices in situ. Compared to previous randomized IDs that used the QR decomposition to determine the column basis, we adopt a streaming ridge leverage score-based column subset selection algorithm that dynamically selects proper basis columns from the data and thus avoids an extra pass over the data to compute the coefficient matrix of the ID. In particular, we adopt a single-pass error estimator based on the non-adaptive Hutch++ algorithm to provide real-time error approximation for determining the best coefficients. As a result, our approach only needs a single pass over the original data and thus is suitable for large and high-dimensional matrices stored outside of core memory or generated in PDE simulations. A strategy to improve the accuracy of the reconstructed data gradient, when desired, within the ID framework is also presented. We provide numerical experiments on turbulent channel flow and ignition simulations, and on the NSTX Gas Puff Image dataset, comparing our algorithm with the offline ID algorithm to demonstrate its utility in real-world applications.
Column subset selection↗
The neutrino gravitational memory from a core collapse supernova: phenomenology and physics potential
General Relativity predicts that the passage of matter or radiation from an asymmetrically-emitting source should cause a permanent change in the local space-time metric. This phenomenon, called the gravitational memory effect, has never been observed, however supernova neutrinos have long been considered a promising avenue for its detection in the future. With the advent of deci-Hertz gravitational wave interferometers, observing the supernova neutrino memory will be possible, with important implications for multimessenger astronomy and for tests of gravity. In this work, we develop a phenomenological (analytical) toy model for the supernova neutrino memory effect, which is overall consistent with the results of numerical simulations. This description is then generalized to several case studies of interest. We find that, for a galactic supernova, the dimensionless strain, h(t), is of order ~ 10 -22 - 10 -21 , and develops over a typical time scale that varies between ~ 0.1 - 10 s, depending on the time-evolution of the anisotropy of the neutrino emission. The characteristic strain, h c (f), has a maximum at a frequency f max ~ Script $\mathcal{O}$(10 -1 ) - Script $\mathcal{O}$(1) Hz. The detailed features of the time- and frequency-structure of the memory strain will inform us of the matter dynamics near the collapsed core, and allow to distinguish between different stellar collapse scenarios. Next generation gravitational wave detectors like DECIGO and BBO will be sensitive to the neutrino memory effect for supernovae at typical galactic distances and beyond; with Ultimate DECIGO exceeding a detectability distance of 10 Mpc
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Gravitational-wave and Gravitational-wave Memory Signatures of Core-collapse Supernovae
Abstract In this paper, we calculate the energy, signal-to-noise ratio (SNR), detection range, and angular anisotropy of the matter, matter memory, and neutrino memory gravitational-wave (GW) signatures of 21 three-dimensional initially nonrotating core-collapse supernova (CCSN) models carried to late times. We find that inferred energy, SNR, and detection range are angle-dependent quantities, and that the spread of possible energy, signal to noise, and detection ranges across all viewing angles generally increases with progenitor mass. When examining the low-frequency matter memory and neutrino memory components of the signal, we find that the neutrino memory is the most detectable component of a CCSN GW signal, and that DECIGO is best equipped to detect both matter memory and neutrino memory. Moreover, we find that the polarization angle between the h + and h × strains serves as a unique identifier of matter and neutrino memory. Finally, we develop a Galactic density- and stellar mass-weighted formalism to calculate the rate at which we can expect to detect CCSN GW signals with the Advanced Laser Interferometer Gravitational-Wave Observatory (aLIGO). When considering only the matter component of the signal, the aLIGO detection rate is around 65% of the total Galactic supernova rate, but increases to 90% when incorporating the neutrino memory component. We find that all future detectors (Einstein Telescope, Cosmic Explorer, DECIGO) will be able to detect CCSN GW signals from the entire Galaxy, and for the higher-mass progenitors even into the Local Group of galaxies.
Choi, Lyla (ORCID:0000000153860133)↗
Streaming Data Reorganization at Scale with DeltaFS Indexed Massive Directories
We report complex storage stacks providing data compression, indexing, and analytics help leverage the massive amounts of data generated today to derive insights. It is challenging to perform this computation, however, while fully utilizing the underlying storage media. This is because, while storage servers with large core counts are widely available, single-core performance and memory bandwidth per core grow slower than the core count per die. Computational storage offers a promising solution to this problem by utilizing dedicated compute resources along the storage processing path. We present DeltaFS Indexed Massive Directories (IMDs), a new approach to computational storage. DeltaFS IMDs harvest available (i.e., not dedicated) compute, memory, and network resources on the compute nodes of an application to perform computation on data. We demonstrate the efficiency of DeltaFS IMDs by using them to dynamically reorganize the output of a real-world simulation application across 131,072 CPU cores. DeltaFS IMDs speed up reads by 1,740x while only slightly slowing down the writing of data during simulation I/O for in situ data processing.
97 MATHEMATICS AND COMPUTING↗
Shared-Memory Scalable k-Core Maintenance on Dynamic Graphs and Hypergraphs.
Abstract not provided.
Gabert, Kasimir Georg↗
Shared-Memory Scalable k-Core Maintenance on Dynamic Graphs and Hypergraphs.
Abstract not provided.
Gabert, Kasimir Georg↗
Indicator-directed Dynamic Power Management for Iterative Workloads on GPU-Accelerated Systems
Modern high-performance and warehouse computing centers show strong interest in minimizing system power consumption while satisfying customers’ quality of service (QoS). Dynamic voltage and frequency scaling (DVFS) is effective for achieving this goal. Nevertheless, automating the process online and making it transparent to users must address three major challenges: (1) Complexity — today’s hardware components (e.g., CPUs, GPUs, memory, network, etc.) can be configured in several or dozens of frequency/voltage states for satisfying divergent system demands. Given their combination and the emergence of heterogeneity, searching the optimal configuration in the design space online can be timing consuming. (2) QoS guarantee — user-defined objectives such as power constraint and performance target must be monitored, predicted and ensured at the best effort. (3) Adaptability — various known and unknown workloads run on systems. Workloads characteristics should be quickly determined and configurations dynamically adjusted in accord with workloads and QoS. In this work, we focus on applications exhibiting an interesting feature – iterative or periodic, which is common among conventional HPC and emerging machine learning workloads. We propose an online dynamic power-performance (ODPP) management framework to dynamically adjust GPU DVFS configurations to meet performance and power objectives and constraints, without any code annotation or intrusion. Particularly, ODPP extracts the performance and power indicators for applications from their resources utilization profiles in a short episode. It further automatically constructs an accurate model that infers from the indicators how the application's performance and power vary with GPU core and memory frequencies. Aided with the model, for both seen and unseen applications, ODPP can quickly determine the most appropriate DVFS configuration for their execution. We evaluate ODPP on an NVIDIA GPU using multiple exascale computing (ECP) and deep learning applications.
Zou, Pengfei↗
A compute-bound formulation of Galerkin model reduction for linear time-invariant dynamical systems
This work aims to advance computational methods for projection-based reduced-order models (ROMs) of linear time-invariant (LTI) dynamical systems. For such systems, current practice relies on ROM formulations expressing the state as a rank-1 tensor (i.e., a vector), leading to computational kernels that are memory bandwidth bound and, therefore, ill-suited for scalable performance on modern architectures. This weakness can be particularly limiting when tackling many-query studies, where one needs to run a large number of simulations. This work introduces a reformulation, called rank-2 Galerkin, of the Galerkin ROM for LTI dynamical systems which converts the nature of the ROM problem from memory bandwidth to compute bound. We present the details of the formulation and its implementation, and demonstrate its utility through numerical experiments using, as a test case, the simulation of elastic seismic shear waves in an axisymmetric domain. We quantify and analyze performance and scaling results for varying numbers of threads and problem sizes. In conclusion, we present an end-to-end demonstration of using the rank-2 Galerkin ROM for a Monte Carlo sampling study. We show that the rank-2 Galerkin ROM is one order of magnitude more efficient than the rank-1 Galerkin ROM (the current practice) and about 970 times more efficient than the full-order model, while maintaining accuracy in both the mean and statistics of the field.
97 MATHEMATICS AND COMPUTING↗
Memory-triggered supernova neutrino detection
Here, we demonstrate that observations of the gravitational memory from core collapse supernovae at future deci-Hz interferometers enable time-triggered searches of supernova neutrinos at Mt-scale detectors. Achieving a sensitivity to characteristic strains of at least $\sim 10^{–25}$ at $f ≃ 0.3$ $\mathrm{Hz}$ —e.g., by improving the noise of DECIGO by one order of magnitude—will allow robust time triggers for supernovae at distances $D \sim 40–300$ $\mathrm{Mpc}$, resulting in a nearly background-free sample of $\sim 3–70$ neutrino events per Mt per decade of operation. This sample would bridge the sensitivity gap between rare galactic supernova bursts and the cosmological diffuse supernova neutrino background, allowing detailed studies of the neutrino emission of supernovae in the local Universe.
79 ASTRONOMY AND ASTROPHYSICS↗
Performance and usability enhancements for continuous subgraph matching queries on graph-structured data
A query graph, which includes vertices and edges, represents a query on graph-structured data. The query graph is decomposed into query subgraphs. A network analysis tool performs continuous subgraph matching queries to facilitate analysis of computer network traffic, social media events, or other streams of data represented as a dynamic data graph (graph-structured data). This can help identify emerging trends in the data. Some features of the network analysis tool enhance performance by effectively utilizing distributed computing resources (including processing cores and memory at different nodes of a cluster) to speed up the process of updating the dynamic data graph and detecting matches of query subgraphs. Features of a query graph building tool enhance usability by providing intuitive ways to specify query graphs and their subgraphs. Features of a results visualization tool enhance usability by providing an intuitive way to present the results of continuous subgraph matching queries.
Choudhury, Sutanay↗
ZFP Hardware Implementation
As core counts increase in new HPC systems with comparatively little increase in memory bandwidth, the trend is an effective decrease in memory bandwidth per core. Other bandwidth limitations in HPC systems exist between CPU and GPU memory, between system nodes, and between node memory and storage. Compression of floating-point data has the potential to reduce data movement and pressure across these communication channels. Furthermore, it has the potential to reduce the footprint of floating-point arrays stored in memory. ZFP, implemented in software, is gaining traction as an effective method in floating-point compression; however, performance gains are limited to the spare compute cycles available before reaching the bandwidth limitations of the communication channel. A hardware implementation of ZFP has the potential to raise the bar on performance. From the inception of ZFP, it was designed to accommodate a hardware implementation.
42 ENGINEERING↗
Accuracy Enhancement of Nuclear Power Plant Simulators Utilizing High Accuracy Simulation Predictions
More recently, reactor core simulators for core designs associated with commercial nuclear power plants that utilize what is believed to be higher fidelity models have been developed. Features such as neutronics models that utilize transport equation solvers with fine spatial meshes and many energy-groups, thermal-hydraulic models that utilize sub-channel solvers with fine spatial mesh and capable of treating a wide range of fluid conditions, and fuel-coolant chemistry interaction models capable of treating CRUD deposition are to be found in these higher fidelity core simulators. These reactor core simulators require access to higher performance computers, characterized by many processors, cores and large memory. So associated with utilization of these simulators is access to high performance computers and ability to accommodate in one’s workflow longer execution times. By contrast, currently used core simulators by the nuclear industry can execute on engineering workstations and have execution times of seconds to minutes. The desirability for having short execution times is not only desired for support of time critical tasks but supports the mental process of decision making by engineers. The goal of the work reported upon here has the objective of retaining the fidelity of higher fidelity models while retaining the ability to utilize engineering workstations. Beyond the core simulator goal, additional goals of this work include incorporating the just described core simulator capability into a Nuclear Steam Supply System (NSSS) simulator, and to incorporate the resulting capability into an environment supportive of design and operational decision making associated with nuclear power stations. The model selected for the core neutronics model is the NESTLE code, for the core thermal-hydraulic model is the CTF code utilizing coarse mesh, and for the NSSS model is the RELAP5-3D code. WSC’s proprietary 3KEYMASTERTM platform is being used to provide software coupling, user interface, visualization, and reporting. The NESTLE core neutronics simulator was first integrated with the CTF core thermal-hydraulic simulator using CTF developed communication commands which are also used for CTF to communicate with RELAP5-3D under WSC’s proprietary 3KEYMASTERTM platform. To assure NESTLE prediction consistency with higher fidelity core neutronic simulators, buffer codes have been created to automatically generate from output files written by the VERA core simulator the NESTLE nodal neutronic parameter’ library, geometry, and pin-power reconstruction input files, thereby avoiding a number of challenges associated with utilizing lattice physics codes and providing consistency with VERA predictions. To treat absorber rod effects a multi-set library is utilized, where a set refers to a specific absorber rod fully inserted pattern. A coarse spatial mesh CTF model was developed with features added that support using CTF as envisioned in the engineering quality simulator. A hybrid meshing approach was implemented to allow for automated construction of models with mixed levels of refinement. Specifically, a core model could resolve some assemblies at a nodal level (4 subchannels per assembly) and others at a pin-resolution (one subchannel per coolant subchannel in the assembly). The intention is that this will allow for better resolution of limiting conditions such as DNBR and PCT, which are based on local rod and subchannel conditions. Further development was done of features that enhance the capabilities for the envisioned engineering quality simulator that has been developed, but now for RELAP-3D. The RELAP5-3D code development includes ability to model more than 999 components and the addition of the cross-channels turbulence mixing model and the void drift model that are implemented in CTF, aiming to achieve closer prediction agreement of the two codes for transient simulations, specifically, more accurate matches of the overall mass, momentum, and energy exchanges of both the liquid and gas phases between the neighboring core assemblies. Graphics were also developed for the Instructor Station for this project under WSC’s proprietary 3KEYMASTERTM platform to facilitate design and operational decision making.
42 ENGINEERING↗
Sensitivity Study of Mini-Batch Size on a Long Short-Term Memory Network for In-situ Sensing of Core-to-shell Ratio of Microencapsulated Phase Change Materials
Microencapsulated phase change materials are being studied for applications for thermal energy storage in concentrated solar fields. During fabrication, the thickness of the encapsulation cannot be readily measured for real-time control. Therefore, a machine learning network, specifically a Long Short-Term Memory network, is being developed to estimate the ratio of the shell radius to core radius based on a one second temperature history. The mini-batch size determines how often the algorithm weights are updated during network training, and shuffle indicates whether the training data is shuffled during training. A general factorial design is used to analyze the effects of varying mini-batch size and shuffle, along with the core-to-shell ratio, on the RMSE of the response from the Long Short-Term Memory network. It was found that the network performed better for smaller core to shell ratios (less than 0.6) and had the lowest RMSE when the minibatch size was 128. The minimum RMSE found was 0.00501.
Shannon, Rebecca↗
Fragile-to-strong transition in liquid As 2 S 3 under pressure: The effect of melt metallization
The well-known classification of glass-forming melts into fragile and strong liquids has several notable exceptions, including water, silica, and certain phase-change materials (PCMs). These exceptional fluid systems exhibit a fragile-to-strong transition (FST) upon cooling: a transformation from a high-temperature liquid with fast atomic dynamics, low viscosity, and low flow activation energy, to a viscous supercooled melt with high energy barriers near the glass transition temperature T g . This behavior is critically important for non-volatile memories, photonic tensor cores, reconfigurable metamaterials, and other devices, that use PCMs, enabling nanosecond-scale crystallization in the fragile regime and long data retention in the strong regime near or below T g . A significant structural transformation is expected between these two viscosity regimes, along with a semiconductor-metal (SC-M) transition upon heating, driven by high internal pressure and associated density increase. By applying high external pressure to the canonical low-conducting chalcogenide melt As 2 S 3 , we observed both the FST and the SC-M transition, occurring simultaneously within the same domain of the P, T−phase space. These findings suggest that the FST is not limited to a few exceptional liquids but is a common phenomenon, at least in systems that exhibit melt metallization within specific regions of their P, T−phase diagrams.
first-principles molecular dynamics↗