Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “distributed computation”

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,477 records · Page 82

Parallel language constructs for tensor product computations on loosely coupled architectures

Distributed memory architectures offer high levels of performance and flexibility, but have proven awkard to program. Current languages for nonshared memory architectures provide a relatively low level programming environment, and are poorly suited to modular programming, and to the construction of libraries. A set of language primitives designed to allow the specification of parallel numerical algorithms at a higher level is described. Tensor product array computations are focused on along with a simple but important class of numerical algorithms. The problem of programming 1-D kernal routines is focused on first, such as parallel tridiagonal solvers, and then how such parallel kernels can be combined to form parallel tensor product algorithms is examined.

Mehrotra, Piyush↗

Convex Decreasing Algorithms: Distributed Synthesis and Finite-Time Termination in Higher Dimension

Here we establish finite time termination algorithms for consensus algorithms based on geometric properties that yield finite-time guarantees, suited for use in high dimension and in the absence of a central authority. These pursuits motivate a new peer to peer convex hull algorithm which is utilized for one stopping algorithm. Further an alternative lightweight norm based stopping criteria is also developed. The practical utility of the algorithm is illustrated through MATLAB simulations.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Predicting Real-Time Safety of the National Airspace System

To gain the situational awareness necessary for informed decision making regarding avoidance of airspace hazards, each operator must consolidate operations-relevant information from disparate sources and apply extensive domain knowledge to correctly interpret not just the current state of the NAS but forecast its (combined) evolution over the duration of the operation. This time- and workload-intensive process is periodically repeated throughout the operation so that changes can be managed in a timely manner.The imprecision, inaccuracies, inconsistency, and incompleteness of the incoming data further challenges the process. To facilitate informed decision making, this paper presents a model-based framework for the textitautomated real-time monitoring and prediction of possible effects of airspace hazards on the safety of the National Airspace System (NAS). First, hazards to flight are identified and transformed into sms, that is, quantities of interest that could be evaluated based on available data and are predictive of an unsafe event. The sms and associated thresholds that specify when an event transitions from emphsafe to emphunsafe are combined with models of airspace operations and aircraft dynamics. The framework can include any hazard to flight that can be modeled quantitatively. Models can be detailed and complex, or they can be considerably simplifed, as appropriate to the application. Real-time NAS safety monitoring and prediction begins with an estimate of the state of the NAS using the dynamic models. Given the state estimate and a probability distribution of future inputs to the NAS, we can then predict the evolution of the NAS - the future state - and the occurrence of hazards and unsafe events. The entire probability distribution of airspace sms is computed, not just point estimates, without significant assumptions regarding the distribution type andor parameters. We demonstrate our overall approach through a simulated scenario in which we predict the occurrence of some unsafe events and show how these predictions evolve in time as flight operations progress. Predictions accounting for common sources of uncertainty are included and it is shown how the predictions improve in time, become more confident, and change dynamically as new information is made available to the prediction algorithm.

safety↗

Rapid Analysis of Mass Distribution of Radiation Shielding

Radiation Shielding Evaluation Toolset (RADSET) is a computer program that rapidly calculates the spatial distribution of mass of an arbitrary structure for use in ray-tracing analysis of the radiation-shielding properties of the structure. RADSET was written to be used in conjunction with unmodified commercial computer-aided design (CAD) software that provides access to data on the structure and generates selected three-dimensional-appearing views of the structure. RADSET obtains raw geometric, material, and mass data on the structure from the CAD software. From these data, RADSET calculates the distribution(s) of the masses of specific materials about any user-specified point(s). The results of these mass-distribution calculations are imported back into the CAD computing environment, wherein the radiation-shielding calculations are performed.

Zapp, Edward↗

Understanding the hydrological response of a headwater-dominated catchment by analysis of distributed surface–subsurface interactions

Abstract We computationally explore the relationship between surface–subsurface exchange and hydrological response in a headwater-dominated high elevation, mountainous catchment in East River Watershed, Colorado, USA. In order to isolate the effect of surface–subsurface exchange on the hydrological response, we compare three model variations that differ only in soil permeability. Traditional methods of hydrograph analysis that have been developed for headwater catchments may fail to properly characterize catchments, where catchment response is tightly coupled to headwater inflow. Analyzing the spatially distributed hydrological response of such catchments gives additional information on the catchment functioning. Thus, we compute hydrographs, hydrological indices, and spatio-temporal distributions of hydrological variables. The indices and distributions are then linked to the hydrograph at the outlet of the catchment. Our results show that changes in the surface–subsurface exchange fluxes trigger different flow regimes, connectivity dynamics, and runoff generation mechanisms inside the catchment, and hence, affect the distributed hydrological response. Further, changes in surface–subsurface exchange rates lead to a nonlinear change in the degree of connectivity—quantified through the number of disconnected clusters of ponding water—in the catchment. Although the runoff formation in the catchment changes significantly, these changes do not significantly alter the aggregated streamflow hydrograph. This hints at a crucial gap in our ability to infer catchment function from aggregated signatures. We show that while these changes in distributed hydrological response may not always be observable through aggregated hydrological signatures, they can be quantified through the use of indices of connectivity.

