SEARCH · Search NASA

Results for “scalable computing”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 775 records · Page 43

All sources NASA NTRS DOE OSTI

DOE OSTI2016

Transport of spin qubits with donor chains under realistic experimental conditions

The ability to transport quantum information across some distance can facilitate the design and operation of a quantum processor. One-dimensional spin chains provide a compact platform to realize scalable spin transport for a solid-state quantum computer. Here, we model odd-sized donor chains in silicon under a range of experimental nonidealities, including variability of donor position within the chain. We show that the tolerance against donor placement inaccuracies is greatly improved by operating the spin chain in a mode where the electrons are confined at the Si-SiO 2 interface. We then estimate the required time scales and exchange couplings, and the level of noise that can be tolerated to achieve high-fidelity transport. As a result, we also propose a protocol to calibrate and initialize the chain, thereby providing a complete guideline for realizing a functional donor chain and utilizing it for spin transport.

36 MATERIALS SCIENCE↗

DOE OSTI2022

High Performance Adaptive Physics Refinement to Enable Large-Scale Tracking of Cancer Cell Trajectory

The ability to track simulated cancer cells through the circulatory system, important for developing a mechanistic understanding of metastatic spread, pushes the limits of today's supercomputers by requiring the simulation of large fluid volumes at cellular-scale resolution. To overcome this challenge, we introduce a new adaptive physics refinement (APR) method that captures cellular-scale interaction across large domains and leverages a hybrid CPU-GPU approach to maximize performance. Through algorithmic advances that integrate multi-physics and multi-resolution models, we establish a finely resolved window with explicitly modeled cells coupled to a coarsely resolved bulk fluid domain. In this work we present multiple validations of the APR framework by comparing against fully resolved fluid-structure interaction methods and employ techniques, such as latency hiding and maximizing memory bandwidth, to effectively utilize heterogeneous node architectures. Collectively, these computational developments and performance optimizations provide a robust and scalable framework to enable system-level simulations of cancer cell transport.

59 BASIC BIOLOGICAL SCIENCES↗

DOE OSTI2020

A Survey of Singular Value Decomposition Methods for Distributed Tall/Skinny Data

The Singular Value Decomposition (SVD) is one of the most important matrix factorizations, enjoying a wide variety of applications across numerous application domains. In statistics and data analysis, the common applications of SVD inclue Principal Components Analysis (PCA) and regression. Usually these applications arise on data that has far more rows than columns, so-called "tall/skinny" matrices. In the big data analytics context, this may take the form of hundreds of millions to billions of rows with only a few hundred columns. There is a need, therefore, for fast, accurate, and scalable tall/skinny SVD implementations which can fully utilize modern computing resources. To that end, we present a survey of three different algorithms for computing the SVD for these kinds of tall/skinny data layouts using MPI for communication. We contextualize these with common big data analytics techniques. Finally, we present both CPU and GPU timing results from the Summit supercomputer, and discuss possible alternative approaches.

Schmidt, Drew↗

DOE OSTI2015

IMG-ABC. A knowledge base to fuel discovery of biosynthetic gene clusters and novel secondary metabolites

