Engineering Papers⌕ Search

SEARCH · Engineering Papers

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

Particle Accelerator Spin-Transparent Storage Rings for Beyond State-of-the-Art Science

We will describe spin-transparent storage rings that exhibit spin-coherence times of several hours and store a large number of particles and their use in novel applications. For example, these rings can be used to directly measure the electric dipole moment of the electron, relevant to CP violation and matter-antimatter asymmetry in the universe, and to search for dark energy and ultra-light dark matter*. These rings can also serve as a compelling platform for quantum computing. In this presentation, we will describe how spin-transparent rings can be used in conjunction with ion traps to enhance scalability and increase quantum coherence times of ion quantum computing.

Suleiman, R.↗
DOE OSTI2024

Adaptive finite differencing in high accuracy electronic structure calculations

Abstract A multi-order Adaptive Finite Differencing (AFD) method is developed for the kinetic energy operator in real-space, grid-based electronic structure codes. It uses atomic pseudo orbitals produced by the corresponding pseudopotential codes to optimize the standard finite difference (SFD) operators for improved precision. Results are presented for a variety of test systems and Bravais lattice types, including the well-known Δ test for 71 elements in the periodic table, the Mott insulator NiO, and borax decahydrate, which contains covalent, ionic, and hydrogen bonds. The tests show that an 8th-order AFD operator leads to the same average Δ value as that achieved by plane-wave codes and is typically far more accurate and has a much lower computational cost than a 12th-order SFD operator. The scalability of real-space electronic calculations is demonstrated for a 2016-atom NiO cell, for which the computational time decreases nearly linearly when scaled from 18 to 144 CPU-GPU nodes.

Briggs, E. L. (ORCID:0000000343983492)↗
NASA NTRS2002

Message Passing and Shared Address Space Parallelism on an SMP Cluster

Currently, message passing (MP) and shared address space (SAS) are the two leading parallel programming paradigms. MP has been standardized with MPI, and is the more common and mature approach; however, code development can be extremely difficult, especially for irregularly structured computations. SAS offers substantial ease of programming, but may suffer from performance limitations due to poor spatial locality and high protocol overhead. In this paper, we compare the performance of and the programming effort required for six applications under both programming models on a 32-processor PC-SMP cluster, a platform that is becoming increasingly attractive for high-end scientific computing. Our application suite consists of codes that typically do not exhibit scalable performance under shared-memory programming due to their high communication-to-computation ratios and/or complex communication patterns. Results indicate that SAS can achieve about half the parallel efficiency of MPI for most of our applications, while being competitive for the others. A hybrid MPI+SAS strategy shows only a small performance advantage over pure MPI in some cases. Finally, improved implementations of two MPI collective operations on PC-SMP clusters are presented.

Shan, Hongzhang↗
DOE OSTI2022

Single electrons on solid neon as a solid-state qubit platform

Progress towards the realization of quantum computers requires persistent advances in their constituent building blocks-qubits. Novel qubit platforms that simultaneously embody long coherence, fast operation and large scalability offer compelling advantages in the construction of quantum computers and many other quantum information systems 1-3 . Electrons, ubiquitous elementary particles of non-zero charge, spin and mass, have commonly been perceived as paradigmatic local quantum information carriers. Despite superior controllability and configurability, their practical performance as qubits through either motional or spin states depends critically on their material environment 3-5 . In this work, we report our experimental realization of a qubit platform based on isolated single electrons trapped on an ultraclean solid neon surface in vacuum 6-13 . By integrating an electron trap in a circuit quantum electrodynamics architecture 14-20 , we achieve strong coupling between the motional states of a single electron and a single microwave photon in an on-chip superconducting resonator. Qubit gate operations and dispersive readout are implemented to measure the energy relaxation time T 1 of 15 μs and phase coherence time T 2 over 200 ns. These results indicate that the electron-on-solid-neon qubit already performs near the state of the art for a charge qubit 21 .

36 MATERIALS SCIENCE↗
DOE OSTI2014

