Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Parallel optimization”

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 739 records · Page 41

In Flight Evaluation of Active Inceptor Force-Feel Characteristics and Handling Qualities

The effect of inceptor feel-system characteristics on piloted handling qualities has been a research topic of interest for many years. Most of the research efforts have focused on advanced fly-by-wire fixed-wing aircraft with only a few studies investigating the effects on rotorcraft. Consequently, only limited guidance is available on how cyclic force-feel characteristics should be set to obtain optimal handling qualities for rotorcraft. To study this effect, the U.S. Army Aeroflightdynamics Directorate working with the DLR Institute of Flight Systems in Germany under Task X of the U.S. German Memorandum of Understanding have been conducting flight test evaluations. In the U.S., five experimental test pilots have completed evaluations of two Mission Task Elements (MTEs) from ADS-33E-PRF and two command/response types for a matrix of center-stick cyclic force-feel characteristics at Moffett Field. In Germany, three experimental test Pilots have conducted initial evaluations of the two MTEs with two command/response types for a parallel matrix of side-stick cyclic force-feel characteristics at WTD-61 in Manching. The resulting data set is used to correlate the effect of changes in natural frequency and damping ratio of the cyclic inceptor on the piloted handling qualities. Existing criteria in ADS-33E and a proposed Handling Qualities Sensitivity Function that includes the effects of the cyclic force-feel characteristics are also evaluated against the data set and discussed.

Lusardi, Jeff A.↗

3D Cloud Tomography and Droplet Size Retrieval from Multi-Angle Polarimetric Imaging of Scattered Sunlight from Above

Tomography aims to recover a three-dimensional (3D) density map of a medium or an object. In medical imaging,it is extensively used for diagnostics via X-ray computed tomography (CT). We define and derive a tomographyof cloud droplet distributions via passive remote sensing. We use multi-view polarimetric images to fit a 3Dpolarized radiative transfer (RT) forward model. Our motivation is 3D volumetric probing of vertically-developedconvectively-driven clouds that are ill-served by current methods in operational passive remote sensing. Currenttechniques are indeed based on strictly 1D RT modeling and applied to a single cloudy pixel, where cloud geometrydefaults to that of a plane-parallel slab. Incident unpolarized sunlight, once scattered by cloud droplets, changesits polarization state according to droplet size. Therefore, polarimetric measurements in the rainbow and gloryangular regions can be used to infer the droplet size distribution. This work defines and derives a framework for afull 3D tomography of cloud droplets for both their mass concentration in space and their distribution across arange of sizes. This gridded 3D retrieval of key microphysical properties is made tractable by our novel approachthat involves a restructuring and partial linearization of an open-source polarized 3D RT code to accommodate aspecial two-step iterative optimization technique. Physically-realistic synthetic clouds are used to demonstrate themethodology with rigorous uncertainty quantification, while a real-world cloud imaged by AirMSPI is processedto illustrate the new remote sensing capability

Schechner, Yoav Y.↗

On bottleneck partitioning k-ary n-cubes

Graph partitioning is a topic of extensive interest, with applications to parallel processing. In this context graph nodes typically represent computation, and edges represent communication. One seeks to distribute the workload by partitioning the graph so that every processor has approximately the same workload, and the communication cost (measured as a function of edges exposed by the partition) is minimized. Measures of partition quality vary; in this paper we consider a processor's cost to be the sum of its computation and communication costs, and consider the cost of a partition to be the bottleneck, or maximal processor cost induced by the partition. For a general graph the problem of finding an optimal partitioning is intractable. In this paper we restrict our attention to the class of k-art n-cube graphs with uniformly weighted nodes. Given mild restrictions on the node weight and number of processors, we identify partitions yielding the smallest bottleneck. We also demonstrate by example that some restrictions are necessary for the partitions we identify to be optimal. In particular, there exist cases where partitions that evenly partition nodes need not be optimal.

Nicol, David M.↗

File-System Workload on a Scientific Multiprocessor

