Search NASA⌕ Search

SEARCH · Search NASA

Results for “distributed parallelization”

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,531 records · Page 85

Performance Evaluation of Counter-Based Dynamic Load Balancing Schemes for Massive Contingency Analysis with Different Computing Environments

Contingency analysis is a key function in the Energy Management System (EMS) to assess the impact of various combinations of power system component failures based on state estimation. Contingency analysis is also extensively used in power market operation for feasibility test of market solutions. High performance computing holds the promise of faster analysis of more contingency cases for the purpose of safe and reliable operation of today’s power grids with less operating margin and more intermittent renewable energy sources. This paper evaluates the performance of counter-based dynamic load balancing schemes for massive contingency analysis under different computing environments. Insights from the performance evaluation can be used as guidance for users to select suitable schemes in the application of massive contingency analysis. Case studies, as well as MATLAB simulations, of massive contingency cases using the Western Electricity Coordinating Council power grid model are presented to illustrate the application of high performance computing with counter-based dynamic load balancing schemes.

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↗

Machine Learning for Distributed Acoustic Sensing data (MLDAS) v1.0.1

MLDAS is a Python-written package for exploratory data analysis and deep learning training on Distributed Acoustic Sensing data. The machine learning tools are powered by the PyTorch library and designed to work efficiently on large scale datasets using parallel computing. Various SLURM scripts as well as a tutorial have also been made available to allow geophysicists to quickly and easily implement the available tools in their analysis workflow on supercomputer facilities.

Dumont, Vincent↗

Overcoming the losses of a split ring resonator array with gain

We present a computational approach, allowing for a self-consistent treatment of a split ring resonator (SRR) array with a gain layer underneath. We apply three different pumping schemes on the gain layer: (1) homogeneously pumped isotropic gain, (2) homogeneously pumped isotropic gain with a shadow cast by the SRR and (3) anisotropic gain pumped in a selected direction only. We show numerically the magnetic losses of the SRR can be compensated by the gain. The difference on loss compensations among the three pumping schemes is analyzed by the electric field distribution. Studies also show the dielectric background of gain does not affect the loss compensation much for the gain only pumped in the direction parallel to the SRR plane.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Toward Interactive Scenario Analysis and Exploration

As Modeling and Simulation (M&S) tools have matured, their applicability and importance have increased across many national security challenges. In particular, they provide a way to test how something may behave without the need to do real world testing. However, current and future changes across several factors including capabilities, policy, and funding are driving a need for rapid response or evaluation in ways that many M&S tools cannot address. Issues around large data, computational requirements, delivery mechanisms, and analyst involvement already exist and pose significant challenges. Furthermore, rising expectations, rising input complexity, and increasing depth of analysis will only increase the difficulty of these challenges. In this study we examine whether innovations in M&S software coupled with advances in ''cloud'' computing and ''big-data'' methodologies can overcome many of these challenges. In particular, we propose a simple, horizontally-scalable distributed computing environment that could provide the foundation (i.e. ''cloud'') for next-generation M&S-based applications based on the notion of ''parallel multi-simulation''. In our context, the goal of parallel multi- simulation is to consider as many simultaneous paths of execution as possible. Therefore, with sufficient resources, the complexity is dominated by the cost of single scenario runs as opposed to the number of runs required. We show the feasibility of this architecture through a stable prototype implementation coupled with the Umbra Simulation Framework [6]. Finally, we highlight the utility through multiple novel analysis tools and by showing the performance improvement compared to existing tools.

97 MATHEMATICS AND COMPUTING↗

SBIR Phase I Final Report, TACO: Distributed and Heterogeneous Sparse Compiler

Tensor algebra is a powerful tool for computing, but writing optimized codes that operate on sparse tensors can be very complex. This project enables a Tensor Algebra Compiler (TACO) that simplifies this task from man-years to man-days and extends TACO to support complex and large distributed systems. This report details the hypotheses, approaches used, and findings in this project.

97 MATHEMATICS AND COMPUTING↗

Decomposition of Large Scale Semantic Graphsvia an Efficient Communities Algorithm

