Search NASA⌕ Search

SEARCH · Search NASA

Results for “accelerated 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,423 records · Page 79

A Multi-Band Uncertainty Set Based Robust SCUC With Spatial and Temporal Budget Constraints

The dramatic increase of renewable energy resources in recent years, together with the long-existing load forecast errors and increasingly involved price sensitive demands, has introduced significant uncertainties into power systems operation. In order to guarantee the operational security of power systems with such uncertainties, robust optimization has been extensively studied in security-constrained unit commitment (SCUC) problems, for immunizing the system against worst uncertainty realizations. However, traditional robust SCUC models with single-band uncertainty sets may yield over-conservative solutions in most cases. This paper proposes a multi-band robust model to accurately formulate various uncertainties with higher resolution. By properly tuning band intervals and weight coefficients of individual bands, the proposed multi-band robust model can rigorously and realistically reflect spatial/temporal relationships and asymmetric characteristics of various uncertainties, and in turn could effectively leverage the tradeoff between robustness and economics of robust SCUC solutions. The proposed multi-band robust SCUC model is solved by Benders decomposition (BD) and outer approximation (OA), while taking the advantage of integral property of the proposed multi-band uncertainty set. In addition, several accelerating techniques are developed for enhancing the computational performance and the convergence speed. Numerical studies on a 6-bus system and the modified IEEE 118-bus system verify the effectiveness of the proposed robust SCUC approach for enhancing uncertainty modeling capabilities and mitigating conservativeness of the robust SCUC solution.

24 POWER TRANSMISSION AND DISTRIBUTION↗

HiSpatialCluster: A novel high‐performance software tool for clustering massive spatial points

Abstract In the era of big data, spatial clustering is a very important means for geo‐data analysis. When clustering big geo‐data such as social media check‐in data, geotagged photos, and taxi trajectory points, traditional spatial clustering algorithms are facing more challenges. On the one hand, existing spatial clustering tools cannot support the clustering of massive point sets; on the other hand, there is no perfect solution for self‐adaptive spatial clustering. In order to achieve clustering of millions or even billions of points adaptively, a new spatial clustering tool—HiSpatialCluster—was proposed, in which the CFSFDP (clustering by fast search and finding density peaks) idea to find cluster centers and the DBSCAN (density‐based spatial clustering of applications with noise) idea of density‐connect filtering for classification are introduced. The tool’s source codes and other resources have been released on Github, and experimental evaluation was performed through clustering massive taxi trajectory points and Flickr geotagged photos in Beijing, China. The spatial clustering results were compared with those through K‐means and DBSCAN as well. As a spatial clustering tool, HiSpatialCluster is expected to play a fundamental role in big geo‐data research. First, this tool enables clustering adaptively on massive point datasets with uneven spatial density distribution. Second, the density‐connect filter method is applied to generate homogeneous analysis units from geotagged data. Third, the tool is accelerated by both parallel CPU and GPU computing so that millions or even billions of points can be clustered efficiently.

Chen, Yiran↗

SU-E-T-377: Evaluation of a Novel Transmission Detector as a Reference Chamber for Use in Beam Measurements

Purpose: To evaluate a new transmission chamber for use as a reference chamber in measurements of beam data Methods: We assessed the performance of a new transmission detector, the Stealth Chamber, manufactured by IBA (IBA Dosimetry). The chamber has an active volume of 249 cm{sup 3}, with an attenuation equivalent of <0.5mm Al. We mounted the chamber to a TrueBeam linac (Varian Medical Systems, Palo Alto, CA) such that the active area is perpendicular to the beam direction. We performed PDD and profile measurements on field sizes from 1×1 cm{sup 2} to 10×10 cm{sup 2}, as well as for a 4 mm cone. The field detector was either a CC-13 chamber (IBA Dosimetry) with an active volume of 0.13 cm{sup 3} or an Edge Detector (Sun Nuclear, Melbourne, FL) with an active volume of 0.019 cm{sup 3}. For comparison we repeated all measurements using a CC-13 or CC-01 (active volume 0.01 cm{sup 3} ) chamber as reference detectors (IBA Dosimetry).All scans were acquired using a Blue Phantom2 (IBA Dosimetry) and IBA OmniPro-Accept v7.4.24 software. Results: All measurements with the Stealth Chamber were identical to those with ion reference chambers. For both regular and filter free 6MV beams there was agreement in PDDs and profiles, including the penumbra region, for all field sizes. This was true for the 4mm cone measurement, as well. The deviation between the Stealth and ion chamber measurements was on average 0.3%. Conclusion: The Stealth Chamber gives identical beam data as a conventional ion chamber for all field sizes. The advantage of the Stealth chamber over ion chambers is its efficiency. Once mounted, there is no need to reposition the chamber with varying field sizes. This translates into a huge savings in measurement time, as well as a reduction in potential errors due to reference chamber mispositioning.

