Search NASA⌕ Search

SEARCH · Search NASA

Results for “distributed algorithm”

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,099 records · Page 61

An Ensemble-Based Smoother with Retrospectively Updated Weights for Highly Nonlinear Systems

Monte Carlo computational methods have been introduced into data assimilation for nonlinear systems in order to alleviate the computational burden of updating and propagating the full probability distribution. By propagating an ensemble of representative states, algorithms like the ensemble Kalman filter (EnKF) and the resampled particle filter (RPF) rely on the existing modeling infrastructure to approximate the distribution based on the evolution of this ensemble. This work presents an ensemble-based smoother that is applicable to the Monte Carlo filtering schemes like EnKF and RPF. At the minor cost of retrospectively updating a set of weights for ensemble members, this smoother has demonstrated superior capabilities in state tracking for two highly nonlinear problems: the double-well potential and trivariate Lorenz systems. The algorithm does not require retrospective adaptation of the ensemble members themselves, and it is thus suited to a streaming operational mode. The accuracy of the proposed backward-update scheme in estimating non-Gaussian distributions is evaluated by comparison to the more accurate estimates provided by a Markov chain Monte Carlo algorithm.

Monte Carlo↗

GPU-based Image Compression for Efficient Compositing in Distributed Rendering Applications

Visualizations of large-scale data sets are often created on graphics clusters that distribute the rendering task amongst many processes. When using real-time GPU-based graphics algorithms, the most time-consuming aspect of distributed rendering is typically the com-positing phase - combining all partial images from each rendering process into the final visualization. Compo siting requires image data to be copied off the GPU and sent over a network to other processes. While compression has been utilized in existing distributed rendering compositors to reduce the data being sent over the network, this compression tends to occur after the raw images are transferred from the GPU to main memory. In this paper, we present work that leverages OpenGL / CUDA interoperability to compress raw images on the GPU prior to transferring the data to main memory. This approach can significantly reduce the device-to-host data transfer time, thus enabling more efficient compositing of images generated by distributed rendering applications.

Lipinksi, Riley↗

TRMM Realtime Data Production, Transfer, and Future Plans

The Tropical Rainfall Measuring Mission, a joint US NASA and Japan NASDA mission, was launched on November 27, 1997 from Tanegashima Island, Japan on a NASDA provided H-II launch vehicle. The TRMM objectives are: to obtain and study multi-year science data sets of tropical and sub- tropical rainfall measurement; to understand how interactions between the sea, air, and land masses produce changes in global rainfall and climate; to help improve modeling of tropical rainfall processes; to test, evaluate, and improve the performance of satellite rainfall estimates measurements and techniques. The routine production and quick distribution of standard products provides an important underpinning to these objectives. The determination of standard TRMM algorithms and the requirements for routine production and distribution fall within the authority of the joint US-Japan Science Team. In April of 1998, the Joint TRMM Science team requested that TRMM data be made available in near real-time to approved international agencies and modelers. This request was an addition to the routine production of the standard TRMM data products. The science team requested that near-realtime products be as small as possible to facilitate their transfer via networks. Indeed, it was determined that only network transfer would be available. This presentation provides an overview of the type of products available from the realtime system and how the TRMM system was developed at the lowest cost in the shortest amount of time. It then describes the real-time data flow. The presentation also summarizes how the science quality of real-time data is maintained. It describes how interested groups can get access to this data and the importance of networks for the future of real-time data expansion. The presentation concludes real-time possibilities and improvements possible as part of the proposed Global Precipitation Mission. High speed network access availability is an important catalyst to real-time data flow during the proposed mission.

Stocker, Erich Franz↗

Experimental validation of deterministic Acuros XB algorithm for IMRT and VMAT dose calculations with the Radiological Physics Center's head and neck phantom