FAST $\mathrm{G}$ AP $\mathrm{F}$ ILL : efficient gap filling in metabolic networks

Genome-scale metabolic reconstructions summarize current knowledge about a target organism in a structured manner and as such highlight missing information. Such gaps can be filled algorithmically. Scalability limitations of available algorithms for gap filling hinder their application to compartmentalized reconstructions. We present fastGapFill, a computationally efficient tractable extension to the COBRA toolbox that permits the identification of candidate missing knowledge from a universal biochemical reaction database (e.g. Kyoto Encyclopedia of Genes and Genomes) for a given (compartmentalized) metabolic reconstruction. The stoichiometric consistency of the universal reaction database and of the metabolic reconstruction can be tested for permitting the computation of biologically more relevant solutions. We demonstrate the efficiency and scalability of fastGapFill on a range of metabolic reconstructions.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2023

DGaaS: GPU as a Service on Distributed Computing System

In the rapidly evolving landscape of scientific computing, Graphics Processing Units (GPUs) have become indispensable for their unparalleled ability to handle parallel tasks in complex calculations, simulations, and data analysis. Their utility is further magnified in machine learning and AI applications, where they significantly accelerate model training and predictive analytics. Within this context, the Triton Inference Server emerges as a pivotal open-source tool, specializing in AI inferencing and optimizing GPU utilization across various platforms and frameworks. This paper presents an in-depth study on distributed High Throughput Computing (HTC), specifically focusing on the HTCondor framework and its resource provisioning tools, GlideinWMS and HEPCloud. These systems enable large-scale scientific experiments like CMS and DUNE to efficiently access and utilize vast computational resources. The paper explores the core architectural components of GlideinWMS, including jobs, user pools, and worker nodes, and discusses their integration with GPUs and the Triton server. The primary aim of this research is to develop a solution that optimizes GPU utilization by leveraging Glideins and containers. This approach allows computational jobs, particularly those involving AI models, to use GPUs only when essential, thereby facilitating efficient sharing of limited GPU resources. To validate this architecture, the study conducted three key tests involving custom scripts, container-based servers, and Triton server deployments. However, the study faces challenges, notably in locating the Triton server and ensuring secure remote access. To address these issues, future work will focus on developing a proxy mechanism and enhancing security protocols. In conclusion, this study offers a comprehensive roadmap for effective and efficient GPU utilization in distributed High Throughput Computing. It aims to contribute significantly to the scientific community by solving pressing problems and implementing robust solutions in collaboration with the GlideinWMS and HEPCloud teams. The research sets the stage for a more efficient, scalable, and cost-effective paradigm in scientific computing.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2014

The Anatomy of Mr. Scan: A Dissection of Performance of an Extreme Scale GPU-Based Clustering Algorithm, In: 2014 5th Workshop on Latest Advances in Scalable Algorithms for Large-Scale Systems

The emergence of leadership class systems with GPU-equipped nodes has the potential to vastly increase the performance of existing distributed applications. However, the inclusion of GPU computation into existing extreme scale distributed applications can reveal scalability issues that were absent in the CPU version. The issues exposed in scaling by a GPU can become limiting factors to overall application performance. We developed an extreme scale GPU-based application to perform data clustering on multi-billion point datasets. In this application, called Mr. Scan, we ran into several of these performance limiting issues. Through the use of complete end-to-end benchmarking of Mr. Scan (measuring time from reading and distribution to final output), we were able to identify three major sources of real world performance issues: data distribution, GPU load balancing, and system specific issues such as start-up time. These issues comprised a vast majority of the run time of Mr. Scan. Data distribution alone accounted for 68% of the total run time of Mr. Scan when processing 6.5 billion points on Cray Titan at 8192 nodes. With improvements in these areas, we have been able able to cut total run time of Mr. Scan from 17.5 minutes to 8.3 minutes when clustering 6.5 billion points.

Computer Science↗
DOE OSTI2021

Brain Connectivity Workshop Series Report

