Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 559 records · Page 31

Algorithms for Automatic Alignment of Arrays

Aggregate data objects (such as arrays) are distributed across the processor memories when compiling a data-parallel language for a distributed-memory machine. The mapping determines the amount of communication needed to bring operands of parallel operations into alignment with each other. A common approach is to break the mapping into two stages: an alignment that maps all the objects to an abstract template, followed by a distribution that maps the template to the processors. This paper describes algorithms for solving the various facets of the alignment problem: axis and stride alignment, static and mobile offset alignment, and replication labeling. We show that optimal axis and stride alignment is NP-complete for general program graphs, and give a heuristic method that can explore the space of possible solutions in a number of ways. We show that some of these strategies can give better solutions than a simple greedy approach proposed earlier. We also show how local graph contractions can reduce the size of the problem significantly without changing the best solution. This allows more complex and effective heuristics to be used. We show how to model the static offset alignment problem using linear programming, and we show that loop-dependent mobile offset alignment is sometimes necessary for optimum performance. We describe an algorithm with for determining mobile alignments for objects within do loops. We also identify situations in which replicated alignment is either required by the program itself or can be used to improve performance. We describe an algorithm based on network flow that replicates objects so as to minimize the total amount of broadcast communication in replication.

Chatterjee, Siddhartha↗

Predictive Inverse Model for Advective Heat Transfer in a Short–Circuited Fracture: Dimensional Analysis, Machine Learning, and Field Demonstration

Identifying fluid flow maldistribution in planar geometries is a well–established problem in subsurface science/engineering. Of particular importance to the thermal performance of enhanced (or “engineered”) geothermal systems is identifying the existence of nonuniform (i.e., heterogeneous) permeability and subsequently predicting advective heat transfer. Here, machine learning via a genetic algorithm (GA) identifies the spatial distribution of an unknown permeability field in a two–dimensional Hele–Shaw geometry (i.e., parallel plates). The inverse problem is solved by minimizing the L2 norm between simulated residence time distribution (RTD) and measurements of an inert tracer breakthrough curve (BTC) (C–Dot nanoparticle). Principal component analysis (PCA) of spatially correlated permeability fields enabled reduction of the parameter space by more than a factor of 10 and restricted the inverse search to reservoir–scale permeability variations. Thermal experiments and tracer tests conducted at the mesoscale Altona Field Laboratory (AFL) demonstrate that the method accurately predicts the effects of extreme flow channeling on heat transfer in a single bedding–plane rock fracture. However, this is only true when the permeability distributions provide adequate matches to both tracer RTD and frictional pressure loss. Without good agreement to frictional pressure loss, it is still possible to match a simulated RTD to measurements, but subsequent predictions of heat transfer are grossly inaccurate. Here, the results of this study suggest that it is possible to anticipate the thermal effects of flow maldistribution, but only if both simulated RTDs and frictional pressure loss between fluid inlets and outlets are in good agreement with measurements.

42 ENGINEERING↗

Network Analysis of Academic Medical Center Websites in the United States

Healthcare resources are published annually in repositories such as the AHA Annual Survey Database TM . However, these data repositories are created via manual surveying techniques which are cumbersome in collection and not updated as frequently as website information of the respective hospital systems represented. Also, this resource is not widely available to patients in an easy-to-use format. Network analysis techniques have the potential to create topological maps which serve to aid in pathfinding for patients in their search for healthcare services. This study explores the topological structure of forty United States academic health center websites. Network analysis is utilized to analyze and visualize 48,686 webpages. Several elements of network structure are examined including basic network properties, and centrality measures distributions. The Louvain community detection algorithm is used to examine the extent to which these techniques allow identification of healthcare resources within networks. The results indicate that websites with related healthcare services tend to form observable clusters useful in mapping key resources within a hospital system.

97 MATHEMATICS AND COMPUTING↗

The Completed SDSS-IV extended Baryon Oscillation Spectroscopic Survey: Large-scale structure catalogues for cosmological analysis

ABSTRACT We present large-scale structure catalogues from the completed extended Baryon Oscillation Spectroscopic Survey (eBOSS). Derived from Sloan Digital Sky Survey (SDSS) IV Data Release 16 (DR16), these catalogues provide the data samples, corrected for observational systematics, and random positions sampling the survey selection function. Combined, they allow large-scale clustering measurements suitable for testing cosmological models. We describe the methods used to create these catalogues for the eBOSS DR16 Luminous Red Galaxy (LRG) and Quasar samples. The quasar catalogue contains 343 708 redshifts with 0.8 < z < 2.2 over 4808 deg2. We combine 174 816 eBOSS LRG redshifts over 4242 deg2 in the redshift interval 0.6 < z < 1.0 with SDSS-III BOSS LRGs in the same redshift range to produce a combined sample of 377 458 galaxy redshifts distributed over 9493 deg2. Improved algorithms for estimating redshifts allow that 98 per cent of LRG observations result in a successful redshift, with less than one per cent catastrophic failures (Δz > 1000 km s−1). For quasars, these rates are 95 and 2 per cent (with Δz > 3000 km s−1). We apply corrections for trends between the number densities of our samples and the properties of the imaging and spectroscopic data. For example, the quasar catalogue obtains a χ2/DoF = 776/10 for a null test against imaging depth before corrections and a χ2/DoF= 6/8 after. The catalogues, combined with careful consideration of the details of their construction found here-in, allow companion papers to present cosmological results with negligible impact from observational systematic uncertainties.

