Search NASA⌕ Search

SEARCH · Search NASA

Results for “parallel, scaling”

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 577 records · Page 32
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Practical applications of machine-learned flows on gauge fields

Normalizing flows are machine-learned maps between different lattice theories which can be used as components in exact sampling and inference schemes. Ongoing work yields increasingly expressive flows on gauge fields, but it remains an open question how flows can improve lattice QCD at state-of-the-art scales. We discuss and demonstrate two applications of flows in replica exchange (parallel tempering) sampling, aimed at improving topological mixing, which are viable with iterative improvements upon presently available flows.

Abbott, Ryan↗
DOE OSTI2024

Efficient First-Order Algorithms for Large-Scale, Non-Smooth Maximum Entropy Models with Application to Wildfire Science

Maximum entropy (MaxEnt) models are a class of statistical models that use the maximum entropy principle to estimate probability distributions from data. Due to the size of modern data sets, MaxEnt models need efficient optimization algorithms to scale well for big data applications. State-of-the-art algorithms for MaxEnt models, however, were not originally designed to handle big data sets; these algorithms either rely on technical devices that may yield unreliable numerical results, scale poorly, or require smoothness assumptions that many practical MaxEnt models lack. In this paper, we present novel optimization algorithms that overcome the shortcomings of state-of-the-art algorithms for training large-scale, non-smooth MaxEnt models. Our proposed first-order algorithms leverage the Kullback–Leibler divergence to train large-scale and non-smooth MaxEnt models efficiently. For MaxEnt models with discrete probability distribution of n elements built from samples, each containing m features, the stepsize parameter estimation and iterations in our algorithms scale on the order of O(mn) operations and can be trivially parallelized. Moreover, the strong ℓ1 convexity of the Kullback–Leibler divergence allows for larger stepsize parameters, thereby speeding up the convergence rate of our algorithms. To illustrate the efficiency of our novel algorithms, we consider the problem of estimating probabilities of fire occurrences as a function of ecological features in the Western US MTBS-Interagency wildfire data set. Our numerical results show that our algorithms outperform the state of the art by one order of magnitude and yield results that agree with physical models of wildfire occurrence and previous statistical analyses of wildfire drivers.

Physics↗
DOE OSTI2021

GR-Athena++: Puncture Evolutions on Vertex-centered Oct-tree Adaptive Mesh Refinement

Numerical relativity is central to the investigation of astrophysical sources in the dynamical and strong-field gravity regime, such as binary black hole and neutron star coalescences. Current challenges set by gravitational-wave and multimessenger astronomy call for highly performant and scalable codes on modern massively parallel architectures. We present GR-Athena++, a general-relativistic, high-order, vertex-centered solver that extends the oct-tree, adaptive mesh refinement capabilities of the astrophysical (radiation) magnetohydrodynamics code Athena++. To simulate dynamical spacetimes, GR-Athena++ uses the Z4c evolution scheme of numerical relativity coupled to the moving puncture gauge. We demonstrate stable and accurate binary black hole merger evolutions via extensive convergence testing, cross-code validation, and verification against state-of-the-art effective-one-body waveforms. GR-Athena++ leverages the task-based parallelism paradigm of Athena++ to achieve excellent scalability. We measure strong-scaling efficiencies above 95% for up to ~1.2 × 10 4 CPUs and excellent weak scaling is shown up to ~10 5 CPUs in a production binary black hole setup with adaptive mesh refinement. GR-Athena++ thus allows for the robust simulation of compact binary coalescences and offers a viable path toward numerical relativity at exascale.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2018

HEP Software Foundation Community White Paper Working Group - Data Processing Frameworks

Data processing frameworks are an essential part of HEP experiments' software stacks. Frameworks provide a means by which code developers can undertake the essential tasks of physics data processing, accessing relevant inputs and storing their outputs, in a coherent way without needing to know the details of other domains. Frameworks provide essential core services for developers and help deliver a configurable working application to the experiments' production systems. Modern HEP processing frameworks are in the process of adapting to a new computing landscape dominated by parallel processing and heterogeneity, which pose many questions regarding enhanced functionality and scaling that must be faced without compromising the maintainability of the code. In this paper we identify a program of work that can help further clarify the key concepts of frameworks for HEP and then spawn R&D activities that can focus the community's efforts in the most efficient manner to address the challenges of the upcoming experimental program.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2022

CEAZ: Accelerating Parallel I/O Via Hardware-Algorithm Co-Designed Adaptive Lossy Compression