Purpose: The purpose of this study was to verify the dosimetric performance of Acuros XB (AXB), a grid-based Boltzmann solver, in intensity-modulated radiation therapy (IMRT) and volumetric-modulated arc therapy (VMAT). Methods: The Radiological Physics Center (RPC) head and neck (H and N) phantom was used for all calculations and measurements in this study. Clinically equivalent IMRT and VMAT plans were created on the RPC H and N phantom in the Eclipse treatment planning system (version 10.0) by using RPC dose prescription specifications. The dose distributions were calculated with two different algorithms, AXB 11.0.03 and anisotropic analytical algorithm (AAA) 10.0.24. Two dose report modes of AXB were recorded: dose-to-medium in medium (D{sub m,m}) and dose-to-water in medium (D{sub w,m}). Each treatment plan was delivered to the RPC phantom three times for reproducibility by using a Varian Clinac iX linear accelerator. Absolute point dose and planar dose were measured with thermoluminescent dosimeters (TLDs) and GafChromic registered EBT2 film, respectively. Profile comparison and 2D gamma analysis were used to quantify the agreement between the film measurements and the calculated dose distributions from both AXB and AAA. The computation times for AAA and AXB were also evaluated. Results: Good agreement was observed between measured doses and those calculated with AAA or AXB. Both AAA and AXB calculated doses within 5% of TLD measurements in both the IMRT and VMAT plans. Results of AXB{sub Dm,m} (0.1% to 3.6%) were slightly better than AAA (0.2% to 4.6%) or AXB{sub Dw,m} (0.3% to 5.1%). The gamma analysis for both AAA and AXB met the RPC 7%/4 mm criteria (over 90% passed), whereas AXB{sub Dm,m} met 5%/3 mm criteria in most cases. AAA was 2 to 3 times faster than AXB for IMRT, whereas AXB was 4-6 times faster than AAA for VMAT. Conclusions: AXB was found to be satisfactorily accurate when compared to measurements in the RPC H and N phantom. Compared with AAA, AXB results were equal to or better than those obtained with film measurements for IMRT and VMAT plans. The AXB{sub Dm,m} reporting mode was found to be closer to TLD and film measurements than was the AXB{sub Dw,m} mode. AXB calculation time was found to be significantly shorter (x 4) than AAA for VMAT.

61 RADIATION PROTECTION AND DOSIMETRY↗

Rapid solution of large-scale systems of equations

The analysis and design of complex aerospace structures requires the rapid solution of large systems of linear and nonlinear equations, eigenvalue extraction for buckling, vibration and flutter modes, structural optimization and design sensitivity calculation. Computers with multiple processors and vector capabilities can offer substantial computational advantages over traditional scalar computer for these analyses. These computers fall into two categories: shared memory computers and distributed memory computers. This presentation covers general-purpose, highly efficient algorithms for generation/assembly or element matrices, solution of systems of linear and nonlinear equations, eigenvalue and design sensitivity analysis and optimization. All algorithms are coded in FORTRAN for shared memory computers and many are adapted to distributed memory computers. The capability and numerical performance of these algorithms will be addressed.

Storaasli, Olaf O.↗

Multi-fault Tolerance for Cartesian Data Distributions

Faults are expected to play an increasingly important role in how algorithms and applications are designed to run on future extreme-scale sys- tems. Algorithm-based fault tolerance (ABFT) is a promising approach that involves modications to the algorithm to recover from faults with lower over- heads than replicated storage and a signicant reduction in lost work compared to checkpoint-restart techniques. Fault-tolerant linear algebra (FTLA) algo- rithms employ additional processors that store parities along the dimensions of a matrix to tolerate multiple, simultaneous faults. Existing approaches as- sume regular data distributions (blocked or block-cyclic) with the failures of each data block being independent. To match the characteristics of failures on parallel computers, we extend these approaches to mapping parity blocks in several important ways. First, we handle parity computation for generalized Cartesian data distributions with each processor holding arbitrary subsets of blocks in a Cartesian-distributed array. Second, techniques to handle corre- lated failures, i.e., multiple processors that can be expected to fail together, are presented. Third, we handle the colocation of parity blocks with the data blocks and do not require them to be on additional processors. Several al- ternative approaches, based on graph matching, are presented that attempt to balance the memory overhead on processors while guaranteeing the same fault tolerance properties as existing approaches that assume independent fail- ures on regular blocked data distributions. The evaluation of these algorithms demonstrates that the additional desirable properties are provided by the pro- posed approach with minimal overhead.

Ali, Nawab↗

AGNfitter: a Bayesian MCMC approach to fitting spectral energy distributions of AGNs