79 ASTRONOMY AND ASTROPHYSICS↗

Flexibility Estimation and Control of Thermostatically Controlled Loads with Lock Time for Regulation Service

A virtual battery model is a simple and general method to quantify aggregate flexibility from thermostatically controlled loads (TCLs), enabling grid operators to effectively coordinate a large number of flexible building loads with supplyside resources in power systems. Lockout controls are designed to avoid wear and tear resulting from short-cycling of hardware. The lock on/off time could significantly affect aggregate flexibility from TCLs to provide ancillary services and may even fail control algorithms designed without considering the lock time constraints. This paper focuses on flexibility estimation and control design for TCLs with lock time constraints to provide frequency regulation service. We first investigate the potential impacts of lock time on TCLs’ aggregate flexibility and control performance. Both control-dependent and control-independent power bounds are derived, based on either previous TCL switching operations or regulation signals. While the control-dependent method provides aggregate flexibility for a given control method, the control-independent method calculates the theoretical maximum of power bounds. Two control algorithms are proposed to better distribute flexibility over time and thereby improve signal tracking performance. The proposed methods are illustrated and validated through simulations.

Wang, Peng↗

Scalable Computation of Topological Abstractions for Scalar Data

Topological data analysis has become an important tool for large scale scalar data analysis and visualization, efficiently extracting the inherent structure and features of interest of the data. However, with growing dataset sizes and complexity, it is increasingly becoming infeasible to compute topological abstractions of interest in serial and on single machines. This paper presents the state of the art in the scalable computation of topological abstractions on scalar data, in shared memory parallel on single machines, and in distributed memory parallel on multiple machines. We highlight results for set‐based, graph‐based and complex‐based abstractions and organize the state of the art based on this taxonomy. The paper identifies parallelization and distribution techniques common in topological algorithms and highlights further areas of interest with underdeveloped efforts.

97 MATHEMATICS AND COMPUTING↗

Distributed-Memory Parallel JointNMF

Joint Nonnegative Matrix Factorization (JointNMF) is a hybrid method for mining information from datasets that contain both feature and connection information. We propose distributed-memory parallelizations of three algorithms for solving the JointNMF problem based on Alternating Nonnegative Least Squares, Projected Gradient Descent, and Projected Gauss-Newton. We extend well-known communication-avoiding algorithms using a single processor grid case to our coupled case on two processor grids. We demonstrate the scalability of the algorithms on up to 960 cores (40 nodes) with 60% parallel efficiency. The more sophisticated Alternating Nonnegative Least Squares (ANLS) and Gauss-Newton variants outperform the first-order gradient descent method in reducing the objective on large-scale problems. We perform a topic modelling task on a large corpus of academic papers that consists of over 37 million paper abstracts and nearly a billion citation relationships, demonstrating the utility and scalability of the methods.

Eswar, Srinivas↗

Fine Structure in 3C 120 and 3C 84

Seven epochs of very long baseline radio interferometric observations of the Seyfert galaxies 3C 120 and 3C 84, at 3.8-cm wave length using stations at Westford, Massachusetts, Goldstone, California, Green Bank, West Virginia, and Onsala, Sweden, have been analyzed for source structure. An algorithm for reconstructing the brightness distribution of a spatially confined source from fringe amplitude and so called closure phase data has been developed and successfully applied to artificially generated test data and to data on the above mentioned sources. Over the two year time period of observation, 3C 120 was observed to consist of a double source showing apparent super relativistic expansion and separation velocities. The total flux changes comprising one outburst can be attributed to one of these components. 3C 84 showed much slower changes, evidently involving flux density changes in individual stationary components rather than relative motion.

Hutton, L. K.↗

The dynamics and control of large flexible space structures

The dynamics and attitude and shape control of very large, inherently flexible spacecraft systems were investigated. Increasingly more complex examples were examined, beginning with a uniform free-free beam, next a free-free uniform plate/platform and finally by considering a thin shallow spherical shell structure in orbit. The effects devices were modeled. For given sets of assumed actuator locations, the controllability of these systems was first established. Control laws for each of the actuators were developed based on decoupling techniques (including distributed modal control) pole placement algorithms and a application of the linear regulator problem for optical control theory.

Bainum, P. M.↗

Rain measurements from space using a modified Seasat-type radar altimeter

The incorporation in the 13.5 GHz Seasat-type radar altimeter of a mode to measure rain rate is investigated. Specifically, an algorithm is developed relating the echo power at the various range bins, to the rain rate taking into consideration Mie scattering and path attenuation. The dependence of the algorithm on rain drop size distribution and nonuniform rain structure are examined and associated uncertainties defined. A technique for obtaining drop size distribution through the measurements of power at the top of the raincell and power difference through the cell also is investigated together with an associated error analysis. A description of the minor hardware modifications to the basic Seasat design is given for implementing the rain measurements.