The National Institutes of Health (NIH) BRAIN Initiative aims to accelerate development and application of technologies that show how individual brain cells in complex neural circuits interact at the speed of thought and action. Complete wiring diagrams of the mammalian brain will revolutionize the capabilities of researchers to formulate and test models of how activity within brain circuits drives coordinated function and behavior. A top priority for the BRAIN Initiative, motivated by the strategic guidance of the BRAIN 2.0 Working Group report, is to muster the resources and foster the collaborations needed to generate these wiring diagrams at the level of long-range projections (“projectomes”) and synapses (“connectomes”) in whole mammalian brains, including those from rodents, humans, and other large-brained mammals. Achieving the scale and resolution necessary to characterize and use these projectomes and connectomes will not only push the boundaries of current imaging and computational capabilities to generate faster, cheaper, and more scalable technologies, but also drive broad innovation in data science, artificial intelligence, and machine learning.

42 ENGINEERING↗
DOE OSTI2019

Machine Learning Classical Interatomic Potentials for Molecular Dynamics from First-Principles Training Data

The ever-increasing power of modern super-computers, along with the availability of highly scalable atomistic simulation codes, has begun to revolutionize predictive modeling of materials. In particular, molecular dynamics (MD) has led to breakthrough advances in diverse fields, including tribology, catalysis, sensing, and nanoparticle self-assembly. Furthermore, recent integration of MD simulations with X-ray characterization has demonstrated promise in real-time 3-D characterization of materials on the atomic scale. The popularity of MD is driven by its applicability at disparate length/time scales, ranging from ab initio MD (hundreds of atoms and tens of picoseconds) to all-atom classical MD (millions of atoms over microseconds), and coarse-grained (CG) models (micrometers and tens of microseconds). Nevertheless, a substantial gap persists between AIMD, which is highly accurate but restricted to extremely small sizes, and those based on classical force fields (atomistic and CG) with limited accuracy but access to larger length/time scales. The accuracy and predictive power of classical MD simulations is dictated by the empirical force fields, and their capability to capture the relevant physics. Here, we discuss some of our recent work on the use of machine learning (ML) to combine the accuracy and flexibility of electronic structure calculations with the speed of classical potentials. Our ML framework attempts to bridge the significant gulf that exists between the handful of research groups that develop new interatomic potential models (often requiring several years of effort), and the increasingly large user community from academia and industry that applies these models. Our data-driven approach represents significant departure from the status quo and involves several steps including generation and manipulation of extensive training data sets through electronic structure calculations, defining novel potential functional forms, employing state-of-the-art ML algorithms to formulate highly optimized training procedures, and subsequently developing user-friendly workflow tools integrating these algorithms on high-performance computers (HPCs). Our ML approach shows marked success in developing force fields for a wide range of materials from metals, oxides, nitrides, and heterointerfaces to two-dimensional (2D) materials.

Chan, Henry↗
DOE OSTI2015

Forces and stress in second order Møller-Plesset perturbation theory for condensed phase systems within the resolution-of-identity Gaussian and plane waves approach

The forces acting on the atoms as well as the stress tensor are crucial ingredients for calculating the structural and dynamical properties of systems in the condensed phase. Here, these derivatives of the total energy are evaluated for the second-order Møller-Plesset perturbation energy (MP2) in the framework of the resolution of identity Gaussian and plane waves method, in a way that is fully consistent with how the total energy is computed. This consistency is non-trivial, given the different ways employed to compute Coulomb, exchange, and canonical four center integrals, and allows, for example, for energy conserving dynamics in various ensembles. Based on this formalism, a massively parallel algorithm has been developed for finite and extended system. The designed parallel algorithm displays, with respect to the system size, cubic, quartic, and quintic requirements, respectively, for the memory, communication, and computation. All these requirements are reduced with an increasing number of processes, and the measured performance shows excellent parallel scalability and efficiency up to thousands of nodes. Additionally, the computationally more demanding quintic scaling steps can be accelerated by employing graphics processing units (GPU’s) showing, for large systems, a gain of almost a factor two compared to the standard central processing unit-only case. In this way, the evaluation of the derivatives of the RI-MP2 energy can be performed within a few minutes for systems containing hundreds of atoms and thousands of basis functions. With good time to solution, the implementation thus opens the possibility to perform molecular dynamics (MD) simulations in various ensembles (microcanonical ensemble and isobaric-isothermal ensemble) at the MP2 level of theory. Geometry optimization, full cell relaxation, and energy conserving MD simulations have been performed for a variety of molecular crystals including NH{sub 3}, CO{sub 2}, formic acid, and benzene.

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

