Search NASA⌕ Search

SEARCH · Search NASA

Results for “Scalable computation”

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,207 records · Page 67

Distributed Many-to-Many Protein Sequence Alignment using Sparse Matrices

Identifying similar protein sequences is a core step in many computational biology pipelines such as detection of homologous protein sequences, generation of similarity protein graphs for downstream analysis, functional annotation, and gene location. Performance and scalability of protein similarity search have proven to be a bottleneck in many bioinformatics pipelines due to increase in cheap and abundant sequencing data. This work presents a new distributed-memory software PASTIS. PASTIS relies on sparse matrix computations for efficient identification of possibly similar proteins. We use distributed sparse matrices for scalability and show that the sparse matrix infrastructure is a great fit for protein similarity search when coupled with a fully-distributed dictionary of sequences that allow remote sequence requests to be fulfilled. Our algorithm incorporates the unique bias in amino acid sequence substitution in search without altering basic sparse matrix model, and in turn, achieves ideal scaling up to millions of protein sequences.

97 MATHEMATICS AND COMPUTING↗

2HOT: An improved parallel hashed oct-tree N-body algorithm for cosmological simulation

Here we report on improvements made over the past two decades to our adaptive treecode N-body method (HOT). A mathematical and computational approach to the cosmological N-body problem is described, with performance and scalability measured up to 256k (218) processors. We present error analysis and scientific application results from a series of more than ten 69 billion (40963) particle cosmological simulations, accounting for 4×1020 floating point operations. These results include the first simulations using the new constraints on the standard model of cosmology from the Planck satellite. Our simulations set a new standard for accuracy and scientific throughput, while meeting or exceeding the computational efficiency of the latest generation of hybrid TreePM N-body methods.

97 MATHEMATICS AND COMPUTING↗

Report of a Workshop on Parallelization of Coupled Cluster Methods

The benchmark, ab initio quantum mechanical methods for molecular structure and spectra are now recognized to be coupled-cluster theory. To benefit from the transiiton to tera- and petascale computers, such coupled-cluster methods must be created to run in a scalable fashion. This Workshop, held as a aprt of the 48th annual Sanibel meeting, at St. Simns, Island, GA, addressed that issue. Representatives of all the principal scientific groups who are addressing this topic were in attendance, to exchange information about the problem and to identify what needs to be done in the future. This report summarized the conclusions of the workshop.

36 MATERIALS SCIENCE↗

The 200 Gbps Challenge: Imagining HL-LHC analysis facilities

The IRIS-HEP software institute, as a contributor to the broader HEP Python ecosystem, is developing scalable analysis infrastructure and software tools to address the upcoming HL-LHC computing challenges with new approaches and paradigms, driven by our vision of what HL-LHC analysis will require. The institute uses a "Grand Challenge" format, constructing a series of increasingly large, complex, and realistic exercises to show the vision of HL-LHC analysis. Recently, the focus has been demonstrating the IRIS-HEP analysis infrastructure at scale and evaluating technology readiness for production. As a part of the Analysis Grand Challenge activities, the institute executed a "200 Gbps Challenge", aiming to show sustained data rates into the event processing of multiple analysis pipelines. The challenge integrated teams internal and external to the institute, including operations and facilities, analysis software tools, innovative data delivery and management services, and scalable analysis infrastructure. The challenge showcases the prototypes - including software, services, and facilities - built to process around 200 TB of data in both the CMS NanoAOD and ATLAS PHYSLITE data formats with test pipelines. The teams were able to sustain the 200 Gbps target across multiple pipelines. The pipelines focusing on event rate were able to process at over 30 MHz. These target rates are demanding; the activity revealed considerations for future testing at this scale and changes necessary for physicists to work at this scale in the future. The 200 Gbps Challenge has established a baseline on today's facilities, setting the stage for the next exercise at twice the scale.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Scalable Data Management of the Uintah Simulation Framework for Next-Generation Engineering Problems with Radiation

The need to scale next-generation industrial engineering problems to the largest computational platforms presents unique challenges. This paper focuses on data management related problems faced by the Uintah simulation framework at a production scale of 260K processes. Uintah provides a highly scalable asynchronous many-task runtime system, which in this work is used for the modeling of a 1000 megawatt electric (MWe) ultra-supercritical (USC) coal boiler. At 260K processes, we faced both parallel I/O and visualization related challenges, e.g., the default file-per-process I/O approach of Uintah did not scale on Mira. In this paper we present a simple to implement, restructuring based parallel I/O technique. We impose a restructuring step that alters the distribution of data among processes. The goal is to distribute the dataset such that each process holds a larger chunk of data, which is then written to a file independently. This approach finds a middle ground between two of the most common parallel I/O schemes–file per process I/O and shared file I/O–in terms of both the total number of generated files, and the extent of communication involved during the data aggregation phase. To address scalability issues when visualizing the simulation data, we developed a lightweight renderer using OSPRay, which allows scientists to visualize the data interactively at high quality and make production movies. Finally, this work presents a highly efficient and scalable radiation model based on the sweeping method, which significantly outperforms previous approaches in Uintah, like discrete ordinates. The integrated approach allowed the USC boiler problem to run on 260K CPU cores on Mira.

