Search NASA⌕ Search

SEARCH · Search NASA

Results for “faster”

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 775 records · Page 43

Buffered electropolishing parameters on niobium sheet

In this paper, studies on applying a new electrolyte to treat the surfaces of Nb sheets, which was called buffered electropolishing (BEP), were reported. Through studies of the BEP I-V characteristic and optimization of main parameters such as acid agitation, temperature, etc., much faster Nb polishing rate and smoother surface finish were achieved in comparison with those obtained from the conventional electropolishing (EP). The average polishing rate could reach around 2.5 μm/min. It was over 7 times faster than that of the traditional EP. Meanwhile, the average surface mean square root roughness was around 50 nm over an area of (200×200) μm2. This study shows BEP has a great potential to replace the traditional EP process and becomes a new generation of technology for treating Nb superconducting radio frequency cavities.

36 MATERIALS SCIENCE↗

Time evolution of the luminosity of colliding heavy-ion beams in BNL Relativistic Heavy Ion Collider and CERN Large Hadron Collider

We have studied the time evolution of the heavy ion luminosity and bunch intensities in the Relativistic Heavy Ion Collider (RHIC), at BNL, and in the Large Hadron Collider (LHC), at CERN. First, we present measurements from a large number of RHIC stores (from Run 7), colliding 100 GeV/nucleon {sup 197}Au{sup 79}+ beams without stochastic cooling. These are compared with two different calculation methods. The first is a simulation based on multi-particle tracking taking into account collisions, intrabeam scattering, radiation damping, and synchrotron and betatron motion. In the second, faster, method, a system of ordinary differential equations with terms describing the corresponding effects on emittances and bunch populations is solved numerically. Results of the tracking method agree very well with the RHIC data. With the faster method, significant discrepancies are found since the losses of particles diffusing out of the RF bucket due to intrabeam scattering are not modeled accurately enough. Finally, we use both methods to make predictions of the time evolution of the future {sup 208}Pb+{sup 82+} beams in the LHC at injection and collision energy. For this machine, the two methods agree well.

43 PARTICLE ACCELERATORS↗

Structural and Biochemical Characterization of Cinnamoyl-CoA Reductases

Cinnamoyl-coenzyme A reductase (CCR) catalyzes the reduction of hydroxycinnamoyl-coenzyme A (CoA) esters using NADPH to produce hydroxycinnamyl aldehyde precursors in lignin synthesis. Here, the catalytic mechanism and substrate specificity of cinnamoyl-CoA reductases from sorghum (Sorghum bicolor), a strategic plant for bioenergy production, were deduced from crystal structures, site-directed mutagenesis, and kinetic and thermodynamic analyses. Although SbCCR1 displayed higher affinity for caffeoyl-CoA or p-coumaroyl-CoA than for feruloyl-CoA, the enzyme showed significantly higher activity for the latter substrate. Through molecular docking and comparisons between the crystal structures of the Vitis vinifera dihydroflavonol reductase and SbCCR1, residues threonine-154 and tyrosine-310 were pinpointed as being involved in binding CoA-conjugated phenylpropanoids. Threonine-154 of SbCCR1 and other CCRs likely confers strong substrate specificity for feruloyl-CoA over other cinnamoyl-CoA thioesters, and the T154Y mutation in SbCCR1 led to broader substrate specificity and faster turnover. Through data mining using our structural and biochemical information, four additional putative CCR genes were discovered from sorghum genomic data. One of these, SbCCR2, displayed greater activity toward p-coumaroyl-CoA than did SbCCR1, which could imply a role in the synthesis of defense-related lignin. Taken together, these findings provide knowledge about critical residues and substrate preference among CCRs and provide, to our knowledge, the first three-dimensional structure information for a CCR from a monocot species.

Sattler, Steven A.↗

Hitting the target: fragment screening with acoustic in situ co-crystallization of proteins plus fragment libraries on pin-mounted data-collection micromeshes