43 PARTICLE ACCELERATORS↗

Enabling the High Level Synthesis of Data Analytics Accelerators

Conventional High Level Synthesis (HLS) tools mainly tar- get compute intensive kernels typical of digital signal pro- cessing applications. We are developing techniques and ar- chitectural templates to enable HLS of data analytics appli- cations. These applications are memory intensive, present fine-grained, unpredictable data accesses, and irregular, dy- namic task parallelism. We discuss an architectural tem- plate based around a distributed controller to efficiently ex- ploit thread level parallelism. We present a memory in- terface that supports parallel memory subsystems and en- ables implementing atomic memory operations. We intro- duce a dynamic task scheduling approach to efficiently ex- ecute heavily unbalanced workload. The templates are val- idated by synthesizing queries from the Lehigh University Benchmark (LUBM), a well know SPARQL benchmark.

Data Analytics↗

Toward Evaluating High-Level Synthesis Portability and Performance between Intel and Xilinx FPGAs

Offloading computation from a CPU to a hardware accelerator is becoming a more common solution for improving performance because traditional gains enabled by Moore’s law and Dennard scaling have slowed. GPUs are often used as hardware accelerators, but field-programmable gate arrays (FPGAs) are gaining traction. FPGAs are beneficial because they allow hardware specific to a particular application to be created. However, they are notoriously difficult to program. To this end, two of the main FPGA manufacturers, Intel and Xilinx, have created tools and frameworks that enable the use of higher level languages to design FPGA hardware. Although Xilinx kernels can be designed by using C/C++, both Intel and Xilinx support the use of OpenCL C to architect FPGA hardware. However, not much is known about the portability and performance between these two device families other than the fact that it is theoretically possible to synthesize a kernel meant for Intel to Xilinx and vice versa.In this work, we evaluate the portability and performance of Intel and Xilinx kernels. We use OpenCL C implementations of a subset of the Rodinia benchmarking suite that were designed for an Intel FPGA and make the necessary modifications to create synthesizable OpenCL C kernels for a Xilinx FPGA. We find that the difficulty of porting certain kernel optimizations varies, depending on the construct. Once the minimum amount of modifications is made to create synthesizable hardware for the Xilinx platform, more nontrivial work is needed to improve performance. However, we find that constructs that are known to be performant for an FPGA should improve performance regardless of the platform; the difficulty comes in deciding how to invoke certain kernel optimizations while also abiding by the constraints enforced by a given platform’s hardware compiler.

Cabrera, Anthony↗

ArborX

ArborX library tackles a problem of efficiently finding geometric objects that are close in space. Variations of this problem, such as finding the nearest neighbors of a point, or finding all objects within a certain distance, are inherent components of applications in many fields. The data may be large so that solving the problem efficiently may require significant computational resources, such as multiple processors or accelerators such as general purpose GPUs. ArborX' main advantage in its ability to solve large problems efficiently utilizing a combination of distributed and on-node parallelism. ArborX can be run efficiently on a wide variety of hardware, including GPUs from different vendors, which distinguishes it from other available libraries which typically choose only few of these. The other advantage is that it supports both types of user problems: spatial problems (useful for intersections and finding objects within certain distance), and nearest neighbor problems. ArborX also supports flexible interface in its interaction with a user. Particularly, it allows a user to call user's own function on a positive match, a functionality not rarely available in other libraries. ArborX implements construction and traversal algorithms using efficient tree structures, such as bounding volume hierarchy (BVH). At its core, it uses linear BVH for its low construction cost and sufficient quality. ArborX is written using C++, and is parallelized using the message passing interface (MPI) for the distributed communication, and the Kokkos library for on-node parallelism. This approach allows ArborX to be run on a wide variety of hardware, from common laptops and desktops to supercomputers while using the same codebase. ArborX also implements several advanced algorithms using geometric search, such as density-based clustering algorithm DBSCAN.