97 MATHEMATICS AND COMPUTING↗

Advanced Computational Methods for Security Constrained Financial Transmission Rights: Structure and Parallelism

Financial Transmission Rights (FTRs) help power market participants reduce price risks associated with transmission congestion. FTRs are issued based on a process of solving a constrained optimization problem with the objective to maximize the FTR social welfare under power flow security constraints. Security constraints for different FTR categories (monthly, seasonal or annual) are usually coupled and the number of constraints increases exponentially with the number of categories. Commercial software for FTR calculation can only provide limited categories of FTRs due to the inherent computational challenges mentioned above. In this paper, a novel non-linear dynamical system (NDS) approach is proposed to solve the optimization problem. The new formulation and performance of the NDS solver is benchmarked against widely used linear programming (LP) solvers like CPLEX™ and tested on large-scale systems using data from the Western Electricity Coordinating Council (WECC). The NDS is demonstrated to outperform the widely used CPLEX algorithms while exhibiting superior scalability. Furthermore, the NDS based solver can be easily parallelized which results in significant computational improvement.

Environmental Molecular Sciences Laboratory↗

Advanced coal gasifier designs using large-scale simulations

Porting of the legacy code MFIX to a high performance computer (HPC) and the useof high resolution simulations for the design of a coal gasifier are described here. MFIX isbased on a continuum multiphase flow model that considers gas and solids to forminterpenetrating continua. Low resolution simulations of a commercial scale gasifier with avalidated MFIX model revealed interesting physical phenomena with implications on thegasifier design, which prompted the study reported here. To be predictive, the simulations needto model the spatiotemporal variations in gas and solids volume fractions, velocities,temperatures with any associated phase change and chemical reactions. These processes occurat various time- and length-scales requiring very high spatial resolution and large number ofiterations with small time-steps. We were able to perform perhaps the largest knownsimulations of gas-solids reacting flows, providing detailed information about the gas-solidsflow structure and the pressure, temperature and species distribution in the gasifier. One keyfinding is the new features of the coal jet trajectory revealed with the high spatial resolution,which provides information on the accuracy of the lower resolution simulations.Methodologies for effectively combining high and low resolution simulations for designstudies must be developed. From a computational science perspective, we found that globalcommunication has to be reduced to achieve scalability to 1000s of cores, hybridparallelization is required to effectively utilize the multicore chips, and the wait time in thebatch queue significantly increases the actual time-to-solution. From our experience,development is required in the following areas: efficient solvers for heterogeneous, massivelyparallel systems; data analysis tools to extract information from large data sets; andprogramming environments for easily porting legacy codes to HPC.

01 COAL, LIGNITE, AND PEAT↗

Scalable Nano-Scaffold SOFC Anode Architecture Enabling Direct Hydrocarbon Utilization