Many scientific applications have intense computational and I/O requirements. Although multiprocessors have permitted astounding increases in computational performance, the formidable I/O needs of these applications cannot be met by current multiprocessors a their I/O subsystems. To prevent I/O subsystems from forever bottlenecking multiprocessors and limiting the range of feasible applications, new I/O subsystems must be designed. The successful design of computer systems (both hardware and software) depends on a thorough understanding of their intended use. A system designer optimizes the policies and mechanisms for the cases expected to most common in the user's workload. In the case of multiprocessor file systems, however, designers have been forced to build file systems based only on speculation about how they would be used, extrapolating from file-system characterizations of general-purpose workloads on uniprocessor and distributed systems or scientific workloads on vector supercomputers (see sidebar on related work). To help these system designers, in June 1993 we began the Charisma Project, so named because the project sought to characterize 1/0 in scientific multiprocessor applications from a variety of production parallel computing platforms and sites. The Charisma project is unique in recording individual read and write requests-in live, multiprogramming, parallel workloads (rather than from selected or nonparallel applications). In this article, we present the first results from the project: a characterization of the file-system workload an iPSC/860 multiprocessor running production, parallel scientific applications at NASA's Ames Research Center.

Kotz, David↗

Dynamic remapping of parallel computations with varying resource demands

The issue of deciding when to invoke a global load remapping mechanism is studied. Such a decision policy must effectively weigh the costs of remapping against the performance benefits, and should be general enough to apply automatically to a wide range of computations. The authors propose a general mapping decision heuristic, then study its effectiveness and its anticipated behavior on two very different models of load evolution. Assuming only that the remapping cost is known, this policy dynamically minimizes system degradation (including the cost of remapping) for each computation step. This policy is quite simple, choosing to remap when the first local minimum in the degradation function is detected. Simulations show that the decision obtained provides significantly better performance than that achieved by never remapping. The authors also observe that the average intermapping frequency is quite close to the optimal fixed remapping frequency.

Nicol, David M.↗

On the Sensitivity of Piezoceramics and Piezopolymers in Structural Integrity Monitoring of Large Trusses

An analytical assessment has been made of the reliability of using integrated microactuators and sensors in the form of piezoceramics and piezopolymers as joint integrity monitors in trussed systems. The concept is first implemented for a simple structure which consists of two truss members with a 45 deg lift angle joined at the apex. A piezoceramic patch (or piezopolymer film) bonded on the surface of one of the members at a location near the joint is used as a collocated actuator/sensor. The overall structural dynamic response under an excitation was modeled by finite element method. Different degrees of nodal constraints at the joints representing various degrees of joint integrity are employed. The resulting dynamic response showed distinct responses for varying joint stiffnesses. Parallel experimental work on a truss model using a multichannel data acquisition system and a digital signal analyzer confirms the results from analysis. We further studied the sensitivity of the micro-sensors to the behavior of joints of large arch truss structure. Results obtained for large trusses with many degrees of freedom indicate optimum locations of sensors for which the dynamic response signatures are distinct and distinguishable for relatively small changes in joint integrity and/or structural geometry. Computations based on finite element modeling show that locating the single actuator/sensor at the joint corresponding to the first loss of static stability appear optimal. Hence, static stability analysis of complex trusses can give us a good indication of the optimum placement of sensors for maximum response. This observation is important if few distributed sensors and actuators are available for placement in constructed facilities made from large trusses with many degrees of freedom. As an extension of this work a dynamic response signature identification technique to monitor in-service degradation of joints is under development for application to the monitoring of the integrity of adhesive joints in composite structures.

Abatan, A. O.↗

Looking around: 35 years of oculomotor modeling

Eye movements have attracted an unusually large number of researchers from many disparate fields, especially over the past 35 years. The lure of this system stemmed from its apparent simplicity of description, measurement, and analysis, as well as the promise of providing a "window in the mind." Investigators in areas ranging from biological control systems and neurological diagnosis to applications in advertising and flight simulation expected eye movements to provide clear indicators of what the sensory-motor system was accomplishing and what the brain found to be of interest. The parallels between compensatory eye movements and perception of spatial orientation have been a subject for active study in visual-vestibular interaction, where substantial knowledge has accumulated through experiments largely guided by the challenge of proving or disproving model predictions. Even though oculomotor control has arguably benefited more from systems theory than any other branch of motor control, many of the original goals remain largely unfulfilled. This paper considers some of the promising potential benefits of eye movement research and compares accomplishments with anticipated results. Four topics are considered in greater detail: (i) the definition of oculomotor system input and output, (ii) optimization of the eye movement system, (iii) the relationship between compensatory eye movements and spatial orientation through the "internal model," and (iv) the significance of eye movements as measured in (outer) space.

Flight Experiment↗

Onboard Autonomous Trajectory Planning for Mars Power Descent

