Search NASA⌕ Search

SEARCH · Search NASA

Results for “algorithm timings”

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,729 records · Page 96

GX: a GPU-native gyrokinetic turbulence code for tokamak and stellarator design

GX is a code designed to solve the nonlinear gyrokinetic system for low-frequency turbulence in magnetized plasmas, particularly tokamaks and stellarators. In GX, our primary motivation and target is a fast gyrokinetic solver that can be used for fusion reactor design and optimization along with wide-ranging physics exploration. Here, this has led to several code and algorithm design decisions, specifically chosen to prioritize time to solution. First, we have used a discretization algorithm that is pseudospectral in the entire phase space, including a Laguerre–Hermite pseudospectral formulation of velocity space, which allows for smooth interpolation between coarse gyrofluid-like resolutions and finer conventional gyrokinetic resolutions and efficient evaluation of a model collision operator. Additionally, we have built GX to natively target graphics processors (GPUs), which are among the fastest computational platforms available today. Finally, we have taken advantage of the reactor-relevant limit of small $\rho _*$ by using the radially local flux-tube approach. In this paper we present details about the gyrokinetic system and the numerical algorithms used in GX to solve the system. We then present several numerical benchmarks against established gyrokinetic codes in both tokamak and stellarator magnetic geometries to verify that GX correctly simulates gyrokinetic turbulence in the small $\rho _*$. Moreover, we show that the convergence properties of the Laguerre–Hermite spectral velocity formulation are quite favourable for nonlinear problems of interest. Coupled with GPU acceleration, which we also investigate with scaling studies, this enables GX to be able to produce useful turbulence simulations in minutes on one (or a few) GPUs and higher fidelity results in a few hours using several GPUs. GX is open-source software that is ready for fusion reactor design studies.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Techniques for shuttle trajectory optimization

The application of recently developed function-space Davidon-type techniques to the shuttle ascent trajectory optimization problem is discussed along with an investigation of the recently developed PRAXIS algorithm for parameter optimization. At the outset of this analysis, the major deficiency of the function-space algorithms was their potential storage problems. Since most previous analyses of the methods were with relatively low-dimension problems, no storage problems were encountered. However, in shuttle trajectory optimization, storage is a problem, and this problem was handled efficiently. Topics discussed include: the shuttle ascent model and the development of the particular optimization equations; the function-space algorithms; the operation of the algorithm and typical simulations; variable final-time problem considerations; and a modification of Powell's algorithm.

Edge, E. R.↗

Instrumental variables algorithm for modal parameter identification in flutter testing

The paper is concerned with the task of estimating modal parameters from system response measurement in aircraft flutter testing. A frequency-domain derivation of an instrumental-variables algorithm is presented for a linear time-invariant dynamic system of order n. Basically, this algorithm fits a set of poles and zeros to the measured transfer function. An illustrative example is provided regarding the application of the algorithm to aeroelasticity testing. It is shown that the algorithm can be implemented for on-line data reduction with a microcomputer-based analysis system. By using instrumental variables the sensitivity of the modal parameter estimates to noise in the system-response measurements is reduced greatly. The algorithm is expected to be a powerful and valuable tool for on-line estimation of modal parameters in flutter testing and should be useful in control system and structural dynamics tests.

Johnson, W.↗

Improvements and validation of the erythropoiesis control model for bed rest simulation

The most significant improvement in the model is the explicit formulation of separate elements representing erythropoietin production and red cell production. Other modifications include bone marrow time-delays, capability to shift oxyhemoglobin affinity and an algorithm for entering experimental data as time-varying driving functions. An area of model development is suggested by applying the model to simulating onset, diagnosis and treatment of a hematologic disorder. Recommendations for further improvements in the model and suggestions for experimental application are also discussed. A detailed analysis of the hematologic response to bed rest including simulation of the recent Baylor Medical College bed rest studies is also presented.

Leonard, J. I.↗

Advanced power system protection and incipient fault detection and protection of spaceborne power systems

This research concentrated on the application of advanced signal processing, expert system, and digital technologies for the detection and control of low grade, incipient faults on spaceborne power systems. The researchers have considerable experience in the application of advanced digital technologies and the protection of terrestrial power systems. This experience was used in the current contracts to develop new approaches for protecting the electrical distribution system in spaceborne applications. The project was divided into three distinct areas: (1) investigate the applicability of fault detection algorithms developed for terrestrial power systems to the detection of faults in spaceborne systems; (2) investigate the digital hardware and architectures required to monitor and control spaceborne power systems with full capability to implement new detection and diagnostic algorithms; and (3) develop a real-time expert operating system for implementing diagnostic and protection algorithms. Significant progress has been made in each of the above areas. Several terrestrial fault detection algorithms were modified to better adapt to spaceborne power system environments. Several digital architectures were developed and evaluated in light of the fault detection algorithms.

