Search NASA⌕ Search

SEARCH · Search NASA

Results for “bandwidth optimization”

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 163 records · Page 9

Dispersive X-ray absorption spectroscopy using independent grazing-incidence focusing and convexly bent Bragg-crystal dispersing optics

We present a modular instrument for dispersive X-ray absorption spectroscopy (DXAS) developed for the Advanced Spectroscopy Beamline at Sector 25 of the Advanced Photon Source. The setup employs a double-multilayer monochromator to provide X-rays with a broad energy bandwidth, Kirkpatrick–Baez mirrors for focusing, a convexly bent Bragg-crystal polychromator for energy dispersion, and a pixel-array detector to resolve all X-ray energies and collect their intensity simultaneously, thereby enabling acquisition of a full X-ray absorption spectrum in a single shot. The use of separate optics for X-ray focusing and energy dispersion provides high spatial resolution and avoids chromatic aberrations inherent in focusing bent-crystal optics, and a modular design makes implementation of the technique at other beamlines possible without requiring modifications to the upstream beamline configurations. Theoretical calculations are performed to determine optimal instrument operating parameters and demonstrate that an energy resolution better than the K-edge core-hole lifetime broadening can be maintained while providing a sufficient bandwidth for X-ray absorption near-edge structure spectroscopy through the full operating range of 5–11 keV. Additionally, instrument design, data analysis methods, and initial DXAS results on lithium–manganese–nickel oxide laminates are presented.

47 OTHER INSTRUMENTATION↗

Optimizing Error-Bounded Lossy Compression for Scientific Data by Dynamic Spline Interpolation

Today's scientific simulations are producing vast volumes of data that cannot be stored and transferred efficiently because of limited storage capacity, parallel I/O bandwidth, and network bandwidth. The situation is getting worse over time because of the ever-increasing gap between relatively slow data transfer speed and fast-growing computation power in modern supercomputers. Error-bounded lossy compression is becoming one of the most critical techniques for resolving the big scientific data issue, in that it can significantly reduce the scientific data volume while guaranteeing that the reconstructed data is valid for users because of its compression-error-bounding feature. In this paper, we present a novel error-bounded lossy compressor based on a state-of-the-art prediction-based compression framework. Our solution exhibits substantially better compression quality than all of the existing error-bounded lossy compressors, with comparable compression speed. Specifically, our contribution is threefold. (1) We provide an in-depth analysis of why the best-existing prediction-based lossy compressor can only minimally improve the compression quality. (2) We propose a dynamic spline interpolation approach with a series of optimization strategies that can significantly improve the data prediction accuracy, substantially improving the compression quality in turn. (3) We perform a thorough evaluation using six real-world scientific simulation datasets across different science domains to evaluate our solution vs. all other related works. Experiments show that the compression ratio of our solution is higher than that of the second-best lossy compressor by 20%similar to 460% with the same error bound in most of the cases.

Zhao, Kai↗

Preparing NERSC users for Cori, a Cray XC40 system with Intel many integrated cores

The newest NERSC supercomputer Cori is a Cray XC40 system consisting of 2,388 Intel Xeon Haswell nodes and 9,688 Intel Xeon-Phi “Knights Landing” (KNL) nodes. Compared to the Xeon-based clusters NERSC users are familiar with, optimal performance on Cori requires consideration of KNL mode settings; process, thread, and memory affinity; fine-grain parallelization; vectorization; and use of the high-bandwidth MCDRAM memory. This paper describes our efforts preparing NERSC users for KNL through the NERSC Exascale Science Application Program, Web documentation, and user training. We discuss how we configured the Cori system for usability and productivity, addressing programming concerns, batch system configurations, and default KNL cluster and memory modes. Here, system usage data, job completion analysis, programming and running jobs issues, and a few successful user stories on KNL are presented.

97 MATHEMATICS AND COMPUTING↗

Parallel implementation and performance optimization of the configuration-interaction method