In recent years, there has been an increasing interest in space-qualified processors such as multi-core central processing units and graphics processing units that can withstand the adverse effects of space radiation. These processors can allow parallel programming to perform tasks that typically demand high computational power. One can study guidance schemes that can take advantage of these currently developing processors and provide more robust guidance. Software for Multi-model Autonomous Real-time Trajectories (SMART) guidance can identify robust trajectories by running an onboard Monte Carlo analysis. SMART guidance can take advantage of knowledge updates obtained from the onboard sensors, allowing it to consider the off-nominal cases that it would not typically encounter during the offline trajectory analysis. This work uses the SMART guidance for the powered divert at Mars simulation in Program to Optimize and Simulated Trajectories- II.

Pardha Sai Chadalavada↗

Onboard Autonomous Trajectory Planning for Mars Power Descent

In recent years, there has been an increasing interest in space-qualified processors such as multi-core central processing units and graphics processing units that can withstand the adverse effects of space radiation. These processors can allow parallel programming to perform tasks that typically demand high computational power. One can study guidance schemes that can take advantage of these currently developing processors and provide more robust guidance. Software for Multi-model Autonomous Real-time Trajectories (SMART) guidance can identify robust trajectories by running an onboard Monte Carlo analysis. SMART guidance can take advantage of knowledge updates obtained from the onboard sensors, allowing it to consider the off-nominal cases that it would not typically encounter during the offline trajectory analysis. This work uses the SMART guidance for the powered divert at Mars simulation in Program to Optimize and Simulated Trajectories- II.

Autonomous Planning↗

Fast-Acquisition/Weak-Signal-Tracking GPS Receiver for HEO

A report discusses the technical background and design of the Navigator Global Positioning System (GPS) receiver -- . a radiation-hardened receiver intended for use aboard spacecraft. Navigator is capable of weak signal acquisition and tracking as well as much faster acquisition of strong or weak signals with no a priori knowledge or external aiding. Weak-signal acquisition and tracking enables GPS use in high Earth orbits (HEO), and fast acquisition allows for the receiver to remain without power until needed in any orbit. Signal acquisition and signal tracking are, respectively, the processes of finding and demodulating a signal. Acquisition is the more computationally difficult process. Previous GPS receivers employ the method of sequentially searching the two-dimensional signal parameter space (code phase and Doppler). Navigator exploits properties of the Fourier transform in a massively parallel search for the GPS signal. This method results in far faster acquisition times [in the lab, 12 GPS satellites have been acquired with no a priori knowledge in a Low-Earth-Orbit (LEO) scenario in less than one second]. Modeling has shown that Navigator will be capable of acquiring signals down to 25 dB-Hz, appropriate for HEO missions. Navigator is built using the radiation-hardened ColdFire microprocessor and housing the most computationally intense functions in dedicated field-programmable gate arrays. The high performance of the algorithm and of the receiver as a whole are made possible by optimizing computational efficiency and carefully weighing tradeoffs among the sampling rate, data format, and data-path bit width.

Wintemitz, Luke↗

Double lead spiral platen parallel jaw end effector

The double lead spiral platen parallel jaw end effector is an extremely powerful, compact, and highly controllable end effector that represents a significant improvement in gripping force and efficiency over the LaRC Puma (LP) end effector. The spiral end effector is very simple in its design and has relatively few parts. The jaw openings are highly predictable and linear, making it an ideal candidate for remote control. The finger speed is within acceptable working limits and can be modified to meet the user needs; for instance, greater finger speed could be obtained by increasing the pitch of the spiral. The force relaxation is comparable to the other tested units. Optimization of the end effector design would involve a compromise of force and speed for a given application.

Beals, David C.↗

Accurate modeling of parallel scientific computations

Scientific codes are usually parallelized by partitioning a grid among processors. To achieve top performance it is necessary to partition the grid so as to balance workload and minimize communication/synchronization costs. This problem is particularly acute when the grid is irregular, changes over the course of the computation, and is not known until load time. Critical mapping and remapping decisions rest on the ability to accurately predict performance, given a description of a grid and its partition. This paper discusses one approach to this problem, and illustrates its use on a one-dimensional fluids code. The models constructed are shown to be accurate, and are used to find optimal remapping schedules.

Nicol, David M.↗

Run-time scheduling and execution of loops on message passing machines

Sparse system solvers and general purpose codes for solving partial differential equations are examples of the many types of problems whose irregularity can result in poor performance on distributed memory machines. Often, the data structures used in these problems are very flexible. Crucial details concerning loop dependences are encoded in these structures rather than being explicitly represented in the program. Good methods for parallelizing and partitioning these types of problems require assignment of computations in rather arbitrary ways. Naive implementations of programs on distributed memory machines requiring general loop partitions can be extremely inefficient. Instead, the scheduling mechanism needs to capture the data reference patterns of the loops in order to partition the problem. First, the indices assigned to each processor must be locally numbered. Next, it is necessary to precompute what information is needed by each processor at various points in the computation. The precomputed information is then used to generate an execution template designed to carry out the computation, communication, and partitioning of data, in an optimized manner. The design is presented for a general preprocessor and schedule executer, the structures of which do not vary, even though the details of the computation and of the type of information are problem dependent.