As supercomputers continue to grow to exa-scale, the amount of data that needs to be saved or transmitted is exploding. To this end, many previous works have studied using error-bounded lossy compressors to reduce the data size and improve the I/O performance. However, little work has been done for effectively offloading lossy compression onto FPGA-based SmartNICs to reduce the compression overhead. In this paper, we propose a hardware-algorithm co-design of efficient and adaptive lossy compressor for scientific data on FPGAs (called CEAZ) to accelerate parallel I/O. Our contribution is fourfold: (1) We propose an efficient Huffman coding approach that can adaptively update Huffman codewords online based on codewords generated offline (from a variety of representative scientific datasets). (2) We derive a theoretical analysis to support a precise control of compression ratio under an error-bounded compression mode, enabling accurate offline Huffman codewords generation. This also help us create a fixed-ratio compression mode for consistent throughput. (3) We develop an efficient compression pipeline by adopting cuSZ’s dual-quantization algorithm to our hardware use case. (4) We evaluate CEAC on five real-world datasets with both a single FPGA board and 256 nodes from Bridges2 supercomputer. Experiments show that CEAZ outperforms the second-best FPGA-based lossy compressor by 2× of throughput and 9.6× of compression ratio. It also improves MPI_File_write and MPI_Gather throughputs by up to 32.7× and 31.4×, respectively.

Zhang, Chengming↗
DOE OSTI2017

Parallel Asynchronous Distributed-Memory Maximal Independent Set Algorithm with Work Ordering

The maximal independent set (MIS) graph problem arises in many applications such as computer vision, information theory, molecular biology, and process scheduling. The growing scale of graph data suggests the use of distributed memory hardware as a cost-effective approach to providing necessary compute and memory resources. Existing distributed memory parallel MIS algorithms rely on synchronous communication and use techniques such as subgraph computations. In this paper, we present an asynchronous distributed-memory parallel graph algorithm that relies on a virtual directed acyclic graph (DAG) that is created during the algorithm execution. We introduce two additional algorithms that save computations by ordering generated work. The first algorithm applies ordering globally to reduce computations, and the second algorithm applies ordering locally at the level of threads to minimize the synchronization overhead. We use two different implementations of Luby’s algorithm variants as baseline to compare the performance of the presented algorithms: (1) vertex-centric Luby A and Luby B implementations, and (2) the CombBLAS linear-algebra Luby A implementation. Results show that proposed algorithms outperform both implementations of Luby algorithms, especially in distributed execution. Furthermore, we show that for low-diameter graphs the algorithm that applies global ordering scales better than other algorithms and for high diameter graphs the original asynchronous algorithm and thread-level ordering algorithm show better performance.

maximal independent set (MIS), distributed memory ↗
DOE OSTI2018

Scalable Multilevel Uncertainty Quantification Concepts for Extreme-Scale Multiscale Problems

Our work in this project is aimed at making fundamental advances in multilevel and multiscale methods for problems with uncertainties related to flows in porous media. The main thrust of this research is to develop a systematic multiscale, multilevel parallel approaches for problems with uncertainties and use them in the uncertainty quantification. A key emphasis is on problems without an apparent scale separation in space, time, and uncertainty spaces. Multiscale solution methods are currently under active investigation. However, the develop- ment of multiscale methods for problems with uncertainties where the scales and uncertainties are tightly coupled is a research area that is less explored. During this project, we have made some significant contributions to the developments of multiscale methods, the uncertainty quantification for multiscale methods, multiscale model learning, uncertainty quantification in inverse problems, and applications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Assembly and Analysis of Cell-Scale Membrane Envelopes

The march toward exascale computing will enable routine molecular simulation of larger and more complex systems, for example, simulation of entire viral particles, on the scale of approximately billions of atoms-a simulation size commensurate with a small bacterial cell. Anticipating the future hardware capabilities that will enable this type of research and paralleling advances in experimental structural biology, efforts are currently underway to develop software tools, procedures, and workflows for constructing cell-scale structures. Herein, we describe our efforts in developing and implementing an efficient and robust workflow for construction of cell-scale membrane envelopes and embedding membrane proteins into them. A new approach for construction of massive membrane structures that are stable during the simulations is built on implementing a subtractive assembly technique coupled with the development of a structure concatenation tool (fastmerge), which eliminates overlapping elements based on volumetric criteria rather than adding successive molecules to the simulation system. Using this approach, we have constructed two "protocells" consisting of MARTINI coarse-grained beads to represent cellular membranes, one the size of a cellular organelle and another the size of a small bacterial cell. The membrane envelopes constructed here remain whole during the molecular dynamics simulations performed and exhibit water flux only through specific proteins, demonstrating the success of our methodology in creating tight cell-like membrane compartments. Extended simulations of these cell-scale structures highlight the propensity for nonspecific interactions between adjacent membrane proteins leading to the formation of protein microclusters on the cell surface, an insight uniquely enabled by the scale of the simulations. We anticipate that the experiences and best practices presented here will form the basis for the next generation of cell-scale models, which will begin to address the addition of soluble proteins, nucleic acids, and small molecules essential to the function of a cell.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2018