A method is presented for screening fragment libraries using acoustic droplet ejection to co-crystallize proteins and chemicals directly on micromeshes with as little as 2.5 nl of each component. This method was used to identify previously unreported fragments that bind to lysozyme, thermolysin, and trypsin. Acoustic droplet ejection (ADE) is a powerful technology that supports crystallographic applications such as growing, improving and manipulating protein crystals. A fragment-screening strategy is described that uses ADE to co-crystallize proteins with fragment libraries directly on MiTeGen MicroMeshes. Co-crystallization trials can be prepared rapidly and economically. The high speed of specimen preparation and the low consumption of fragment and protein allow the use of individual rather than pooled fragments. The Echo 550 liquid-handling instrument (Labcyte Inc., Sunnyvale, California, USA) generates droplets with accurate trajectories, which allows multiple co-crystallization experiments to be discretely positioned on a single data-collection micromesh. This accuracy also allows all components to be transferred through small apertures. Consequently, the crystallization tray is in equilibrium with the reservoir before, during and after the transfer of protein, precipitant and fragment to the micromesh on which crystallization will occur. This strict control of the specimen environment means that the crystallography experiments remain identical as the working volumes are decreased from the few microlitres level to the few nanolitres level. Using this system, lysozyme, thermolysin, trypsin and stachydrine demethylase crystals were co-crystallized with a small 33-compound mini-library to search for fragment hits. This technology pushes towards a much faster, more automated and more flexible strategy for structure-based drug discovery using as little as 2.5 nl of each major component.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

tomoCAM : fast model-based iterative reconstruction via GPU acceleration and non-uniform fast Fourier transforms

X-ray-based computed tomography is a well established technique for determining the three-dimensional structure of an object from its two-dimensional projections. In the past few decades, there have been significant advancements in the brightness and detector technology of tomography instruments at synchrotron sources. These advancements have led to the emergence of new observations and discoveries, with improved capabilities such as faster frame rates, larger fields of view, higher resolution and higher dimensionality. These advancements have enabled the material science community to expand the scope of tomographic measurements towards increasingly in situ and in operando measurements. In these new experiments, samples can be rapidly evolving, have complex geometries and restrictions on the field of view, limiting the number of projections that can be collected. In such cases, standard filtered back-projection often results in poor quality reconstructions. Iterative reconstruction algorithms, such as model-based iterative reconstructions (MBIR), have demonstrated considerable success in producing high-quality reconstructions under such restrictions, but typically require high-performance computing resources with hundreds of compute nodes to solve the problem in a reasonable time. Here, tomoCAM , is introduced, a new GPU-accelerated implementation of model-based iterative reconstruction that leverages non-uniform fast Fourier transforms to efficiently compute Radon and back-projection operators and asynchronous memory transfers to maximize the throughput to the GPU memory. The resulting code is significantly faster than traditional MBIR codes and delivers the reconstructive improvement offered by MBIR with affordable computing time and resources. tomoCAM has a Python front-end, allowing access from Jupyter -based frameworks, providing straightforward integration into existing workflows at synchrotron facilities.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Exascale Deep Learning to Accelerate Cancer Research

Deep learning, through the use of neural networks, has demonstrated remarkable ability to automate many routine tasks when presented with sufficient data for training. The neural network architecture (e.g. number of layers, types of layers, connections between layers, etc.) plays a critical role in determining what, if anything, the neural network is able to learn from the training data. The trend for neural network architectures, especially those trained on ImageNet, has been to grow ever deeper and more complex. The result has been ever increasing accuracy on benchmark datasets with the cost of increased computational demands. In this paper we demonstrate that neural network architectures can be automatically generated, tailored for a specific application, with dual objectives: accuracy of prediction and speed of prediction. Using MENNDL- an HPC-enabled software stack for neural architecture search-we generate a neural network with comparable accuracy to state-of-the-art networks on a cancer pathology dataset that is also 16× faster at inference. The speedup in inference is necessary because of the volume and velocity of cancer pathology data; specifically, the previous state-of-the-art networks are too slow for individual researchers without access to HPC systems to keep pace with the rate of data generation. Our new model enables researchers with modest computational resources to analyze newly generated data faster than it is collected.

Patton, Robert↗

Exploring the Landscape of Distributed Graph Clustering on Leadership Supercomputers