Russell, B. Don↗

Parallel algorithms for placement and routing in VLSI design

The computational requirements for high quality synthesis, analysis, and verification of very large scale integration (VLSI) designs have rapidly increased with the fast growing complexity of these designs. Research in the past has focused on the development of heuristic algorithms, special purpose hardware accelerators, or parallel algorithms for the numerous design tasks to decrease the time required for solution. Two new parallel algorithms are proposed for two VLSI synthesis tasks, standard cell placement and global routing. The first algorithm, a parallel algorithm for global routing, uses hierarchical techniques to decompose the routing problem into independent routing subproblems that are solved in parallel. Results are then presented which compare the routing quality to the results of other published global routers and which evaluate the speedups attained. The second algorithm, a parallel algorithm for cell placement and global routing, hierarchically integrates a quadrisection placement algorithm, a bisection placement algorithm, and the previous global routing algorithm. Unique partitioning techniques are used to decompose the various stages of the algorithm into independent tasks which can be evaluated in parallel. Finally, results are presented which evaluate the various algorithm alternatives and compare the algorithm performance to other placement programs. Measurements are presented on the parallel speedups available.

Brouwer, Randall Jay↗

A software architecture for hard real-time execution of automatically synthesized plans or control laws

The design of a flexible, real-time software architecture for trajectory planning and automatic control of redundant manipulators is described. Emphasis is placed on a technique of designing control systems that are both flexible and robust yet have good real-time performance. The solution presented involves an artificial intelligence algorithm that dynamically reprograms the real-time control system while planning system behavior.

Schoppers, Marcel↗

Shuttle radiation dose measurements in the International Space Station orbits

The International Space Station (ISS) is now a reality with the start of a permanent human presence on board. Radiation presents a serious risk to the health and safety of the astronauts, and there is a clear requirement for estimating their exposures prior to and after flights. Predictions of the dose rate at times other than solar minimum or solar maximum have not been possible, because there has been no method to calculate the trapped-particle spectrum at intermediate times. Over the last few years, a tissue-equivalent proportional counter (TEPC) has been flown at a fixed mid-deck location on board the Space Shuttle in 51.65 degrees inclination flights. These flights have provided data that cover the expected changes in the dose rates due to changes in altitude and changes in solar activity from the solar minimum to the solar maximum of the current 23rd solar cycle. Based on these data, a simple function of the solar deceleration potential has been derived that can be used to predict the galactic cosmic radiation (GCR) dose rates to within +/-10%. For altitudes to be covered by the ISS, the dose rate due to the trapped particles is found to be a power-law function, rho(-2/3), of the atmospheric density, rho. This relationship can be used to predict trapped dose rates inside these spacecraft to +/-10% throughout the solar cycle. Thus, given the shielding distribution for a location inside the Space Shuttle or inside an ISS module, this approach can be used to predict the combined GCR + trapped dose rate to better than +/-15% for quiet solar conditions.

NASA Discipline Radiation Health↗

RADIO PULSAR BINARIES IN GLOBULAR CLUSTERS: THEIR ORBITAL ECCENTRICITIES AND STELLAR INTERACTIONS

High sensitivity searches of globular clusters (GCs) for radio pulsars by improved pulsar search algorithms and sustained pulsar timing observations have so far yielded some 140 pulsars in more than two dozen GCs. The observed distribution of orbital eccentricity and period of binary radio pulsars in GCs have imprints of the past interaction between single pulsars and binary systems or of binary pulsars and single passing noncompact stars. It is seen that GCs have different groups of pulsars. These may have arisen out of exchange or merger of a component of the binary with the incoming star or a 'fly-by' in which the original binary remains intact but undergoes a change of eccentricity and orbital period. We consider the genesis of the distribution of pulsars using analytical and computational tools such as STARLAB, which performs numerical scattering experiments with direct N-body integration. Cluster pulsars with intermediate eccentricities can mostly be accounted for by fly-bys, whereas those with high eccentricities are likely to be the result of exchanges and/or mergers of single stars with the binary companion of the pulsar, although there are a few objects which do not easily fit into this description. The corresponding distribution for galactic field pulsars shows notable differences from the GC pulsar orbital period and eccentricity distribution. The long orbital period pulsars in the galactic field with frozen out low eccentricities are largely missing from the GCs, and we show that the ionization of these systems in GCs cannot alone account for the peculiarities.