The configuration-interaction (CI) method, long a popular approach to describe quantum many-body systems, is cast as a very large sparse matrix eigenpair problem with matrices whose dimension can exceed one billion. Such formulations place high demands on memory capacity and memory bandwidth - - two quantities at a premium today. In this paper, we describe an efficient, scalable implementation, BIGSTICK, which, by factorizing both the basis and the interaction into two levels, can reconstruct the nonzero matrix elements on the fly, reduce the memory requirements by one or two orders of magnitude, and enable researchers to trade reduced resources for increased computational time. We optimize BIGSTICK on two leading HPC platforms - - the Cray XC30 and the IBM Blue Gene/Q. Specifically, we not only develop an empirically-driven load balancing strategy that can evenly distribute the matrix-vector multiplication across 256K threads, we also developed techniques that improve the performance of the Lanczos reorthogonalization. Combined, these optimizations improved performance by 1.3-8× depending on platform and configuration.

97 MATHEMATICS AND COMPUTING↗

Optimizing Error-Bounded Lossy Compression for Scientific Data With Diverse Constraints

Vast volumes of data are produced by today's scientific simulations and advanced instruments. These data cannot be stored and transferred efficiently because of limited I/O bandwidth, network speed, and storage capacity. Error-bounded lossy compression can be an effective method for addressing these issues: not only can it significantly reduce data size, but it can also control the data distortion based on user-defined error bounds. In practice, many scientific applications have specific requirements or constraints for lossy compression, in order to guarantee that the reconstructed data are valid for post hoc analysis. For example, some datasets contain irrelevant data that should be isolated in particular and users often have intuition regarding value ranges, geospatial regions, and other data subsets that are crucial for subsequent analysis. Existing state-of-the-art error-bounded lossy compressors, however, do not consider these constraints during compression, resulting in inferior compression ratios with respect to user's post hoc analysis, due to the fact that the data itself provides little or no value for post hoc analysis. In this work we address this issue by proposing an optimized framework that can preserve diverse constraints during the error-bounded lossy compression, e.g., cleaning the irrelevant data, efficiently preserving different precision for multiple value intervals, and allowing users to set diverse precision over both regular and irregular regions. We perform our evaluation on a supercomputer with up to 2,100 cores. Experiments with six real-world applications show that our proposed diverse constraints based error-bounded lossy compressor can obtain a higher visual quality or data fidelity on reconstructed data with the same or even higher compression ratios compared with the traditional state-of-the-art compressor SZ. Furthermore, our experiments also demonstrate very good scalability in compression performance compared with the I/O throughput of the parallel file system.

97 MATHEMATICS AND COMPUTING↗

Chromatic information and feature detection in fast visual analysis

The visual system is able to recognize a scene based on a sketch made of very simple features. This ability is likely crucial for survival, when fast image recognition is necessary, and it is believed that a primal sketch is extracted very early in the visual processing. Such highly simplified representations can be sufficient for accurate object discrimination, but an open question is the role played by color in this process. Rich color information is available in natural scenes, yet artist's sketches are usually monochromatic; and, black-andwhite movies provide compelling representations of real world scenes. Also, the contrast sensitivity of color is low at fine spatial scales. We approach the question from the perspective of optimal information processing by a system endowed with limited computational resources. We show that when such limitations are taken into account, the intrinsic statistical properties of natural scenes imply that the most effective strategy is to ignore fine-scale color features and devote most of the bandwidth to gray-scale information. We find confirmation of these information-based predictions from psychophysics measurements of fast-viewing discrimination of natural scenes. As a result, we conclude that the lack of colored features in our visual representation, and our overall low sensitivity to high-frequency color components, are a consequence of an adaptation process, optimizing the size and power consumption of our brain for the visual world we live in.

97 MATHEMATICS AND COMPUTING↗

Demonstration of a 1820 channel multiplexer for transition-edge sensor bolometers