Crowley, Kay↗

Run-time scheduling and execution of loops on message passing machines

Sparse system solvers and general purpose codes for solving partial differential equations are examples of the many types of problems whose irregularity can result in poor performance on distributed memory machines. Often, the data structures used in these problems are very flexible. Crucial details concerning loop dependences are encoded in these structures rather than being explicitly represented in the program. Good methods for parallelizing and partitioning these types of problems require assignment of computations in rather arbitrary ways. Naive implementations of programs on distributed memory machines requiring general loop partitions can be extremely inefficient. Instead, the scheduling mechanism needs to capture the data reference patterns of the loops in order to partition the problem. First, the indices assigned to each processor must be locally numbered. Next, it is necessary to precompute what information is needed by each processor at various points in the computation. The precomputed information is then used to generate an execution template designed to carry out the computation, communication, and partitioning of data, in an optimized manner. The design is presented for a general preprocessor and schedule executer, the structures of which do not vary, even though the details of the computation and of the type of information are problem dependent.

Saltz, Joel↗

Control of multiple resonant power processors in a multi-source system

Analysis and test results show that phasor-regulated, Mapham-derived resonant inverters can be paralleled to provide standardizing interfaces for multiple sources on a utility-type, aerospace power distribution bus. The basic sources do not require matching in any way, and may have grossly different characteristics. Fully stable system architectures with multiple sources, parallel/redundant distribution buses, and a wide variety of loads can be easily constructed and controlled. The commands and parameters available for system control allow for tight tolerance bus voltage control, and absolute power-sharing control from the various sources over the full range of possible source and load variations. That level of control enables simplified load power processing hardware and the distribution of losses to optimally load the source thermal control system. Positive control of all system performance and allocation of losses are not required by all missions or vehicles, and overall vehicle considerations do not always require the loads on vehicle energy sources and thermal control systems to be balanced. In those cases, power system control can be simplified, and a hierarchical set of defaults can be substituted for computer-generated or supervisory input commands to allow for stable, fully autonomous system operation.

Mildice, James↗

Domain decomposition: A bridge between nature and parallel computers

Domain decomposition is an intuitive organizing principle for a partial differential equation (PDE) computation, both physically and architecturally. However, its significance extends beyond the readily apparent issues of geometry and discretization, on one hand, and of modular software and distributed hardware, on the other. Engineering and computer science aspects are bridged by an old but recently enriched mathematical theory that offers the subject not only unity, but also tools for analysis and generalization. Domain decomposition induces function-space and operator decompositions with valuable properties. Function-space bases and operator splittings that are not derived from domain decompositions generally lack one or more of these properties. The evolution of domain decomposition methods for elliptically dominated problems has linked two major algorithmic developments of the last 15 years: multilevel and Krylov methods. Domain decomposition methods may be considered descendants of both classes with an inheritance from each: they are nearly optimal and at the same time efficiently parallelizable. Many computationally driven application areas are ripe for these developments. A progression is made from a mathematically informal motivation for domain decomposition methods to a specific focus on fluid dynamics applications. To be introductory rather than comprehensive, simple examples are provided while convergence proofs and algorithmic details are left to the original references; however, an attempt is made to convey their most salient features, especially where this leads to algorithmic insight.

Keyes, David E.↗

Initial Findings in Full-Shell Active Optics

The realization of active full-shell x-ray optics will provide ground-breaking capability for future missions. Future X-ray missions, such as Lynx, require high angular-resolution, large effective area, and as wide a field of view(FOV) as possible. It is currently not possible to perform high-resolution imaging of both wide and narrow FOVs with a single X-ray telescope. In this paper, we discuss the use of actuators to switch the optical surface of full-shell x-ray optics between prescriptions optimized for narrow-field and wide-field viewing, as well as correct for low-spatial-frequency errors in the optics. Previously, a pathfinder was developed using finite-element modeling(FEM). Using a combination of the model’s influence functions, the capacity of active full-shell optics was shown to switch between prescriptions with 92% accuracy. Another benefit of the analytical pathfinder was its ability to correct low-spatial frequency errors, which comprise a large percentage of the MSFC full-shell x-ray optics root-mean-square (RMS) slope error. In order to verify the pathfinder, a surface-parallel actuator was bonded to a nickel-replicated coupon. After the actuator was bonded to the coupon, the slope of the surface was measured while the actuator was activated. The proof-of-concept demonstrator development, the influence function data, and the resulting implications on the analytical pathfinder are reported and discussed.