In the discovery of secondary metabolites, analysis of sequence data is a promising exploration path that remains largely underutilized due to the lack of computational platforms that enable such a systematic approach on a large scale. In this work, we present IMG-ABC (https://img.jgi.doe.gov/abc), an atlas of biosynthetic gene clusters within the Integrated Microbial Genomes (IMG) system, which is aimed at harnessing the power of “big” genomic data for discovering small molecules. IMG-ABC relies on IMG’s comprehensive integrated structural and functional genomic data for the analysis of biosynthetic gene clusters (BCs) and associated secondary metabolites (SMs). SMs and BCs serve as the two main classes of objects in IMG-ABC, each with a rich collection of attributes. A unique feature of IMG-ABC is the incorporation of both experimentally validated and computationally predicted BCs in genomes as well as metagenomes, thus identifying BCs in uncultured populations and rare taxa. We demonstrate the strength of IMG-ABC’s focused integrated analysis tools in enabling the exploration of microbial secondary metabolism on a global scale, through the discovery of phenazine-producing clusters for the first time in lphaproteobacteria . IMG-ABC strives to fill the long-existent void of resources for computational exploration of the secondary metabolism universe; its underlying scalable framework enables traversal of uncovered phylogenetic and chemical structure space, serving as a doorway to a new era in the discovery of novel molecules. IMG-ABC is the largest publicly available database of predicted and experimental biosynthetic gene clusters and the secondary metabolites they produce. The system also includes powerful search and analysis tools that are integrated with IMG’s extensive genomic/metagenomic data and analysis tool kits. As new research on biosynthetic gene clusters and secondary metabolites is published and more genomes are sequenced, IMG-ABC will continue to expand, with the goal of becoming an essential component of any bioinformatic exploration of the secondary metabolism world.

59 BASIC BIOLOGICAL SCIENCES↗

DOE OSTI2018

Partitioning and Communication Strategies for Sparse Non-negative Matrix Factorization

Non-negative matrix factorization (NMF), the problem of finding two non-negative low-rank factors whose product approximates an input matrix, is a useful tool for many data mining and scientific applications such as topic modeling in text mining and unmixing in microscopy. In this paper, we focus on scaling algorithms for NMF to very large sparse datasets and massively parallel machines by employing effective algorithms, communication patterns, and partitioning schemes that leverage the sparsity of the input matrix. We consider two previous works developed for related problems, one that uses a fine-grained partitioning strategy using a point-to-point communication pattern and one that uses a Cartesian, or checkerboard, partitioning strategy using a collective-based communication pattern. We show that a combination of the previous approaches balances the demands of the various computations within NMF algorithms and achieves high efficiency and scalability. From the experiments, we see that our proposed strategy runs up to 10x faster than the state of the art on real-world datasets.

Kaya, Oguz↗

DOE OSTI2020

Scalability of OpenFOAM Density-Based Solver with Runge–Kutta Temporal Discretization Scheme

Compressible density-based solvers are widely used in OpenFOAM, and the parallel scalability of these solvers is crucial for large-scale simulations. In this paper, we report our experiences with the scalability of OpenFOAM’s native rhoCentralFoam solver, and by making a small number of modifications to it, we show the degree to which the scalability of the solver can be improved. The main modification made is to replace the first-order accurate Euler scheme in rhoCentralFoam with a third-order accurate, four-stage Runge-Kutta or RK4 scheme for the time integration. The scaling test we used is the transonic flow over the ONERA M6 wing. This is a common validation test for compressible flows solvers in aerospace and other engineering applications. Numerical experiments show that our modified solver, referred to as rhoCentralRK4Foam, for the same spatial discretization, achieves as much as a 123.2% improvement in scalability over the rhoCentralFoam solver. As expected, the better time resolution of the Runge–Kutta scheme makes it more suitable for unsteady problems such as the Taylor–Green vortex decay where the new solver showed a 50% decrease in the overall time-to-solution compared to rhoCentralFoam to get to the final solution with the same numerical accuracy. Finally, the improved scalability can be traced to the improvement of the computation to communication ratio obtained by substituting the RK4 scheme in place of the Euler scheme. All numerical tests were conducted on a Cray XC40 parallel system, Theta, at Argonne National Laboratory.

Li, Sibo↗

DOE OSTI2019

Slycat v 2.0

Slycat™ is a web-based system for analysis of large, high-dimensional data such as that produced by High Performance Computing (HPC) platforms. The Slycat™ server integrates data ingestion, scalable analysis, data management, and visualization with commodity web clients using a multi-tiered hierarchy of data and model storage. Analysis inputs are pushed or pulled into Slycat™, where models are generated and analysis artifacts are stored in a project database. These artifacts are the basis for visualizations that are delivered to users’ desktops through ordinary web browsers, eliminating the need to build and deploy platform-specific client applications. Slycat™ currently provides four types of analysis: canonical correlation analysis (CCA) to model relationships between inputs and output metrics, time series analysis featuring clustering and comparative visualization of waveforms, parameter space visualization including remote retrieval of images and movies from HPC disks, and VideoSwarm for modeling video similarities over time.

Letter, Matthew↗

DOE OSTI2022

SRF Levitation and Trapping of Nanoparticles

A proposal has been conceived to levitate and trap mesoscopic particles using radio frequency (RF) fields in a superconducting RF(SRF) cavity. Exploiting the intrinsic characteristics of an SRF cavity, this proposal aims at overcoming a major limit faced by state-of-the-art laser trapping techniques. The goal of the proposal is to establish a foundation to enable observation of quantum phenomena of an isolated mechanical oscillator interacting with microwave fields. An experiment supported by LDRD funding at JLab has started to address R&D issues relevant to these new research directions using existing SRF facilities at JLab. The success of this experiment would establish its groundbreaking relevance to quantum information science and technology, which may lead to applications in precision force measurement sensors, quantum memories, and alternative quantum computing implementations with promises for superior coherence characteristics and scalability well beyond the start-of-the-art. In this contribution, we will introduce the proposal and basic consideration of the experiment.

Geng, R. L.↗

DOE OSTI2025

Strong Scalability Analysis of the Albany Land Ice code on HPC Architectures

Scalability is a critical factor in High-Performance Computing (HPC), where optimizing resource usage has a direct impact on cost-effectiveness and time-efficiency. This report presents a strong scaling performance study of the Albany Land Ice (ALI) code across different HPC architectures, towards determining the best configuration to use when running large-scale simulation ensembles.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

Fabrication and Evaluation of Large Alumina Crucibles by Vat Photopolymerization Additive Manufacturing for High-Temperature Actinide Chemistry

Additive manufacturing (AM) offers opportunities to advance the design and function of ceramic tooling in high temperature actinide pyrochemistry. In technical ceramics such as alumina, conventional forming techniques often restrict design flexibility and can limit experimental progress. In this study, we investigate the use of vat photopolymerization (VP) with commercial resins to fabricate large-scale alumina crucibles, reaching dimensions up to 125 mm, which is significantly larger than typically reported for dense VP ceramics. Notably, these additively manufactured components are produced using consumer-grade hardware, which limits process control, but offers significant upside in scalability and accessibility. Using microscopy and X-ray computed tomography, the VP alumina parts have high bulk densities above 95%, but also the prevalence of AM-induced artifacts and surface defects. Mechanical testing showed these defects to significantly reduce flexural strength and compromise part reliability. Electrorefining trials under sustained exposure to molten salts and metals reveal mixed results, with the AM material exhibiting high chemical compatibility, but mechanical failures due to the reduced strength were prevalent. Our findings illustrate both the promise and current limitations of AM ceramics for actinide chemistry, and point toward future improvements in process optimization, design strategies, and part screening to enhance performance and reliability.

Materials science↗

DOE OSTI2013

Slycat v 1.0 Beta

Slycat is a web-based system for analysis of large, high-dimensional data such as that produced by High Performance Computing (HPC) platforms. The Slycat server integrates data ingestion, scalable analysis, data management, and visualization with commodity web clients using a multi-tiered hierarchy of data and model storage. Analysis inputs are pushed into Slycat, where models are generated and analysis artifacts are stored in a project database. These artifacts are the basis for visualizations that are delivered to users' desktops through ordinary web browsers, eliminating the need to build and deploy platform-specific client applications. Slycat currently provides two types of analysis: canonical correlation analysis (CCA) to model relationships between inputs and output metrics, and time series analysis featuring clustering and comparative visualization of waveforms.

Source record↗

DOE OSTI2017

Demand Response Resource Quantification with Detailed Building Energy Models

Demand response is a broad suite of technologies that enables changes in electrical load operations in support of power system reliability and efficiency. Although demand response is not a new concept, there is new appetite for comprehensively evaluating its technical potential in the context of renewable energy integration. The complexity of demand response makes this task difficult -- we present new methods for capturing the heterogeneity of potential responses from buildings, their time-varying nature, and metrics such as thermal comfort that help quantify likely acceptability of specific demand response actions. Computed with an automated software framework, the methods are scalable.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2022

SRF Levitation and Trapping of Nanoparticles

Geng, Rong-Li↗

DOE OSTI2023

Two-link Staggered Quark Smearing in QUDA

Gauge covariant smearing based on the 3D lattice Laplacian can be used to create extended operators that have better overlap with hadronic ground states. For staggered quarks, we make use of two-link parallel transport to preserve taste properties. We have implemented the procedure in QUDA. We present the performance of this code on the NVIDIA A100 GPUs in Indiana University's Big Red 200 supercomputer and on the AMD MI250X GPUs in Oak Ridge Leadership Computer Facility's (OLCF's) Crusher and discuss its scalability. We also study the performance improvement from using NVSHMEM on OLCF's Summit. Reusing precomputed two-link products for all sources and sinks, it reduces the total smearing time for a baryon correlator measurement by a factor of 100-120 as compared with the original MILC code and reduces the overall time by 60-70%.

Gottlieb, Steven↗

DOE OSTI2025

WorkflowHub: a registry for computational workflows

The rising popularity of computational workflows is driven by the need for repetitive and scalable data processing, sharing of processing know-how, and transparent methods. As both combined records of analysis and descriptions of processing steps, workflows should be reproducible, reusable, adaptable, and available. Workflow sharing presents opportunities to reduce unnecessary reinvention, promote reuse, increase access to best practice analyses for non-experts, and increase productivity. In reality, workflows are scattered and difficult to find, in part due to the diversity of available workflow engines and ecosystems, and because workflow sharing is not yet part of research practice. WorkflowHub provides a unified registry for all computational workflows that links to community repositories, and supports both the workflow lifecycle and making workflows findable, accessible, interoperable, and reusable (FAIR). By interoperating with diverse platforms, services, and external registries, WorkflowHub adds value by supporting workflow sharing, explicitly assigning credit, enhancing FAIRness, and promoting workflows as scholarly artefacts. The registry has a global reach, with hundreds of research organisations involved, and more than 800 workflows registered.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2015

In situ plasma removal of surface contaminants from ion trap electrodes

In this thesis, the construction and implementation of an in situ plasma discharge designed to remove surface contaminants from electrodes in an ion trapping experimental system is presented with results. In recent years, many advances have been made in using ion traps for quantum information processing. All of the criteria defined by DiVincenzo for using ion traps for implementing a quantum computer have been individually demonstrated, and in particular surface traps provide a scalable platform for ions. In order to be used for quantum algorithms, trapped ions need to be cooled to their motional (quantum mechanical) ground state. One of the hurdles in integrating surface ion traps for a quantum computer is minimizing electric field noise, which causes the ion to heat out of its motional ground state and which increases with smaller ion-to-electrode distances realized with surface traps. Surface contamination of trap electrodes is speculated to be the primary source of electric field noise. The main goal achieved by this work was to implement an in situ surface cleaning solution for surface electrode ion traps, which would not modify the ion trap electrode surface metal. Care was taken in applying the RF power in order to localize a plasma near the trap electrodes. A method for characterizing the energy of the plasma ions arriving at the ion trap surface is presented and results for plasma ion energies are shown. Finally, a method for quantifying the effectiveness of plasma cleaning of trap electrodes, using the surface analysis technique of X-ray photoelectron spectroscopy for measuring the amount and kind of surface contaminants, is described. A significant advantage of the trap electrode surface cleaning method presented here is the minimal changes necessary for implementation on a working ion trap experimental system.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2022

Precision Tomography of a Three-Qubit Donor Quantum Processor in Silicon

Nuclear spins were among the first physical platforms to be considered for quantum information processing, because of their exceptional quantum coherence and atomic-scale footprint. However, their full potential for quantum computing has not yet been realized, owing to the lack of methods with which to link nuclear qubits within a scalable device combined with multi-qubit operations with sufficient fidelity to sustain fault-tolerant quantum computation. Here we demonstrate universal quantum logic operations using a pair of ion-implanted 31 P donor nuclei in a silicon nanoelectronic device. A nuclear two-qubit controlled-Z gate is obtained by imparting a geometric phase to a shared electron spin, and used to prepare entangled Bell states with fidelities up to 94.2(2.7)%. The quantum operations are precisely characterized using gate set tomography (GST), yielding one-qubit average gate fidelities up to 99.95(2)%, two-qubit average gate fidelity of 99.37(11)% and two-qubit preparation/measurement fidelities of 98.95(4)%. These three metrics indicate that nuclear spins in silicon are approaching the performance demanded in fault-tolerant quantum processors. We then demonstrate entanglement between the two nuclei and the shared electron by producing a Greenberger-Horne-Zeilinger three-qubit state with 92.5(1.0)% fidelity. Because electron spin qubits in semiconductors can be further coupled to other electrons or physically shuttled across different locations, these results establish a viable route for scalable quantum information processing using donor nuclear and electron spins.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2021

ARENA: Asynchronous Reconfigurable Accelerator Ring to Enable Data-Centric Parallel Computing

The next generation HPC and data centers are likely to be reconfigurable and data-centric due to the trend of hardware specialization and the emergence of data-driven applications. In this work, we propose ARENA – an asynchronous reconfigurable accelerator ring architecture as a potential scenario on how the future HPC and data centers will be like. Despite using the coarse-grained reconfigurable arrays (CGRAs) as the substrate platform, our key contribution is not only the CGRA-cluster design itself, but also the ensemble of a new architecture and programming model that enables asynchronous tasking across a cluster of reconfigurable nodes, so as to bring specialized computation to the data rather than the reverse. We presume distributed data storage without asserting any prior knowledge on the data distribution. Hardware specialization occurs at runtime when a task finds the majority of data it requires are available at the present node. In other words, we dynamically generate specialized CGRA accelerators where the data reside. The asynchronous tasking for bringing computation to data is achieved by circulating the task token, which describes the dataflow graphs to be executed for a task, among the CGRA cluster connected by a fast ring network. Evaluations on a set of HPC and data-driven applications across different domains show that ARENA can provide better parallel scalability with reduced data movement (53.9 percent). Compared with contemporary compute-centric parallel models, ARENA can bring on average 4.37× speedup. The synthesized CGRAs and their task-dispatchers only occupy 2.93mm 2 chip area under 45nm process technology and can run at 800MHz with on average 759.8mW power consumption. ARENA also supports the concurrent execution of multi-applications, offering ideal architectural support for future high-performance parallel computing and data analytics systems.

97 MATHEMATICS AND COMPUTING↗