Search NASA⌕ Search

SEARCH · Search NASA

Results for “sparse”

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,657 records · Page 92

Porting DMRG++ Scientific Application to OpenPOWER

With the rapidly changing microprocessor designs and architectural diversity (multi-cores, many-cores, accelerators) for the next generation HPC systems, scientific applications must adapt to the hardware, to exploit the different types of parallelism and resources available in the architecture. To get the benefit of all the in-node hardware threads, it is important to use a single programming model to map and coordinate the available work to the different heterogeneous execution units in the node (e.g., multi-core hardware threads (latency optimized), accelerators (bandwidth optimized), etc.).Our goal is to show that we can manage the node complexity of these systems by using OpenMP for in-node parallelization by exploiting different “programming styles” supported by OpenMP 4.5 to program CPU cores and accelerators. Finding out the suitable programming-style (e.g., SPMD style, multi-level tasks, accelerator programming, nested parallelism, or a combination of these) using the latest features of OpenMP to maximize performance and achieve performance portability across heterogeneous and homogeneous systems is still an open research problem.We developed a mini-application, Kronecker Product (KP), from the original DMRG++ application (sparse matrix algebra) computational motif to experiment with different OpenMP programming styles on an OpenPOWER architecture and present their results in this paper.

Chatterjee, Ronnie↗

Optimization of Condensed Matter Physics Application with OpenMP Tasking Model

The Density Matrix Renormalization Group (DMRG++) is a condensed matter physics application used to study superconductivity properties of materials. It’s main computations consist of calculating hamiltonian matrix which requires sparse matrix-vector multiplications. This paper presents task-based parallelization and optimization strategies of the Hamiltonian algorithm. The algorithm is implemented as a mini-application in C++ and parallelized with OpenMP. The optimization leverages tasking features, such as dependencies or priorities included in the OpenMP standard 4.5. The code refactoring targets performance as much as programmability. The optimized version achieves a speedup of 8.0× with 8 threads and 20.5× with 40 threads on a Power9 computing node while reducing the memory consumption to 90 MB with respect to the original code, by adding less than ten OpenMP directives.

Criado, Joel↗

Performance Improvements on SNS and HFIR Instrument Data Reduction Workflows Using Mantid

Performance of data reduction workflows at the High Flux Isotope Reactor (HFIR) and the Spallation Neutron Source (SNS) at Oak Ridge National Laboratory (ORNL) is mainly determined by the time spent loading raw measurement events stored in large and sparse datasets. This paper describes: (1) our long-term view to leverage SNS and HFIR data management needs with our experience at ORNL’s world-class high performance computing (HPC) facilities, and (2) our short-term efforts to speed up current workflows using Mantid, a data analysis and reduction community framework used across several neutron scattering facilities. We show that minimally invasive short-term improvements in metadata management have a moderate impact in speeding up current production workflows. We propose a more disruptive domain-specific solution: the No Cost Input Output (NCIO) framework, we provide an overview, the risks and challenges in NCIO’s adoption by HFIR and SNS stakeholders.

Godoy, William↗

Just-in-Time Compilation and Link-Time Optimization for OpenMP Target Offloading

Following the mass adoption of external accelerators for high performance computing, the overall performance of many applications has become increasingly dependent on relatively small accelerated kernels. As static analysis is fundamentally limited by dynamic values and external definitions, standard ahead-of-time compilation is not always sufficient to achieve the best performance. Furthermore, many users looking to port an existing application to run on an external accelerator will not want to fundamentally restructure their programs. These and other problems can be addressed through both link-time optimization (LTO) and just-in-time (JIT) compilation, but until now had sparse and inconsistent support from the compiler. In this work, we present a new compilation method that enables device-side LTO as well as a transparent JIT compilation tool-chain for OpenMP target offloading. Our contributions include an entirely new device linking and embedding scheme to enable LTO as well as a novel JIT engine to efficiently optimize OpenMP offloading regions at run-time. We also introduce a persistent caching system to improve end-to-end runtime using the JIT engine and minimize kernel launching overheads. We measure the performance of our LTO and JIT implementation via several real-world scientific applications. With our optimizations we observe significant improvements through LTO on large applications as well as significant end-to-end execution time improvement using JIT.

Tian, Shilei↗

The Kokkos OpenMPTarget Backend: Implementation and Lessons Learned