Carbon-Based Quantum Information Science with Symmetry Protected Topological States (Final Report, DOE-BES award DE-SC0023105)

This research program established the scientific foundation for the rational, bottom-up design, synthesis, isolation, and investigation of symmetry-protected topological (SPT) electron spin qubits embedded in graphene nanoribbons (GNRs). The work focused on integrating atomically precise low-dimensional carbon nanostructures with emerging quantum logic architectures, providing a pathway toward scalable quantum materials for next-generation computing and sensing technologies. A central component of the program was the elucidation of fundamental relationships between real-space molecular architecture, local spin density distributions, electronic band dispersion, and energy level alignment in atomically precise GNR systems. These correlations define key operational parameters of SPT qubits and were systematically investigated to establish quantitative benchmarks against established molecular and solid-state spin qubit platforms. Attention was given to properties critical for quantum device performance, e.g. decoherence times, spectral sharpness of energy transitions, and tunable exchange interactions between spin states. The research demonstrated that these parameters can be engineered with atomic precision through scalable bottom-up synthetic strategies. Theory-guided design played a central role in identifying candidate structures hosting topologically protected spin states. Experimental validation was performed using both ensemble measurements and single-molecule characterization. In addition to advances in quantum materials synthesis, the program developed and applied spin-sensitive scanning probe microscopy techniques capable of directly probing quantum states and dynamic processes with atomic-scale spatial resolution. These capabilities enabled direct observation and characterization of quantum structures at the single-atom level. While the research activities were primarily hypothesis-driven fundamental investigations, the program adopted a comprehensive materials-by-design framework aimed at translating scientific discoveries into technological concepts compatible with scalable and intelligent manufacturing approaches.

36 MATERIALS SCIENCE↗
NASA NTRS1998

The SGI/Cray T3E: Experiences and Insights

The NASA Goddard Space Flight Center is home to the fifth most powerful supercomputer in the world, a 1024 processor SGI/Cray T3E-600. The original 512 processor system was placed at Goddard in March, 1997 as part of a cooperative agreement between the High Performance Computing and Communications Program's Earth and Space Sciences Project (ESS) and SGI/Cray Research. The goal of this system is to facilitate achievement of the Project milestones of 10, 50 and 100 GFLOPS sustained performance on selected Earth and space science application codes. The additional 512 processors were purchased in March, 1998 by the NASA Earth Science Enterprise for the NASA Seasonal to Interannual Prediction Project (NSIPP). These two "halves" still operate as a single system, and must satisfy the unique requirements of both aforementioned groups, as well as guest researchers from the Earth, space, microgravity, manned space flight and aeronautics communities. Few large scalable parallel systems are configured for capability computing, so models are hard to find. This unique environment has created a challenging system administration task, and has yielded some insights into the supercomputing needs of the various NASA Enterprises, as well as insights into the strengths and weaknesses of the T3E architecture and software. The T3E is a distributed memory system in which the processing elements (PE's) are connected by a low latency, high bandwidth bidirectional 3-D torus. Due to the focus on high speed communication between PE's, the T3E requires PE's to be allocated contiguously per job. Further, jobs will only execute on the user specified number of PE's and PE timesharing is possible but impractical. With a highly varied job mix in both size and runtime of jobs, the resulting scenario is PE fragmentation and an inability to achieve near 100% utilization. SGI/Cray has provided several scheduling and configuration tools to minimize the impact of fragmentation. These tools include PScheD (the political scheduler), GRM (the global resource manager) and NQE (the Network Queuing Environment). Features and impact of these tools will be discussed, as will resulting performance and utilization data. As a distributed memory system, the T3E is designed to be programmed through explicit message passing. Consequently, certain assumptions related to code design are made by the operating system (UNICOS/mk) and its scheduling tools. With the exception of HPF, which does run on the T3E, however poorly, alternative programming styles have the potential to impact the T3E in unexpected and undesirable ways. Several examples will be presented (preceeded with the disclaimer, "Don't try this at home! Violators will be prosecuted!")