This project is based on WVU’s pending patents, technology and aims to design and modify the internal surfaces of the Ni/YSZ anode from currently commercially viable Solid Oxide Fuel Cells (SOFCs) using the additive manufacturing process of Atomic Layer Deposition (ALD). The surface architecture/scaffold added onto the internal surface of the anode possesses an engineered nanostructure but it features only commonly-used oxide conductors and electro-catalyst materials. The surface layer possesses a minimum thickness of ~2-40 nm and is solely designed to control the surface reforming reactions and to increase catalytic activity. Three-dimensional (3D) nano scaffold architectures with the noble metal nano-catalyst, low-cost bimetallic catalytic alloys, and nano-scale ionic conducting oxide fully compatible with the state-of-the-art Ni/YSZ anode, were applied to the internal surface of the entire porous SOFC anode using ALD. In the present work, the surface scaffold architecture is essentially multi-functional at the nano-scale, facilitated by the multiple heterostructured interfaces. It will significantly enhance the power density and cell durability for direct hydrocarbon utilization by (1) increasing the number of electrochemical reaction sites to enhance the hydrogen/hydrocarbon oxidation reactions; (2) reducing carbon formation; (3) mitigating the coarsening of backbone Ni phase and the oxidation attack of Ni from oxidants (e.g., H2O, CO2); and (4) promoting the internal reforming capabilities, especially for natural gas applications. ALD is employed to generate stable anode surface architectures that are uniform, precisely controllable at the atomic scale, and accurately repeatable for processing. The engineered anode surface nano-scaffold architecture was cataloged and analyzed using High-resolution Transmission Electron Microscopy (TEM), and cell power/durability performance assessed via comprehensive electrochemical performance testing with commercial specimens and relevant environments using hydrocarbon fuels. To the best of our knowledge, this project is the First Report on ALD of Ni/YSZ. The actual achievement of this Project includes (1). Successful demonstration of 7 types of ALD layers on Ni/YSZ anode, including Co, Ni, Mn, Pt, Ru, ZrOx and multi-functional nano-composite. (1). Conformal coating and subsequently spontaneously pinning the discrete nano-catalyst, including the precious metal nano-catalyst and the Ni and Co catalysts, on the YSZ surface upon the electrochemical operation in the reduced atmosphere. Those nano-catalysts on the ionic-conducting YSZ provided excellent sites for promoting internal reforming; (2). Demonstrated ALD coating increased both catalytic activity and conductivity of Ni/YSZ. Conformal coating provided dopants and introduced additional electrical conducting pathways on the YSZ ionic conductor. The doped surface layer of YSZ with mixed conductivity thus further introduces the active triple phase boundaries adjacent to the ALD-coated nano-catalysts such as Pt, Co, and Ni that are pinned on the YSZ surface. The nano-composite ALD coating on Ni/YSZ anode has significantly increased cell durability; and (3). ALD coating of Ni/YSZ anode increased the power density of the entire cell by 300%. For a long time, the SOFC performance, such as the power density, was deemed hindered by the cathode. The sluggish oxygen reduction reaction (ORR) in the cathode was deemed as hindering the power density of the SOFCs. For the anode-supported commercial SOFCs, the cell performance is considered to be limited by the cathode's performance. For the first time in the field of SOFC, this project has demonstrated that (1). the performance of commercial SOFCs can be further increased by the ALD coating on Ni/YSZ anode backbone. (2). ALD coating on Ni/YSZ fuel electrodes results in the enhancement of power density, and increased reliability, robustness, and endurance of SOFCs, for their application using both hydrogen and hydrocarbon fuels over the entire operating temperature range of 650-800ºC for the inherently functional commercial cells. (3). ALD coating provides alternative approaches of exsolutions for introducing the stable catalyst onto the internal surface of the Ni/YSZ electrode. ALD coating could be much more versatile than exsolution in employing the catalysts with various chemistries onto the various backbones. (4). Due to the negligible amount of ALD materials coated onto the internal surface of the porous cathode of the as-fabricated cells, a peak power density increase up to 300 % induced by ALD coating was simultaneously achieved in terms of both power density and specific power. (5). The ALD coating developed through this project was applied to both the SOFC and Solid Oxide Electrolysis Cells (SOEC). SOEC’s face a similar but more demanding need to improve the fuel electrode's performance. It opens further research directions for electrocatalytic surface nanoionics with a wide range of chemistry. It will revolutionize our ability to render the formation of a nanostructured electrode that has been constantly pursued yet barely achieved for practical SOFC/SOEC applications. The research is also immediately transformative since both the preliminary data and the proposed work are on the direct implantation of nanoionics into the state-of-the-art inherently functional SOCs. It represents an immediate impact on the commercial sectors in SOC technology since the applied ALD processing is computer-controlled ALD coating using the commercial ALD systems, and it is scalable to both the single cells and SOC stacks.

36 MATERIALS SCIENCE↗

Quantum Monte Carlo algorithms for electronic structure at the petascale; the endstation project.

Over the past two decades, continuum quantum Monte Carlo (QMC) has proved to be an invaluable tool for predicting of the properties of matter from fundamental principles. By solving the Schrodinger equation through a stochastic projection, it achieves the greatest accuracy and reliability of methods available for physical systems containing more than a few quantum particles. QMC enjoys scaling favorable to quantum chemical methods, with a computational effort which grows with the second or third power of system size. This accuracy and scalability has enabled scientific discovery across a broad spectrum of disciplines. The current methods perform very efficiently at the terascale. The quantum Monte Carlo Endstation project is a collaborative effort among researchers in the field to develop a new generation of algorithms, and their efficient implementations, which will take advantage of the upcoming petaflop architectures. Some aspects of these developments are discussed here. These tools will expand the accuracy, efficiency and range of QMC applicability and enable us to tackle challenges which are currently out of reach. The methods will be applied to several important problems including electronic and structural properties of water, transition metal oxides, nanosystems and ultracold atoms.

