Search NASA⌕ Search

SEARCH · Search NASA

Results for “data parallel algorithms”

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 523 records · Page 29

Fault-Tolerant, Radiation-Hard DSP

Commercial digital signal processors (DSPs) for use in high-speed satellite computers are challenged by the damaging effects of space radiation, mainly single event upsets (SEUs) and single event functional interrupts (SEFIs). Innovations have been developed for mitigating the effects of SEUs and SEFIs, enabling the use of very-highspeed commercial DSPs with improved SEU tolerances. Time-triple modular redundancy (TTMR) is a method of applying traditional triple modular redundancy on a single processor, exploiting the VLIW (very long instruction word) class of parallel processors. TTMR improves SEU rates substantially. SEFIs are solved by a SEFI-hardened core circuit, external to the microprocessor. It monitors the health of the processor, and if a SEFI occurs, forces the processor to return to performance through a series of escalating events. TTMR and hardened-core solutions were developed for both DSPs and reconfigurable field-programmable gate arrays (FPGAs). This includes advancement of TTMR algorithms for DSPs and reconfigurable FPGAs, plus a rad-hard, hardened-core integrated circuit that services both the DSP and FPGA. Additionally, a combined DSP and FPGA board architecture was fully developed into a rad-hard engineering product. This technology enables use of commercial off-the-shelf (COTS) DSPs in computers for satellite and other space applications, allowing rapid deployment at a much lower cost. Traditional rad-hard space computers are very expensive and typically have long lead times. These computers are either based on traditional rad-hard processors, which have extremely low computational performance, or triple modular redundant (TMR) FPGA arrays, which suffer from power and complexity issues. Even more frustrating is that the TMR arrays of FPGAs require a fixed, external rad-hard voting element, thereby causing them to lose much of their reconfiguration capability and in some cases significant speed reduction. The benefits of COTS high-performance signal processing include significant increase in onboard science data processing, enabling orders of magnitude reduction in required communication bandwidth for science data return, orders of magnitude improvement in onboard mission planning and critical decision making, and the ability to rapidly respond to changing mission environments, thus enabling opportunistic science and orders of magnitude reduction in the cost of mission operations through reduction of required staff. Additional benefits of COTS-based, high-performance signal processing include the ability to leverage considerable commercial and academic investments in advanced computing tools, techniques, and infra structure, and the familiarity of the science and IT community with these computing environments.

Czajkowski, David↗

Performance Considerations for the SIMPL Single Photon, Polarimetric, Two-Color Laser Altimeter as Applied to Measurements of Forest Canopy Structure and Composition

The Slope Imaging Multi-polarization Photon-counting Lidar (SIMPL) is a multi-beam, micropulse airborne laser altimeter that acquires active and passive polarimetric optical remote sensing measurements at visible and near-infrared wavelengths. SIMPL was developed to demonstrate advanced measurement approaches of potential benefit for improved, more efficient spaceflight laser altimeter missions. SIMPL data have been acquired for wide diversity of forest types in the summers of 2010 and 2011 in order to assess the potential of its novel capabilities for characterization of vegetation structure and composition. On each of its four beams SIMPL provides highly-resolved measurements of forest canopy structure by detecting single-photons with 15 cm ranging precision using a narrow-beam system operating at a laser repetition rate of 11 kHz. Associated with that ranging data SIMPL provides eight amplitude parameters per beam unlike the single amplitude provided by typical laser altimeters. Those eight parameters are received energy that is parallel and perpendicular to that of the plane-polarized transmit pulse at 532 nm (green) and 1064 nm (near IR), for both the active laser backscatter retro-reflectance and the passive solar bi-directional reflectance. This poster presentation will cover the instrument architecture and highlight the performance of the SIMPL instrument with examples taken from measurements for several sites with distinct canopy structures and compositions. Specific performance areas such as probability of detection, after pulsing, and dead time, will be highlighted and addressed, along with examples of their impact on the measurements and how they limit the ability to accurately model and recover the canopy properties. To assess the sensitivity of SIMPL's measurements to canopy properties an instrument model has been implemented in the FLIGHT radiative transfer code, based on Monte Carlo simulation of photon transport. SIMPL data collected in 2010 over the Smithsonian Environmental Research Center, MD are currently being modelled and compared to other remote sensing and in situ data sets. Results on the adaptation of FLIGHT to model micropulse, single'photon ranging measurements are presented elsewhere at this conference. NASA's ICESat-2 spaceflight mission, scheduled for launch in 2016, will utilize a multi-beam, micropulse, single-photon ranging measurement approach (although non-polarimetric and only at 532 nm). Insights gained from the analysis and modelling of SIMPL data will help guide preparations for that mission, including development of calibration/validation plans and algorithms for the estimation of forest biophysical parameters.

Dabney, Philip W.↗

Radiative Characteristics of Clouds Embedded in Smoke Derived from Airborne Multiangular Measurements