The scalability of most transition-edge sensor arrays is limited by the multiplexing technology, which combines their signals over a reduced number of wires and amplifiers. Here, in this Letter, we present and demonstrate a multiplexer design optimized for transition-edge sensor bolometers with 1820 sensors per readout unit, a factor of two more than the previous state-of-the-art. The design is optimized for cosmic microwave background imaging applications, and it builds on previous microwave superconducting quantum interference device multiplexers by doubling the available readout bandwidth to the full 4–8 GHz octave. Evaluating the key performance metrics of yield, sensitivity, and crosstalk through laboratory testing, we find an end-to-end operable detector yield of 78%, a typical nearest-neighbor crosstalk amplitude of ∼0.4%, and a median white noise level of 83 pA/$\sqrt{\textrm{Hz}}$ due to the multiplexer, corresponding to an estimated contribution of 4% to the total system noise for a ground-based cosmic microwave background telescope. Additionally, we identify a possible path toward reducing resonator loss for future designs with reduced noise. We expect these developments to alleviate the system complexity, cryogenic requirements, and cost of future large arrays of low temperature detectors.

cosmic microwave background↗

Quantum metrology timing limits of the Hong-Ou-Mandel interferometer and of general two-photon measurements

We examine the precision limits of Hong-Ou-Mandel (HOM) timing measurements, as well as precision limits applying to generalized two-photon measurements. As a special case, we consider the use of two-photon measurements using photons with variable bandwidths and frequency correlations. When the photon bandwidths are not equal, maximizing the measurement precision involves a trade-off between high interference visibility and strong frequency anticorrelations, with the optimal precision occurring when the photons share non-maximal frequency anticorrelations. We show that a generalized measurement has precision limits that are qualitatively similar to those of the HOM measurement whenever the generalized measurement is insensitive to the net delay of both photons. Finally, by examining the performance of states with more general frequency distributions, our analysis allows for engineering of the joint spectral amplitude for use in realistic situations, in which both photons may not have ideal spectral properties.

79 ASTRONOMY AND ASTROPHYSICS↗

Lossy checkpoint compression in full waveform inversion: a case study with ZFPv0.5.5 and the overthrust model

This paper proposes a new method that combines checkpointing methods with error-controlled lossy compression for large-scale high-performance full-waveform inversion (FWI), an inverse problem commonly used in geophysical exploration. This combination can significantly reduce data movement, allowing a reduction in run time as well as peak memory. In the exascale computing era, frequent data transfer (e.g., memory bandwidth, PCIe bandwidth for GPUs, or network) is the performance bottleneck rather than the peak FLOPS of the processing unit. Like many other adjoint-based optimization problems, FWI is costly in terms of the number of floating-point operations, large memory footprint during backpropagation, and data transfer overheads. Past work for adjoint methods has developed checkpointing methods that reduce the peak memory requirements during backpropagation at the cost of additional floating-point computations. Combining this traditional checkpointing with error-controlled lossy compression, we explore the three-way tradeoff between memory, precision, and time to solution. We investigate how approximation errors introduced by lossy compression of the forward solution impact the objective function gradient and final inverted solution. Empirical results from these numerical experiments indicate that high lossy-compression rates (compression factors ranging up to 100) have a relatively minor impact on convergence rates and the quality of the final solution.

58 GEOSCIENCES↗

Optimal filtering and generation of entangled photons for quantum applications in the presence of noise