Semantic graphs have become key components in analyzing complex systems such as the Internet, or biological and social networks. These types of graphs generally consist of sparsely connected clusters or 'communities' whose nodes are more densely connected to each other than to other nodes in the graph. The identification of these communities is invaluable in facilitating the visualization, understanding, and analysis of large graphs by producing subgraphs of related data whose interrelationships can be readily characterized. Unfortunately, the ability of LLNL to effectively analyze the terabytes of multisource data at its disposal has remained elusive, since existing decomposition algorithms become computationally prohibitive for graphs of this size. We have addressed this limitation by developing more efficient algorithms for discerning community structure that can effectively process massive graphs. Current algorithms for detecting community structure, such as the high quality algorithm developed by Girvan and Newman [1], are only capable of processing relatively small graphs. The cubic complexity of Girvan and Newman, for example, makes it impractical for graphs with more than approximately 10{sup 4} nodes. Our goal for this project was to develop methodologies and corresponding algorithms capable of effectively processing graphs with up to 10{sup 9} nodes. From a practical standpoint, we expect the developed scalable algorithms to help resolve a variety of operational issues associated with the productive use of semantic graphs at LLNL. During FY07, we completed a graph clustering implementation that leverages a dynamic graph transformation to more efficiently decompose large graphs. In essence, our approach dynamically transforms the graph (or subgraphs) into a tree structure consisting of biconnected components interconnected by bridge links. This isomorphism allows us to compute edge betweenness, the chief source of inefficiency in Girvan and Newman's decomposition algorithm, much more efficiently, leading to significantly reduced computation time. Test runs on a desktop computer have shown reductions of up to 89%. Our focus this year has been on the implementation of parallel graph clustering on one of LLNL's supercomputers. In order to achieve efficiency in parallel computing, we have exploited the fact that large semantic graphs tend to be sparse, comprising loosely connected dense node clusters. When implemented on distributed memory computers, our approach performed well on several large graphs with up to one billion nodes, as shown in Table 2. The rightmost column of Table 2 contains the associated Newman's modularity [1], a metric that is widely used to assess the quality of community structure. Existing algorithms produce results that merely approximate the optimal solution, i.e., maximum modularity. We have developed a verification tool for decomposition algorithms, based upon a novel integer linear programming (ILP) approach, that computes an exact solution. We have used this ILP methodology to find the maximum modularity and corresponding optimal community structure for several well-studied graphs in the literature (e.g., Figure 1) [3]. The above approaches assume that modularity is the best measure of quality for community structure. In an effort to enhance this quality metric, we have also generalized Newman's modularity based upon an insightful random walk interpretation that allows us to vary the scope of the metric. Generalized modularity has enabled us to develop new, more flexible versions of our algorithms. In developing these methodologies, we have made several contributions to both graph theoretic algorithms and software engineering. We have written two research papers for refereed publication [3-4] and are working on another one [5]. In addition, we have presented our research findings at three academic and professional conferences.

99 GENERAL AND MISCELLANEOUS↗

ARM-IRL: Adaptive Resilience Metric Quantification Using Inverse Reinforcement Learning

The resilience of safety-critical systems is gaining importance due to the rise in cyber and physical threats, especially within critical infrastructure. Traditional static resilience metrics may not capture dynamic system states, leading to inaccurate assessments and ineffective responses to cyber threats. This work aims to develop a data-driven, adaptive method for resilience metric learning. We propose a data-driven approach using inverse reinforcement learning (IRL) to learn a single, adaptive resilience metric. The method infers a reward function from expert control actions. Unlike previous approaches using static weights or fuzzy logic, this work applies adversarial inverse reinforcement learning (AIRL), training a generator and discriminator in parallel to learn the reward structure and derive an optimal policy. The proposed approach is evaluated on multiple scenarios: optimal communication network rerouting, power distribution network reconfiguration, and cyber–physical restoration of critical loads using the IEEE 123-bus system. The adaptive, learned resilience metric enables faster critical load restoration in comparison to conventional RL approaches.

97 MATHEMATICS AND COMPUTING↗

Asymptotic Behavior of Memristive Circuits