We present AGNfitter, a publicly available open-source algorithm implementing a fully Bayesian Markov Chain Monte Carlo method to fit the spectral energy distributions (SEDs) of active galactic nuclei (AGNs) from the sub-millimeter to the UV, allowing one to robustly disentangle the physical processes responsible for their emission. AGNfitter makes use of a large library of theoretical, empirical, and semi-empirical models to characterize both the nuclear and host galaxy emission simultaneously. The model consists of four physical emission components: an accretion disk, a torus of AGN heated dust, stellar populations, and cold dust in star-forming regions. AGNfitter determines the posterior distributions of numerous parameters that govern the physics of AGNs with a fully Bayesian treatment of errors and parameter degeneracies, allowing one to infer integrated luminosities, dust attenuation parameters, stellar masses, and star-formation rates. We tested AGNfitter’s performance on real data by fitting the SEDs of a sample of 714 X-ray selected AGNs from the XMM-COSMOS survey, spectroscopically classified as Type1 (unobscured) and Type2 (obscured) AGNs by their optical–UV emission lines. We find that two independent model parameters, namely the reddening of the accretion disk and the column density of the dusty torus, are good proxies for AGN obscuration, allowing us to develop a strategy for classifying AGNs as Type1 or Type2, based solely on an SED-fitting analysis. Our classification scheme is in excellent agreement with the spectroscopic classification, giving a completeness fraction of ∼86% and ∼70%, and an efficiency of ∼80% and ∼77%, for Type1 and Type2 AGNs, respectively.

79 ASTRONOMY AND ASTROPHYSICS↗

New approach based on group technology for the consolidation problem in cloud computing-mathematical model and genetic algorithm

Resource management is a hotspot issue in distributed systems like cloud computing (CC). It means how to prepare the computational resources, i.e., servers and virtual machines (VMS), to execute the tasks. This paper offers a new approach based on Group Technology (GT)—known as a powerful philosophy for the resource management in cellular manufacturing systems—to deal with the resource management problem in CC. We develop a mathematical model to optimally consolidate the VMs, servers and tasks simultaneously to control several important factors such as task migrations and server load variation, as well as the number of VMs. To test the validity of our proposed model, several small problems are generated randomly and solved by LINGO 9 software. Furthermore, to cope with larger problems, which cannot be solved optimally, a genetic algorithm is proposed. We, finally, compare our methods with the most well-known algorithms in this context, round robin (RR) and first-come, first-served (FCFS) algorithms.

97 MATHEMATICS AND COMPUTING↗

NASA Computational Case Study: Spectral Energy Distribution Fitting

The need for faster, more efficient algorithms is an important aspect of scientific computing. Generally, scientists are only exposed to computational issues that arise in their field. Thus, collaboration between a numerical analyst and a scientist is becoming necessary for scientific computing. The purpose of this case study is to expose computer scientists to processes that an astronomer would use to obtain useful results from raw data. For example, astronomers are interested in determining the properties of galaxies and measuring changes in those properties as a function of time throughout cosmic history. To do so, they use certain models that are designed and refined over time via observations at different wavelengths of the light spectrum. The process of matching these models with observed data from studying celestial bodies is referred to as Spectral Energy Distribution (SED) fitting. In this case study, we learn how to perform the SED fit. This process requires knowledge of both the astronomical and computational issues involved when fitting flux, the total energy from a source as seen from Earth, to a set of physical templates. Once a fit is complete, one can classify the source and estimate a number of physical parameters. The goal is to demonstrate how the computer science skill set can be used in the scientific community and to possibly improve one or more of the computational aspects of this problem. The following provides some background on the astronomy issues, including information on the spectral energy distribution and related physical parameters, and the computational issues, including the fitting procedure..

modeling↗

Advanced Reconfiguration and Protection of Distribution Systems: Four Areas of Supporting Research

Historically, distribution systems have been very susceptible to transmission- and distribution-level events, such as line trips and faults within substations, because local sources of energy, if available at all, were only designed to operate in the context of a fully functional grid. However, the increasing deployment of advanced measuring devices, distributed energy resources (DERs), and energy storage provide the opportunity to improve reliability at the distribution level using advanced measurement-based reconfiguration and protection methods. This report discusses research regarding 1) a transmission equivalent model, 2) an algorithm for distinguishing between transmission- and distribution-level events, 3) a spreadsheet to help site new measurement devices, and 4) network theory to enable smart reconfiguration of distribution systems. Each of these areas of research support the development and study of advanced reconfiguration and protection methods.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Mitigating the Impacts of Uncertain Geomagnetic Disturbances on Electric Grids: A Distributionally Robust Optimization Approach