The rapid growth of large-scale datasets in fields like biology and social networks has driven the need for advanced graph analytics techniques. Community detection, a fundamental task in graph analytics, identifies closely connected groups of nodes within a network, providing valuable insights across various disciplines. This study focuses on two classic community detection methods, the Louvain algorithm and Markov Clustering (MCL), and evaluates the performance of two prominent distributed community detection algorithms: HiPDPL-GPU, our prior implementation, and HipMCL. We conduct experiments on GPU-accelerated heterogeneous HPC systems, Summit and Frontier, to assess their performance under varying conditions. Our objective is to identify the strengths and weaknesses of these algorithms in terms of scalability, and quality of solutions. We evaluate these algorithms on a diverse set of 70+ networks spanning 13 domains, with sizes ranging up to 4.2 billion edges. Our results demonstrate that HiPDPL-GPU consistently outperforms HipMCL, especially for large-scale networks. HiPDPL-GPU achieves significantly faster runtimes (47x to 1439x), higher modularity scores, and improved scalability. These findings highlight HiPDPL-GPU as a promising solution for efficient and effective large-scale graph analytics in diverse application domains, and provide insights into the feasibility of using MCL-based approaches for certain application domains.

Community detection, graph algorithms↗

Accelerating Scientific Workflows on HPC Platforms with In Situ Processing

Scientific workflows drive most modern large-scale science breakthroughs by allowing scientists to define their computations as a set of jobs executed in a given order based on their data dependencies. Workflow management systems (WMSs) have become key to automating scientific workflows-executing computational jobs and orchestrating data transfers between those jobs running on complex high-performance computing (HPC) platforms. Traditionally, WMSs use files to communicate between jobs: a job writes out files that are read by other jobs. However, HPC machines face a growing gap between their storage and compute capabilities. To address that concern, the scientific community has adopted a new approach called in situ, which bypasses costly parallel filesystem I/O operations with faster in-memory or in-network communications. When using in situ approaches, communication and computations can be interleaved. In this work, we leverage the Decaf in situ dataflow framework to accelerate task-based scientific workflows managed by the Pegasus WMS, by replacing file communications with faster MPI messaging. We propose a new execution engine that uses Decaf to manage communications within a sub-workflow (i.e., set of jobs) to optimize inter-job communications. We consider two workflows in this study: (i) a synthetic workflow that benchmarks and compares file- and MPI-based communication; and (ii) a realistic bioinformatics workflow that computes mu-tational overlaps in the human genome. Experiments show that in situ communication can improve the bioinformatics workflow execution time by 22% to 30% compared with file communication. Our results motivate further opportunities and challenges for bridging traditional WMSs with in situ frameworks.

Decaf↗

Graph Laplacian Spectrum and Primary Frequency Regulation: Preprint

We present a framework based on spectral graph theory that captures the interplay among network topology, system inertia, and generator and load damping in determining overall power grid behavior and performance. Specifically, we show that the impact of network topology on a power system can be quantified through the network Laplacian eigenvalues, and such eigenvalues determine the grid robustness against low frequency disturbances. Moreover, we can explicitly decompose the frequency signal along scaled Laplacian eigenvectors when damping-intertia ratios are uniform across buses. The insight revealed by this framework suggests why load-side participation in frequency regulation not only makes the system respond faster, but also helps lower the system nadir after disturbance. Finally, by presenting a new controller specifically tailored to suppress high frequency disturbances, we demonstrate that our results can provide useful guidelines in the controller design for load-side primary frequency regulation. We simulate the improved controller on the IEEE 39-bus New England interconnection system to illustrate its robustness against high frequency oscillation compared to both the conventional droop control and a recent controller design.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Stability Quantification for Consensus-Based Power Flow Control between Transmission and Distribution Power Systems

With increasing integration of distributed energy resources (DERs), distribution systems (DS) with DERs are expected to provide proactive grid services. The result is that power references, or known as dispatch signals, required for DS can become faster changing than in legacy power system. Consensus-based integral controls have been proposed for the purpose of coordinating power generations of DERs in DS to match the power references. These existing controls assume the integral control signal to be sufficiently slow or constant, and ignore the potential dynamics of the integral controller when tracking more varying power references. Therefore, in this paper we present an improvement for such controls by deriving the stability condition utilizing generalized Nyquist criterion. The stability condition is quantified by a set of integral gains that guarantee stability in closed-loop system without assuming a constant integral signal. A rule-of-thumb criterion is also derived to instruct the design of the consensus topology that can provide faster convergence rate for the closed-loop system. Here, the stability and convergence improvements developed in this paper are demonstrated and verified through numerical examples.

42 ENGINEERING↗