54 ENVIRONMENTAL SCIENCES↗

Transition Effects on Heating in the Wake of a Blunt Body

A series of aerodynamic heating tests was conducted on a 70-deg sphere-cone planetary entry vehicle model in a Mach 10 perfect-gas wind tunnel at freestream Reynolds numbers based on diameter of 8.23x104 to 3.15x105. Surface heating distributions were determined from temperature time-histories measured on the model and on its support sting using thin-film resistance gages. The experimental heating data were compared to computations made using an axisymmetric/2D, laminar, perfect-gas Navier-Stokes solver. Agreement between computational and experimental heating distributions to within, or slightly greater than, the experimental uncertainty was obtained on the forebody and afterbody of the entry vehicle as well as on the sting upstream of the free-shear-layer reattachment point. However, the distributions began to diverge near the reattachment point, with the experimental heating becoming increasingly greater than the computed heating with distance downstream from the reattachment point. It was concluded that this divergence was due to transition of the wake free shear layer just upstream of the reattachment point on the sting.

Hollis, Brian R.↗

GPU-acceleration of the ELPA2 distributed eigensolver for dense symmetric and hermitian eigenproblems

The solution of eigenproblems is often a key computational bottleneck that limits the tractable system size of numerical algorithms, among them electronic structure theory in chemistry and in condensed matter physics. Large eigenproblems can easily exceed the capacity of a single compute node, thus must be solved on distributed-memory parallel computers. We here present GPU-oriented optimizations of the ELPA two-stage tridiagonalization eigensolver (ELPA2). On top of cuBLAS-based GPU offloading, we add a CUDA kernel to speed up the back-transformation of eigenvectors, which can be the computationally most expensive part of the two-stage tridiagonalization algorithm. Furthermore, we benchmark the performance of this GPU-accelerated eigensolver on two hybrid CPU–GPU architectures, namely a compute cluster based on Intel Xeon Gold CPUs and NVIDIA Volta GPUs, and the Summit supercomputer based on IBM POWER9 CPUs and NVIDIA Volta GPUs. Consistent with previous benchmarks on CPU-only architectures, the GPU-accelerated two-stage solver exhibits a parallel performance superior to the one-stage counterpart. Finally, we demonstrate the performance of the GPU-accelerated eigensolver developed in this work for routine semi-local KS-DFT calculations comprising thousands of atoms.

97 MATHEMATICS AND COMPUTING↗

Transonic wing analysis using advanced computational methods

This paper discusses the application of three-dimensional computational transonic flow methods to several different types of transport wing designs. The purpose of these applications is to evaluate the basic accuracy and limitations associated with such numerical methods. The use of such computational methods for practical engineering problems can only be justified after favorable evaluations are completed. The paper summarizes a study of both the small-disturbance and the full potential technique for computing three-dimensional transonic flows. Computed three-dimensional results are compared to both experimental measurements and theoretical results. Comparisons are made not only of pressure distributions but also of lift and drag forces. Transonic drag rise characteristics are compared. Three-dimensional pressure distributions and aerodynamic forces, computed from the full potential solution, compare reasonably well with experimental results for a wide range of configurations and flow conditions.

Henne, P. A.↗

Panorama 360 (Final Report)

This is the final technical report for the DOE-funded Panorama 360 project. Panorama 360 provided a resource for the collection, analysis, and sharing of performance data about end-to-end scientific workflows executing on DOE facilities. The work focused on workflows that include experimental data generation at DOE facilities. The main activities of Panorama 360 include the development of: 1. A distributed repository that stores different types of workflow execution data (e.g., point and time series performance traces at fine- and coarse-grained levels); 2. A set of open-source data capture, curation, and publishing tools fully integrated with a state-of-the-art workflow management system that automates data ingestion to the repository and enables users to discover, query, and process data from the repository; 3. A set of analysis algorithms and machine learning based tools to perform analysis and characterization of the gathered data, which can be used to detect anomalous performance or system faults; and 4. Best practices and recommendations for workflow evaluation, analysis, execution, and architectures.

97 MATHEMATICS AND COMPUTING↗

User-Defined Data Distributions in High-Level Programming Languages

One of the characteristic features of today s high performance computing systems is a physically distributed memory. Efficient management of locality is essential for meeting key performance requirements for these architectures. The standard technique for dealing with this issue has involved the extension of traditional sequential programming languages with explicit message passing, in the context of a processor-centric view of parallel computation. This has resulted in complex and error-prone assembly-style codes in which algorithms and communication are inextricably interwoven. This paper presents a high-level approach to the design and implementation of data distributions. Our work is motivated by the need to improve the current parallel programming methodology by introducing a paradigm supporting the development of efficient and reusable parallel code. This approach is currently being implemented in the context of a new programming language called Chapel, which is designed in the HPCS project Cascade.

physically distributed memory↗