Severe geomagnetic disturbances (GMDs) increase the magnitude of the electric field on the Earth’s surface (E-field) and drive geomagnetically-induced currents (GICs) along the transmission lines in electric grids. These additional currents can pose severe risks, such as current distortions, transformer saturation and increased reactive power losses, each of which can lead to system unreliability. Today several mitigation actions (e.g., changing grid topology) exist that can reduce the harmful GIC effects on the grids. Making such decisions can be challenging, however, because the magnitude and direction of the E-field are uncertain and non-stationary. In this paper, we model uncertain E-fields using the distributionally robust optimization (DRO) approach that determines optimal transmission grid operations such that the worst-case expectation of the system cost is minimized. We also capture the effect of GICs on the nonlinear AC power flow equations. For solution approaches, we develop an accelerated column-and-constraint generation (CCG) algorithm by exploiting a special structure of the support set of uncertain parameters representing the E-field. Extensive numerical experiments based on “epri-21” and “uiuc-150” systems, designed for GMD studies, demonstrate (i) the computational performance of the accelerated CCG algorithm, (ii) the superior performance of distributionally robust grid operations that satisfy nonlinear, nonconvex AC power flow equations and GIC constraints, in comparison with standard stochastic programming-based methods during the out-of-sample testing.

42 ENGINEERING↗

Streamline integration as a method for two-dimensional elliptic grid generation

We propose a new numerical algorithm to construct a structured numerical elliptic grid of a doubly connected domain. Our method is applicable to domains with boundaries defined by two contour lines of a two-dimensional function. Furthermore, we can adapt any analytically given boundary aligned structured grid, which specifically includes polar and Cartesian grids. The resulting coordinate lines are orthogonal to the boundary. Grid points as well as the elements of the Jacobian matrix can be computed efficiently and up to machine precision. In the simplest case we construct conformal grids, yet with the help of weight functions and monitor metrics we can control the distribution of cells across the domain. Our algorithm is parallelizable and easy to implement with elementary numerical methods. We assess the quality of grids by considering both the distribution of cell sizes and the accuracy of the solution to elliptic problems. Among the tested grids these key properties are best fulfilled by the grid constructed with the monitor metric approach. - Graphical abstract: - Highlights: • Construct structured, elliptic numerical grids with elementary numerical methods. • Align coordinate lines with or make them orthogonal to the domain boundary. • Compute grid points and metric elements up to machine precision. • Control cell distribution by adaption functions or monitor metrics.

97 MATHEMATICS AND COMPUTING↗

Coherent x-ray diffraction imaging of paint pigmentparticles by scanning a phase plate modulator

We have implemented a coherent x-ray diffraction imaging technique that scans a phase plate to modulate wave-fronts of the x-ray beam transmitted by samples. The method was applied to measure a decorative alkyd paint containing iron oxide red pigment particles. By employing an iterative algorithm for wave-front modulation phase retrieval, we obtained an image of the paint sample that shows the distribution of the pigment particles and is consistent with the result obtained from a transmission x-ray microscope. The technique has been experimentally proven to be a feasible coherent x-ray imaging method with about 120 nm spatial resolution and was shown to work well with industrially relevant specimens.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Estimation of distributions via multilevel Monte Carlo with stratified sampling

We design and implement a novel algorithm for computing a multilevel Monte Carlo (MLMC) estimator of the joint cumulative distribution function (CDF) of a vector-valued quantity of interest in problems with random input parameters and initial conditions. Our approach combines MLMC with stratified sampling of the input sample space by replacing standard Monte Carlo at each level with stratified Monte Carlo initialized with proportionally allocated samples. We show that the resulting stratified MLMC (sMLMC) algorithm is more efficient than its standard MLMC counterpart due to the additional variance reduction provided by the stratification of the random parameter's domain, especially at the coarsest levels. Additional computational cost savings are obtained by smoothing the indicator function with a Gaussian kernel, which proves to be an efficient and robust alternative to recently developed polynomial-based techniques.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Distributed Coordination of Demand-side Flexible Resources in Microgrid with All-Time Feasibility

