Engineering Papers⌕ Search

SEARCH · Engineering Papers

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.

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

At least 667 records · Page 37

An approach for fast and accurate simulation of phase change material based thermal energy storage in buildings

Latent heat thermal energy storage (LHTES) has significant potential for mitigating peak electricity demand and enabling load shifting in buildings. Phase Change Material embedded heat exchangers (PCM-HX) can significantly improve energy demand management due to high storage capacity. However, PCM-HX evaluation typically depends on computationally expensive fully transient simulations, posing significant challenges for scalable system- and building-level energy assessments across different climates and system architectures. This paper presents a generalized, accurate, and computationally efficient methodology for simulating building energy systems integrated with LHTES. The PCM-HX transient performance is represented by performance maps generated using a Generalized Resistance-Capacitance Model (GRCM) that enables accurate predictions of arbitrary PCM-HXs at low computational cost. The feasibility of the proposed approach was verified using a case study considering a dual-mode heat pump-thermal energy storage (HP-TES) system simulated in Modelica with Spawn of EnergyPlus™ for a DOE prototype small office building in two locations: Tampa, FL, and International Falls, MN. The PCM-HX performance maps provided accurate predictions of PCM-HX transient behavior, with mean absolute percentage deviations within 2–4% compared to GRCM while also achieving at least 1800× reduction in computational time. Moreover, the HP-TES system achieved energy savings of up to 17.4% in Tampa, FL, and 62.2% in International Falls, MN, demonstrating the broader applicability of the proposed methodology across different climate zones. This work highlights the importance of robust PCM-HX models in enabling accurate and computationally efficient building-level simulations and enabling future research opportunities for investigating optimized HP-TES designs and advanced control strategies for grid-interactive buildings.

Modelica↗

Efficient Scalable Tomography of Many-Qubit Quantum Processors

Quantum computing has the potential to realize powerful and revolutionary applications. A quantum computer can, in theory, solve certain problems exponentially faster than its classical counterparts. The current state of the art devices, however, are too small and noisy to practically realize this goal. An important tool for the advancement of quantum hardware, called model-based characterization, seeks to learn what types of noise are exhibited in a quantum processor. This technique, however, is notoriously difficult to scale up to even modest numbers of qubit, and has been limited to just 2 qubits until now. In this report, we present a novel method for performing model-based characterization, or tomography, on a many-qubit quantum processor. We consider up to 10 qubits, but the technique is expected to scale to even larger systems.

97 MATHEMATICS AND COMPUTING↗

Designing FAIR Workflows at OLCF: Building Scalable and Reusable Ecosystems for HPC Science

High Performance Computing (HPC) centers, such as the Oak Ridge Leadership Computing Facility (OLCF), provide advanced infrastructure that enables scientific research at extreme scale. These centers operate with unique hardware configurations, specialized software environments, and elevated security re quirements that differ substantially from what most users encounter on their local systems. As a result, users often develop customized digital artifacts that are tightly coupled to the specific configuration of a given HPC center. Although necessary, this practice can lead to significant duplication of effort as multiple users independently create similar solutions to common problems.

97 MATHEMATICS AND COMPUTING↗

Highly Parallel Solver for Multi-scale Parquet Quantum Modeling of Strongly Correlated Materials

The parquet formalism to calculate the two-particle Green s functions of large systems requires the solution of a large, sparse, complex system of quadratic equations. If Nf Matsubara frequencies are used for a system of size Nc , and Newton s method is used to solve the nonlinear system, the Jacobian system has O(8Nt^3 ) variables and O(40Nt^4 ) complex entries where Nt = Nc Nf . For Nt = 1024, the nonlinear system has over 8.5 billion degrees of freedom and the sparse Jacobian will require over 351 TBytes of memory. The Jacobian is very expensive to store but the matrix-vector products can be computed directly. We are developing a highly scalable parallel solver that uses both OpenMP and MPI to exploit the multicore nodes. We present initial scalability results on the Cray XT5 that suggests the code can be scaled to solve larger problems with Nt 1024.

97 MATHEMATICS AND COMPUTING↗

Scalable Parallel Execution of an Event-based Radio Signal Propagation Model for Cluttered 3D Terrains

Radio signal strength estimation is essential in many applications, including the design of military radio communications and industrial wireless installations. While classical approaches such as finite difference methods are well-known, new event-based models of radio signal propagation have been recently shown to deliver such estimates faster (via serial execution) than other methods. For scenarios with large or richly-featured geographical volumes, however, parallel processing is required to meet the memory and computation time demands. Here, we present a scalable and efficient parallel execution of a recently-developed event-based radio signal propagation model. We demonstrate its scalability to thousands of processors, with parallel speedups over 1000x. The speed and scale achieved by our parallel execution enable larger scenarios and faster execution than has ever been reported before.

99 GENERAL AND MISCELLANEOUS↗

Synchronization-Avoiding Graph Algorithms