Complete and Correct Transfer of Information (CACTI)

Many distributed systems, file transfer mechanisms, and message passing systems offer reliability mechanisms such as acknowledgements, retries, and durability. While these tools may be “good enough” for their typical use cases, they may not offer sufficient coverage for the wide range of faults that impact data transfers and communication. A gap in the reliability measures may lead to some small amount of data loss. Some high-consequence systems cannot tolerate the loss or corruption of even a single record. We present seven principles that will counter a wide range of faults and protect against data loss and corruption. These principles bring together lessons learned from a wide range of technologies and can inform appropriate system design and application usage. These principles will help readers reason on how prevent data loss in a multi-hop pipeline and how to properly use tools that may have a deficiency in reliability.

97 MATHEMATICS AND COMPUTING↗

Analysis of Issues for Project Scheduling by Multiple, Dispersed Schedulers (distributed Scheduling) and Requirements for Manual Protocols and Computer-based Support

Although computerized operations have significant gains realized in many areas, one area, scheduling, has enjoyed few benefits from automation. The traditional methods of industrial engineering and operations research have not proven robust enough to handle the complexities associated with the scheduling of realistic problems. To address this need, NASA has developed the computer-aided scheduling system (COMPASS), a sophisticated, interactive scheduling tool that is in wide-spread use within NASA and the contractor community. Therefore, COMPASS provides no explicit support for the large class of problems in which several people, perhaps at various locations, build separate schedules that share a common pool of resources. This research examines the issue of distributing scheduling, as applied to application domains characterized by the partial ordering of tasks, limited resources, and time restrictions. The focus of this research is on identifying issues related to distributed scheduling, locating applicable problem domains within NASA, and suggesting areas for ongoing research. The issues that this research identifies are goals, rescheduling requirements, database support, the need for communication and coordination among individual schedulers, the potential for expert system support for scheduling, and the possibility of integrating artificially intelligent schedulers into a network of human schedulers.

Richards, Stephen F.↗

Array distribution in data-parallel programs

We consider distribution at compile time of the array data in a distributed-memory implementation of a data-parallel program written in a language like Fortran 90. We allow dynamic redistribution of data and define a heuristic algorithmic framework that chooses distribution parameters to minimize an estimate of program completion time. We represent the program as an alignment-distribution graph. We propose a divide-and-conquer algorithm for distribution that initially assigns a common distribution to each node of the graph and successively refines this assignment, taking computation, realignment, and redistribution costs into account. We explain how to estimate the effect of distribution on computation cost and how to choose a candidate set of distributions. We present the results of an implementation of our algorithms on several test problems.

Chatterjee, Siddhartha↗

Computational methods for analyzing the transmission characteristics of a beta particle magnetic analysis system

Computational methods were developed to study the trajectories of beta particles (positrons) through a magnetic analysis system as a function of the spatial distribution of the radionuclides in the beta source, size and shape of the source collimator, and the strength of the analyzer magnetic field. On the basis of these methods, the particle flux, their energy spectrum, and source-to-target transit times have been calculated for Na-22 positrons as a function of the analyzer magnetic field and the size and location of the target. These data are in studies requiring parallel beams of positrons of uniform energy such as measurement of the moisture distribution in composite materials. Computer programs for obtaining various trajectories are included.

Singh, J. J.↗

Radiation exposure and risk assessment for critical female body organs

Space radiation exposure limits for astronauts are based on recommendations of the National Council on Radiation Protection and Measurements. These limits now include the age at exposure and sex of the astronaut. A recently-developed computerized anatomical female (CAF) model is discussed in detail. Computer-generated, cross-sectional data are presented to illustrate the completeness of the CAF model. By applying ray-tracing techniques, shield distribution functions have been computed to calculate absorbed dose and dose equivalent values for a variety of critical body organs (e.g., breasts, lungs, thyroid gland, etc.) and mission scenarios. Specific risk assessments, i.e., cancer induction and mortality, are reviewed.

Atwell, William↗

Multi-Area Distribution System State Estimation Using Decentralized Physics-Aware Neural Networks

The development of active distribution grids requires more accurate and lower computational cost state estimation. In this paper, the authors investigate a decentralized learning-based distribution system state estimation (DSSE) approach for large distribution grids. The proposed approach decomposes the feeder-level DSSE into subarea-level estimation problems that can be solved independently. The proposed method is decentralized pruned physics-aware neural network (D-P2N2). The physical grid topology is used to parsimoniously design the connections between different hidden layers of the D-P2N2. Monte Carlo simulations based on one-year of load consumption data collected from smart meters for a three-phase distribution system power flow are developed to generate the measurement and voltage state data. The IEEE 123-node system is selected as the test network to benchmark the proposed algorithm against the classic weighted least squares and state-of-the-art learning-based DSSE approaches. Numerical results show that the D-P2N2 outperforms the state-of-the-art methods in terms of estimation accuracy and computational efficiency.

24 POWER TRANSMISSION AND DISTRIBUTION↗