Bernard, Lisa Hamet↗
DOE OSTI2020

COHORT: Coordination of Heterogeneous Thermostatically Controlled Loads for Demand Flexibility

Demand flexibility is increasingly important for power grids. Careful coordination of thermostatically controlled loads (TCLs) can modulate energy demand, decrease operating costs, and increase grid resiliency. We propose a novel distributed control framework for the Coordination Of HeterOgeneous Residential Thermostatically controlled loads (COHORT). COHORT is a practical, scalable, and versatile solution that coordinates a population of TCLs to jointly optimize a grid-level objective, while satisfying each TCL’s end-use requirements and operational constraints. To achieve that, we decompose the grid-scale problem into subproblems and coordi- nate their solutions to find the global optimum using the alternating direction method of multipliers (ADMM). The TCLs’ local problems are distributed to and computed in parallel at each TCL, making COHORT highly scalable and privacy-preserving. While each TCL poses combinatorial and non-convex constraints, we characterize these constraints as a convex set through relaxation, thereby making COHORT computationally viable over long planning horizons. After coordination, each TCL is responsible for its own control and tracks the agreed-upon power trajectory with its preferred strategy. In this work, we translate continuous power back to discrete on/off actuation, using pulse width modulation. COHORT is generalizable to a wide range of grid objectives, which we demonstrate through three distinct use cases: generation following, minimizing ramping, and peak load curtailment. In a notable experiment, we validated our approach through a hardware-in-the-loop simulation, including a real-world air conditioner (AC) controlled via a smart thermostat, and simulated instances of ACs modeled after real-world data traces. During the 15-day experimental period, COHORT reduced daily peak loads by an average of 12.5% and maintained comfortable temperatures.

demand response↗
DOE OSTI2017

Control and Information Systems for the National Ignition Facility

Orchestration of every National Ignition Facility (NIF) shot cycle is managed by the Integrated Computer Control System (ICCS), which uses a scalable software architecture running code on more than 1950 front-end processors, embedded controllers, and supervisory servers. The ICCS operates laser and industrial control hardware containing 66 000 control and monitor points to ensure that all of NIF’s laser beams arrive at the target within 30 ps of each other and are aligned to a pointing accuracy of less than 50 μm root-mean-square, while ensuring that a host of diagnostic instruments record data in a few billionths of a second. NIF’s automated control subsystems are built from a common object-oriented software framework that distributes the software across the computer network and achieves interoperation between different software languages and target architectures. A large suite of business and scientific software tools supports experimental planning, experimental setup, facility configuration, and post-shot analysis. Standard business services using open-source software, commercial workflow tools, and database and messaging technologies have been developed. An information technology infrastructure consisting of servers, network devices, and storage provides the foundation for these systems. Thus, this work is an overview of the control and information systems used to support a wide variety of experiments during the National Ignition Campaign.

42 ENGINEERING↗
DOE OSTI2021

Local time stepping for the shallow water equations in MPAS