Filtering is commonly used in quantum optics to reject noise photons, and also to enable interference between independent photons. However, filtering the joint spectrum of photon pairs can reduce the inherent coincidence probability or loss-independent heralding efficiency. Here we investigate filtering for multiphoton applications based on entanglement and interference (e.g., quantum teleportation). We multiplex C-band entangled photons and C-band classical communications into the same long-distance fibers, which enables scalable low-loss quantum networking but requires filtering of spontaneous Raman scattering noise from classical light. Using tunable-bandwidth filters, low-jitter detectors, and polarization filters, we distribute wavelength-degenerate time-bin entangled photons in the C band (1536.5 nm) over 25 km/25 km standard fibers (50 km) each carrying 10 Gbit/s C-band classical data signals. Narrow filtering enables milliwatt-level C-band power, which exceeds the power achieved by comparable studies by roughly an order of magnitude and could feasibly support terabit per second classical rates. We evaluate how performance depends on pump and filter bandwidths, multipair emission, filter shapes, loss, phase matching, and how quantum information is measured. We find a trade-off between reducing noise impact and increasing single-mode purity, and discuss mitigation methods toward optimal multiphoton applications. Importantly, these results apply to noise in free space and in quantum devices (sources, frequency converters, switches, detectors, etc.) and provide insight into filter-induced degradation of single-photon purity and rates even in noise-free environments.

Thomas, Jordan M. [Fermilab; Northwestern U.]↗

Experimental demonstration of fresh bunch self-seeding in an X-ray free electron laser

Here, we report the generation of ultrahigh brightness X-ray pulses using the Fresh Bunch Self-Seeding (FBSS) method in an X-ray Free Electron Laser (XFEL). The FBSS method uses two different electron slices or bunches, one to generate the seed and the other to amplify it after the monochromator. This method circumvents the trade-off between the seed power and electron slice energy spread, which limits the efficiency of regular self-seeded FELs. The experiment, the performance of which is limited by existing hardware, shows FBSS feasibility, generating 5.5 keV photon pulses which are 9 fs long and of 7.3 ×10 –5 bandwidth and 50 GW power. FBSS performance is compared with Self Amplified Spontaneous Emission/self-seeding performance, measuring a brightness increase of twelve/two times, respectively. In an optimized XFEL, FBSS can increase the peak power a hundred times more than state-of-the-art to multi-TW, opening new research areas for nonlinear science and single molecule imaging.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Experimental demonstration of a single-spike hard-X-ray free-electron laser starting from noise

In this letter, we report the experimental demonstration of single-spike hard-X-ray free-electron laser pulses starting from noise with multi-eV bandwidth. Here, this is accomplished by shaping a low-charge electron beam with a slotted emittance spoiler and by adjusting the transport optics to optimize the beam-shaping accuracy. Based on elementary free-electron laser scaling laws, we estimate the pulse duration to be less than 1 fs full-width at half-maximum.

43 PARTICLE ACCELERATORS↗

Milestone M6 Report: Reducing Excess Data Movement Part 1

This is the second in a sequence of three Hardware Evaluation milestones that provide insight into the following questions: What are the sources of excess data movement across all levels of the memory hierarchy, going out to the network fabric? What can be done at various levels of the hardware/software hierarchy to reduce excess data movement? How does reduced data movement track application performance? The results of this study can be used to suggest where the DOE supercomputing facilities, working with their hardware vendors, can optimize aspects of the system to reduce excess data movement. Quantitative analysis will also benefit systems software and applications to optimize caching and data layout strategies. Another potential avenue is to answer cost-benefit questions, such as those involving memory capacity versus latency and bandwidth. This milestone focuses on techniques to reduce data movement, quantitatively evaluates the efficacy of the techniques in accomplishing that goal, and measures how performance tracks data movement reduction. We study a small collection of benchmarks and proxy mini-apps that run on pre-exascale GPUs and on the Accelsim GPU simulator. Our approach has two thrusts: to measure advanced data movement reduction directives and techniques on the newest available GPUs, and to evaluate our benchmark set on simulated GPUs configured with architectural refinements to reduce data movement.

97 MATHEMATICS AND COMPUTING↗

Fluid-Kinetic Coupling: Advanced Discretizations for Simulations on Emerging Heterogeneous Architectures (LDRD FY20-0643)