Clouds in the presence of absorbing aerosols result in their apparent darkening, observed at the top of atmosphere (TOA), which is associated with the radiative effects of aerosol absorption. Owing to the large radiative effect and potential impacts on regional climate, above-cloud aerosols have recently been characterized in multiple satellite-based studies. While satellite data are particularly useful in showing the radiative impact of above-cloud aerosols at the TOA, recent literature indicates large uncertainties in satellite retrievals of above-cloud aerosol optical depth (AOD) and single scattering albedo (SSA), which are among the most important parameters in the assessment of associated radiative effects. In this study, we analyze radiative characteristics of clouds in the presence of wildfire smoke using airborne data primarily from NASA's Cloud Absorption Radiometer, collected during the Arctic Research of the Composition of the Troposphere from Aircraft and Satellites campaign in Canada during the 2008 summer season. We found a strong positive reflectance (R) gradient in the UV-visible (VIS)-near infrared (NIR) spectrum for clouds embedded in dense smoke, as opposed to an (expected) negative gradient for cloud-free smoke and a flat spectrum for smoke-free cloud cover. Several cases of clouds embedded in thick smoke were found, when the aircraft made circular/spiral measurements, which not only allowed the complete characterization of angular distribution of smoke scattering but also provided the vertical distribution of smoke and clouds (within 0.5-5 km). Specifically, the largest darkening by smoke was found in the UV/VIS, with R(sub 0.34 microns) reducing to 0.2 (or 20%), in contrast to 0.8 at NIR wavelengths (e.g., 1.27 microns). The observed darkening is associated with large AODs (0.5-3.0) and moderately low SSA (0.85-0.93 at 0.53 microns), resulting in a significantly large instantaneous aerosol forcing efficiency of 254 +/- 47 W/sq m/τ. Our observations of smoke-cloud radiative interactions were found to be physically consistent with theoretical plane-parallel 1-D and Monte Carlo 3-D radiative transfer calculations, capturing the observed gradient across UV-VIS-NIR. Results from this study offer insights into aerosol-cloud radiative interactions and may help in better constraining satellite retrieval algorithms.

absorbing aerosols↗

Cloud Spatial Structure and 3D Radiative Transfer

Cloud radiative properties are sensitive to drop size and other parameters of cloud micro-structure, but also to cloud shape, spacing, and other parameters of cloud macro-structure, including internal fractal structure. New information on cloud structure is being derived from a variety of cloud radars and lidars. Ongoing field programs such as DoE/ARM are improving the measurement and modelling of physical and radiative properties of clouds. A parallel effort is underway to improve cloud remote sensing, especially from the new suite of EOS (Earth Observing System) instruments which are beginning to provide higher spectral, spatial resolution, and/or angular resolution. Key parameters for improving pixel-scale retrievals are cloud thickness and photon mean-free-path, which together determine the scale of "radiative smoothing" of cloud fluxes and radiances. This scale has been observed as a change in the spatial spectrum of Landsat cloud radiances, and was also recently found with the Goddard micropulse lidar, by searching for returns from directions nonparallel to the incident beam. "Offbeam" Lidar returns are now being used to estimate the cloud "radiative Green's function", (G). G depends on cloud thickness and may be used to retrieve that important quantity. G is also being applied to improving simple estimates of cloud radiative properties that are based on the "Independent Pixel Approximation" or IPA. This and other measurements of 3D transfer in clouds, coupled with Monte Carlo and other 3D transfer methods, are beginning to provide a better understanding of the dependence of radiation on cloud inhomogeneity, and to suggest new retrieval and parameterization algorithms which take account of cloud inhomogeneity. An international "Intercomparison of 3D Radiation Codes" or I3RC, program is underway to coordinate and evaluate the variety of 3D radiative transfer methods now available, and to make them more widely available. Information is on the Web at: http://climate.gsfc.nasa.gov/I3RC. Input consists of selected cloud fields derived from data sources such as radar, microwave and satellite, and from models involved in the GEWEX Cloud Systems Studies. Output is selected radiative quantities that characterize the large-scale properties of the fields of radiative fluxes and heating. Several example cloud fields will be used to illustrate the effects of cloud inhomogeneity and 3D radiation.

Cahalan, Robert F.↗

Cloud Spatial Structure and 3D Radiative Transfer

Cloud radiative properties are sensitive to drop size and other parameters of cloud micro-structure, but also to cloud shape, spacing, and other parameters of cloud macro-structure, including internal fractal structure. New information on cloud structure is being derived from a variety of cloud radars and lidars. Ongoing field programs such as DoE/ARM (atmospheric radiation measurement) are improving the measurement and modelling of physical and radiative properties of clouds. A parallel effort is underway to improve cloud remote sensing, especially from the new suite of EOS (Earth observing system) instruments which are beginning to provide higher spectral, spatial resolution, and/or angular resolution. Key parameters for improving pixel-scale retrievals are cloud thickness and photon mean-free-path, which together determine the scale of 'radiative smoothing' of cloud fluxes and radiances. This scale has been observed as a change in the spatial spectrum of Landsat cloud radiances, and was also recently found with the Goddard micropulse lidar, by searching for returns from directions nonparallel to the incident beam. 'Offbeam' Lidar returns are now being used to estimate the cloud 'radiative Green's function' (G). G depends on cloud thickness and may be used to retrieve that important quantity. G is also being applied to improving simple estimates of cloud radiative properties that are based on the 'Independent Pixel Approximation' or IPA. This and other measurements of 3D (three dimensional) transfer in clouds, coupled with Monte Carlo and other 3D transfer methods, are beginning to provide a better understanding of the dependence of radiation on cloud inhomogeneity, and to suggest new retrieval and parameterization algorithms which take account of cloud inhomogeneity. An international 'Intercomparison of 3D Radiation Codes' (I3RC) program is underway to coordinate and evaluate the variety of 3D radiative transfer methods now available, and to make them more widely available. Information is on the Web at: http://climate.gsfc.nasa.gov/I3RC. Input consists of selected cloud fields derived from data sources such as radar, microwave and satellite, and from models involved in the GEWEX Cloud Systems Studies. Output is selected radiative quantities that characterize the large-scale properties of the fields of radiative fluxes and heating. Several example cloud fields will be used to illustrate the effects of cloud inhomogeneity and 3D radiation.