ECP↗

ArborX 2.0

ArborX library tackles a problem of efficiently finding geometric objects that are close in space. Variations of this problem, such as finding the nearest neighbors of a point, or finding all objects within a certain distance, are inherent components of applications in many fields. The data may be large so that solving the problem efficiently may require significant computational resources, such as multiple processors or accelerators such as general purpose GPUs. ArborX' main advantage in its ability to solve large problems efficiently utilizing a combination of distributed and on-node parallelism. ArborX can be run efficiently on a wide variety of hardware, including GPUs from different vendors, which distinguishes it from other available libraries which typically choose only few of these. The other advantage is that it supports both types of user problems: spatial problems (useful for intersections and finding objects within certain distance), and nearest neighbor problems. ArborX also supports flexible interface in its interaction with a user. Particularly, it allows a user to call user's own function on a positive match, a functionality not rarely available in other libraries. ArborX implements construction and traversal algorithms using efficient tree structures, such as bounding volume hierarchy (BVH). At its core, ArborX uses linear BVH for its low construction cost and sufficient quality. ArborX implements both spatial and nearest-neighbor traversal algorithms. ArborX also provides several clustering algorithms (minimum spanning tree, DBSCAN, HDBSCAN*), interpolation using minimum least squares and ray tracing. ArborX is written using C++, and is parallelized using the message passing interface (MPI) for the distributed communication, and the Kokkos library for on-node parallelism. This approach allows ArborX to be run on a wide variety of hardware, from common laptops and desktops to supercomputers while using the same codebase.