Plasma physics simulations are vital for a host of Sandia mission concerns, for fundamental science, and for clean energy in the form of fusion power. Sandia's most mature plasma physics simulation capabilities come in the form of particle-in-cell (PIC) models and magnetohydrodynamics (MHD) models. MHD models for a plasma work well in denser plasma regimes when there is enough material that the plasma approximates a fluid. PIC models, on the other hand, work well in lower-density regimes, in which there is not too much to simulate; error in PIC scales as the square root of the number of particles, making high-accuracy simulations expensive. Real-world applications, however, almost always involve a transition region between the high-density regimes where MHD is appropriate, and the low-density regimes for PIC. In such a transition region, a direct discretization of Vlasov is appropriate. Such discretizations come with their own computational costs, however; the phase-space mesh for Vlasov can involve up to six dimensions (seven if time is included), and to apply appropriate homogeneous boundary conditions in velocity space requires meshing a substantial padding region to ensure that the distribution remains sufficiently close to zero at the velocity boundaries. Moreover, for collisional plasmas, the right-hand side of the Vlasov equation is a collision operator, which is non-local in velocity space, and which may dominate the cost of the Vlasov solver. The present LDRD project endeavors to develop modern, foundational tools for the development of continuum-kinetic Vlasov solvers, using the discontinuous Petrov-Galerkin (DPG) methodology, for discretization of Vlasov, and machine-learning (ML) models to enable efficient evaluation of collision operators. DPG affords several key advantages. First, it has a built-in, robust error indicator, allowing us to adapt the mesh in a very natural way, enabling a coarse velocity-space mesh near the homogeneous boundaries, and a fine mesh where the solution has fine features. Second, it is an inherently high-order, high-intensity method, requiring extra local computations to determine so-called optimal test functions, which makes it particularly suited to modern hardware in which floating-point throughput is increasing at a faster rate than memory bandwidth. Finally, DPG is a residual-minimizing method, which enables high-accuracy computation: in typical cases, the method delivers something very close to the $L^2$ projection of the exact solution. Meanwhile, the ML-based collision model we adopt affords a cost structure that scales as the square root of a standard direct evaluation. Moreover, we design our model to conserve mass, momentum, and energy by construction, and our approach to training is highly flexible, in that it can incorporate not only synthetic data from direct-simulation Monte Carlo (DSMC) codes, but also experimental data. We have developed two DPG formulations for Vlasov-Poisson: a time-marching, backward-Euler discretization and a space-time discretization. We have conducted a number of numerical experiments to verify the approach in a 1D1V setting. In this report, we detail these formulations and experiments. We also summarize some new theoretical results developed as part of this project (published as papers previously): some new analysis of DPG for the convection-reaction problem (of which the Vlasov equation is an instance), a new exponential integrator for DPG, and some numerical exploration of various DPG-based time-marching approaches to the heat equation. As part of this work, we have contributed extensively to the Camellia open-source library; we also describe the new capabilities and their usage. We have also developed a well-documented methodology for single-species collision operators, which we applied to argon and demonstrated with numerical experiments. We summarize those results here, as well as describing at a high level a design extending the methodology to multi-species operators. We have released a new open-source library, MLC, under a BSD license; we include a summary of its capabilities as well.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DIRAQ: scalable in situ data- and resource-aware indexing for optimized query performance