Cahalan, Robert F.↗

Development and Airborne Demonstration of the Concurrent Artificially-Intelligent Spectrometry and Adaptive Lidar System: Advancing Lidar Capabilities for the STV Observing System

We report on the design, build and planned airborne demonstration of a spaceflight-prototype Concurrent Artificially-intelligent Spectrometry and Adaptive Lidar System (CASALS). The CASALS lidar is an Adaptive Wavelength Scanning Lidar (AWSL) operating in push broom mode. The demonstration has three major goals: advance the Technical Readiness Level of the AWSL hardware, validate its measurement performance and mature algorithms and methods needed for the Surface Topography and Vegetation (STV) observing system. AWSL acquires parallel tracks of surface heights by rapidly steering a laser beam across a swath. A 1040nm-centered laser is tuned across 30nm and carved into 2-ns pulses, the pulse energy is fiber amplified and the pulses are dispersed cross-track using a non-mechanical wavelength-to-angle grating. For the spaceflight system the beam will be pointable to 1200 10m footprints across a 7km swath. For the airborne demonstration there will be 256 0.7m footprints across a 110m swath. In both cases the footprints overlap across- and along-track for uniform target illumination. For the airborne demonstration a steering mirror will increase the accessible swath width to 4km. At the receiver, solar radiation is filtered with a narrow-slit grating-spectrometer and the footprints are imaged onto a linear-mode, photon-sensitive HgCdTe APD-array. The received pulses are time-division-multiplexed to a few high-speed analog-to-digital converters to record waveforms. Spaceflight and airborne CASALS are designed to nominally detect 20 photons per pulse and, by averaging 27 overlapping footprints, achieve 2cm flat target range precision and high-quality vegetation structure waveforms The AWSL will be flown in the summer of 2024, along with a Headwall VNIR-SWIR hyperspectral sensor imaging a 4km wide swath, at NEON eddy covariance flux towers in the U.S. mid-Atlantic where high resolution hyperspectral and lidar data, acquired annually, are available for validation.

Guangning Yang↗

TRMM Fire Algorithm, Product and Applications

Land fires are frequent menaces to human lives and property. They also change the state of the vegetation and contribute to the climate forcing by releasing large amount of aerosols and greenhouse gases into the atmosphere. This paper summarizes methodologies of detecting global land fires from the Tropical Rainfall Measuring Mission (TRMM) Visible Infrared Scanner FIRS) measurements. The TRMM Science Data and Information System (TSDIS) fire products include global images of daily hot spots and monthly fire counts at 0.5 deg. x 0.5 deg. resolution, as well as text fiies that details necessary information of all fire pixels. The information includes date, orbit number, pixel number, local time, solar zenith angle, latitude, longitude, reflectance of visible/near infrared channels, brightness temperatures of infrared channels, as well as background brightness temperatures of infrared channels. These products have been archived since January 1998. The TSDIS fire products are compared with the coincidental European Commission (EC) Joint Research Center (JRC) 1 km AVHRR fire products. Analyses of the TSDIS monthly fire products during the period from 1998 to 2003 manifested seasonal cycles of biomass fires over Southeast Asia, Africa, North America and South America. The data also showed interannual variations associated with the 98/99 ENS0 cycle in Central America and the Indonesian region. In order to understand the variability of global land fires and their effects on the distribution of atmospheric aerosols, statistical methods were applied to the TSDIS fire products as well as to the Total Ozone Mapping Spectrometer (TOMS) aerosol index products for a period of five years from January 1998 to December 2002. The variability of global atmospheric aerosol is consistent with the fire variations over these regions during this period. The correlation between fire count and TOMS aerosol index is about 0.55 for fire pixels in Southeast Asia, Indonesia, and Africa. Parallel statistical analyses such as Empirical Orthogonal Function (EOF) analysis and Singular Spectrum Analysis (SSA) methods were applied to pentad TRMM fire data and TOMS aerosol data. The EOF analyses showed contrast between North and South hemispheres and also inter- continental transitions in Africa and America. EOF and SSA analyses also identified 25-60 day intra-seasonal oscillations that were superimposed on the annual cycles of both fire and aerosol data. The intra-seasonal variability of fires showed similarity of tropical rainfall oscillation modes. The TRMM fire products were also compared to the coincident TRMh4 rainfall and other rainfall products to investigate the interaction between rainfall and fire. The results indicate that the annual, interannual and intraseasonal variability of fire are dominated by global rainfall variations. However, the feedback of fire to the rainfall occurrence at regional scale for certain regions is also evident.

Ji, Yi-Min↗

Parallel Simulation of Unsteady Turbulent Flames