Because they were developed for optimal sequential complexity, classical graph algorithms as found in textbooks have strictly-defined orders of operations. Enforcing a prescribed order of operations, or even an approximate order, in a distributed memory setting requires significant amounts of synchronization, which in turn can severely limit scalability. As a result, new algorithms are typically required to achieve scalable performance, even for solving well-known graph problems. Yet, even in these cases, parallel graph algorithms are written according to parallel programming models that evolved for, e.g., scientific computing, and that still have inherent, and scalability-limiting, amounts of synchronization. In this paper we present a new approach to parallel graph algorithms: synchronization-avoiding algorithms. To eliminate synchronization and its associated overhead, synchronization-avoiding algorithms perform work in an unordered and fully asynchronous fashion in such a way that the result is constantly refined toward its final state. “Wasted” work is minimized by locally prioritizing tasks using problem-dependent task utility metrics. We classify algorithms for graph applications into two broad categories: algorithms with monotonic updates (which evince global synchronization) and algorithms with nonmonotonic updates (which evince vertex-centric synchronization). We apply our approach to both classes and develop novel, synchronization-avoiding algorithms for solving exemplar problems: SSSP and connected components for the former, graph coloring for the latter. We demonstrate that eliminating synchronization in conjunction with effective scheduling policies and optimizations in the runtime results in improved scalability for both classes of algorithms.

Firoz, Jesun S.↗

A Scalable O(N) Algorithm for Large-Scale Parallel First-Principles Molecular Dynamics Simulations

Traditional algorithms for first-principles molecular dynamics (FPMD) simulations only gain a modest capability increase from current petascale computers, due to their O(N 3 ) complexity and their heavy use of global communications. To address this issue, we are developing a truly scalable O(N) complexity FPMD algorithm, based on density functional theory (DFT), which avoids global communications. The computational model uses a general nonorthogonal orbital formulation for the DFT energy functional, which requires knowledge of selected elements of the inverse of the associated overlap matrix. We present a scalable algorithm for approximately computing selected entries of the inverse of the overlap matrix, based on an approximate inverse technique, by inverting local blocks corresponding to principal submatrices of the global overlap matrix. The new FPMD algorithm exploits sparsity and uses nearest neighbor communication to provide a computational scheme capable of extreme scalability. Accuracy is controlled by the mesh spacing of the finite difference discretization, the size of the localization regions in which the electronic orbitals are confined, and a cutoff beyond which the entries of the overlap matrix can be omitted when computing selected entries of its inverse. We demonstrate the algorithm's excellent parallel scaling for up to O(100K) atoms on O(100K) processors, with a wall-clock time of O(1) minute per molecular dynamics time step.

36 MATERIALS SCIENCE↗

Scalable Node Monitoring

Project description is: (1) Build a high performance computer; and (2) Create a tool to monitor node applications in Component Based Tool Framework (CBTF) using code from Lightweight Data Metric Service (LDMS). The importance of this project is that: (1) there is a need a scalable, parallel tool to monitor nodes on clusters; and (2) New LDMS plugins need to be able to be easily added to tool. CBTF stands for Component Based Tool Framework. It's scalable and adjusts to different topologies automatically. It uses MRNet (Multicast/Reduction Network) mechanism for information transport. CBTF is flexible and general enough to be used for any tool that needs to do a task on many nodes. Its components are reusable and 'EASILY' added to a new tool. There are three levels of CBTF: (1) frontend node - interacts with users; (2) filter nodes - filters or concatenates information from backend nodes; and (3) backend nodes - where the actual work of the tool is done. LDMS stands for lightweight data metric servies. It's a tool used for monitoring nodes. Ltool is the name of the tool we derived from LDMS. It's dynamically linked and includes the following components: Vmstat, Meminfo, Procinterrupts and more. It works by: Ltool command is run on the frontend node; Ltool collects information from the backend nodes; backend nodes send information to the filter nodes; and filter nodes concatenate information and send to a database on the front end node. Ltool is a useful tool when it comes to monitoring nodes on a cluster because the overhead involved with running the tool is not particularly high and it will automatically scale to any size cluster.

99 GENERAL AND MISCELLANEOUS↗

Current possibilities and future opportunities for erasure coded computations

The key capability established through the research funded by this award are erasure coded computations for linear systems, in serial and in parallel. This capability enables powerful efficient and scalable alternatives to existing linear system solvers in fault-prone computational systems.

97 MATHEMATICS AND COMPUTING↗

SAGIPS: a physics-inspired scalable asynchronous generative inverse-problem solver

Abstract Solving large-scale inverse problems using deep-learning algorithms have become an essential part of modern research and industrial applications. The complexity of the underlying inverse problem may require the utilization of high performance computing systems which poses a challenge on the algorithmic design of the inverse problem solver. Most deep learning algorithms require, due to their design, custom parallelization techniques in order to be resource efficient while showing a reasonable convergence. In this paper we introduce a S calable A synchronous G enerative I nverse P roblem S olver (SAGIPS) on high-performance computing systems. We present a workflow that utilizes an asynchronous ring-allreduce algorithm to transfer the gradients of the generator network across multiple GPUs. Experiments with a scientific proxy application demonstrate that SAGIPS shows near linear weak scaling, together with a convergence quality that is comparable to traditional methods. The approach presented here allows leveraging Generative Adverserial Network across multiple GPUs, promising advancements in solving complex inverse problems at scale.