Scientific data analytics in high-performance computing environments has been evolving along with the advancement of computing capabilities. With the onset of exascale computing, the increasing gap between compute performance and I/O bandwidth has rendered the traditional post-simulation processing a tedious process. Despite the challenges due to increased data production, there exists an opportunity to benefit from "cheap" computing power to perform query-driven exploration and visualization during simulation time. To accelerate such analyses, applications traditionally augment, post-simulation, raw data with large indexes, which are then repeatedly utilized for data exploration. However, the generation of current state-of-the-art indexes involves a compute- and memory-intensive processing, thus rendering them inapplicable in an in situ context. In this paper we propose DIRAQ, a parallel in situ, in network data encoding and reorganization technique that enables the transformation of simulation output into a query-efficient form, with negligible runtime overhead to the simulation run. DIRAQ's effective core-local, precision-based encoding approach incorporates an embedded compressed index that is 3---6 $$\times $$ ? smaller than current state-of-the-art indexing schemes. Its data-aware index adjustmentation improves performance of group-level index layout creation by up to 35 % and reduces the size of the generated index by up to 27 %. Moreover, DIRAQ's in network index merging strategy enables the creation of aggregated indexes that speed up spatial-context query responses by up to $$10\times $$ 10 ? versus alternative techniques. DIRAQ's topology-, data-, and memory-aware aggregation strategy results in efficient I/O and yields overall end-to-end encoding and I/O time that is less than that required to write the raw data with MPI collective I/O.

Computer Science↗

Performance characterization of scientific workflows for the optimal use of Burst Buffers

Scientific discoveries are significantly rely on the analysis of large volumes of data from observations and simulations of complex phenomena. Scientists compose the complex analyses as workflows and execute them on large-scale HPC systems. The workflow structures are in contrast with monolithic single simulations that have often been the primary use case on HPC systems. At the same time, new storage paradigms such as Burst Buffers are becoming available on HPC platforms. In this paper, we analyze the performance characteristics of a Burst Buffer and two representative scientific workflows with the aim of optimizing the usage of a Burst Buffer, extending our previous analyses (Daley et al., 2016). Our key contributions are (a) developing a performance analysis methodology pertinent to Burst Buffers, (b) improving the use of a Burst Buffer in workflows with bandwidth-sensitive and metadata-sensitive I/O workloads, (c) highlighting the key data management challenges when incorporating a Burst Buffer in the studied scientific workflows.

97 MATHEMATICS AND COMPUTING↗

Network coding for improving throughput in WDM optical networks with dedicated protection

Network coding (NC) has been recently emerging as an excellent technique for leveraging network efficiency. In optical networks, NC and protection appear to be a good match and indeed, NC could be effectively exploited for greater protection efficiency thanks to the opportunity of combining signals rather than duplication in the traditional approach. Motivated by this observation, we investigate the application of a simple and practical NC technique based on XOR operation to improve the network throughput in survivable optical networks. To this end, we propose the NC-based protection whose speed recovery is on a par with the conventional 1+1 dedicated protection while the capacity usage could be more efficient, paving the way for improving throughput in constrained capacity conditions. A novel mixed integer linear programming model is developed for survivable optical networks design employing the proposed NC-based protection. The model attempts to optimally determine the demands to serve, the routing for served demands and NC assignment among demands aiming at maximizing the network throughput in the constraint of bandwidth limitation. Extensive numerical evaluations on realistic topologies are provided to highlight the advantages of our NC-based protection proposal compared with the conventional dedicated protection in improving the network throughput. Encouraging results are observed when the new protection proposal based on NC could accommodate up to 30% more traffic than the conventional case.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Pushing memory bandwidth limitations through efficient implementations of Block-Krylov space solvers on GPUs

Lattice quantum chromodynamics simulations in nuclear physics have benefited from a tremendous number of algorithmic advances such as multigrid and eigenvector deflation. These improve the time to solution but do not alleviate the intrinsic memory-bandwidth constraints of the matrix-vector operation dominating iterative solvers. Batching this operation for multiple vectors and exploiting cache and register blocking can yield a super-linear speed up. Block-Krylov solvers can naturally take advantage of such batched matrix-vector operations, further reducing the iterations to solution by sharing the Krylov space between solves. However, practical implementations typically suffer from the quadratic scaling in the number of vector-vector operations. Here, using the QUDA library, we present an implementation of a block-CG solver on NVIDIA GPUs which reduces the memory-bandwidth complexity of vector-vector operations from quadratic to linear. We present results for the HISQ discretization, showing a 5x speedup compared to highly-optimized independent Krylov solves on NVIDIA's SaturnV cluster.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