The interest in memristors has risen due to their possible application both as memory units and as computational devices in combination with CMOS. This is in part due to their nonlinear dynamics, and a strong dependence on the circuit topology. We provide evidence that also purely memristive circuits can be employed for computational purposes. In the present paper we show that a polynomial Lyapunov function in the memory parameters exists for the case of DC controlled memristors. Such a Lyapunov function can be asymptotically approximated with binary variables, and mapped to quadratic combinatorial optimization problems. This also shows a direct parallel between memristive circuits and the Hopfield-Little model. In the case of Erdos-Renyi random circuits, we show numerically that the distribution of the matrix elements of the projectors can be roughly approximated with a Gaussian distribution, and that it scales with the inverse square root of the number of elements. This provides an approximated but direct connection with the physics of disordered system and, in particular, of mean field spin glasses. Using this and the fact that the interaction is controlled by a projector operator on the loop space of the circuit. We estimate the number of stationary points of the approximate Lyapunov function and provide a scaling formula as an upper bound in terms of the circuit topology only.

97 MATHEMATICS AND COMPUTING↗

Plasma Dynamics and Nonthermal Particle Acceleration in 3D Nonrelativistic Magnetic Reconnection

Understanding plasma dynamics and nonthermal particle acceleration in 3D magnetic reconnection has been a long-standing challenge. In this paper, we explore these problems by performing large-scale fully kinetic simulations of multi-X-line plasmoid reconnection with various parameters in both the weak- and strong-guide-field regimes. In each regime, we have identified its unique 3D dynamics that lead to field-line chaos and efficient acceleration, and we have achieved nonthermal acceleration of both electrons and protons into power-law spectra. The spectral indices agree well with a simple Fermi acceleration theory that includes guide-field dependence. In the low-guide-field regime, the flux rope kink instability governs the 3D dynamics for efficient acceleration. The weak dependence of the spectra on the ion-to-electron mass ratio and β ($\ll$1) implies that the particles are sufficiently magnetized for Fermi acceleration in our simulations. While both electrons and protons are injected at reconnection exhausts, protons are primarily injected by perpendicular electric fields through Fermi reflections and electrons are injected by a combination of perpendicular and parallel electric fields. The magnetic power spectra agree with in situ magnetotail observations, and the spectral index may reflect a reconnection-driven size distribution of plasmoids instead of the Goldreich–Sridhar vortex cascade. As the guide field becomes stronger, the oblique flux ropes of large sizes capture the main 3D dynamics for efficient acceleration. Intriguingly, the oblique flux ropes can also experience flux rope kink instability, to drive extra 3D dynamics. This work has broad implications for 3D reconnection dynamics and particle acceleration in heliophysics and astrophysics.

79 ASTRONOMY AND ASTROPHYSICS↗

Application of the INSTANT-HPS PN Transport Code to the C5G7 Benchmark Problem

INSTANT is the INL's next generation neutron transport solver to support high-fidelity multi-physics reactor simulation INSTANT is in continuous development to extend its capability Code is designed to take full advantage of middle to large cluster (10-1000 processors) Code is designed to focus on method adaptation while also mesh adaptation will be possible. It utilizes the most modern computing techniques to generate a neutronics tool of full-core transport calculations for reactor analysis and design. It can perform calculations on unstructured 2D/3D triangular, hexagonal and Cartesian geometries. Calculations can be easily extended to more geometries because of the independent mesh framework coded with the model Fortran. This code has a multigroup solver with thermal rebalance and Chebyshev acceleration. It employs second-order PN and Hybrid Finite Element method (PNHFEM) discretization scheme. Three different in-group solvers - preconditioned Conjugate Gradient (CG) method, preconditioned Generalized Minimal Residual Method (GMRES) and Red-Black iteration - have been implemented and parallelized with the spatial domain decomposition in the code. The input is managed with extensible markup language (XML) format. 3D variables including the flux distributions are outputted into VTK files, which can be visualized by tools such as VisIt and ParaView. An extension of the code named INSTANTHPS provides the capability to perform 3D heterogeneous transport calculations within fuel pins. C5G7 is an OECD/NEA benchmark problem created to test the ability of modern deterministic transport methods and codes to treat reactor core problems without spatial homogenization. This benchmark problem had been widely analyzed with various code packages. In this transaction, results of the applying the INSTANT-HPS code to the C5G7 problem are summarized.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

A cognitive-consistency based model of population wide attitude change.