Integration experiences and performance studies of A COTS parallel archive systems

Current and future Archive Storage Systems have been asked to (a) scale to very high bandwidths, (b) scale in metadata performance, (c) support policy-based hierarchical storage management capability, (d) scale in supporting changing needs of very large data sets, (e) support standard interface, and (f) utilize commercial-off-the-shelf(COTS) hardware. Parallel file systems have been asked to do the same thing but at one or more orders of magnitude faster in performance. Archive systems continue to move closer to file systems in their design due to the need for speed and bandwidth, especially metadata searching speeds such as more caching and less robust semantics. Currently the number of extreme highly scalable parallel archive solutions is very small especially those that will move a single large striped parallel disk file onto many tapes in parallel. We believe that a hybrid storage approach of using COTS components and innovative software technology can bring new capabilities into a production environment for the HPC community much faster than the approach of creating and maintaining a complete end-to-end unique parallel archive software solution. In this paper, we relay our experience of integrating a global parallel file system and a standard backup/archive product with a very small amount of additional code to provide a scalable, parallel archive. Our solution has a high degree of overlap with current parallel archive products including (a) doing parallel movement to/from tape for a single large parallel file, (b) hierarchical storage management, (c) ILM features, (d) high volume (non-single parallel file) archives for backup/archive/content management, and (e) leveraging all free file movement tools in Linux such as copy, move, ls, tar, etc. We have successfully applied our working COTS Parallel Archive System to the current world's first petaflop/s computing system, LANL's Roadrunner, and demonstrated its capability to address requirements of future archival storage systems.

99 GENERAL AND MISCELLANEOUS↗

Comparison of Virtual Oscillator and Droop Control: Preprint

Virtual oscillator control and droop control are two techniques that can be used to ensure synchronization and power sharing of parallel inverters in islanded operation. VOC relies on the implementation of non-linear Van der Pol oscillator equations in the control system of the inverter, acting upon the time-domain instantaneous inverter current and terminal voltage. On the other hand, DC explicitly computes active and reactive power produced by the inverter and relies on limited bandwidth low-pass filters. Even though both methods can be engineered to produce the same steady-state characteristics, their dynamic performances are significantly different. This paper presents analytical and experimental results that aim to compare both methods. It is shown that VOC is inherently faster and enables minimizing the circulating currents. The results are verified using three 120V, 1kW inverters.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Automatic Regionalization Algorithm for Distributed State Estimation in Power Systems

The deregulation of the power system and the incorporation of generation from renewable energy sources recessitates faster state estimation in the smart grid. Distributed state estimation (DSE) has become a promising and scalable solution to this urgent demand. In this paper, we investigate the regionalization algorithms for the power system, a necessary step before distributed state estimation can be performed. To the best of the authors' knowledge, this is the first investigation on automatic regionalization (AR). We propose three spectral clustering based AR algorithms. Simulations show that our proposed algorithms outperform the two investigated manual regionalization cases. With the help of AR algorithms, we also show how the number of regions impacts the accuracy and convergence speed of the DSE and conclude that the number of regions needs to be chosen carefully to improve the convergence speed of DSEs.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Machine Learning-Assisted Distribution System Network Reconfiguration Problem

High penetration from volatile renewable energy resources in the grid and the varying nature of loads raise the need for frequent line switching to ensure the efficient operation of electrical distribution networks. Operators must ensure maximum load delivery, reduced losses, and the operation between voltage limits. However, computations to decide the optimal feeder configuration are often computationally expensive and intractable, making it unfavorable for real-time operations. This is mainly due to the existence of binary variables in the network reconfiguration optimization problem. To tackle this issue, we have devised an approach that leverages machine learning techniques to reshape distribution networks featuring multiple substations. This involves predicting the substation responsible for serving each part of the network. Hence, it leaves simple and more tractable Optimal Power Flow problems to be solved. This method can produce accurate results in a significantly faster time, as demonstrated using the IEEE 37-bus distribution feeder. Compared to the traditional optimization-based approaches, a feasible solution is achieved approximately ten times faster for all the tested scenarios.

deep neural networks↗

Optimizing Multi-Robot Placements for Wire Arc Additive Manufacturing