97 MATHEMATICS AND COMPUTING↗

Striped Data Analysis Framework

Traditionally, High Energy data analysis is based on the model where data are stored in files and analyzed by running multiple analysis processes, each reading one or more of the data files. This process involves repeated data reduction step, which produces smaller files, which is time consuming and leads to data duplication. We propose an alternative approach to data storage and analysis, based on the Big Data technologies. The idea is to store each element of data once and only once in a distributed scalable database and analyze data by reading only "interesting" pieces of data from the database. To make this approach possible, we developed columnar Striped Data Representation Format as the basis of the framework. Traditional columnar approach allows for efficient analysis of complex data structures. While keeping all the benefits of columnar data representation, striped mechanism goes further by enabling efficient parallelization of computations and flexible dist ribution of data analysis. The framework includes scalable and elastic data storage, compute and user analysis backend components. The framework uses off-the shelf web services and data caching technologies as the compute/data co-location mechanism. Flexible architecture allows the framework run in the cloud using container technologies. The framework offers Python/Jupyter as the user analysis backend platform, but can also run in command line or batch mode. In the article, we will present the results of the FNAL-LDRD-2016-032 FNAL LDRD project, the design, implementation, features and performance characteristics of the Striped Data Analysis Framework.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Learning quantum computers' errors using interpretable neural networks

Learning and reducing the errors and noise in quantum computing systems is necessary for achieving quantum computation’s promise. However, rapid advances in experimental quantum computing are making this task increasingly difficult, because state-of-the-art systems now contain hundreds of qubits and many characterization techniques are hard to apply at this scale. Furthermore, complex kinds of errors in these systems, such as crosstalk and non-Markovian effects, must be understood and decreased, but these errors are challenging to study with most existing methods. In this project, we explored using neural networks for scalable characterization of complex errors in quantum computers. We proposed and demonstrated characterizing a quantum computer’s errors with neural networks that have interpretable parameters corresponding to the rates of different kinds of errors, within a sparse Lindbladian parameterization for errors. To enable scaling to many qubit systems, these networks then predict how these errors combine within quantum circuits and impact their outcomes using an efficient approximations. We demonstrated these networks ability to learn coherent crosstalk errors and context-dependent errors in a simulated 4-qubit system.

97 MATHEMATICS AND COMPUTING↗

MOLAR: Modular Linux and Adaptive Runtime Support for HEC OS/R Research

MOLAR is a multi-institution research effort that concentrates on adaptive, reliable,and efficient operating and runtime system solutions for ultra-scale high-end scientific computing on the next generation of supercomputers. This research addresses the challenges outlined by the FAST-OS - forum to address scalable technology for runtime and operating systems --- and HECRTF --- high-end computing revitalization task force --- activities by providing a modular Linux and adaptable runtime support for high-end computing operating and runtime systems. The MOLAR research has the following goals to address these issues. (1) Create a modular and configurable Linux system that allows customized changes based on the requirements of the applications, runtime systems, and cluster management software. (2) Build runtime systems that leverage the OS modularity and configurability to improve efficiency, reliability, scalability, ease-of-use, and provide support to legacy and promising programming models. (3) Advance computer reliability, availability and serviceability (RAS) management systems to work cooperatively with the OS/R to identify and preemptively resolve system issues. (4) Explore the use of advanced monitoring and adaptation to improve application performance and predictability of system interruptions. The overall goal of the research conducted at NCSU is to develop scalable algorithms for high-availability without single points of failure and without single points of control.

97 MATHEMATICS AND COMPUTING↗

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.↗

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)↗

Ergatis: a web interface and scalable software system for bioinformatics workflows

Motivation: The growth of sequence data has been accompanied by an increasing need to analyze data on distributed computer clusters. The use of these systems for routine analysis requires scalable and robust software for data management of large datasets. Software is also needed to simplify data management and make large-scale bioinformatics analysis accessible and reproducible to a wide class of target users. Results: We have developed a workflow management system named Ergatis that enables users to build, execute and monitor pipelines for computational analysis of genomics data. Ergatis contains preconfigured components and template pipelines for a number of common bioinformatics tasks such as prokaryotic genome annotation and genome comparisons. Outputs from many of these components can be loaded into a Chado relational database. Ergatis was designed to be accessible to a broad class of users and provides a user friendly, web-based interface. Ergatis supports highthroughput batch processing on distributed compute clusters and has been used for data management in a number of genome annotation and comparative genomics projects.

59 BASIC BIOLOGICAL SCIENCES↗

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↗

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↗