Goldhirsh, J.↗

Potential of dual-measurement techniques for accurate determination of instantaneous rainfall rate from space

The incorporation in the 13.5 GHz SEASAT type radar altimeter of a mode to measure rain rate is investigated. Specifically, an algorithm is developed relating the echo power at the various range bins to the rain rate, taking into consideration Mie scattering and path attenuation. The dependence of the algorithm on rain drop size distribution, and non-uniform rain structure are examined and associated uncertainties defined. A technique for obtaining drop size distribution through the measurements of power at the top of the raincell and power difference through the cell is also investigated together with an associated error analysis. A description of the minor hardware modifications to the basic SEASAT design is given for implementing the rain measurements.

Ulbrich, C. W.↗

Adapting a Navier-Stokes code to the ICL-DAP

The results of an experiment are reported, i.c., to adapt a Navier-Stokes code, originally developed on a serial computer, to concurrent processing on the CL Distributed Array Processor (DAP). The algorithm used in solving the Navier-Stokes equations is briefly described. The architecture of the DAP and DAP FORTRAN are also described. The modifications of the algorithm so as to fit the DAP are given and discussed. Finally, performance results are given and conclusions are drawn.

Grosch, C. E.↗

High performance architecture for robot control

Practical aspects of the design and implementation of a modular, high performance, parallel computer control system for telerobots are discussed. Topics of consideration include system architecture, operator interface, and control execution. In a laboratory environment, a telerobotics test control configuration is used to obtain measurements on communications and control loop timing for use in an effective full scale operational system design. The feasibility of the selected architectural approach has been successfully demonstrated. The modularity of the software and hardware enables ease of transport for use in the operational system. The distributed partioning of the control algorithms and the performance measurements acquired during control system implementation are discussed.

Byler, E.↗

Black light - How sensors filter spectral variation of the illuminant

Visual sensor responses may be used to classify objects on the basis of their surface reflectance functions. In a color image, the image data are represented as a vector of sensor responses at each point in the image. This vector depends both on the surface reflectance functions and on the spectral power distribution of the ambient illumination. Algorithms designed to classify objects on the basis of their surface reflectance functions typically attempt to overcome the dependence of the sensor responses on the illuminant by integrating sensor data collected from multiple surfaces. In machine vision applications, it is shown that it is often possible to design the sensor spectral responsivities so that the vector direction of the sensor responses does not depend upon the illuminant. The conditions under which this is possible are given and an illustrative calculation is performed. In biological systems, where the sensor responsivities are fixed, it is shown that some changes in the illumination cause no change in the sensor responses. Such changes in illuminant are called black illuminants. It is possible to express any illuminant as the sum of two unique components. One component is a black illuminant. The second component is called the visible component. The visible component of an illuminant completely characterizes the effect of the illuminant on the vector of sensor responses.

Brainard, David H.↗

Diffraction Analysis Of Distorted Reflector Antennas

Effects of systematic distortions of surfaces on radiation patterns predicted. Computer program for Diffraction Analysis of Reflector Antennas Subject to Systematic Distortions predicts performance of reflector antennas subject to sinusoidal, thermal, or gravitational distortions. Provides local interpolation algorithm readily applied to nonregular distribution of data. Developed in UNIVAC FORTRAN 77 for UNIVAC computer.

Rahmat-Samii, Yahya↗

Supercomputing '91; Proceedings of the 4th Annual Conference on High Performance Computing, Albuquerque, NM, Nov. 18-22, 1991

Various papers on supercomputing are presented. The general topics addressed include: program analysis/data dependence, memory access, distributed memory code generation, numerical algorithms, supercomputer benchmarks, latency tolerance, parallel programming, applications, processor design, networks, performance tools, mapping and scheduling, characterization affecting performance, parallelism packaging, computing climate change, combinatorial algorithms, hardware and software performance issues, system issues. (No individual items are abstracted in this volume)

Source record↗

Single-phase power distribution system power flow and fault analysis

Alternative methods for power flow and fault analysis of single-phase distribution systems are presented. The algorithms for both power flow and fault analysis utilize a generalized approach to network modeling. The generalized admittance matrix, formed using elements of linear graph theory, is an accurate network model for all possible single-phase network configurations. Unlike the standard nodal admittance matrix formulation algorithms, the generalized approach uses generalized component models for the transmission line and transformer. The standard assumption of a common node voltage reference point is not required to construct the generalized admittance matrix. Therefore, truly accurate simulation results can be obtained for networks that cannot be modeled using traditional techniques.

Halpin, S. M.↗

Airfoil Design Using a Coupled Euler and Integral Boundary Layer Method with Adjoint Based Sensitivities

The objective of this paper is to present a control theory approach for the design of airfoils in the presence of viscous compressible flows. A coupled system of the integral boundary layer and the Euler equations is solved to provide rapid flow simulations. An adjunct approach consistent with the complete coupled state equations is employed to obtain the sensitivities needed to drive a numerical optimization algorithm. Design to target pressure distribution is demonstrated on an RAE 2822 airfoil at transonic speed.

Edwards, S.↗