Search NASA⌕ Search

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.

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

At least 1,747 records · Page 97

High-Performance Computing Based EMT Simulation: Power Grid with IBRs

Electromagnetic transient (EMT) simulation of power grids with high-fidelity models of inverter-based resources (IBRs) is time-consuming and difficult to scale. The necessity for high-fidelity models of IBRs that incorporate the dynamics of individual inverters within IBRs has been showcased in recent studies. These studies focused on events with partial power reduction in each IBR during a transmission line fault in the power grid. These types of events have been documented in multiple North American Electric Reliability Council (NERC) reports in the past decade. It is imperative then to find solutions to speed-up EMT simulations and scale the size of the region with IBRs studied in EMT simulations. In this paper, a combination of numerical simulation algorithms with high-performance computing techniques are employed in discretization and linear solvers employed in the proposed RE-INTEGRATE EMT simulation platform for power grid with IBRs. For ease of scalability, modular and object-oriented programming is used as these techniques are implemented. Additionally, automation software is developed to convert legacy software codes to the proposed RE-INTEGRATE EMT simulation platform. Thereafter, this platform is evaluated on multi-core central processing units (CPUs). Finally, scale-up tests are performed to showcase the scalability that is possible.

Marthi, Phani Ratna Vanamali [ORNL] (ORCID:0000000↗

The Radical Atom: Mechanosynthetic 3D Printing of an Atomically Precise SPM Tip

This research effort sought to overcome current limitations in scanning probe-based atomic manipulation to enable atomically precise manufacturing (APM). Previous theoretical and experimental works on atom by atom and molecule by molecule fabrication of precise structures are limited to essentially to two-dimensions. APM will enable a paradigm shift in 21st century manufacturing practices in which every single atom in a electronic chip, device or machine can be placed in an exact and predefined position in three-dimensions. By providing a general method for generating reproducible SPM tip structure, this project will drive forward the entire field of atomically precise scanning probe microscopy, opening the door to positional control of nearly arbitrary covalent chemistry. Such control could, for example, be used in applications such as novel 2.5 or 3D microchip fabrication. The creation of a unique manufacturing method through APM has the potential to impact technologies at the theoretical limits of performance, weight, and utility including: solid-state quantum and spintronic computing systems, high efficiency optical antenna, solar power systems, defect engineered materials and extremely efficient catalysts. Although this experiment focused on pick-and-place non-scalable APM, the better understanding of the chemistry is crucial to the eventual goal of scalable APM. To place individual atoms into a specified location is a seminal aspiration of researchers and engineers in the many fields and may have early premium applications in medical devices and microelectronics.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

Fermilab Automation of Coil Winding System

The automated coil winder project creates a repeatable, scalable method for producing superconducting magnet coils with increased accuracy and efficiency. The design uses an ortho cyclic winding method to achieve high fill factors by combining computer numerical control (CNC), microcontroller-based controls, and sophisticated optimization techniques. The method optimizes coil turns, core geometry, and current consumption by utilizing analytical models based on magnetic moment, Ohm’s law, and power constraints. For particle accelerator applications, prototype testing using a 3D-printed coil winder has shown enhanced winding repeatability, thermal management, and manufacturability.

Dzida, Rafal [Northern Illinois U.]↗

Silo & HDF5 I/O Scaling Improvements on BG/P Systems

Silo and HDF5 are I/O libraries used by many codes important to the LLNL's Weapons and Complex Integration (WCI) mission. In the past year, modest adjustments and tuning of Silo, HDF5 and the I/O configuration of the BG/P platform, Dawn, were undertaken. A key goal of this work was to improve I/O performance without requiring any changes in the application codes themselves. In particular, the application codes have been allowed to continue to use a simplified yet highly flexible I/O paradigm known as 'Poor Man's Parallel I/O', where scalability is achieved through concurrent, serial I/O to multiple files. The results demonstrate substantial performance gains (better than 50x in many cases) at large scale (greater than 64,000 MPI tasks). They describe key enhancements made to Silo, HDF5 and the I/O configuration of our BG/P platform and present very favorable results from scalability studies over a wide range of operating scenarios.

97 MATHEMATICS AND COMPUTING↗

Building a Parallel Cloud Storage System using OpenStack’s Swift Object Store and Transformative Parallel I/O

Our project consists of bleeding-edge research into replacing the traditional storage archives with a parallel, cloud-based storage solution. It used OpenStack's Swift Object Store cloud software. It's Benchmarked Swift for write speed and scalability. Our project is unique because Swift is typically used for reads and we are mostly concerned with write speeds. Cloud Storage is a viable archive solution because: (1) Container management for larger parallel archives might ease the migration workload; (2) Many tools that are written for cloud storage could be utilized for local archive; and (3) Current large cloud storage practices in industry could be utilized to manage a scalable archive solution.

99 GENERAL AND MISCELLANEOUS↗

There and Back Again: Reimagining Cryogenic Cooling for Scalable Arrays of Dilution Refrigerators for future Quantum Datacenters

While pulse tube cryocoolers enabled the rapid expansion of dilution refrigerator technology over the past two decades, the transition to large-scale quantum systems is now driving a reassessment of the DR’s higher-temperature-stage cooling strategies and how these systems can be effectively scaled in a modular way. Quasi-wet architectures based on centralized cryoplants and forced-flow helium distribution offer compelling advantages in energy efficiency, operational cost, and scalability. With appropriate redundancy, standardized interfaces, and optimized distribution system designs, these architectures will provide a practical and robust path forward for the next generation of quantum computing infrastructure.

Hansen, B. [Fermilab]↗

Sub-MeV ultra-compact linac for radioactive isotope sources replacement, non-destructive testing, security and medical applications

RadiaBeam Technologies, LLC has developed an inexpensive, hand-portable 180 keV electron accelerator to replace 57 Co radionuclide sources in Cascade Header Enrichment Monitor detectors. We used two innovative technologies in our design: a Ku-band (1 cm wavelength) magnetron, and a split accelerating structure design to reduce manufacturing costs. In this paper, we will discuss the accelerator, including X-ray convertor and accelerating structure design. The results of RF measurements of a Ku-band split structure prototype will also be reviewed. Other applications of Ku-band linacs include compact backscatter and transmission X-ray security inspection systems, as well as computed tomography (CT) systems for luggage and parcel screening. The main requirement for luggage inspection systems is that the X-ray source must be extremely compact. Further, the required energies should cover the range from 180 keV to 1 MeV. In this paper, we will discuss the linac’s energy scalability and other modifications that will enable our technology to address these applications.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Scalable fermionic error correction in Majorana surface codes

We study the error correcting properties of Majorana surface codes (MSCs), topological quantum codes constructed out of interacting Majorana fermions, which can be used to store quantum information and perform quantum computation. Furthermore, these quantum memories suffer from purely “fermionic” errors, such as quasiparticle poisoning (QP), that have no analog in conventional platforms with bosonic qubits. In physical realizations where QP dominates, we show that errors can be corrected provided that the poisoning rate is below a threshold of ~11%. When QP is highly suppressed and fermionic bilinear (“bosonic”) errors become dominant, we find an error threshold of ~16%, which is much higher than the threshold for spin-based topological memories like the surface code or the color code. In addition, we derive lattice gauge theories to account for measurement errors. These results, together with the inherent error suppression provided by the superconducting gap in physical realizations of the MSCs, makes this a strong candidate for a robust topological quantum memory.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Evaluating In-Clique and Topological Parallelism Strategies for Junction Tree-Based Bayesian Inference Algorithm on the Cray XMT

Long viewed as a strong statistical inference technique, Bayesian networks have emerged to be an important class of applications for high-performance computing. We have applied an architecture-conscious approach to parallelizing the Lauritzen-Spiegelhalter Junction Tree algorithm for exact inferencing in Bayesian networks. In optimizing the Junction Tree algorithm, we have implemented both in-clique and topological parallelism strategies to best leverage the fine-grained synchronization and massive-scale multithreading of the Cray XMT architecture. Two topological techniques were developed to parallelize the evidence propagation process through the Bayesian network. One technique involves performing intelligent scheduling of junction tree nodes based on its topology and relative size. The second technique involves decomposing the junction tree into a much finer tree-like representation to offer much more opportunities for parallelism. We evaluate these optimizations on five different Bayesian networks and report our findings and observations. Another important contribution of this paper is to demonstrate the application of massive-scale multithreading for load balancing and use of implicit parallelism-based compiler optimizations in designing scalable inferencing algorithms.

99 GENERAL AND MISCELLANEOUS↗

High-Performance Computation of Distributed-Memory Parallel 3D Voronoi and Delaunay Tessellation

Computing a Voronoi or Delaunay tessellation from a set of points is a core part of the analysis of many simulated and measured datasets: N-body simulations, molecular dynamics codes, and LIDAR point clouds are just a few examples. Such computational geometry methods are common in data analysis and visualization; but as the scale of simulations and observations surpasses billions of particles, the existing serial and shared-memory algorithms no longer suffice. A distributed-memory scalable parallel algorithm is the only feasible approach. The primary contribution of this paper is a new parallel Delaunay and Voronoi tessellation algorithm that automatically determines which neighbor points need to be exchanged among the subdomains of a spatial decomposition. Other contributions include periodic and wall boundary conditions, comparison of our method using two popular serial libraries, and application to numerous science datasets.

97 MATHEMATICS AND COMPUTING↗

A computationally efficient P 1 radiation model for modern combustion systems utilizing pre-conditioned conjugate gradient methods

The iterative convergence of the P 1 radiation model can be slow in optically thin scenarios when employing classical iterative methods. In order to remedy this shortcoming, an in-house P 1 radiation model was interfaced with high performance, scalable, linear solver libraries. Next, the accuracies of P 1 radiation model calculations was assessed by comparing its predictions against discrete ordinates (DO) model calculations for prototypical problems representative of modern combustion systems. Corresponding benchmark results were also included for comparison. Utilizing Pre-Conditioners (PC) to the Conjugate Gradients (CG) method, the convergence time of the P 1 radiation model reduced by a factor of 30 for modest problem sizes and a factor of 70 for larger sized problems when compared against classical Gauss Seidel sweeps. Additionally, PC provided 50% computational savings compared to employing CG in a standalone mode. The P 1 model calculation times were about 25–30% of the DO model calculation time. The time to solution also scaled linearly with an increase in problem size. The weighted sum of gray gases model employed in this study in conjunction with the P 1 model provided good agreement against benchmark data with L 2 error norms (defined relative to corresponding DO calculations) improving when isotropic intensities were prevalent.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Parallel Heuristics for Scalable Community Detection

Community detection has become a fundamental operation in numerous graph-theoretic applications. It is used to reveal natural divisions that exist within real world networks without imposing prior size or cardinality constraints on the set of communities. Despite its potential for application, there is only limited support for community detection on large-scale parallel computers, largely owing to the irregular and inherently sequential nature of the underlying heuristics. In this paper, we present parallelization heuristics for fast community detection using the Louvain method as the serial template. The Louvain method is an iterative heuristic for modularity optimization. Originally developed by Blondel et al. in 2008, the method has become increasingly popular owing to its ability to detect high modularity community partitions in a fast and memory-efficient manner. However, the method is also inherently sequential, thereby limiting its scalability to problems that can be solved on desktops. Here, we observe certain key properties of this method that present challenges for its parallelization, and consequently propose multiple heuristics that are designed to break the sequential barrier. Our heuristics are agnostic to the underlying parallel architecture. For evaluation purposes, we implemented our heuristics on shared memory (OpenMP) and distributed memory (MapReduce-MPI) machines, and tested them over real world graphs derived from multiple application domains (internet, biological, natural language processing). Experimental results demonstrate the ability of our heuristics to converge to high modularity solutions comparable to those output by the serial algorithm in nearly the same number of iterations, while also drastically reducing time to solution.

clustering, graph algorithms↗

Scalable Techniques for Stochastic Power Flow Problems (Final Report)

The proposed research focuses on developing scalable algorithms for two-stage security-constrained OPF problems with AC power flow constraints, a class of problems complicated by (i) scale arising from a scenario representation; and (ii) the presence of nonlinearity, nonconvexity, and possibly second-stage discreteness or complementarity. Unfortunately, most existing solvers cannot contend with both challenges simultaneously; accordingly, the proposed research focuses on developing solution techniques that can both scale with the number of scenarios and contend with nonconvexity and second-stage complementarity. We consider three avenues for addressing such problems: (i) Variable sample-size SQP (VS-SQP) methods that combine sparse Quasi-Newton updates with a scalable variance-reduced stochastic gradient scheme for stochastic QP subproblems, allowing for contending with second-stage complementarity via regularization; (ii) Variable sample-size stochastic Interior-point (VS-sIP) schemes that propose a sampling-based regularized (to allow for contending with complementarity) interior-point schemes in which a Schur-complement technique is employed for decomposing the Newton direction computation step; (iii) Variable sample-size tractable ADMM (VS-tADMM) schemes combine variable sample-sizes with carefully designed techniques for resolving each of the nonconvex updates (by leveraging the QCQP structures). We intend to compare the three schemes using performance profiles in terms of solution quality, scalability, etc. and then select one scheme which will then be developed and further refined in Python for purposes of the GO competition.

42 ENGINEERING↗