CRADL: Proxy Application for Concurrent Relaxation through Accelerated Deep Learning
Explore the source record for details and available documents.
SEARCH · Search NASA
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.
Explore the source record for details and available documents.
Input signals may be received from monitoring nodes of the industrial asset, each input signal comprising time series data representing current operation. A neutralization engine may transform the input signals into feature vectors in feature space, each feature vector being associated with one of a plurality of overlapping batches of received input signals. A dynamic decision boundary may be generated based on the set of feature vectors, and an abnormal state of the asset may be detected based on the set of feature vectors and a predetermined static decision boundary. An estimated neutralized value for each abnormal feature value may be calculated based on the dynamic decision boundary and the static decision boundary such that a future set of feature vectors will be moved with respect to the static decision boundary. An inverse transform of each estimated neutralized value may be performed to generate neutralized signals comprising time series data that are output.
Abstract not provided.
Explore the source record for details and available documents.
Abstract not provided.
Abstract not provided.
Abstract not provided.
Explore the source record for details and available documents.
Explore the source record for details and available documents.
Explore the source record for details and available documents.
Explore the source record for details and available documents.
Entanglement measures are useful tools in characterizing otherwise unknown quantum phases and indicating transitions between them. Here we examine the concurrence and entanglement entropy in quantum spin chains with random long-range couplings, spatially decaying with a power-law exponent $\textit{α}$. Using the strong disorder renormalization group (SDRG) technique, we find by analytical solution of the master equation a strong disorder fixed point, characterized by a fixed point distribution of the couplings with a finite dynamical exponent, which describes the system consistently in the regime $α > \frac{1}{2}$ . A numerical implementation of the SDRG method yields a power-law spatial decay of the average concurrence, which is also confirmed by exact numerical diagonalization. However, we find that the lowest-order SDRG approach is not sufficient to obtain the typical value of the concurrence. We therefore implement a correction scheme which allows us to obtain the leading-order corrections to the random singlet state. This approach yields a power-law spatial decay of the typical value of the concurrence, which we derive both by a numerical implementation of the corrections and by analytics. Next, using numerical SDRG, the entanglement entropy (EE) is found to be logarithmically enhanced for all $\textit{α}$, corresponding to a critical behavior with an effective central charge $\textit{c}$ = ln(2), independent of $\textit{α}$. This is confirmed by an analytical derivation. Using numerical exact diagonalization (ED), we confirm the logarithmic enhancement of the EE and a weak dependence on $\textit{α}$. For a wide range of partition size $\textit{l}$, the EE fits a critical behavior with a central charge close to $\textit{c}$ = 1, which is the same as for the clean Haldane-Shastry model with a power-law-decaying interaction with $\textit{α}$ = 2. Only for small $l \ll L$, in a range which increases with the number of spins N, we find deviations which are rather consistent with the strong disorder fixed point central charge $\textit{c}$ = ln(2). Furthermore, we find using ED that the concurrence shows power-law decay, albeit with smaller power exponents than obtained by SDRG. Finally, we also present results obtained with DMRG and find agreement with ED for sufficiently small $\textit{α}$ < 2, whereas for larger $\textit{α}$ DMRG tends to underestimate the entanglement entropy and finds a faster decaying concurrence.
Given a pre-trained neural network, Inference-Engine performs maps network inputs to outputs by executing the forward pass through the provided network. Although the predominant programming language for machine-learning is Python, most high-performance computing (HPC) applications are written in Fortran, C, or C++. Inference-Engine aims to support HPC programs and is written in Fortran, a language with a large feature set supporting interoperability with C. This software exposes concurrency in a portable way by using standard language features that some modern Fortran compilers can exploit with various optimizations, including offloading computation to a Graphics Processing Unit (GPU). In particular, this software makes extensive use of Fortran's "do concurrent" parallel loop construct, implicitly parallel array statements, and pure procedures that can be invoked inside "do concurrent" blocks. Inference-Engine also supports dynamic choice of inference methods at runtime. Two current options include one method that uses Fortran's "dot_product" intrinsic function inside "do concurrent" blocks and another method that instead uses Fortran' "matmul" array intrinsic function. We plan to investigate automatic compiler offloading of "do concurrent" calculations to GPUs and compile-time substitution of optimized libraries such as the Basic Linear Algebra Library (BLAS) for "matmul" invocations. We also envision the potential for the choice of which method to use could happen at program launch based on in situ performance measurements on any given platform.
Exascale workloads are expected to incorporate data-intensive processing in close coordination with traditional physics simulations. These emerging scientific, data-analytics and machine learning applications need to access a wide variety of datastores in flat files and structured databases. Programmer productivity is greatly enhanced by mapping datastores into the application process's virtual memory space to provide a unified “in-memory” interface. Currently, memory mapping is provided by system software primarily designed for generality and reliability. However, scalability at high concurrency is a formidable challenge on exascale systems. Also, there is a need for extensibility to support new datastores potentially requiring HPC data transfer services. In this article, we present UMap , a scalable and extensible userspace service for memory-mapping datastores. Furthermore, through decoupled queue management, concurrency aware adaptation, and dynamic load balancing, UMap enables application performance to scale even at high concurrency. We evaluate UMap in data-intensive applications, including sorting, graph traversal, database operations, and metagenomic analytics. Our results show that UMap as a userspace service outperforms an optimized kernel-based service across a wide range of intra-node concurrency by 1.22-1.9 × . We performed two case studies to demonstrate UMap 's extensibility. First, a new datastore residing in remote memory is incorporated into UMap as an application-specific plugin. Second, we present a persistent memory allocator Metall built atop UMap for unified storage/memory.
Abstract Most real‐world networks are both dynamic and multivariate in nature, meaning that the network is associated with various attributes and both the network structure and attributes evolve over time. Visualizing dynamic multivariate networks is of great significance to the visualization community because of their wide applications across multiple domains. However, it remains challenging because the techniques should focus on representing the network structure, attributes and their evolution concurrently. Many real‐world network analysis tasks require the concurrent usage of the three aspects of the dynamic multivariate networks. In this paper, we analyze current techniques and present a taxonomy to classify the existing visualization techniques based on three aspects: temporal encoding, topology encoding, and attribute encoding. Finally, we survey application areas and evaluation methods; and discuss challenges for future research.
Today the LHC offline computing relies heavily on CPU resources, despite the interest in compute accelerators, such as GPUs, for the longer term future. The number of cores per CPU socket has continued to increase steadily, reaching the levels of 64 cores (128 threads) with recent AMD EPYC processors, and 128 cores on Ampere Altra Max ARM processors. Over the course of the past decade, the CMS data processing framework, CMSSW, has been transformed from a single-threaded framework into a highly concurrent one. The first multithreaded version was brought into production by the start of the LHC Run 2 in 2015. Since then, the framework's threading efficiency has gradually been improved by adding more levels of concurrency and reducing the amount of serial code paths. The latest addition was support for concurrent Runs. In this work we review the concurrency model of the CMSSW, and measure its scalability with real CMS applications, such as simulation and reconstruction, on mode rn many-core machines. We show metrics such as event processing throughput and application memory usage with and without the contribution of I/O, as I/O has been the major scaling limitation for the CMS applications.
Almost all future energy systems (advanced nuclear reactors, fusion energy system, concentrating solar-thermal power (CSP), and wind technologies) are limited by degradation of key material systems exposed to multiple environmental stressors. The degradation during exposure to high temperatures, radiation, mechanical loading, and chemical attack is often dictated by mechanisms active at the microstructural level. The nature of these mechanisms and the associated variations between sequential and concurrent interplay can be explored if the transmission electron microscope (TEM) is utilized as a toolbox for exploration [1]. One such tool developed at Sandia National Laboratories to couple several of these environments is the In situ Ion Irradiation TEM (I3TEM) [2]. Several studies over the last decade utilizing this tool have shown that the scientific intuition developed over decades of sequential experiments is not always a good indicator of concurrent mechanisms or failure routes. This presentation will highlight the recent and planned additions into the I3TEM facility of a Waviks gas injection system and Raman system, respectively, as can be seen in Fig. 1, permitting environmental degradation from gas species leaked into the pole piece region during quantitative mechanical loading (indentation, monotonic loading, high temperature creep, irradiation induced creep, and high-cycle fatigue); multi-beam ion irradiation (energies ranging from 1 keV to 48 MeV and species from H to Au); laser exposure (20 W and 1064 nm), or various combinations thereof that are already possible [3]. This addition permits the facility to explore both sequential or concurrently the four axes of stressors: thermal, mechanical, radiation, and chemical. This information can be directly coupled to modeling, expediting the refinement and validation of both atomistic and mesoscale models.