79 ASTRONOMY AND ASTROPHYSICS↗

Accelerated Distributed Energy Management for Microgrids

This paper considers the optimal energy management for a microgrid. The goal of optimal energy management is to minimize the total generation cost while meeting total demand and satisfying individual generator output limits. To achieve this goal, we develop a distributed algorithm based on the consensus theory and gradient estimation technique. Compared to the existing algorithms with diminishing step-sizes, the proposed algorithm enjoys a faster convergence speed due to the fixed step-size, and thus increases the computation speed, and reduces the computation and communication burden. The proposed distributed algorithm is applicable to both fixed and time-varying directed communication networks. We show that the convergence of the proposed distributed algorithm is achieved if the fixed communication network is strongly connected, or if the time-varying communication network is uniformly jointly strongly connected. Numerical simulation results are used to illustrate and demonstrate the effectiveness of the proposed algorithm.

Du, Wen↗

The computation of generalized cross-validation functions through householder tridiagonalization with applications to the fitting of interaction spline models

An efficient algorithm for computing the generalized cross-validation function for the general cross-validated regularization/smoothing problem is provided. This algorithm is appropriate for problems where no natural structure is available, and the regularization/smoothing problem is solved (exactly) in a reproducing kernel Hilbert space. It is particularly appropriate for certain multivariate smoothing problems with irregularly spaced data, and certain remote sensing problems, such as those that occur in meteorology, where the sensors are arranged irregularly. The algorithm is applied to the fitting of interaction spline models with irregularly spaced data and two smoothing parameters; favorable timing results are presented. The algorithm may be extended to the computation of certain generalized maximum likelihood (GML) functions. Application of the GML algorithm to a problem in numerical weather forecasting, and to a broad class of hypothesis testing problems, is noted.

Gu, Chong↗

Rolling Horizon with K-Position Search Method for Strategic Deconfliction of Package Delivery UAS

This research focuses on the strategic deconfliction of unmanned aircraft systems (UAS) in an urban package delivery environment with two depots and multiple drop-off locations. Since the formulated mixed-integer nonlinear programming (MINLP) problem is non-deterministic polynomial-time (NP) hard, a heuristic algorithm called "rolling horizon with k-position search (KPS)" is used to compute the departure sequence and scheduled time of departure (STD) of each UAS at a depot, considering temporal constraints at en-route crossing waypoints and depots for strategic deconfliction. The simulation studies show that an increase in the value of k (local neighborhood search) in the KPS reduces the average ground delay at the cost of an increase in the computation time for a given number of UAS, size of the rolling horizon window, and number of depots involved in the local neighborhood search. The studies also show that for a given rolling horizon window, the computation time increases exponentially with an increase in the total number of UAS flights when serial processing the local neighborhood search of KPS (with k > 1) and drops by an order of magnitude upon performing the local neighborhood search of KPS using parallel processing instead of serial processing. The computation time drops with the reduction in air traffic complexity of a scenario for a given number of flights, k (local neighborhood search), and rolling horizon window.

UTM↗

Scheme for stabilising the phase and arrival time of ultrashort laser pulses in a coherent beam combining fibre system

An algorithm has been demonstrated for simultaneously measuring the phase and arrival time of optical pulses relative to pulses in a reference channel using one detector array. Based on this algorithm, a simple optoelectronic pulse phase and arrival time stabilisation scheme has been designed for operation in a coherent beam combining fibre system for ultrashort pulses (including chirped ones). We have studied the performance of the stabilisation scheme. In particular, we have reached a phase measurement rate of 25 000 cps, demonstrated an ∼ 2 kHz limiting phase stabilisation frequency in a feedback loop, and obtained an arrival time measurement accuracy of ∼ 5 % of the transform-limited pulse duration at a measurement rate of 5 cps. In experiments concerned with coherent beam combining for two channels of a pulsed fibre system at a wavelength of 1030 nm, we have demonstrated phase stabilisation with an accuracy better than λ/100 and delay setting accuracy of 10 fs at a transform-limited pulse duration of ∼ 200 fs and obtained 94 % beam combining efficiency. (paper)

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

FY09 Advanced Instrumentation and Active Interrogation Research for Safeguards