As the supercomputing landscape diversifies, solutions such as Kokkos to write vendor agnostic applications and libraries have risen in popularity. Kokkos provides a programming model designed for performance portability, which allows developers to write a single source implementation that can run efficiently on various architectures. At its heart, Kokkos maps parallel algorithms to architecture and vendor specific backends written in lower level programming models such as CUDA and HIP. Another approach to writing vendor agnostic parallel code is using OpenMP’s directives based approach, which lets developers annotate code to express parallelism. It is implemented at the compiler level and is supported by all major high performance computing vendors, as well as the primary Open Source toolchains GNU and LLVM. Since its inception, Kokkos has used OpenMP to parallelize on CPU architectures. In this paper, we explore leveraging OpenMP for a GPU backend and discuss the challenges we encountered when mapping the Kokkos APIs and semantics to OpenMP target constructs. As an exemplar workload we chose a simple conjugate gradient solver for sparse matrices. We find that performance on NVIDIA and AMD GPUs varies widely based on details of the implementation strategy and the chosen compiler. Furthermore, the performance of the OpenMP implementations decreases with increasing complexity of the investigated algorithms.

Gayatri, Rahulkumar↗

A Hybrid dasymetric and machine learning approach to high-resolution residential electricity consumption modeling

As urban areas continue to grow and evolve in a world of increasingenvironmental awareness, the need for detailed information regarding residentialenergy consumption patterns has become increasingly important. Though currentmodeling efforts mark significant progress in the effort to better understand thespatial distribution of energy consumption, the majority of techniques are highlydependent on region-specific data sources and often require building- ordwelling-level details that are not publicly available for many regions in the UnitedStates. Furthermore, many existing methods do not account for errors in input datasources and may not accurately reflect inherent uncertainties in model outputs. Wepropose an alternative and more general hybrid approach to high-resolution residentialelectricity consumption modeling by merging a dasymetric model with acomplementary machine learning algorithm. The method’s flexible data requirementand statistical framework ensure that the model both is applicable to a widerange of regions and considers errors in input data sources.

cities↗

Comparative Performance Analysis of Coarse Solvers for Algebraic Multigrid on Multicore and Manycore Architectures

In this paper, we study the performance of a two-level algebraic-multigrid algorithm, with a focus on the impact of the coarse-grid solver on performance. We consider two algorithms for solving the coarse-space systems: the preconditioned conjugate gradient method and a new robust HSS-embedded low-rank sparse-factorization algorithm. Our test data comes from the SPE Comparative Solution Project for oil-reservoir simulations. We contrast the performance of our code on one 12-core socket of a Cray XC30 machine with performance on a 60-core Intel Xeon Phi coprocessor. To obtain top performance, we optimized the code to take full advantage of fine-grained parallelism and made it thread-friendly for high thread count. We also developed a bounds-and-bottlenecks performance model of the solver which we used to guide us through the optimization effort, and also carried out performance tuning in the solver’s large parameter space. Finally, as a result, significant speedups were obtained on both machines.

97 MATHEMATICS AND COMPUTING↗

Spinning constraints on chaotic large c CFTs

We study out-of-time ordered four-point functions in two dimensional conformal field theories by suitably analytically continuing the Euclidean correlator. For large central charge theories with a sparse spectrum, chaotic dynamics is revealed in an exponential decay, this is seen directly in the contribution of the vacuum block to the correlation function. However, contributions from individual non-vacuum blocks with large spin and small twist dominate over the vacuum block. We argue, based on holographic intuition, that suitable summations over such intermediate states in the block decomposition of the correlator should be sub-dominant, and attempt to use this criterion to constrain the OPE data with partial success. Along the way we also discuss the relation between the spinning Virasoro blocks and the on-shell worldline action of spinning particles in an asymptotically AdS spacetime.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Reflections on conformal spectra

Here, we use modular invariance and crossing symmetry of conformal field theory to reveal approximate reflection symmetries in the spectral decompositions of the partition function in two dimensions in the limit of large central charge and of the four-point function in any dimension in the limit of large scaling dimensions Δ 0 of external operators. We use these symmetries to motivate universal upper bounds on the spectrum and the operator product expansion coefficients, which we then derive by independent techniques. Some of the bounds for four-point functions are valid for finite Δ 0 as well as for large Δ 0 . We discuss a similar symmetry in a large spacetime dimension limit. Finally, we comment on the analogue of the Cardy formula and sparse light spectrum condition for the four-point function.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

The fate of long-lived superparticles with hadronic decays after LHC Run 1