Prokopenko, Andrey [Oak Ridge National Laboratory ↗

Active Learning Framework

Machine learning (ML) of interatomic potentials show great promise to accelerate scientific simulation, e.g., by emulating expensive computations at a high accuracy but much reduced computational cost. Training datasets are calculated from computationally expensive ab initio quantum mechanics methods, density functional theory (DFT). Trained on this data, an ML model can be very successful in predicting energy and forces for new atomic configurations. A critical factor is the quality and diversity of the training dataset. Thus, a highly automated approach to dataset construction based on active learning framework is designed suitable for material physics. The active learning scheme begins with fully randomized atomic configurations. Then, many Molecular Dynamics (MD) trajectories are simulated using current ML potentials, where each MD trajectory is initialized to a random disordered configuration. The temperature is varied in order to diversify the sampled configuration during these simulations. The variance of predictions for eight neural networks within an ensemble is analyzed to determine whether the model is operating as expected. This helps in determining whether collecting more data would be helpful to the model by checking the ensemble variance is greater than the threshold. In this case, the MD trajectory is terminated and the final atomic configuration is placed on a queue (SQL database) for DFT calculations and added to training dataset. Periodically, ML model is retrained to the updated training model. This Active Learning loop is iterated until the cost of MD simulations becomes prohibitively expensive. The MD simulations will hopefully be sufficiently robust to support nucleation after many active learning iterations. In this sense, active learning scheme must automatically discover the important low energy and nonequilibrium physics.

Nebgen, Benjamin↗

Theoretical and Computational Modeling of a Plasma Wakefield BBU Instability

Plasma wakefield accelerators achieve accelerating gradients on the order of the wave-breaking limit, m c² k_{p}/e, so that higher accelerating gradients correspond to shorter plasma wavelengths. Small-scale accelerating structures, such as plasma and dielectric wakefields, are susceptible to the beam break-up instability (BBU), which can be understood from the Panofsky-Wenzel theorem: if the fundamental accelerating mode scales as b⁻¹ for a structure radius b, then the dipole mode must scale as b⁻³, meaning that high accelerating gradients necessarily come with strong dipole wake fields. Because of this relationship, any plasma-accelerator-based future collider will require detailed study of the trade-offs between extracting the maximum energy from the driver and mitigating the beam break-up instability. Recent theoretical work* predicts the tradeoff between the witness bunch stability and the amount of energy that can be extracted from the drive bunch, a so-called efficiency-instability relation . We will discuss the beam break-up instability and the efficiency-instability relation and the theoretical assumptions made in reaching this conclusion. We will also present preliminary particle-in-cell simulations of a beam-driven plasma wakefield accelerator used to test the domain of validity for the assumptions made in this model.

43 PARTICLE ACCELERATORS↗

Searching for Strongly Coupled Dark Sectors with Unsupervised and Generative Learning

Recipient of the URA Early Career Award for groundbreaking searches for dark matter arising from strongly coupled dark sectors with the CMS detector, pioneering work in ML-based model-independent anomaly detection for collider and astrophysics experiments, and leadership in the development of new AI/ML techniques to improve event reconstruction and detector simulation in particle physics, as well as novel strategies to accelerate AI inference and throughput with heterogeneous computing using coprocessors as a service.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Reduction of Simulation Times for High-Q Structures using the Resonance Equation

Simulating steady state performance of high quality factor (Q) resonant RF structures is computationally difficult for structures with sizes on the order of more than a few wavelengths because of the long times (on the order of ~ 0.1 ms) required to achieve steady state in comparison with maximum time step that can be used in the simulation (typically, on the order of ~ 1 ps). This paper presents analytical and computational approaches that can be used to accelerate the simulation of the steady state performance of such structures. The basis of the proposed approach is the utilization of a larger amplitude signal at the beginning to achieve steady state earlier relative to the nominal input signal. Finally, the methodology for finding the necessary input signal is then discussed in detail, and the validity of the approach is evaluated.

43 PARTICLE ACCELERATORS↗

Stressing the importance of plant specialized metabolites: omics-based approaches for discovering specialized metabolism in plant stress responses

Plants produce a diverse range of specialized metabolites that play pivotal roles in mediating environmental interactions and stress adaptation. These unique chemical compounds also hold significant agricultural, medicinal, and industrial values. Despite the expanding knowledge of their functions in plant stress interactions, understanding the intricate biosynthetic pathways of these natural products remains challenging due to gene and pathway redundancy, multifunctionality of proteins, and the activity of enzymes with broad substrate specificity. In the past decade, substantial progress in genomics, transcriptomics, metabolomics, and proteomics has made the exploration of plant specialized metabolism more feasible than ever before. Notably, recent advances in integrative multi-omics and computational approaches, along with other technologies, are accelerating the discovery of plant specialized metabolism. In this review, we present a summary of the recent progress in the discovery of plant stress-related specialized metabolites. Emphasis is placed on the application of advanced omics-based approaches and other techniques in studying plant stress-related specialized metabolism. Additionally, we discuss the high-throughput methods for gene functional characterization. These advances hold great promise for harnessing the potential of specialized metabolites to enhance plant stress resilience in the future.

59 BASIC BIOLOGICAL SCIENCES↗

deeprob/ThioesteraseEnzymeSpecificity: EnZymClass-first-release

Characterizing the functional properties of plant acyl-ACP thioesterases (TEs), a key enzyme class used in the production of renewable oleochemicals in microbial hosts, experimentally, can be an expensive and time consuming process since it requires manual screening of thousands of candidates in a database. Using amino acid sequence to computationally predict an enzyme’s function might accelerate this process; however obtaining the necessary amount of information on previously characterized enzymes and their respective sequences required by standard Machine Learning (ML) based approaches to accurately infer sequence-function relationships can be prohibitive, especially with a low-throughput testing cycle. Experimental noise, unbalanced dataset where high sequence similarity does not always imply identical functional properties will further prevent robust prediction performance. Herein we present a ML method, Ensemble method for enZyme Classification (EnZymClass), that is specifically designed to address these issues. We used EnZymClass to classify TEs into short, long and mixed free fatty acid substrate specificity categories. While general guidelines for inferring substrate specificity have been proposed before, prediction of chain-length preference from primary sequence has remained elusive for plant acyl-ACP TEs. By applying EnZymClass to a subset of TEs in the ThYme database, we identified two medium chain TEs, ClFatB3 and CwFatB2, with previously uncharacterized activity in E. coli fatty acid production hosts.

Banerjee, Deepro↗

Improving the Effectiveness of Context-based Prefetching with Multi-order Analysis

Data prefetching is an effective way to accelerate data access in high-end computing systems and to bridge the increasing performance gap between processor and memory. In recent years, the context-based data prefetching has received intensive attention because of its general applicability. In this study, we provide a preliminary analysis of the impact of orders on the effectiveness of the context-based prefetching. Motivated by the observations from the analytical results, we propose a new context-based prefetching method named Multi-Order Context-based (MOC) prefetching to adopt multi-order context analysis to increase the context-based prefetching effectiveness. We have carried out simulation testing with the SPEC-CPU2006 benchmarks via an enhanced CMP$im simulator. The simulation results show that the proposed MOC prefetching method outperforms the existing single-order prefetching and reduces the data-access latency effectively.

99 GENERAL AND MISCELLANEOUS↗

Higher-Order Corrections to Optimisers based on Newton's Method

The Newton, Gauss–Newton and Levenberg–Marquardt methods all use the first derivative of a vector function (the Jacobian) to minimise its sum of squares. When the Jacobian matrix is ill-conditioned, the function varies much faster in some directions than others and the space of possible improvement in sum of squares becomes a long narrow ellipsoid in the linear model. This means that even a small amount of nonlinearity in the problem parameters can cause a proposed point far down the long axis of the ellipsoid to fall outside of the actual curved valley of improved values, even though it is quite nearby. This paper presents a differential equation that ‘follows’ these valleys, based on the technique of geodesic acceleration, which itself provides a 2 nd order improvement to the Levenberg–Marquardt iteration step. Higher derivatives of this equation are computed that allow n th order improvements to the optimisation methods to be derived. These higher-order accelerated methods up to 4 th order are tested numerically and shown to provide substantial reduction of both number of steps and computation time.

43 PARTICLE ACCELERATORS↗

Anderson Acceleration for Fixed-Point Iterations

The purpose of this grant was to support research on acceleration methods for fixed-point iterations, with applications to computational frameworks and simulation problems that are of interest to DOE.

43 PARTICLE ACCELERATORS↗

Kirchhoff's Integral Representation and a Cavity Wake Potential

A method is proposed for the calculation of the short-range wake field potentials of an ultra-relativistic bunch passing near some irregularities in a beam pipe. The method is based on the space-time domain integration of Maxwell's equations using Kirchhoff's formulation. We demonstrate this method on two cases where we obtain the wake potentials for the energy loss of a bunch traversing an iris-collimator in a beam pipe and for a cavity. Likewise, formulas are derived for Green's functions that describe the transverse force action of wake fields. Simple formulas for the total energy loss of a bunch with a Gaussian charge density distribution are derived as well. The derived estimates are compared with computer results and predictions of other models.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The effect of small field output factor measurements on IMRT dosimetry

Purpose: To evaluate how changes in the measured small field output factors affect the doses in intensity-modulated treatment planning. Methods: IMRT plans were created using Philips Pinnacle treatment planning system. The plans were optimized to treat a cylindrical target 2 cm in diameter and 2 cm in length. Output factors for 2 Multiplication-Sign 2 and 3 Multiplication-Sign 3 cm{sup 2} field sizes were changed by {+-}5%, {+-}10%, and {+-}20% increments from the baseline measurements and entered into the planning system. The treatment units were recommissioned in the treatment planning system after each modification of the output factors and treatment plans were reoptimized. All plans were delivered to a solid water phantom and dose measurements were made using an ionization chamber. The percentage differences between measured and computed doses were calculated. An Elekta Synergy and a Varian 2300CD linear accelerator were separately evaluated. Results: For the Elekta unit, decreasing the output factors resulted in higher measured than computed doses by 0.8% for -5%, 3.6% for -10%, and 8.7% for -20% steps. Increasing the output factors resulted in lower doses by 2.9% for +5%, 5.4% for +10%, and 8.3% for +20% steps. For the Varian unit no changes were observed for either increased or decreased output factors. Conclusions: The measurement accuracy of small field output factors are of importance especially when the treatment plan consists of small segments as in IMRT. The method proposed here could be used to verify the accuracy of the measured small field output factors for certain linear accelerators as well as to test the beam model. The Pinnacle treatment planning system model uses output factors as a function of jaw setting. Consequently, plans using the Elekta unit, which conforms the jaws to the segments, are sensitive to small field measurement accuracy. On the other hand, for the Varian unit, jaws are fixed and segments are modeled as blocked fields hence, the impact of small field output factors on IMRT monitor unit calculation is not evaluable by this method.

61 RADIATION PROTECTION AND DOSIMETRY↗