X-ray optics↗

NASA Earth Systems Digital Twins (ESDT)

"Similarly to artificial intelligence, which is now revolutionizing many aspects of our daily lives, Earth system digital twin technologies have the potential to revolutionize the way Earth Science research will be conducted in the future, and how results and knowledge from this research will provide information to support decision making and yield impactful societal benefits. An Earth System Digital Twin or ESDT is a dynamic and interactive information system that first provides a digital replica of the past and current states of the Earth or Earth system as accurately and timely as possible; second, allows for computing forecasts of future states under nominal assumptions and based on the current replica; and third, offers the capability to investigate many hypothetical scenarios under varying impact assumptions. In other words, an ESDT provides the integrated What-Now, What-Next, and What-If pictures of the Earth or Earth system, by continuously ingesting newly observed data and by leveraging multiple interconnected models, machine learning as well advanced computing and visualization capabilities. Digital twins have been developed in engineering since 2002, but the interest in digital twins for the Earth domain is more recent and stems from the convergence of several developments: - The huge amount of diverse data that has now been collected continuously for more than 50 years, and that is becoming more and more difficult to access, understand, and utilize. - At the same time, because of climate change and its impacts the information produced by all of this data is becoming of interest to many new non-traditional users for analyzing and predicting various phenomena. - Because of advances in computational and visualization capabilities and the parallel unprecedented development of machine learning (ML), extracting relevant information from these large amounts of data and running complex models faster has become possible. As a result, it is becoming necessary and possible to build intuitive and interactive frameworks that will enable users with various skill levels and/or organizational hierarchy levels to easily access large amounts of targeted information along with the relevant tools and models (Earth system and human activity models), to support them in analyzing and visualizing this information, to help them understand interactions among models, to visualize the potential outcomes of various impacts, and to support decision or policy making. The full power of digital twins is that, through an integrated representation and standardized tools and software technologies, the same digital replica can address the needs of multiple users at various resolutions (spatial and temporal) and for various applications (science, economic, policy, etc.) – “from farmer to scientist”. With all these interests at stake, the challenges of building optimal digital twins are many and complex. The first challenge is to determine if a Digital Twin should be global or local, and multi-domain or thematic. For example, some domains such as Climate or Weather will require a global Digital Twin or Digital Twin capabilities while science areas such as Biodiversity might be more local. We can also envision that multiple thematic ESDTs, e.g., Air Quality, Wildfires, Hydrology could be federated or provide input to other ESDTs, either on a regional level or to a more global ESDT. Overall, we can imagine a future “web” of Digital Twins co-existing in a hierarchy or in a network, and capable of being connected or federated depending on the needs. This last point brings up the very important challenge of interoperability, including standards and protocols that will need to be built into these systems from the beginning. Each individual digital twin would have full flexibility in internal construction but would need standards-based interfaces (input and output) or hooks to make it compatible with others. Another challenge when building digital twins will be to decide how to organize each digital replica. Based on the applications targeted by the DT under implementation, various amounts and types of raw data, Analysis Ready Data (ARD) and information will need to be incorporated. Depending on the required latencies and needs of the users, various solutions can be considered, including Data Cubes, Data Lakes, pointers, or computing information on demand. We envision that each ESDT will choose a solution adapted to its specific objectives. Another important challenge is the type(s) of visualization that will be used, as well as the level of interactivity and refresh rate that will be required. Again, this will depend on the objectives of the ESDT, but also on the various users’ needs. In most cases, several types of visualizations and human interfaces will need to be offered depending on the projected users of that system. In parallel to the challenges highlighted above, there are also many tools and technologies that will need to be developed or improved for all types of digital twins. Among those are improved machine learning technologies, for example providing explainability, but also ML techniques for causality and providing a better integration of physics models. Additionally, reliable uncertainty quantification methods will be needed for all ESDT components, from validating data fusion and assimilation to assessing the accuracy of ML models and weighing the values of decisions supported by those systems. This presentation introduces the ESDT concept, presents several ESDT use cases, and a proposed ESDT architecture framework, as well as various technologies being developed by the Advanced Information Systems Technology (AIST) Program."

Earth Science Remote Sensing; Information Systems↗