In this work we assess the performance of a set of local time-stepping (LTS) schemes for the shallow water equations implemented in the Model for Prediction Across Scales (MPAS). The goal of LTS is to speed up the simulation by allowing different time-steps on different regions of the computational grid. The LTS schemes considered here were originally introduced by Hoang et al. (2019) [26], who laid out the mathematical foundation of the methods. Here, the authors take on the task of presenting a fast, efficient and scalable parallel implementation of these LTS methods on high performance computing machines, with the aim to provide a recipe for other climate modeling groups that may be interested in employing LTS algorithms in their codes. As a matter of fact, even if MPAS is our framework of choice, our approach is general enough and could be of interest to other groups beyond the MPAS community. Due to their nature, LTS methods possess an inherent load imbalance that needs to be carefully addressed in order to obtain efficient scalability. Even more important is the far from trivial task of computing the right-hand side terms only on specific LTS regions during the time-stepping procedure. An inefficient handling of this task causes a drastic decay of the CPU time performance, making the LTS algorithms practically of no use. The emphasis of the present work is therefore on the computational and parallel aspects of the LTS methods, whose proper treatment is crucial to make the methods run faster against existing strategies, such as for instance high-order explicit global time-stepping schemes. This is in fact the ultimate goal of using an LTS procedure and it is the one to which we direct all our optimization efforts.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

High-fidelity parallel entangling gates on a neutral-atom quantum computer

The ability to perform entangling quantum operations with low error rates in a scalable fashion is a central element of useful quantum information processing. Neutral-atom arrays have recently emerged as a promising quantum computing platform, featuring coherent control over hundreds of qubits and any-to-any gate connectivity in a flexible, dynamically reconfigurable architecture. The main outstanding challenge has been to reduce errors in entangling operations mediated through Rydberg interactions. Here we report the realization of two-qubit entangling gates with 99.5% fidelity on up to 60 atoms in parallel, surpassing the surface-code threshold for error correction. Our method uses fast, single-pulse gates based on optimal control, atomic dark states to reduce scattering and improvements to Rydberg excitation and atom cooling. We benchmark fidelity using several methods based on repeated gate applications, characterize the physical error sources and outline future improvements. Finally, we generalize our method to design entangling gates involving a higher number of qubits, which we demonstrate by realizing low-error three-qubit gates. By enabling high-fidelity operation in a scalable, highly connected system, these advances lay the groundwork for large-scale implementation of quantum algorithms, error-corrected circuits and digital simulations.

97 MATHEMATICS AND COMPUTING↗
NASA NTRSDate not supplied

Scalability of Cohesive Fatigue Analyses Using Explicit Solvers

A cohesive fatigue law has been integrated into a constitutive material model compatible with an explicit finite element solver. The cohesive fatigue model response is based on engineering approximations of the endurance limit and the Goodman diagram. This approach can predict stress-life diagrams for crack initiation, the Paris law regime, and transient effects of crack initiation and stable tearing. Simplified cyclic loading is utilized so that the applied load(or displacement) corresponds to the peak load of a fatigue cycle. Loads are held constant during fatigue while damage develops with increasing solution increments. An automatically-calculated ratio of fatigue cycles per solution increment controls the rate of damage growth, ensuring that damage growth is modeled with a sufficient minimum number of increments and damage growth advances to a minimum desired extent within the explicit analysis step time. The compatibility with an explicit finite element solver enables the analysis of structures that are computationally intractable for implicit finite element solvers. Scalability studies are conducted for geometrically nonlinear problems involving fiber-reinforced composite structures that exhibit fatigue damage growth of interacting matrix cracks and delaminations

Frank A Leone↗
DOE OSTI2026

A Linear Programming Approach to Backtracking for Single-Axis Trackers on Rolling Terrain

In this article, we present a computationally efficient method for determining optimal backtracking rotations for single-axis solar trackers on nonuniform terrain. The method allows for ganged tracking, mechanical rotation constraints, uneven row spacing, and arbitrary maximum allowable shaded fractions (to enable “fractional backtracking”). As with previous 2-D approaches, the method is suitable for terrain that varies in the transverse direction with respect to the rotation axis of the trackers. The novelty of the method lies in formulating the problem of shade avoidance as a linear problem, which is achieved by using the row interception width as the optimization variable instead of rotation angles. Formulating backtracking as a linear problem enables the use of extremely efficient linear programming algorithms, making the method highly scalable, requiring less than 1 min to compute optimal rotation schedules for hundreds of trackers. It also produces more effective backtracking rotations, reducing the frequency of shading by 4× and improving system energy output by 1%–2%.

Optimization↗