Measurements of long-range enhanced collisional velocity drag through plasma wave damping

Here we present damping measurements of axial plasma waves in magnetized, multispecies ion plasmas. At high temperatures $T≳10^{-2}$ eV, collisionless Landau damping dominates, whereas, at lower temperatures $T≲10^{-2}$ eV, the damping arises from interspecies collisional drag, which is dependent on the plasma composition and scales roughly as $T^{-3/2}$. This drag damping is proportional to the rate of parallel collisional slowing, and is found to exceed classical predictions of collisional drag damping by as much as an order of magnitude, but agrees with a new collision theory that includes long-range collisions. Centrifugal mass separation and collisional locking of the species occur at ultra-low temperatures $T≲10^{-3}$ eV, which reduce the drag damping from the $T^{-3/2}$ collisional scaling. These mechanisms are investigated by measuring the damping of higher frequency axial modes, and by measuring the damping in plasmas with a non-equilibrium species profile.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2022

Pseudonymization at Scale: OLCF’s Summit Usage Data Case Study

The analysis of vast amounts of data and the processing of complex computational jobs have traditionally relied upon high performance computing (HPC) systems, which offer reliable and efficient management of large-scale computational and data resources. Understanding these analyses’ needs is paramount for designing solutions that can lead to better science, and similarly, understanding the characteristics of the user behavior on those systems is important for improving user experiences on HPC systems. A common approach to gathering data about user behavior is to extract workload characteristics from system log data available only to system administrators. Recently at Oak Ridge Leadership Computing Facility (OLCF), however, we unveiled user behavior about the Summit supercomputer by collecting data from a user’s point of view with ordinary Unix commands.In this paper, we discuss the process, challenges, and lessons learned while preparing this dataset for publication and submission to an open data challenge. The original dataset contains personal identifiable information (PII) about the users of OLCF which needed be masked prior to publication, and we determined that anonymization, which scrubs PII completely, destroyed too much of the structure of the data to be interesting for the data challenge. We instead chose to pseudonymize the dataset, which reduced the linkability of the dataset to the users’ identities. Pseudonymization is significantly more computationally expensive than anonymization, and the size of our dataset, which is approximately 175 million lines of raw text, necessitated the development of a parallelized workflow that could be reused on different HPC machines. We demonstrate the scaling behavior of the workflow on two leadership class HPC systems at OLCF, and we show that we were able to bring the overall makespan time from an impractical 20+ hours on a single node down to around 2 hours. As a result of this work, we release the entire pseudonymized dataset and make the workflows and source code publicly available.

Maheshwari, Ketan↗
DOE OSTI2025

The Viskores User's Guide, Release 1.1

High-performance computing relies on ever finer threading. Advances in processor technology include ever greater numbers of cores, hyperthreading, accelerators with integrated blocks of cores, and special vectorized instructions, all of which require more software parallelism to achieve peak performance. Traditional visualization solutions cannot support this extreme level of concurrency. Extreme scale systems require a new programming model and a fundamental change in how we design algorithms. To address these issues we created Viskores: the visualization toolkit for multi/many-core architectures. Viskores supports a number of algorithms and the ability to design further algorithms through a top-down design with an emphasis on extreme parallelism. Viskores also provides support for finding and building links across topologies, making it possible to perform operations that determine manifold surfaces, interpolate generated values, and find adjacencies. Although Viskores provides a simplified high-level interface for programming, its template-based code removes the overhead of abstraction.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Scalable, In-situ Data Clustering Data Analysis for Extreme Scale Scientific Computing (Final Report)