Time-accurate simulation of turbulent flames in high Reynolds number flows is a challenging task since both fluid dynamics and combustion must be modeled accurately. To numerically simulate this phenomenon, very large computer resources (both time and memory) are required. Although current vector supercomputers are capable of providing adequate resources for simulations of this nature, the high cost and their limited availability, makes practical use of such machines less than satisfactory. At the same time, the explicit time integration algorithms used in unsteady flow simulations often possess a very high degree of parallelism, making them very amenable to efficient implementation on large-scale parallel computers. Under these circumstances, distributed memory parallel computers offer an excellent near-term solution for greatly increased computational speed and memory, at a cost that may render the unsteady simulations of the type discussed above more feasible and affordable.This paper discusses the study of unsteady turbulent flames using a simulation algorithm that is capable of retaining high parallel efficiency on distributed memory parallel architectures. Numerical studies are carried out using large-eddy simulation (LES). In LES, the scales larger than the grid are computed using a time- and space-accurate scheme, while the unresolved small scales are modeled using eddy viscosity based subgrid models. This is acceptable for the moment/energy closure since the small scales primarily provide a dissipative mechanism for the energy transferred from the large scales. However, for combustion to occur, the species must first undergo mixing at the small scales and then come into molecular contact. Therefore, global models cannot be used. Recently, a new model for turbulent combustion was developed, in which the combustion is modeled, within the subgrid (small-scales) using a methodology that simulates the mixing and the molecular transport and the chemical kinetics within each LES grid cell. Finite-rate kinetics can be included without any closure and this approach actually provides a means to predict the turbulent rates and the turbulent flame speed. The subgrid combustion model requires resolution of the local time scales associated with small-scale mixing, molecular diffusion and chemical kinetics and, therefore, within each grid cell, a significant amount of computations must be carried out before the large-scale (LES resolved) effects are incorporated. Therefore, this approach is uniquely suited for parallel processing and has been implemented on various systems such as: Intel Paragon, IBM SP-2, Cray T3D and SGI Power Challenge (PC) using the system independent Message Passing Interface (MPI) compiler. In this paper, timing data on these machines is reported along with some characteristic results.

Menon, Suresh↗

Efficacy of Code Optimization on Cache-based Processors

The current common wisdom in the U.S. is that the powerful, cost-effective supercomputers of tomorrow will be based on commodity (RISC) micro-processors with cache memories. Already, most distributed systems in the world use such hardware as building blocks. This shift away from vector supercomputers and towards cache-based systems has brought about a change in programming paradigm, even when ignoring issues of parallelism. Vector machines require inner-loop independence and regular, non-pathological memory strides (usually this means: non-power-of-two strides) to allow efficient vectorization of array operations. Cache-based systems require spatial and temporal locality of data, so that data once read from main memory and stored in high-speed cache memory is used optimally before being written back to main memory. This means that the most cache-friendly array operations are those that feature zero or unit stride, so that each unit of data read from main memory (a cache line) contains information for the next iteration in the loop. Moreover, loops ought to be 'fat', meaning that as many operations as possible are performed on cache data-provided instruction caches do not overflow and enough registers are available. If unit stride is not possible, for example because of some data dependency, then care must be taken to avoid pathological strides, just ads on vector computers. For cache-based systems the issues are more complex, due to the effects of associativity and of non-unit block (cache line) size. But there is more to the story. Most modern micro-processors are superscalar, which means that they can issue several (arithmetic) instructions per clock cycle, provided that there are enough independent instructions in the loop body. This is another argument for providing fat loop bodies. With these restrictions, it appears fairly straightforward to produce code that will run efficiently on any cache-based system. It can be argued that although some of the important computational algorithms employed at NASA Ames require different programming styles on vector machines and cache-based machines, respectively, neither architecture class appeared to be favored by particular algorithms in principle. Practice tells us that the situation is more complicated. This report presents observations and some analysis of performance tuning for cache-based systems. We point out several counterintuitive results that serve as a cautionary reminder that memory accesses are not the only factors that determine performance, and that within the class of cache-based systems, significant differences exist.

VanderWijngaart, Rob F.↗

Serial-Turbo-Trellis-Coded Modulation with Rate-1 Inner Code

Serially concatenated turbo codes have been proposed to satisfy requirements for low bit- and word-error rates and for low (in comparison with related previous codes) complexity of coding and decoding algorithms and thus low complexity of coding and decoding circuitry. These codes are applicable to such high-level modulations as octonary phase-shift keying (8PSK) and 16-state quadrature amplitude modulation (16QAM); the signal product obtained by applying one of these codes to one of these modulations is denoted, generally, as serially concatenated trellis-coded modulation (SCTCM). These codes could be particularly beneficial for communication systems that must be designed and operated subject to limitations on bandwidth and power. Some background information is prerequisite to a meaningful summary of this development. Trellis-coded modulation (TCM) is now a well-established technique in digital communications. A turbo code combines binary component codes (which typically include trellis codes) with interleaving. A turbo code of the type that has been studied prior to this development is composed of parallel concatenated convolutional codes (PCCCs) implemented by two or more constituent systematic encoders joined through one or more interleavers. The input information bits feed the first encoder and, after having been scrambled by the interleaver, enter the second encoder. A code word of a parallel concatenated code consists of the input bits to the first encoder followed by the parity check bits of both encoders. The suboptimal iterative decoding structure for such a code is modular, and consists of a set of concatenated decoding modules one for each constituent code connected through an interleaver identical to the one in the encoder side. Each decoder performs weighted soft decoding of the input sequence. PCCCs yield very large coding gains at the cost of a reduction in the data rate and/or an increase in bandwidth.