Multiple small-scale projects have been undertaken to investigate advanced instrumentation solutions for safeguard measurement challenges associated with advanced fuel cycle facilities and next-generation fuel reprocessing installations. These activities are in support of the U.S. Department of Energy's Fuel Cycle Research and Development program and its Materials Protection, Accounting, and Control for Transmutation (MPACT) campaign. 1) Work was performed in a collaboration with the University of Michigan (Prof. Sara Pozzi, co-PI) to investigate the use of liquid-scintillator radiation detectors for assaying mixed-oxide (MOX) fuel, to characterize its composition and to develop advanced digital pulse-shape discrimination algorithms for performing time-correlation measurements in the MOX fuel environment. This work included both simulations and experiments and has shown that these techniques may provide a valuable approach for use within advanced safeguard measurement scenarios. 2) Work was conducted in a collaboration with Oak Ridge National Laboratory (Dr. Paul Hausladen, co-PI) to evaluate the strengths and weaknesses of the fast-neutron coded-aperture imaging technique for locating and characterizing fissile material, and as a tool for performing hold-up measurements in fissile material handling facilities. This work involved experiments at Idaho National Laboratory, using MOX fuel and uranium metal, in both passive and active interrogation configurations. A complete analysis has not yet been completed but preliminary results suggest several potential uses for the fast neutron imaging technique. 3) Work was carried out to identify measurement approaches for determining nitric acid concentration in the range of 1 – 4 M and beyond. This work included laboratory measurements to investigate the suitability of prompt-gamma neutron activation analysis for this measurement and product reviews of other commercial solutions. Ultrasonic density analysis appears to be the best candidate technology for determining nitric acid concentrations but the PGNAA approach may also be applicable. 4) Work was also carried out to begin investigating the use of remote UV imaging to detect air-ionization induced by alpha particle emission from plutonium. This approach has been shown elsewhere as a useful tool for detecting and quantifying plutonium contamination and has the potential of providing a unique and powerful approach for quantifying hold-up in reprocessing facilities. Based on these simple scoping experiments the potential far-reaching capabilities of the measurement are clear.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

SmartApps: Middle-ware for Adaptive Applications on Reconfigurable Platforms

There are several reasons why the performance of current distributed and heterogeneous systems is often disappointing. For example, the characteristics of the application may be input sensitive and evolve during execution causing dramatic changes in memory reference patterns, resource requirements, or degree of concurrency between different phases of the computation. Or, the system may change dynamically with nodes failing or appearing, some network links severed and other links established with different latencies and bandwidths. Another important reason for poor performance is the fairly compartmentalized approach to optimization: applications, compilers, operating systems and hardware configurations are designed and optimized in isolation and without the knowledge of instance specific information and needs of a running application. There is too little information flow across these boundaries and no global optimization is even attempted. For example, most operating systems services like paging, virtual-to-physical page mapping, I/O, or data layout in disks, provide little or no application customization. Similarly, the off-the-shelf hardware used by most commercial systems is optimized to give best average-case performance. To address this problem, we have proposed application-centric computing, or Smart Applications (SAS). In the SAS executable, the compiler embeds most run-time system services, and a performance-optimizing feedback loop that monitors the application's performance and adaptively reconfigures the application and the OS/system platform. At run-time, after incorporating the code's input and determining the system's resources and state, the SAS performs an *instance* specific optimization, which is more tractable than a global generic optimization between application, OS and system. The overriding philosophy of SAS is ``measure, compare, and adapt if beneficial.'' That is, the application will continually monitor its performance and the available resources to determine if, and by how much, performance could be improved if the application was restructured. Then, if the potential performance benefit outweighs the projected overhead costs, the application will restructure itself and the underlying system accordingly. The SAS framework includes performance monitoring and modeling components and mechanisms for performing the actual restructuring at various levels including: (i) algorithmic adaptation, (ii) run-time software optimization (e.g., input sensitivity analysis, etc.), (iii) tuning reconfigurable OS services (scheduling policy, page size, etc), and (iv) system configuration (e.g., selecting which, and how many, computational resources to use). SmartApps is being developed in the STAPL infrastructure. STAPL (the Standard Template Adaptive Parallel Library) is a framework for developing highly-optimizable, adaptable, and portable parallel and distributed applications. It consists of a relatively new and still evolving collection of generic parallel algorithms and distributed containers and a run-time system (RTS) through which the application and compiler interact with the OS and hardware.