The objective of this project is to address challenges in the design and development of scalable in-situ data clustering and analytics algorithms and software. Our goal is to develop parallel software consisting of a set of spatio-temporal data clustering and anomaly detection functions, both of which are very important for large-scale analysis and have wide applicability for in-situ runs as well as post-processing analysis. Our design principles for in-situ analysis consider the following: (1) identify parts of the computation can be done close to the data within the nodes, while it is still in memory; (2) extract analysis components can (and should) be performed in remote staging and analysis nodes; (3) develop error-bound approximation methods for applications tolerable for small errors; (4) identify the type of derived distributions and statistics, for spatio-temporal data, that can be kept locally in order to both accelerate computations and meet energy constraints in subsequent iterations and phases; (5) use a self-describing data format so that data can be consistent and understood among local storage (memory and SSDs) and at staging and analysis nodes, thereby providing portability and flexibility; (6) develop service-oriented functions that can schedule in-situ and post-hoc analysis tasks based on the dynamic requirements of applications. Our development focus is to produce the parallel data analysis software/library that will be scalable, reusable, extensible, and generic for applications in different disciplines. The software will be able to run in-situ with the simulations as well as post-hoc analysis. This approach will satisfy many synergistic requirements for data intensive applications executed on data coming from instruments and experiments. In particular, the proposed multilevel approach is directly applicable to perform design tradeoffs for running part of the algorithms near the instruments and the rest on remote (analysis) systems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

The Viskores User's Guide (V.1.0)

High-performance computing relies on ever finer threading. Advances in processor technology include ever greater numbers of cores, hyperthreading, accelerators with integrated blocks of cores, and special vectorized instructions, all of which require more software parallelism to achieve peak performance. Traditional visualization solutions cannot support this extreme level of concurrency. Extreme scale systems require a new programming model and a fundamental change in how we design algorithms. To address these issues we created Viskores: the visualization toolkit for multi-/many-core architectures. Viskores supports a number of algorithms and the ability to design further algorithms through a top-down design with an emphasis on extreme parallelism. Viskores also provides support for finding and building links across topologies, making it possible to perform operations that determine manifold surfaces, interpolate generated values, and find adjacencies. Although Viskores provides a simplified high-level interface for programming, its template-based code removes the overhead of abstraction.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

High frequency (4th order) sequence stratigraphy of Early Miocene deltaic shorelines, offshore Texas and Louisiana

Well logs and 3D seismic reflection data are integrated to image Lower Miocene depocenters of the upper Texas and westernmost Louisiana coastal and offshore areas. Although previously interpreted at a large scale (3rd order cycles), the detailed stratigraphy and depositional history of the early Miocene succession has not been fully developed. The upper lower Miocene interval from Robulus L (MFS10) to Amphistegina B (MFS9) has been further subdivided into five 4th order cycles (each 200 to 300 m thick) to provide finer scale stratigraphic detail and interpretation of depositional environments. Results of the finer scale correlations are presented in a series of sandstone percent maps. Overall, the maps display a strike-elongate (sub-parallel to the present day coastline) orientation for the sandstone bodies which thin to the southeast (basinward). Net sandstone thickness is relatively low in older cycles and increases in younger cycles suggesting an overall progradation of the deltaic system into the mapped area through time. Continued marine regression and southward movement of the shoreline are also confirmed by seismic amplitude 2 maps. After a major transgression associated with Robulus L deltaic progradation occurred under rising sea level conditions. Deltaic sediments prograded southward and sandstone brought to the upper Texas coast was distributed laterally by longshore currents to form strandplain coast lines. Maximum regression occurred during the interval MFS9_2 to MFS9_3 when a deltaic depocenter formed offshore Texas in east High Island area. However, sandstone thickness progressively decreased laterally to the east (offshore Louisiana) where more shale was present and marine processes reworked deltaic derived sandstones into shore parallel bars. There was a clear retreat of the shoreline during the youngest cycle marking the beginning of transgression associated with Amphistegina B . Detailed stratigraphic interpretation (at a 4th order scale) shows more variability in the dominant shoreline processes during early Miocene than previously thought. Recognition of sedimentary systems variability at a 4th order scale is critical for improved hydrocarbon exploration and in understanding potential future CO 2 storage in the area.

58 GEOSCIENCES↗
DOE OSTI2017

Trinity Phase 2 Open Science: CTH

CTH is an Eulerian hydrocode developed by Sandia National Laboratories (SNL) to solve a wide range of shock wave propagation and material deformation problems. Adaptive mesh refinement is also used to improve efficiency for problems with a wide range of spatial scales. The code has a history of running on a variety of computing platforms ranging from desktops to massively parallel distributed-data systems. For the Trinity Phase 2 Open Science campaign, CTH was used to study mesoscale simulations of the hypervelocity penetration of granular SiC powders. The simulations were compared to experimental data. A scaling study of CTH up to 8192 KNL nodes was also performed, and several improvements were made to the code to improve the scalability.

97 MATHEMATICS AND COMPUTING↗