Attitudes play a significant role in determining how individuals process information and behave. In this paper we have developed a new computational model of population wide attitude change that captures the social level: how individuals interact and communicate information, and the cognitive level: how attitudes and concept interact with each other. The model captures the cognitive aspect by representing each individuals as a parallel constraint satisfaction network. The dynamics of this model are explored through a simple attitude change experiment where we vary the social network and distribution of attitudes in a population.

99 GENERAL AND MISCELLANEOUS↗

Solid state pulsed power generator

A power generator includes one or more full bridge inverter modules coupled to a semiconductor opening switch (SOS) through an inductive resonant branch. Each module includes a plurality of switches that are switched in a fashion causing the one or more full bridge inverter modules to drive the semiconductor opening switch SOS through the resonant circuit to generate pulses to a load connected in parallel with the SOS.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Marginal instability threshold condition of the aperiodic ordinary mode in equal-mass plasmas

The purely growing ordinary (O) mode instability for counter-streaming bi-Maxwellian plasma particle distribution functions has recently received renewed attention due to its importance for the solar wind plasma. Here, the analytical marginal instability condition is derived for magnetized plasmas consisting of equal-mass charged particles, distributed in counter-streams with equal temperatures. The equal-mass composition assumption enormously facilitates the theoretical analysis due to the equality of the values of the electron and positron (positive and negative ion) plasma and gyrofrequencies. The existence of a new instability domain of the O-mode at small plasma beta values is confirmed, when the parallel counter-stream free energy exceeds the perpendicular bi-Maxwellian free energy.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Dose Modeling of Noninvasive Image-Guided Breast Brachytherapy in Comparison to Electron Beam Boost and Three-Dimensional Conformal Accelerated Partial Breast Irradiation

Purpose: To perform dose modeling of a noninvasive image-guided breast brachytherapy (NIIGBB) for comparison to electrons and 3DCRT. Methods and Materials: The novel technology used in this study is a mammography-based, noninvasive breast brachytherapy system whereby the treatment applicators are centered on the planning target volume (PTV) to direct {sup 192}Ir emissions along orthogonal axes. To date, three-dimensional dose modeling of NIIGBB has not been possible because of the limitations of conventional treatment planning systems (TPS) to model variable tissue deformation associated with breast compression. In this study, the TPS was adapted such that the NIIGBB dose distributions were modeled as a virtual point source. This dose calculation technique was applied to CT data from 8 patients imaged with the breast compressed between parallel plates in the cranial-caudal and medial-lateral axes. A dose-volume comparison was performed to simulated electron boost and 3DCRT APBI. Results: The NIIGBB PTV was significantly reduced as compared with both electrons and 3DCRT. Electron boost plans had a lower D{sub min} than the NIIGBB technique but higher V{sub 100}, D{sub 90}, and D{sub 50}. With regard to PTV coverage for APBI, the only significant differences were minimally higher D{sub 90}, D{sub 100}, V{sub 80}, and V{sub 90}, with 3DCRT and D{sub max} with NIIGBB. The NIIGBB technique, as compared with electrons and 3D-CRT, achieved a lower maximum dose to skin (60% and 10%, respectively) and chest wall/lung (70-90%). Conclusions: NIIGBB achieves a PTV that is smaller than electron beam and 3DCRT techniques. This results in significant normal tissue sparing while maintaining dosimetric benchmarks to the target tissue.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

A 4-D Climatology (1979-2009) of the Monthly Tropospheric Aerosol Optical Depth Distribution over the Mediterranean Region from a Comparative Evaluation and Blending of Remote Sensing and Model Products