Divsalar, Dariush↗

Maximizing TDRS Command Load Lifetime

The GNC software onboard ISS utilizes TORS command loads, and a simplistic model of TORS orbital motion to generate onboard TORS state vectors. Each TORS command load contains five "invariant" orbital elements which serve as inputs to the onboard propagation algorithm. These elements include semi-major axis, inclination, time of last ascending node crossing, right ascension of ascending node, and mean motion. Running parallel to the onboard software is the TORS Command Builder Tool application, located in the JSC Mission Control Center. The TORS Command Builder Tool is responsible for building the TORS command loads using a ground TORS state vector, mirroring the onboard propagation algorithm, and assessing the fidelity of current TORS command loads onboard ISS. The tool works by extracting a ground state vector at a given time from a current TORS ephemeris, and then calculating the corresponding "onboard" TORS state vector at the same time using the current onboard TORS command load. The tool then performs a comparison between these two vectors and displays the relative differences in the command builder tool GUI. If the RSS position difference between these two vectors exceeds the tolerable lim its, a new command load is built using the ground state vector and uplinked to ISS. A command load's lifetime is therefore defined as the time from when a command load is built to the time the RSS position difference exceeds the tolerable limit. From the outset of TORS command load operations (STS-98), command load lifetime was limited to approximately one week due to the simplicity of both the onboard propagation algorithm, and the algorithm used by the command builder tool to generate the invariant orbital elements. It was soon desired to extend command load lifetime in order to minimize potential risk due to frequent ISS commanding. Initial studies indicated that command load lifetime was most sensitive to changes in mean motion. Finding a suitable value for mean motion was therefore the key to achieving this goal. This goal was eventually realized through development of an Excel spreadsheet tool called EMMIE (Excel Mean Motion Interactive Estimation). EMMIE utilizes ground ephemeris nodal data to perform a least-squares fit to inferred mean anomaly as a function of time, thus generating an initial estimate for mean motion. This mean motion in turn drives a plot of estimated downtrack position difference versus time. The user can then manually iterate the mean motion, and determine an optimal value that will maximize command load lifetime. Once this optimal value is determined, the mean motion initially calculated by the command builder tool is overwritten with the new optimal value, and the command load is built for uplink to ISS. EMMIE also provides the capability for command load lifetime to be tracked through multiple TORS ephemeris updates. Using EMMIE, TORS command load lifetimes of approximately 30 days have been achieved.

Brown, Aaron J.↗

DRAGONS-A Micrometeoroid and Orbital Debris Impact Sensor on the ISS

The Debris Resistive/Acoustic Grid Orbital Navy-NASA Sensor (DRAGONS) is intended to be a large area impact sensor for in situ measurements of micrometeoroids and orbital debris (MMOD) in the sub-millimeter to millimeter size regime in the near Earth space environment. These MMOD particles are too small to be detected by ground-based radars and optical telescopes, but still large enough to be a serious threat to human space activities and robotic missions in the low Earth orbit (LEO) region. The nominal detection area of DRAGONS is 1 sq m, consisting of four 0.5 m × 0.5 m independent panels, but the dimensions of the panels can easily be modified to accommodate different payload constraints. The approach of the DRAGONS design is to combine three particle impact detection concepts to maximize information that can be extracted from each detected impact. The first is a resistive grid consisting of 75-micrometer-wide resistive lines, coated in parallel and separated by 75 micrometer gaps on a 25-micrometer thin film. When a particle a few hundred micrometers or larger strikes the grid, it would penetrate the film and sever some resistive lines. The size of the damage area can be estimated from the increased resistance. The second concept is based on polyvinylidene fluoride (PVDF) acoustic impact sensors. Multiple PVDF sensors are attached to the thin film to provide the impact timing information. From the different signal arrival times at different acoustic sensors, the impact location can be calculated via triangulation algorithms. The third concept employs a dual-layer film system where a second 25-micrometer film is placed 15 cm behind the resistive-grid film. Multiple PVDF acoustic sensors are also attached to the second film. The combination of impact timing and location information from the two films allows for direct measurements of the impact direction and speed. The DRAGONS technology development has been funded by several NASA organizations since 2002, first by the NASA Science Mission Directorate and the NASA Exploration Systems Mission Directorate, then by the NASA JSC Innovative Research and Development Program and the NASA Orbital Debris Program Office. The NASA Orbital Debris Program Office leads the effort with collaboration from the U.S. Naval Academy, Naval Research Laboratory, University of Kent at Canterbury in Great Britain, and Virginia Tech. The project recently reached a major milestone when DRAGONS was approved for a technology demonstration mission by the International Space Station (ISS) Program in October 2014. The plan is to deploy a 1 sq m DRAGONS on the ISS with the detection surface facing the ram-direction for 2 to 3 years. The tentative launch schedule is in early 2017. This mission will collect data on orbital debris in the sub-millimeter size regime to better define the small orbital debris environment at the ISS altitude. The mission will also advance the DRAGONS Technology Readiness Level to 9 and greatly enhance the opportunities to deploy DRAGONS on other spacecraft to high LEO orbits in the future.