Supersymmetry searches at the LHC are both highly varied and highly constraining, but the vast majority are focused on cases where the final-stage visible decays are prompt. Scenarios featuring superparticles with detector-scale lifetimes have therefore remained a tantalizing possibility for sub-TeV SUSY, since explicit limits are relatively sparse. Nonetheless, the extremely low backgrounds of the few existing searches for collider-stable and displaced new particles facilitates recastings into powerful long-lived superparticle searches, even for models for which those searches are highly non-optimized. In this paper, we assess the status of such models in the context of baryonic R-parity violation, gauge mediation, and mini-split SUSY. We then explore a number of common simplified spectra where hadronic decays can be important, employing recasts of LHC searches that utilize different detector systems and final-state objects. The LSP/NLSP possibilities considered here include generic colored superparticles such as the gluino and light-flavor squarks, as well as the lighter stop and the quasi-degenerate Higgsino multiplet motivated by naturalness. We find that complementary coverage over large swaths of mass and lifetime is achievable by superimposing limits, particularly from CMS’s tracker-based displaced dijet search and heavy stable charged particle searches. By adding in prompt searches, we find many cases where a range of sparticle masses is now excluded from zero lifetime to infinite lifetime with no gaps. In other cases, the displaced searches furnish the only extant limits at any lifetime.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

A universal inequality on the unitary 2D CFT partition function

We prove the conjecture proposed by Hartman, Keller and Stoica (HKS) [1]: the grand-canonical free energy of a unitary 2D CFT with a sparse spectrum below the scaling dimension $\frac{c}{12}$ + ϵ and below the twist $\frac{c}{12}$ is universal in the large c limit for all β L β R ≠ 4π 2 . The technique of the proof allows us to derive a one-parameter (with parameter α ∈ (0, 1]) family of universal inequalities on the unitary 2D CFT partition function with general central charge c ⩾ 0, using analytical modular bootstrap. We derive an iterative equation for the domain of validity of the inequality on the (β L , β R ) plane. The infinite iteration of this equation gives the boundary of maximal-validity domain, which depends on the parameter α in the inequality.

AdS-CFT Correspondence↗

Small black holes and near-extremal CFTs

Pure theories of AdS 3 quantum gravity are conjectured to be dual to CFTs with sparse spectra of light primary operators. The sparsest possible spectrum consistent with modular invariance includes only black hole states above the vacuum. Witten conjectured the existence of a family of extremal CFTs, which realize this spectrum for all admissible values of the central charge. We consider the quantum corrections to the classical spectrum, and propose a specific modification of Witten’s conjecture which takes into account the existence of “small” black hole states. These have zero classical horizon area, with a calculable entropy attributed solely to loop effects. Lastly, our conjecture passes various consistency checks, especially when generalized to include theories with supersymmetry. In theories with N = 2 supersymmetry, this “near-extremal CFT” proposal precisely evades the no-go results of Gaberdiel et al.

79 ASTRONOMY AND ASTROPHYSICS↗

On the Virasoro six-point identity block and chaos

We study six-point correlation functions in two dimensional conformal field theory, where the six operators are grouped in pairs with equal conformal dimension. Assuming large central charge $c$ and a sparse spectrum, the leading contribution to this correlation function is the six-point Virasoro identity block - corresponding to each distinct pair of operators fusing into the identity and its descendants. We call this the star channel. One particular term in the star channel identity block is the stress tensor $SL(2,\mathbb{R})$ (global) block, for which we derive an explicit expression. In the holographic context, this object corresponds to a direct measure of nonlinear effects in pure gravity. We calculate additional terms in the star channel identity block that contribute at the same order at large $c$ as the global block using the novel theory of reparametrizations, which extends the shadow operator formalism in a natural way. We investigate these blocks' relevance to quantum chaos in the form of six-point scrambling in an out-of time ordered correlator. Interestingly, the global block does not contribute to the scrambling mode of this correlator, implying that, to leading order, six-point scrambling is insensitive to the three-point graviton coupling in the bulk dual. Finally, we compare our findings with a different OPE channel, called the comb channel, and find the same result for the chaos exponent in this decomposition.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Universal spectrum of 2d conformal field theory in the large c limit

Two-dimensional conformal field theories exhibit a universal free energy in the high temperature limit T → ∞, and a universal spectrum in the Cardy regime, Δ → ∞. We show that a much stronger form of universality holds in theories with a large central charge c and a sparse light spectrum. In these theories, the free energy is universal at all values of the temperature, and the microscopic spectrum matches the Cardy entropy for all \( \Delta \ge \frac{c}{6} \) . The same is true of three-dimensional quantum gravity; therefore our results provide simple necessary and sufficient criteria for 2d CFTs to behave holographically in terms of the leading spectrum and thermodynamics. We also discuss several applications to CFT and gravity, including operator dimension bounds derived from the modular bootstrap, universality in symmetric orbifolds, and the role of non-universal ‘enigma’ saddlepoints in the thermodynamics of 3d gravity.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Bounding the space of holographic CFTs with chaos