The prevalence of distributed renewable generators motivates microgrid operators to exploit demand-side flexible resources (DFRs). Due to their dispersed nature, distributed DFR coordination has been a vibrant research area, while there are several issues awaiting to be addressed. On one hand, DFR power is internally coupled through power flow, while DFR usually cannot access grid information. On the other hand, in time-restricted scenarios, solution feasibility cannot be guaranteed by conventional dual-based algorithms. To fill these gaps, we propose a distributed DFR coordination framework with all-time feasibility. The proposed framework accounts for the distinct access of microgrid entities to grid information. A distributed and all-time feasible algorithm is proposed for optimal DFR coordination, which allows DFRs to make local decisions without violating constraints throughout iterations. The effectiveness of the proposed algorithm is demonstrated through case studies. The impact of peer-to-peer communication links on algorithm convergence is also investigated, which emphasizes the balance between communication investment and algorithm performance.

Li, Hongyi [Iowa State Univ., Ames, IA (United Sta↗

Accurate Automatic Delineation of Heterogeneous Functional Volumes in Positron Emission Tomography for Oncology Applications

Purpose: Accurate contouring of positron emission tomography (PET) functional volumes is now considered crucial in image-guided radiotherapy and other oncology applications because the use of functional imaging allows for biological target definition. In addition, the definition of variable uptake regions within the tumor itself may facilitate dose painting for dosimetry optimization. Methods and Materials: Current state-of-the-art algorithms for functional volume segmentation use adaptive thresholding. We developed an approach called fuzzy locally adaptive Bayesian (FLAB), validated on homogeneous objects, and then improved it by allowing the use of up to three tumor classes for the delineation of inhomogeneous tumors (3-FLAB). Simulated and real tumors with histology data containing homogeneous and heterogeneous activity distributions were used to assess the algorithm's accuracy. Results: The new 3-FLAB algorithm is able to extract the overall tumor from the background tissues and delineate variable uptake regions within the tumors, with higher accuracy and robustness compared with adaptive threshold (T{sub bckg}) and fuzzy C-means (FCM). 3-FLAB performed with a mean classification error of less than 9% +- 8% on the simulated tumors, whereas binary-only implementation led to errors of 15% +- 11%. T{sub bckg} and FCM led to mean errors of 20% +- 12% and 17% +- 14%, respectively. 3-FLAB also led to more robust estimation of the maximum diameters of tumors with histology measurements, with <6% standard deviation, whereas binary FLAB, T{sub bckg} and FCM lead to 10%, 12%, and 13%, respectively. Conclusion: These encouraging results warrant further investigation in future studies that will investigate the impact of 3-FLAB in radiotherapy treatment planning, diagnosis, and therapy response evaluation.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Cluster analysis based on dimensional information with applications to feature selection and classification

A new clustering algorithm is presented that is based on dimensional information. The algorithm includes an inherent feature selection criterion, which is discussed. Further, a heuristic method for choosing the proper number of intervals for a frequency distribution histogram, a feature necessary for the algorithm, is presented. The algorithm, although usable as a stand-alone clustering technique, is then utilized as a global approximator. Local clustering techniques and configuration of a global-local scheme are discussed, and finally the complete global-local and feature selector configuration is shown in application to a real-time adaptive classification scheme for the analysis of remote sensed multispectral scanner data.

Eigen, D. J.↗

A formally verified algorithm for interactive consistency under a hybrid fault model

Consistent distribution of single-source data to replicated computing channels is a fundamental problem in fault-tolerant system design. The 'Oral Messages' (OM) algorithm solves this problem of Interactive Consistency (Byzantine Agreement) assuming that all faults are worst-cass. Thambidurai and Park introduced a 'hybrid' fault model that distinguished three fault modes: asymmetric (Byzantine), symmetric, and benign; they also exhibited, along with an informal 'proof of correctness', a modified version of OM. Unfortunately, their algorithm is flawed. The discipline of mechanically checked formal verification eventually enabled us to develop a correct algorithm for Interactive Consistency under the hybrid fault model. This algorithm withstands $a$ asymmetric, $s$ symmetric, and $b$ benign faults simultaneously, using $m+1$ rounds, provided $n is greater than 2a + 2s + b + m$, and $m\geg a$. We present this algorithm, discuss its subtle points, and describe its formal specification and verification in PVS. We argue that formal verification systems such as PVS are now sufficiently effective that their application to fault-tolerance algorithms should be considered routine.

Lincoln, Patrick↗