Liou, J.-C.↗

Performance of an Optimized Eta Model Code on the Cray T3E and a Network of PCs

In the year 2001, NASA will launch the satellite TRIANA that will be the first Earth observing mission to provide a continuous, full disk view of the sunlit Earth. As a part of the HPCC Program at NASA GSFC, we have started a project whose objectives are to develop and implement a 3D cloud data assimilation system, by combining TRIANA measurements with model simulation, and to produce accurate statistics of global cloud coverage as an important element of the Earth's climate. For simulation of the atmosphere within this project we are using the NCEP/NOAA operational Eta model. In order to compare TRIANA and the Eta model data on approximately the same grid without significant downscaling, the Eta model will be integrated at a resolution of about 15 km. The integration domain (from -70 to +70 deg in latitude and 150 deg in longitude) will cover most of the sunlit Earth disc and will continuously rotate around the globe following TRIANA. The cloud data assimilation is supposed to run and produce 3D clouds on a near real-time basis. Such a numerical setup and integration design is very ambitious and computationally demanding. Thus, though the Eta model code has been very carefully developed and its computational efficiency has been systematically polished during the years of operational implementation at NCEP, the current MPI version may still have problems with memory and efficiency for the TRIANA simulations. Within this work, we optimize a parallel version of the Eta model code on a Cray T3E and a network of PCs (theHIVE) in order to improve its overall efficiency. Our optimization procedure consists of introducing dynamically allocated arrays to reduce the size of static memory, and optimizing on a single processor by splitting loops to limit the number of streams. All the presented results are derived using an integration domain centered at the equator, with a size of 60 x 60 deg, and with horizontal resolutions of 1/2 and 1/3 deg, respectively. In accompanying charts we report the elapsed time, the speedup and the Mflops as a function of the number of processors for the non-optimized version of the code on the T3E and theHIVE. The large amount of communication required for model integration explains its poor performance on theHIVE. Our initial implementation of the dynamic memory allocation has contributed to about 12% reduction of memory but has introduced a 3% overhead in computing time. This overhead was removed by performing loop splitting in some of the high demanding subroutines. When the Eta code is fully optimized in order to meet the memory requirement for TRIANA simulations, a non-negligeable overhead may appear that may seriously affect the efficiency of the code. To alleviate this problem, we are considering implementation of a new algorithm for the horizontal advection that is computationally less expensive, and also a new approach for marching in time.

Kouatchou, Jules↗

Temporal and spatial variability in surface roughness and accumulation rate around 88° S from repeat airborne geophysical surveys

We use repeat high-resolution airborne geophysical data consisting of laser altimetry, snow, and Ku-band radar and optical imagery acquired in 2014, 2016, and 2017 to analyze the spatial and temporal variability in surface roughness, slope, wind deposition, and snow accumulation at 88° S, an elevation bias validation site for ICESat-2 and potential validation site for CryoSat-2. We find significant small-scale variability (<10 km) in snow accumulation based on the snow radar subsurface stratigraphy, indicating areas of strong wind redistribution are prevalent at 88° S. In general, highs in snow accumulation rate correspond with topographic lows, resulting in a negative correlation coefficient of r(exp 2)=−0.32 between accumulation rate and MSWD (mean slope in the mean wind direction). This relationship is strongest in areas where the dominant wind direction is parallel to the survey profile, which is expected as the geophysical surveys only capture a two-dimensional cross section of snow redistribution. Variability in snow accumulation appears to correlate with variability in MSWD. The correlation coefficient between the standard deviations of accumulation rate and MSWD is r(exp 2)=0.48, indicating a stronger link between the standard deviations than the actual parameters. Our analysis shows that there is no simple relationship between surface slope, wind direction, and snow accumulation rates for the overall survey area. We find high variability in surface roughness derived from laser altimetry measurements on length scales smaller than 10 km, sometimes with very distinct and sharp transitions. Some areas also show significant temporal variability over the course of the 3 survey years. Ultimately, there is no statistically significant slope-independent relationship between surface roughness and accumulation rates within our survey area. The observed correspondence between the small-scale temporal and spatial variability in surface roughness and backscatter, as evidenced by Ku-band radar signal strength retrievals, will make it difficult to develop elevation bias corrections for radar altimeter retrieval algorithms.

Michael Studinger↗

Progress of the NASA/USGS Lunar Regolith Simulant Project