97 MATHEMATICS AND COMPUTING↗

Adaptive Runtime Features For Distributed Graph Algorithms

Performance of distributed graph algorithms can benefit greatly by forming rapport between algorithmic abstraction and the underlying runtime system that is responsible for scheduling work and exchanging messages. However, due to their dynamic and irregular nature of computation, distributed graph algorithms written in different programming models impose varying degree of workload pressure on the runtime. To cope with such vastly different workload characteristics, a runtime has to make several trade-offs. One such trade-off arises, for example, when the runtime scheduler has to choose among alternatives such as whether to execute algorithmic work, or progress the network by probing network buffers, or throttle sending messages (termed flow control). This tradeoff decides between optimizing the throughput of a runtime scheduler by increasing the rate of execution of algorithmic work, and reducing the latency of the network messages. Another trade-off exists when a decision has to be made about when to send aggregated messages in buffers (message coalescing). This decision chooses between trading off latency for network bandwidth and vice versa. At any instant, such trade-offs emphasize either on improving the quantity of work being executed (by maximizing the scheduler throughput) or on improving the quality of work (by prioritizing better work). However, encoding static policies for different runtime features (such as flow control, coalescing) can prevent graph algorithms from achieving their full potential, thus can undermine the actual performance of a distributed graph algorithm . In this paper, we investigate runtime support for distributed graph algorithms in the context of two paradigms: variants of wellknown Bulk-Synchronous Parallel model and asynchronous programming model. We explore generic runtime features such as message coalescing (aggregation) and flow control and show that execution policies of these features need to be adjusted over time to make a positive impact on the execution time of a distributed graph algorithm. Since synchronous and asynchronous graph algorithms have different workload characteristics, not all of such runtime features may be good candidates for adaptation. Each of these algorithmic paradigms may require different set of features to be adapted over time. We demonstrate which set of feature(s) can be useful in each case to achieve the right balance of work in the runtime layer. Existing implementation of different graph algorithms can benefit from adapting dynamic policies in the underlying runtime.

Firoz, Jesun S.↗

Fast likelihood classification

A multistage classification that reduces the processing time substantially is proposed. This classification algorithm consists of several stages, and in each stage likelihood values of classes are calculated and compared. If a class has a likelihood value less than a threshold, the class if truncated at that stage as an unlikely class, thus reducing the number of classes for which likelihood values are to be calculated at the next stage. Thus a host of classes can be truncated using a small portion of the total features at early stages, resulting in substantial reduction of computing time. Several truncation criteria are developed, and the relationship between thresholds and the error caused by the truncation is investigated. Experiments show that the proposed algorithm reduces the processing time by the factor of 3-7, depending on the number of classes and features, while maintaining essentially the same accuracies.

Lee, Chulhee↗

Design, Development, and Testing of a UAV Hardware-in-the-Loop Testbed for Aviation and Airspace Prognostics Research

The airspace is becoming more and more complicated, and will continue to do so in the future with the integration of Unmanned Aerial Vehicles (UAVs), autonomy, spacecraft, other forms of aviation technology into the airspace. The new technology and complexity increases the importance and difficulty of safety assurance. Additionally, testing new technologies on complex aviation systems & systems of systems can be very difficult, expensive, and sometimes unsafe in real life scenarios. Prognostic methodology provides an estimate of the health and risks of a component, vehicle, or airspace and knowledge of how that will change over time. That measure is especially useful in safety determination, mission planning, and maintenance scheduling. The developed testbed will be used to validate prediction algorithms for the real-time safety monitoring of the National Airspace System (NAS) and the prediction of unsafe events. The framework injects flight related anomalies related to ground systems, routing, airport congestion, etc. to test and verify algorithms for NAS safety. In our research work, we develop a live, distributed, hardware-in-the-loop testbed for aviation and airspace prognostics along with exploring further research possibilities to verify and validate future algorithms for NAS safety. The testbed integrates virtual aircraft using the X-Plane simulator and X-PlaneConnect toolbox, UAVs using onboard sensors and cellular communications, and hardware in the loop components. In addition, the testbed includes an additional research framework to support and simplify future research activities. It enables safe, accurate, and inexpensive experimentation and research into airspace and vehicle prognosis that would not have been possible otherwise. This paper describes the design, development, and testing of this system. Software reliability, safety and latency are some of the critical design considerations in development of the testbed. Integration of HITL elements in the development phases and veri cation/ validation are key elements to this report.

HITL↗