97 MATHEMATICS AND COMPUTING↗

2HOT: an improved parallel hashed oct-tree n-body algorithm for cosmological simulation

We report on improvements made over the past two decades to our adaptive treecode N-body method (HOT). A mathematical and computational approach to the cosmological N-body problem is described, with performance and scalability measured up to 256k (2 18 ) processors. We present error analysis and scientific application results from a series of more than ten 69 billion (4096 3 ) particle cosmological simulations, accounting for 4 × 10 20 floating point operations. These results include the first simulations using the new constraints on the standard model of cosmology from the Planck satellite. Our simulations set a new standard for accuracy and scientific throughput, while meeting or exceeding the computational efficiency of the latest generation of hybrid TreePM N-body methods.

Computer Science↗

2HOT: An Improved Parallel Hashed Oct-Tree N-Body Algorithm for Cosmological Simulation

We report on improvements made over the past two decades to our adaptive treecode N-body method (HOT). A mathematical and computational approach to the cosmological N-body problem is described, with performance and scalability measured up to 256k (2 18 ) processors. We present error analysis and scientific application results from a series of more than ten 69 billion (4096 3 ) particle cosmological simulations, accounting for 4×10 20 floating point operations. These results include the first simulations using the new constraints on the standard model of cosmology from the Planck satellite. Our simulations set a new standard for accuracy and scientific throughput, while meeting or exceeding the computational efficiency of the latest generation of hybrid TreePM N-body methods.

Warren, Michael S.↗

Scalable implicit incompressible resistive MHD with stabilized FE and fully-coupled Newton–Krylov-AMG

Here, we discuss that the computational solution of the governing balance equations for mass, momentum, heat transfer and magnetic induction for resistive magnetohydrodynamics (MHD) systems can be extremely challenging. These difficulties arise from both the strong nonlinear, nonsymmetric coupling of fluid and electromagnetic phenomena, as well as the significant range of time- and length-scales that the interactions of these physical mechanisms produce. This paper explores the development of a scalable, fully-implicit stabilized unstructured finite element (FE) capability for 3D incompressible resistive MHD. The discussion considers the development of a stabilized FE formulation in context of the variational multiscale (VMS) method, and describes the scalable implicit time integration and direct-to-steady-state solution capability. The nonlinear solver strategy employs Newton–Krylov methods, which are preconditioned using fully-coupled algebraic multilevel preconditioners. These preconditioners are shown to enable a robust, scalable and efficient solution approach for the large-scale sparse linear systems generated by the Newton linearization. Verification results demonstrate the expected order-of-accuracy for the stabilized FE discretization. The approach is tested on a variety of prototype problems, that include MHD duct flows, an unstable hydromagnetic Kelvin–Helmholtz shear layer, and a 3D island coalescence problem used to model magnetic reconnection. Initial results that explore the scaling of the solution methods are also presented on up to 128K processors for problems with up to 1.8B unknowns on a CrayXK7.

97 MATHEMATICS AND COMPUTING↗

Advanced Dynamically Adaptive Algorithms for Stochastic Simulations on Extreme Scales

The focus of the project is the development of mathematical methods and high-performance computational tools for stochastic simulations, with a particular emphasis on computations on extreme scales. The core of the project revolves around the design of highly efficient and scalable numerical algorithms that can adaptively and accurately, in high dimensional spaces, resolve stochastic problems with limited smoothness, even containing discontinuities.

97 MATHEMATICS AND COMPUTING↗

Recent Progress in Nonlinear and Linear Solvers

We discuss two approaches for tackling algebraic systems, one is based on block preconditioning and the other is based on multifrontal and hierarchical matrix methods. First we consider a new preconditioner framework for supporting implicit time integration within an atmospheric climate model. We give an overview of the computational infrastructure used in atmospheric climate studies, address specific challenges of weak-scalability of numerical methods used in these codes, outline a strategy for addressing these challenges, and provide details about the software infrastructure being developed to implement these ideas. In the second part, we present our recent results of employing hierarchically semiseparable low-rank structure in a multifrontal factorization framework. This leads to superfast linear solvers for elliptic PDEs and effective preconditioners for a wider class of sparse linear systems.

54 ENVIRONMENTAL SCIENCES↗

SORA: Scalable Overlap-graph Reduction Algorithms for Genome Assembly using Apache Spark in the Cloud