In this study, thermal states of quantum systems with many degrees of freedom are subject to a bound on the rate of onset of chaos, including a bound on the Lyapunov exponent, λ L ≤ 2π/β. We harness this bound to constrain the space of putative holographic CFTs and their would-be dual theories of AdS gravity. First, by studying out-of-time-order four-point functions, we discuss how λ L = 2π/β in ordinary two-dimensional holographic CFTs is related to properties of the OPE at strong coupling. We then rule out the existence of unitary, sparse two-dimensional CFTs with large central charge and a set of higher spin currents of bounded spin; this implies the inconsistency of weakly coupled AdS 3 higher spin gravities without infinite towers of gauge fields, such as the SL(N) theories. This fits naturally with the structure of higher-dimensional gravity, where finite towers of higher spin fields lead to acausality. On the other hand, unitary CFTs with classical W ∞ [λ] symmetry, dual to 3D Vasiliev or hs[λ] higher spin gravities, do not violate the chaos bound, instead exhibiting no chaos: λ L = 0. Independently, we show that such theories violate unitarity for |λ| > 2. These results encourage a tensionless string theory interpretation of the 3D Vasiliev theory.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

The stranger things of symmetric product orbifold CFTs

Symmetric product orbifold theories are valuable due to their universal features at large N. Here we will demonstrate that they have features that are not as pervasive: we provide evidence of strange behaviour under deformations within their moduli space. To this end, we consider the symmetric product orbifold of tensor products of N = 2 super-Virasoro minimal models, and classify them according to two criteria. The first criterion is the existence of a single-trace twisted exactly marginal operator that triggers the deformation. The second criterion is a sparseness condition on the growth of light states in the elliptic genera. In this context we encounter a strange variety: theories that obey the first criterion but the second criterion falls into a Hagedorn-like growth. We explain why this may be counter-intuitive and discuss how it might be accounted for in conformal perturbation theory. We also find a new infinite class of theories that obey both criteria, which are necessary conditions for each moduli space to contain a supergravity point.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Einstein gravity 3-point functions from conformal field theory

We report on stress tensor correlation functions in four-dimensional conformal field theories with large N and a sparse spectrum. Theories in this class are expected to have local holographic duals, so effective field theory in anti-de Sitter implies that the stress tensor sector should exhibit universal, gravity-like behavior. At the linearized level, the hallmark of locality in the emergent geometry is that stress tensor three-point functions $\langle$T T T $\rangle$, normally specified by three constants, should approach a universal structure controlled by a single parameter as the gap to higher spin operators is increased. We demonstrate this phenomenon by a direct CFT calculation. Stress tensor exchange, by itself, violates causality and unitarity unless the three-point functions are carefully tuned, and the unique consistent choice exactly matches the prediction of Einstein gravity. Under some assumptions about the other potential contributions, we conclude that this structure is universal, and in particular, that the anomaly coefficients satisfy a ≈ c as conjectured by Camanho et al. The argument is based on causality of a four-point function, with kinematics designed to probe bulk locality, and invokes the chaos bound of Maldacena, Shenker, and Stanford.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Target Detection via Cognitive Radars Using Change-Point Detection, Learning, and Adaptation

Many radar detection algorithms that assume a stationary environment (clutter) have been proposed and analyzed over the years. However, in practice, changes in the nonstationary environment can perturb the parameters of the clutter distribution, or even alter the clutter distribution family, which can greatly deteriorate the target detection capability. To avoid such potential performance degradation, cognitive radar systems are envisioned which are required to rapidly realize the nonstationarity, accurately learn the new characteristics of the environments, and adaptively update the detector. In this paper, aiming to develop a fully cognitive radar for target detection in nonstationary environments, we propose a unifying framework that integrates (i) change-point detection of clutter distributions by using a data-driven cumulative sum (CUSUM) algorithm and its extended version, (ii) learning/identification of clutter distribution by applying sparse theory and kernel density estimation methods, and (iii) adaptive target detection by automatically modifying the likelihood-ratio test and corresponding detection threshold. Further, with extensive numerical examples, we demonstrate the achieved improvements in detection performance due to the proposed framework in comparison to a nonadaptive case, an adaptive matched filter (AMF) method, and the clairvoyant case. Herein, we also use Wilcoxon rank-sum tests to evaluate the statistical significance of the performance improvements

42 ENGINEERING↗