Wire arc additive manufacturing is a metal additive manufacturing process in which the material is deposited using arc welding technology. It is gaining popularity due to high material deposition rates and faster build time. It is en-abled using robotic manipulators and can build relatively large-scale parts faster when compared with other metal additive manufacturing processes. However, the size of the large-scale parts is limited by the size of the industrial manipulator being used for the process. This limitation is overcome by using a fixed configuration multi-robot cell in which manipulators work cooperatively to build large-scale parts quickly. A fixed multi-robot cell with closely spaced industrial manipulators has high flexibility, but it restricts the part size that can be built. If the manipulators are spread out, the cell loses its flexibility but can build relatively larger parts. This issue can be avoided by using larger size manipulators, which are expensive, or by moving the modest size manipulators based on the part geometries. This paper presents a novel algorithm to generate multi-robot placements for different part geometries to be built using wire arc additive manufacturing. Furthermore, the algorithm hierarchically optimizes the build time and the inverse kinematics consistency in robot paths to improve the process efficiency and part quality. We compare the results with fixed multi-robot cells and provide insights to users to make an informed decision on whether to use a fixed or a flexible multi-robot cell for wire arc additive manufacturing.

Bhatt, Prahar↗

Optimizing High Performance Markov Clustering for Pre-Exascale Architectures

HipMCL is a high-performance distributed memory implementation of the popular Markov Cluster Algorithm (MCL) and can cluster large-scale networks within hours using a few thousand CPU-equipped nodes. It relies on sparse matrix computations and heavily makes use of the sparse matrix-sparse matrix multiplication kernel (SpGEMM). The existing parallel algorithms in HipMCL are not scalable to Exascale architectures, both due to their communication costs dominating the runtime at large concurrencies and also due to their inability to take advantage of accelerators that are increasingly popular. In this work, we systematically remove scalability and performance bottlenecks of HipMCL. We enable GPUs by performing the expensive expansion phase of the MCL algorithm on GPU. Additionally, we propose a CPU-GPU joint distributed SpGEMM algorithm called pipelined Sparse SUMMA and integrate a probabilistic memory requirement estimator that is fast and accurate. Furthermore, we develop a new merging algorithm for the incremental processing of partial results produced by the GPUs, which improves the overlap efficiency and the peak memory usage. We also integrate a recent and faster algorithm for performing SpGEMM on CPUs. We validate our new algorithms and optimizations with extensive evaluations. With the enabling of the GPUs and integration of new algorithms, HipMCL is up to 12.4x faster, being able to cluster a network with 70 million proteins and 68 billion connections just under 15 minutes using 1024 nodes of ORNL's Summit supercomputer.

97 MATHEMATICS AND COMPUTING↗

Embedding spatial decomposition in parareal in time power system simulation

We propose an approach for combining two decompositions in power system simulation, temporal and spatial, with a goal to achieve faster simulation time than utilizing either one of them alone. The proposed approach builds upon the structure of the Parareal algorithm for temporal decomposition and explores an efficient way of embedding the spatial decomposition into its coarse and fine solutions. This introduces two types of simultaneous parallelism in power system simulations - parallelism between system areas and between coarse integration intervals for time integration. The results from the application of the proposed approach are shown on a two-area system comprised of the IEEE 16-machine, 68-bus, and the IEEE 50-machine, 145-bus system.

Duan, Nan↗

Advanced Sensor Deployment for Distribution System State Estimation and Fault Identification

Distribution systems are currently facing steep operational challenges as a result of the rapidly increasing integration of renewables and other distributed energy resources (DERs) at both the primary and secondary circuit levels. Distribution utilities and system operators have traditionally had some visibility of their primary circuits using low-frequency supervisory control and data acquisition systems, and they have had very poor if not zero visibility of the secondary circuits where the presence of DERs is constantly increasing. Therefore, this paper presents simulation studies to demonstrate the benefits of an advanced, high-fidelity sensor technology, called as the Meta-Alert System (MAS), developed by Electrical Grid Monitoring, Ltd. (EGM), on the distribution grid. First, a reliable model of the EGM sensors is developed, and then two use cases, distribution system state estimation (DSSE) and fault identification are simulated to evaluate the performance of the MAS technology. Simulation results on the Electric Power Research Institute J1 feeder demonstrate that the MAS can effectively participate in system-level DSSE programs and can detect and locate faults faster than traditional distribution protection schemes.

distribution system↗