The advent of high-throughput DNA sequencing techniques has permitted very high quality de novo assemblies of genomes, but raise an issue of requiring large amounts of computer memory to resolve the large genome graphs generated by most overlap graph de novo assemblers. To address these limitations, we present a novel algorithmic approach; Scalable Overlap-graph Reduction Algorithms (SORA). SORA adapts string graph reduction algorithms for the genome assembly using a distributed computing platform. To efficiently compute coverage for enormous paths in the graphs, SORA uses Apache Spark which is a cluster-based engine designed on top of Hadoop to handle very large datasets in the cloud. The experimental results show that SORA can process a nearly one billion edge graph in a distributed cloud cluster as well as smaller graphs on a local cluster with a short turnaround time. Moreover, our algorithms scale almost linearly with increasing numbers of virtual instances in the cloud. SORA is freely available for download at https://github.com/BioHPC/SORA/.

Paul, Alexander↗

Cloud computing security.

Cloud computing is a paradigm rapidly being embraced by government and industry as a solution for cost-savings, scalability, and collaboration. While a multitude of applications and services are available commercially for cloud-based solutions, research in this area has yet to fully embrace the full spectrum of potential challenges facing cloud computing. This tutorial aims to provide researchers with a fundamental understanding of cloud computing, with the goals of identifying a broad range of potential research topics, and inspiring a new surge in research to address current issues. We will also discuss real implementations of research-oriented cloud computing systems for both academia and government, including configuration options, hardware issues, challenges, and solutions.

99 GENERAL AND MISCELLANEOUS↗

Understanding the Scalability of Bayesian Network Inference Using Clique Tree Growth Curves

One of the main approaches to performing computation in Bayesian networks (BNs) is clique tree clustering and propagation. The clique tree approach consists of propagation in a clique tree compiled from a Bayesian network, and while it was introduced in the 1980s, there is still a lack of understanding of how clique tree computation time depends on variations in BN size and structure. In this article, we improve this understanding by developing an approach to characterizing clique tree growth as a function of parameters that can be computed in polynomial time from BNs, specifically: (i) the ratio of the number of a BN s non-root nodes to the number of root nodes, and (ii) the expected number of moral edges in their moral graphs. Analytically, we partition the set of cliques in a clique tree into different sets, and introduce a growth curve for the total size of each set. For the special case of bipartite BNs, there are two sets and two growth curves, a mixed clique growth curve and a root clique growth curve. In experiments, where random bipartite BNs generated using the BPART algorithm are studied, we systematically increase the out-degree of the root nodes in bipartite Bayesian networks, by increasing the number of leaf nodes. Surprisingly, root clique growth is well-approximated by Gompertz growth curves, an S-shaped family of curves that has previously been used to describe growth processes in biology, medicine, and neuroscience. We believe that this research improves the understanding of the scaling behavior of clique tree clustering for a certain class of Bayesian networks; presents an aid for trade-off studies of clique tree clustering using growth curves; and ultimately provides a foundation for benchmarking and developing improved BN inference and machine learning algorithms.

Mengshoel, Ole J.↗

Scalable I/O Systems via Node-Local Storage: Approaching 1 TB/sec File I/O

The growth in the computational capability of modern supercomputing systems has been accompanied by corresponding increases in CPU count, total RAM, and total storage capacity. Indeed, systems such as Blue-Gene/L [3], BlueGene/P, Ranger, and the Cray XT series have grown to more than 100k processors, with 100 TeraBytes of RAM and are attached to multi-PetaByte storage systems. However, as part of this design evolution, large supercomputers have lost node-local storage elements, such as disks. While this decision was motivated by important considerations like overall system reliability, it also resulted in these systems losing a key level in their memory hierarchy, with nothing to fill the gap between local RAM and the parallel file system. While today's large supercomputers are typically attached to fast parallel file systems, which provide tens of GBs/s of I/O bandwidth, the computational capacity has grown much faster than the storage bandwidth capacity. As such, these machines are now provided with much less than 1GB/s of I/O bandwidth per TeraFlop of compute power, which is below the generally accepted limit required for a well-balanced system [8] [16]. The result is that today's limited I/O bandwidth is choking the capabilities of modern supercomputers, specifically in terms of limiting their working sets and making fault tolerance techniques, such as checkpointing, prohibitively expensive. This paper presents an alternative system design oriented on using node-local storage to improve aggregate system I/O bandwidth. We focus on the checkpointing use-case and present an experimental evaluation of SCR, a new checkpointing library that makes use of node-local storage to significantly improve the performance of checkpointing on large-scale supercomputers. Experiments show that SCR achieves unprecedented write speeds, reaching 700GB/s on 8,752 processors. Our results scale such that we expect a similarly structured system consisting of 12,500 processors to achieve aggregate I/O bandwidth of 1 TB/s.

99 GENERAL AND MISCELLANEOUS↗