Beginning in 2004 personnel at MSFC began serious efforts to develop a new generation of lunar simulants. The first two products were a replication of the previous JSC-1 simulant under a contract to Orbitec and a major workshop in 2005 on future simulant development. Beginning in 2006 the project refocused its efforts and approached simulant development in a new and more comprehensive manner, examining new approaches in simulant development and ways to more accurately compare simulants to actual lunar materials. This led to a multi-year effort with five major tasks running in parallel. The five tasks are Requirements, Lunar Analysis, Process Development, Feed Stocks, and Standards. Major progress has been made in all five areas. A substantial draft of a formal requirements document now exists and has been largely stable since 2007. It does evolve as specific details of the standards and Lunar Analysis efforts proceed. Lunar Analysis has turned out to be vastly more difficult than anticipated. After great effort to mine existing published and gray literature, the team has realized the necessity of making new measurements of the Apollo samples, an effort that is currently in progress. Process development is substantially ahead of expectations in 2006. It is now practical to synthesize glasses of appropriate composition and purity. It is also possible to make agglutinate particles in significant quantities. A series of minerals commonly found on the Moon has been synthesized. Separation of mineral constituents from starting rock material is also proceeding. Customized grinding and mixing processes have been developed and tested are now being documented. Identification and development of appropriate feedstocks has been both easier and more difficult than anticipated. The Stillwater Mining Company, operating in the Stillwater layered mafic intrusive complex of Montana, has been an amazing resource for the project, but finding adequate sources for some of the components remains a difficult problem. For example the ratio of clino- to ortho-pyroxenes in the Stillwater is not an exact match for lunar materials. One of the sources being examined as an alternative pyroxene source is the Bushveld Complex in South Africa. Standards have been a major success for the project. The Figure of Merit algorithms have been created, tested, and are being considered for an ISO standard. Agreement has been reached in the community about how to make many of the critical measurements. There remains much work to do: (1) driving down the cost of simulants remains a major obstacle; (2) documentation and cost data analysis have not kept up with progress; (3) educating users in the complexity of the lunar regolith and the use of simulants remains a major task. In summary the project has made enormous progress and is successfully placing simulant development and use on a rigorous, scientifically defensible, engineering basis.

Rickman, Doug↗

Implementing Scientific Simulation Codes Highly Tailored for Vector Architectures Using Custom Configurable Computing Machines

The motivation for this work comes from an observation that amidst the push for Massively Parallel (MP) solutions to high-end computing problems such as numerical physical simulations, large amounts of legacy code exist that are highly optimized for vector supercomputers. Because re-hosting legacy code often requires a complete re-write of the original code, which can be a very long and expensive effort, this work examines the potential to exploit reconfigurable computing machines in place of a vector supercomputer to implement an essentially unmodified legacy source code. Custom and reconfigurable computing resources could be used to emulate an original application's target platform to the extent required to achieve high performance. To arrive at an architecture that delivers the desired performance subject to limited resources involves solving a multi-variable optimization problem with constraints. Prior research in the area of reconfigurable computing has demonstrated that designing an optimum hardware implementation of a given application under hardware resource constraints is an NP-complete problem. The premise of the approach is that the general issue of applying reconfigurable computing resources to the implementation of an application, maximizing the performance of the computation subject to physical resource constraints, can be made a tractable problem by assuming a computational paradigm, such as vector processing. This research contributes a formulation of the problem and a methodology to design a reconfigurable vector processing implementation of a given application that satisfies a performance metric. A generic, parametric, architectural framework for vector processing implemented in reconfigurable logic is developed as a target for a scheduling/mapping algorithm that maps an input computation to a given instance of the architecture. This algorithm is integrated with an optimization framework to arrive at a specification of the architecture parameters that attempts to minimize execution time, while staying within resource constraints. The flexibility of using a custom reconfigurable implementation is exploited in a unique manner to leverage the lessons learned in vector supercomputer development. The vector processing framework is tailored to the application, with variable parameters that are fixed in traditional vector processing. Benchmark data that demonstrates the functionality and utility of the approach is presented. The benchmark data includes an identified bottleneck in a real case study example vector code, the NASA Langley Terminal Area Simulation System (TASS) application.

Rutishauser, David↗

Investigating the Simulink Auto-Coding Process