Since the 1980s several spaceborne sensors have been used to retrieve the aerosol optical depth (AOD) over the Mediterranean region. In parallel, AOD climatologies coming from different numerical model simulations are now also available, permitting to distinguish the contribution of several aerosol types to the total AOD. In this work, we perform a comparative analysis of this unique multiyear database in terms of total AOD and of its apportionment by the five main aerosol types (soil dust, seasalt, sulfate, black and organic carbon). We use 9 different satellite-derived monthly AOD products: NOAA/AVHRR, SeaWiFS (2 products), TERRA/MISR, TERRA/MODIS, AQUA/MODIS, ENVISAT/MERIS, PARASOL/POLDER and MSG/SEVIRI, as well as 3 more historical datasets: NIMBUS7/CZCS, TOMS (onboard NIMBUS7 and Earth- Probe) and METEOSAT/MVIRI. Monthly model datasets include the aerosol climatology from Tegen et al. (1997), the climate-chemistry models LMDz-OR-INCA and RegCM-4, the multi-model mean coming from the ACCMIP exercise, and the reanalyses GEMS and MACC. Ground-based Level- 2 AERONET AOD observations from 47 stations around the basin are used here to evaluate the model and satellite data. The sensor MODIS (on AQUA and TERRA) has the best average AOD scores over this region, showing a relevant spatiotemporal variability and highlighting high dust loads over Northern Africa and the sea (spring and summer), and sulfate aerosols over continental Europe (summer). The comparison also shows limitations of certain datasets (especially MERIS and SeaWiFS standard products). Models reproduce the main patterns of the AOD variability over the basin. The MACC reanalysis is the closest to AERONET data, but appears to underestimate dust over Northern Africa, where RegCM-4 is found closer to MODIS thanks to its interactive scheme for dust emissions. The vertical dimension is also investigated using the CALIOP instrument. This study confirms differences of vertical distribution between dust aerosols showing a large vertical spread, and other continental and marine aerosols which are confined in the boundary layer. From this compilation, we propose a 4-D blended product from model and satellite data, consisting in monthly time series of 3-D aerosol distribution at a 50 km horizontal resolution over the Euro-Mediterranean marine and continental region for the 2003–2009 period. The product is based on the total AOD from AQUA/MODIS, apportioned into sulfates, black and organic carbon from the MACC reanalysis, and into dust and sea-salt aerosols from RegCM-4 simulations, which are distributed vertically based on CALIOP climatology.We extend the 2003–2009 reconstruction to the past up to 1979 using the 2003–2009 average and applying the decreasing trend in sulfate aerosols from LMDz-OR-INCA, whose AOD trends over Europe and the Mediterranean are median among the ACCMIP models. Finally optical properties of the different aerosol types in this region are proposed from Mie calculations so that this reconstruction can be included in regional climate models for aerosol radiative forcing and aerosolclimate studies.

1979-2009↗

Free volume in imidazolium triflimide ([C{sub 3}MIM][NTf{sub 2}]) ionic liquid from positron lifetime: Amorphous, crystalline, and liquid states

Positron annihilation lifetime spectroscopy (PALS) is used to study the ionic liquid 1-methyl-3-propylimidazolium bis(trifluoromethylsulfonyl)imide [C{sub 3}MIM][NTf{sub 2}] in the temperature range between 150 and 320 K. The positron decay spectra are analyzed using the routine LifeTime-9.0 and the size distribution of local free volumes (subnanometer-size holes) is calculated. This distribution is in good agreement with Fuerth's classical hole theory of liquids when taking into account Fuerth's hole coalescence hypothesis. During cooling, the liquid sample remains in a supercooled, amorphous state and shows the glass transition in the ortho-positronium (o-Ps) lifetime at 187 K. The mean hole volume varies between 70 A{sup 3} at 150 K and 250 A{sup 3} at 265-300 K. From a comparison with the macroscopic volume, the hole density is estimated to be constant at 0.20x10{sup 21} g{sup -1} corresponding to 0.30 nm{sup -3} at 265 K. The hole free volume fraction varies from 0.023 at 185 K to 0.073 at T{sub m}+12 K=265 K and can be estimated to be 0.17 at 430 K. It is shown that the viscosity follows perfectly the Cohen-Turnbull free volume theory when using the free volume determined here. The heating run clearly shows crystallization at 200 K by an abrupt decrease in the mean <{tau}{sub 3}> and standard deviation {sigma}{sub 3} of the o-Ps lifetime distribution and an increase in the o-Ps intensity I{sub 3}. The parameters of the second lifetime component <{tau}{sub 2}> and {sigma}{sub 2} behave parallel to the o-Ps parameters, which also shows the positron's (e{sup +}) response to structural changes. During melting at 253 K, all lifetime parameters recover to the initial values of the liquid. An abrupt decrease in I{sub 3} is attributed to the solvation of e{sup -} and e{sup +} particles. Different possible interpretations of the o-Ps lifetime in the crystalline state are briefly discussed.

36 MATERIALS SCIENCE↗