Model based program design is the most clear and direct way to develop algorithms and programs for interfacing with hardware. While coding "by hand" results in a more tailored product, the ever-growing size and complexity of modern-day applications can cause the project work load to quickly become unreasonable for one programmer. This has generally been addressed by splitting the product into separate modules to allow multiple developers to work in parallel on the same project, however this introduces new potentials for errors in the process. The fluidity, reliability and robustness of the code relies on the abilities of the programmers to communicate their methods to one another; furthermore, multiple programmers invites multiple potentially differing coding styles into the same product, which can cause a loss of readability or even module incompatibility. Fortunately, Mathworks has implemented an auto-coding feature that allows programmers to design their algorithms through the use of models and diagrams in the graphical programming environment Simulink, allowing the designer to visually determine what the hardware is to do. From here, the auto-coding feature handles converting the project into another programming language. This type of approach allows the designer to clearly see how the software will be directing the hardware without the need to try and interpret large amounts of code. In addition, it speeds up the programming process, minimizing the amount of man-hours spent on a single project, thus reducing the chance of human error as well as project turnover time. One such project that has benefited from the auto-coding procedure is Ramses, a portion of the GNC flight software on-board Orion that has been implemented primarily in Simulink. Currently, however, auto-coding Ramses into C++ requires 5 hours of code generation time. This causes issues if the tool ever needs to be debugged, as this code generation will need to occur with each edit to any part of the program; additionally, this is lost time that could be spent testing and analyzing the code. This is one of the more prominent issues with the auto-coding process, and while much information is available with regard to optimizing Simulink designs to produce efficient and reliable C++ code, not much research has been made public on how to reduce the code generation time. It is of interest to develop some insight as to what causes code generation times to be so significant, and determine if there are architecture guidelines or a desirable auto-coding configuration set to assist in streamlining this step of the design process for particular applications. To address the issue at hand, the Simulink coder was studied at a foundational level. For each different component type made available by the software, the features, auto-code generation time, and the format of the generated code were analyzed and documented. Tools were developed and documented to expedite these studies, particularly in the area of automating sequential builds to ensure accurate data was obtained. Next, the Ramses model was examined in an attempt to determine the composition and the types of technologies used in the model. This enabled the development of a model that uses similar technologies, but takes a fraction of the time to auto-code to reduce the turnaround time for experimentation. Lastly, the model was used to run a wide array of experiments and collect data to obtain knowledge about where to search for bottlenecks in the Ramses model. The resulting contributions of the overall effort consist of an experimental model for further investigation into the subject, as well as several automation tools to assist in analyzing the model, and a reference document offering insight to the auto-coding process, including documentation of the tools used in the model analysis, data illustrating some potential problem areas in the auto-coding process, and recommendations on areas or practices in the current Ramses model that should be further investigated. Several skills were required to be built up over the course of the internship project. First and foremost, my Simulink skills have improved drastically, as much of my experience had been modeling electronic circuits as opposed to software models. Furthermore, I am now comfortable working with the Simulink Auto-coder, a tool I had never used until this summer; this tool also tested my critical thinking and C++ knowledge as I had to interpret the C++ code it was generating and attempt to understand how the Simulink model affected the generated code. I had come into the internship with a solid understanding of Matlab code, but had done very little in using it to automate tasks, particularly Simulink tasks; along the same lines, I had rarely used shell script to automate and interface with programs, which I gained a fair amount of experience with this summer, including how to use regular expression. Lastly, soft-skills are an area everyone can continuously improve on; having never worked with NASA engineers, which to me seem to be a completely different breed than what I am used to (commercial electronic engineers), I learned to utilize the wealth of knowledge present at JSC. I wish I had come into the internship knowing exactly how helpful everyone in my branch would be, as I would have picked up on this sooner. I hope that having gained such a strong foundation in Simulink over this summer will open the opportunity to return to work on this project, or potentially other opportunities within the division. The idea of leaving a project I devoted ten weeks to is a hard one to cope with, so having the chance to pick up where I left off sounds appealing; alternatively, I am interested to see if there are any opening in the future that would allow me to work on a project that is more in-line with my research in estimation algorithms. Regardless, this summer has been a milestone in my professional career, and I hope this has started a long-term relationship between JSC and myself. I really enjoy the thought of building on my experience here over future summers while I work to complete my PhD at Missouri University of Science and Technology.

Gualdoni, Matthew J.↗

Spiking Neurons for Analysis of Patterns

Artificial neural networks comprising spiking neurons of a novel type have been conceived as improved pattern-analysis and pattern-recognition computational systems. These neurons are represented by a mathematical model denoted the state-variable model (SVM), which among other things, exploits a computational parallelism inherent in spiking-neuron geometry. Networks of SVM neurons offer advantages of speed and computational efficiency, relative to traditional artificial neural networks. The SVM also overcomes some of the limitations of prior spiking-neuron models. There are numerous potential pattern-recognition, tracking, and data-reduction (data preprocessing) applications for these SVM neural networks on Earth and in exploration of remote planets. Spiking neurons imitate biological neurons more closely than do the neurons of traditional artificial neural networks. A spiking neuron includes a central cell body (soma) surrounded by a tree-like interconnection network (dendrites). Spiking neurons are so named because they generate trains of output pulses (spikes) in response to inputs received from sensors or from other neurons. They gain their speed advantage over traditional neural networks by using the timing of individual spikes for computation, whereas traditional artificial neurons use averages of activity levels over time. Moreover, spiking neurons use the delays inherent in dendritic processing in order to efficiently encode the information content of incoming signals. Because traditional artificial neurons fail to capture this encoding, they have less processing capability, and so it is necessary to use more gates when implementing traditional artificial neurons in electronic circuitry. Such higher-order functions as dynamic tasking are effected by use of pools (collections) of spiking neurons interconnected by spike-transmitting fibers. The SVM includes adaptive thresholds and submodels of transport of ions (in imitation of such transport in biological neurons). These features enable the neurons to adapt their responses to high-rate inputs from sensors, and to adapt their firing thresholds to mitigate noise or effects of potential sensor failure. The mathematical derivation of the SVM starts from a prior model, known in the art as the point soma model, which captures all of the salient properties of neuronal response while keeping the computational cost low. The point-soma latency time is modified to be an exponentially decaying function of the strength of the applied potential. Choosing computational efficiency over biological fidelity, the dendrites surrounding a neuron are represented by simplified compartmental submodels and there are no dendritic spines. Updates to the dendritic potential, calcium-ion concentrations and conductances, and potassium-ion conductances are done by use of equations similar to those of the point soma. Diffusion processes in dendrites are modeled by averaging among nearest-neighbor compartments. Inputs to each of the dendritic compartments come from sensors. Alternatively or in addition, when an affected neuron is part of a pool, inputs can come from other spiking neurons. At present, SVM neural networks are implemented by computational simulation, using algorithms that encode the SVM and its submodels. However, it should be possible to implement these neural networks in hardware: The differential equations for the dendritic and cellular processes in the SVM model of spiking neurons map to equivalent circuits that can be implemented directly in analog very-large-scale integrated (VLSI) circuits.

Huntsberger, Terrance↗