Search NASA⌕ Search

SEARCH · Search NASA

Results for “code sharing”

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.

282 records · Page 16

Analysis of Measured and Predicted Acoustics From an XV-15 Flight Test

Flight acoustic and vehicle state data from an XV-15 acoustic flight test are examined. Flight predictions using TiltRotor Aeroacoustic Code (TRAC) are performed for a level flight (repeated) and four descent conditions (including a blade vortex interaction (BVI)). The assumptions and procedures used for TRAC flight predictions as well as the variability in flight measurements, which are used for input and comparison to predictions, are investigated in detail. Differences were found in the measured vehicle airspeed, altitude, glideslope, and vehicle orientation (yaw, pitch, and roll angle) between each of the repeat runs. These differences violate some of the prediction assumptions and significantly impacted the resulting acoustic predictions. Multiple acoustic pulses, with a variable time between the pulses, were found in the measured acoustic time histories for the repeat runs. These differences could be attributed in part to the variability in vehicle orientation. Acoustic predictions that used the measured vehicle orientation for the repeat runs captured this multiple pulse variability. Thickness noise was found to be dominant on approach for all the cases, except the BVI condition. After the aircraft passed overhead, broadband noise and low frequency loading noise were dominant. The predicted LowSPL time histories compared well with measurement on approach to the array for the non-BVI conditions and poorly for the BVI condition. Accurate prediction of the lift share between the rotor and fuselage must be known in order to improve predictions. At a minimum, measurements of the rotor thrust and tip-path-plane angle are critical to further develop accurate flight acoustic prediction capabilities.

Boyd, D. Douglas, Jr.↗

Rough-Wall Channel Analysis Using Suboptimal Control Theory

The original aim of this work was to shed some light on the physics of turbulence over rough walls using large-eddy simulations and the suboptimal-control wall boundary conditions introduced by Nicoud et al. It was hoped that, if that algorithm was used to fit the mean velocity profile of the simulations to that of a rough-walled channel, instead of to a smooth one, the wall stresses introduced by the control algorithm would give some indication of what aspects of rough walls are most responsible for the modification of the flow in real turbulence. It was similarly expected that the structure of the resulting velocity fluctuations would share some of the characteristics of rough-walled flows, thus again suggesting what is intrinsic and what is accidental in the effect of geometric wall roughness. A secondary goal was to study the effect of 'unphysical' boundary conditions on the outside flow by observing how a relatively major change of the target velocity profile, and therefore presumably of the applied wall stresses, modifies properties such as the dominant length scales of the velocity fluctuations away from the wall. As will be seen below, this secondary goal grew more important during the course of the study, which was carried out during a short summer visit of the first two authors to the CTR. It became clear that there are open questions about the way in which the control algorithm models the boundary conditions, even for smooth walls, and that these questions make the physical interpretation of the results difficult. Considerable more work in that area seems to be needed before even relatively advanced large-eddy simulations, such as these, can be used to draw conclusions about the physics of wall-bounded turbulent flows. The numerical method is the same as in Nicoud et al. The modifications introduced in the original code are briefly described in section 2, but the original paper should be consulted for a full description of the algorithm. The results are presented in section 3 and summarized in section 4. The elementary properties of turbulence over rough walls which are used in the text have been taken from recent reviews such as Raupach et al. or Jimenez.

Flores, O.↗

Development of a Computer Architecture to Support the Optical Plume Anomaly Detection (OPAD) System

The NASA OPAD spectrometer system relies heavily on extensive software which repetitively extracts spectral information from the engine plume and reports the amounts of metals which are present in the plume. The development of this software is at a sufficiently advanced stage where it can be used in actual engine tests to provide valuable data on engine operation and health. This activity will continue and, in addition, the OPAD system is planned to be used in flight aboard space vehicles. The two implementations, test-stand and in-flight, may have some differing requirements. For example, the data stored during a test-stand experiment are much more extensive than in the in-flight case. In both cases though, the majority of the requirements are similar. New data from the spectrograph is generated at a rate of once every 0.5 sec or faster. All processing must be completed within this period of time to maintain real-time performance. Every 0.5 sec, the OPAD system must report the amounts of specific metals within the engine plume, given the spectral data. At present, the software in the OPAD system performs this function by solving the inverse problem. It uses powerful physics-based computational models (the SPECTRA code), which receive amounts of metals as inputs to produce the spectral data that would have been observed, had the same metal amounts been present in the engine plume. During the experiment, for every spectrum that is observed, an initial approximation is performed using neural networks to establish an initial metal composition which approximates as accurately as possible the real one. Then, using optimization techniques, the SPECTRA code is repetitively used to produce a fit to the data, by adjusting the metal input amounts until the produced spectrum matches the observed one to within a given level of tolerance. This iterative solution to the original problem of determining the metal composition in the plume requires a relatively long period of time to execute the software in a modern single-processor workstation, and therefore real-time operation is currently not possible. A different number of iterations may be required to perform spectral data fitting per spectral sample. Yet, the OPAD system must be designed to maintain real-time performance in all cases. Although faster single-processor workstations are available for execution of the fitting and SPECTRA software, this option is unattractive due to the excessive cost associated with very fast workstations and also due to the fact that such hardware is not easily expandable to accommodate future versions of the software which may require more processing power. Initial research has already demonstrated that the OPAD software can take advantage of a parallel computer architecture to achieve the necessary speedup. Current work has improved the software by converting it into a form which is easily parallelizable. Timing experiments have been performed to establish the computational complexity and execution speed of major components of the software. This work provides the foundation of future work which will create a fully parallel version of the software executing in a shared-memory multiprocessor system.

Katsinis, Constantine↗

Interference Lattice-based Loop Nest Tilings for Stencil Computations

A common method for improving performance of stencil operations on structured multi-dimensional discretization grids is loop tiling. Tile shapes and sizes are usually determined heuristically, based on the size of the primary data cache. We provide a lower bound on the numbers of cache misses that must be incurred by any tiling, and a close achievable bound using a particular tiling based on the grid interference lattice. The latter tiling is used to derive highly efficient loop orderings. The total number of cache misses of a code is the sum of (necessary) cold misses and misses caused by elements being dropped from the cache between successive loads (replacement misses). Maximizing temporal locality is equivalent to minimizing replacement misses. Temporal locality of loop nests implementing stencil operations is optimized by tilings that avoid data conflicts. We divide the loop nest iteration space into conflict-free tiles, derived from the cache miss equation. The tiling involves the definition of the grid interference lattice an equivalence class of grid points whose images in main memory map to the same location in the cache-and the construction of a special basis for the lattice. Conflicts only occur on the boundaries of the tiles, unless the tiles are too thin. We show that the surface area of the tiles is bounded for grids of any dimensionality, and for caches of any associativity, provided the eccentricity of the fundamental parallelepiped (the tile spanned by the basis) of the lattice is bounded. Eccentricity is determined by two factors, aspect ratio and skewness. The aspect ratio of the parallelepiped can be bounded by appropriate array padding. The skewness can be bounded by the choice of a proper basis. Combining these two strategies ensures that pathologically thin tiles are avoided. They do not, however, minimize replacement misses per se. The reason is that tile visitation order influences the number of data conflicts on the tile boundaries. If two adjacent tiles are visited successively, there will be no replacement misses on the shared boundary. The iteration space may be covered with pencils larger than the size of the cache while avoiding data conflicts if the pencils are traversed by a scanning-face method. Replacement misses are incurred only on the boundaries of the pencils, and the number of misses is minimized by maximizing the volume of the scanning face, not the volume of the tile. We present an algorithm for constructing the most efficient scanning face for a given grid and stencil operator. In two dimensions it is based on a continued fraction algorithm. In three dimensions it follows Voronoi's successive minima algorithm. We show experimental results of using the scanning face, and compare with canonical loop orderings.

VanderWijngaart, Rob F.↗

Electra: A Modular-Based Expansion of NASA's Supercomputing Capability

NASA has increasingly relied on high-performance computing (HPC) re- sources for computational modeling, simulation, and data analysis to meet the science and engineering goals of its missions in space exploration, aeronautics, and Earth and space science. The NASA Advanced Supercomputing (NAS) Division at Ames Research Center in Silicon Valley, Calif., hosts NASA’s premier supercomputing resources, integral to achieving and enhancing the success of the agency’s missions. NAS provides a balanced environment, funded under the High-End Computing Capability (HECC) project, comprised of world-class supercomputers, including its flagship distributed-memory cluster, Pleiades; high-speed networking; and massive data storage facilities, along with multi-disciplinary support teams for user support, code porting and optimization, and large-scale data analysis and scientific visualization. However, as scientists have increased the fidelity of their simulations and engineers are conducting larger parameter-space studies, the requirements for supercomputing resources have been growing by leaps and bounds. With the facility housing the HECC systems reaching its power and cooling capacity, NAS undertook a prototype project to investigate an alternative approach for housing supercomputers. Modular supercomputing, or container-based computing, is an innovative concept for expanding NASA’s HPC capabilities. With modular supercomputing, additional containers—similar to portable storage pods—can be connected together as needed to accommodate the agency’s ever-increasing demand for computing resources. In addition, taking advantage of the local weather permits the use of cooling technologies that would additionally save energy and reduce annual water usage. The first stage of NASA’s Modular Supercomputing Facility (MSF) prototype, which resulted in a 1,000 square-foot module on a concrete pad with room for 16 compute racks, was completed in Fall 2016 and an SGI (now HPE) computer system, named Electra, was deployed there in early 2017. Cooling is performed via an evaporative system built into the module, and preliminary experience shows a Power Usage Effectiveness (PUE) measurement of 1.03. Electra achieved over a petaflop on the LINPACK benchmark, sufficient to rank number 96 on the November 2016 TOP500 list [14]. The system consists of 1,152 InfiniBand-connected Intel Xeon Broadwell-based nodes. Its users access their files on a facility-wide file system shared by all HECC compute assets via Mellanox MetroX InfiniBand extenders, which connect the Electra fabric to Lustre routers in the primary facility over fiber-optic links about 900 feet long. The MSF prototype has exceeded expectations and is serving as a blueprint for future expansions. In the remainder of this chapter, we detail how modular data center technology can be used to expand an existing compute resource. We begin by describing NASA’s requirements for supercomputing and how resources were provided prior to the integration of the Electra module-based system.

Biswas, Rupak↗

Deep Space Test Bed

The DSTB Facility provides a new capability for the National Aeronautics and Space Administration s (NASA s) Space Radiation Shielding Project (SRSP). The objective of the DSTB is to provide a platform to conduct radiation shielding investigations in an environment more similar to deep space than most Low Earth orbits or is achievable at a particle accelerator. The DSTB provides a means to experimentally test radiation shielding effectiveness of various materials and to test the accuracy of radiation transport code predictions in the deep space cosmic ray environment more frequently and at a lower cost compared to space flight missions. New spectrometers, dosimeters and other techniques may be exercised and verified using the DSTB before space flight. The DSTB will be implemented through NASA s National Scientific Balloon Facility (NSBF) which provides polar balloon flights that lift science payloads to high altitude (120,000 A. (36.58km)) to escape much of the shielding effects of the Earth s atmosphere and magnetosphere. Polar flights are conducted through NSBF in coordination with the United States Polar Program. The DSTB will be launched on a Long Duration Balloon (LDB) from McMurdo, Antarctica (77.86 degrees south latitude) for circumpolar flights, nominally 20 days, traveling to the west and typically bounded between 73 to 82 degrees south latitude. Float altitudes for these balloons with payload are 115,000 to 130,000 feet (35.05 to 39.62km). The DSTB will be able to accommodate up to 20 investigations per flight. Annual flight opportunities are planned starting in December 2005. Balloon campaigns in Antarctica occur in December and January during the Austral summer. Since a key goal of the DSTB facility is to efficiently serve the varied needs of the radiation shielding community; it must be designed with a flexible architecture. By implementing the DSTB facility with NASA s balloon program, which operates under reduced formalities compared to space flight, the DSTB facility can adjust for different investigation priorities on successive flights. This flexibility in the DSTB will be applied at several levels; in the distribution of the shared resources for each flight; addressing the payload configuration on a system level for each flight; and utilizing a selection process for investigations that considers yearly flight opportunities as well as the possibility for repeated flights. This approach for operating the DSTB facility will allow it to handle a wide range of investigations.

Milton, Martha E.↗

Delay Tolerant, Radio Frequency Identification (RFID )-enabled Sensing

Radio Frequency Identification (RFID) technology offers a completely passive method to transmit fixed data sequences from an RFID tag, which typically doesn’t have its own power supply, to an interrogator. Radio frequency (RF) energy harvested from the interrogator is rectified by the tag and used to charge an integrated circuit (IC). The IC then modulates the received signal with the data stored on the tag and reflects the energy back to the interrogator. RFID has seen great proliferation in terrestrial inventory management applications, and it has recently made the jump to spaceflight applications onboard the International Space Station, augmenting an existing optical bar‐code infrastructure for tracking supplies. A number of advanced automated logistics management (ALM) concepts employing RFID are currently being developed and evaluated, including so‐called “smart” shelves, cubbies, and trash receptacles using low‐power, embeddable RFID interrogators. An infrastructure where both crew members and robotic assistants, such as autonomous free flyers, are similarly equipped with small RFID interrogators seems likely. It therefore behooves us to consider extending this infrastructure beyond ALM to applications such as low power, embedded sensing. Typically, data on an RFID tag can only be written by an RFID interrogator, using interrogator energy. In recent years, however, a few efforts have focused on using that energy to drive data acquisition from the tag IC, allowing the tag to modify its stored data sequence with sensor data before replying to an interrogator. In this way, the tag can act as a completely passive sensing device. One problem exists with this approach, however: the tag cannot gather data when an interrogator is not present. Thus, strictly passive RFID sensing tags cannot gather data at regular intervals, in the manner of a typical wireless sensor network, without careful, and impractical, planning of mobile interrogator movements. To address this shortcoming, we look to a recent advance in RFID technology which allows an external microprocessor to power the tag IC and write directly into its RFID memory using a wired serial interface. In this paradigm, data gathering is driven by a small, on‐board power supply (using batteries or harvested energy), and data transfer is provided passively through the RFID interrogation service. Since communication typically consumes the lion’s share of power in WSNs, such a technique has the potential to enable extremely long‐lived, embedded wireless sensing when used with extremely low‐current microcontrollers. Since the communication channel is only open when an interrogator is present and actively interrogating the RFID sensing tag, transport of periodically‐sampled sensor data presents itself as a delay/disruption‐tolerant networking (DTN) problem. In this paper, we present the design of a DTN‐like overlay on the common EPC Global, Class 1, Generation 2 RFID standard. This overlay allows seamless, guaranteed data transfer using the EPC Global protocol, supporting extremely low‐power, embedded sensing using an infrastructure likely to be already in place for ALM applications. We evaluate a prototype implementation of a complete end‐to‐end system using a robotic RFID interrogation agent, and we present future directions for the development of this sensing technique.

Raymond S. Wagner↗

Harmonized Emissions Component (HEMCO) 3.0 as a Versatile Emissions Component for Atmospheric Models: Application in the GEOS-Chem, NASA GEOS, WRF-GC, CESM2, NOAA GEFS-Aerosol, and NOAA UFS Models

Emissions are a central component of atmospheric chemistry models. The Harmonized Emissions Component (HEMCO) is a software component for computing emissions from a user-selected ensemble of emission inventories and algorithms. It allows users to re-grid, combine, overwrite, subset, and scale emissions from different inventories through a configuration file and with no change to the model source code. The configuration file also maps emissions to model species with appropriate units. HEMCO can operate in offline stand-alone mode, but more importantly it provides an online facility for models to compute emissions at runtime. HEMCO complies with the Earth System Modeling Framework (ESMF) for portability across models. We present a new version here, HEMCO 3.0, that features an improved three-layer architecture to facilitate implementation into any atmospheric model and improved capability for calculating emissions at any model resolution including multiscale and unstructured grids. The three-layer architecture of HEMCO 3.0 includes (1) the Data Input Layer that reads the configuration file and accesses the HEMCO library of emission inventories and other environmental data, (2) the HEMCO Core that computes emissions on the user-selected HEMCO grid, and (3) the Model Interface Layer that re-grids (if needed) and serves the data to the atmospheric model and also serves model data to the HEMCO Core for computing emissions dependent on model state (such as from dust or vegetation). The HEMCO Core is common to the implementation in all models, while the Data Input Layer and the Model Interface Layer are adaptable to the model environment. Default versions of the Data Input Layer and Model Interface Layer enable straightforward implementation of HEMCO in any simple model architecture, and options are available to disable features such as re-gridding that may be done by independent couplers in more complex architectures. The HEMCO library of emission inventories and algorithms is continuously enriched through user contributions so that new inventories can be immediately shared across models. HEMCO can also serve as a general data broker for models to process input data not only for emissions but for any gridded environmental datasets. We describe existing implementations of HEMCO 3.0 in (1) the GEOS-Chem “Classic” chemical transport model with shared-memory infrastructure, (2) the high-performance GEOS-Chem (GCHP) model with distributed-memory architecture, (3) the NASA GEOS Earth System Model (GEOS ESM), (4) the Weather Research and Forecasting model with GEOS-Chem (WRF-GC), (5) the Community Earth System Model Version 2 (CESM2), and (6) the NOAA Global Ensemble Forecast System – Aerosols (GEFS-Aerosols), as well as the planned implementation in the NOAA Unified Forecast System (UFS). Implementation of HEMCO in CESM2 contributes to the Multi-Scale Infrastructure for Chemistry and Aerosols (MUSICA) by providing a common emissions infrastructure to support different simulations of atmospheric chemistry across scales.

Haipeng Lin↗

Full Life-Cycle Defect Management Assessment: Initial Inspection Data Collection Results and Research Questions for Further Study

It is often the case in software projects that when schedule and budget resources are limited, the Verification and Validation (V&V) activities suffer. Fewer V&V activities can be afforded and moreover, short-term challenges can result in V&V activities being scaled back or dropped altogether. As a result, too often the default solution is to save activities for improving software quality until too late in the life-cycle, relying on late-term code inspections followed by thorough testing activities to reduce defect counts to acceptable levels. As many project managers realize, however, this is a resource-intensive way of achieving the required quality for software. The Full Life-cycle Defect Management Assessment Initiative, funded by NASA s Office of Safety and Mission Assurance under the Software Assurance Research Program, aims to address these problems by: Improving the effectiveness of early life-cycle V&V activities to make their benefits more attractive to team leads. Specifically, we focus on software inspection, a proven method that can be applied to any software work product, long before executable code has been developed; Better communicating this effectiveness to software development teams, along with suggestions for parameters to improve in the future to increase effectiveness; Analyzing the impact of early life-cycle V&V on the effectiveness and cost required for late life-cycle V&V activities, such as testing, in order to make the tradeoffs more apparent. This white paper reports on an initial milestone in this work, the development of a preliminary model of inspection effectiveness across multiple NASA Centers. This model contributes toward reaching our project goals by: Allowing an examination of inspection parameters, across different types of projects and different work products, for an analysis of factors that impact defect detection effectiveness. Allowing a comparison of this NASA-specific model to existing recommendations in the literature regarding how to plan effective inspections. Forming a baseline model which can be extended to incorporate factors describing: the numbers and types of defects that are missed by inspections; how such defects flow downstream through software development phases; how effectively they can be caught by testing activities in the late stages of development. The model has been implemented in a prototype web-enabled decision-support tool which allows developers to enter their inspection data and receive feedback based on a comparison against the model. The tool also allows users to access reusable materials (such as checklists) from projects included in the baseline. Both the tool itself and the model underlying it will continue to be extended throughout the remainder of this initiative. As results of analyzing inspection effectiveness for defect containment are determined, they can be shared via the tool and also via updates to existing training courses on metrics and software inspections. Moreover, the tool will help satisfy key CMMI requirements for the NASA Centers, as it will enable NASA to take a global view across peer review results for various types of projects to identify systemic problems. This analysis can result in continuous improvements to the approach to verification.

Shull, Forrest↗

Virtual Microscope Views of the Apollo 11 and 12 Lunar Samples

The Apollo virtual microscope is a means of viewing, over the Internet, polished thin sections of every rock in the Apollo lunar sample collections via software, duplicating many of the functions of a petrological microscope, is described. Images from the Apollo 11 and 12 missions may be viewed at: www.virtualmicroscope.org/content/apollo. Introduction: During the six NASA missions to the Moon from 1969-72 a total of 382 kilograms of rocks and soils, often referred to as "the legacy of Apollo", were collected and returned to Earth. A unique collection of polished thin sections (PTSs) was made from over 400 rocks by the Lunar Sample Curatorial Facility at the Johnson Spacecraft Center (JSC), Houston. These materials have been available for loan to approved PIs but of course they can't be simultaneously investigated by several researchers unless they are co-located or the sample is passed back and forward between them by mail/hand carrying which is inefficient and very risky for irreplaceable material. When The Open University (OU), the world's largest Distance Learning Higher Education Establishment found itself facing a comparable problem (how to supply thousands of undergraduate students with an interactive petrological microscope and a personal set of thin sections), it decided to develop a software tool called the Virtual Microscope (VM). As a result it is now able to make the unique and precious collection of Apollo specimens universally available as a resource for concurrent study by anybody in the world's Earth and Planetary Sciences community. Herein, we describe the first steps of a collaborative project between OU and the Johnson Space Center (JSC) Curatorial Facility to record a PTS for every lunar rock, beginning with those collected by the Apollo 11 and 12 missions. Method: Production of a virtual microscope dedicated to a particular theme divides into four main parts - photography, image processing, building and assembly of virtual microscope components, and publication on a website. Two large research quality microscopes are used to collect all the images required for a virtual microscope. The first is part of an integrated package that utilizes Leica PowerMosaic software and a motorised XYZ stage to generate large area mosaics. It includes a fast acquisition camera and depending on the PTS size normally is used to produce seamless mosaic images consisting of 100-500 individual photographs. If the sample is suitable, three mosaics of each sample are recorded - plane polarised light, between crossed polars and reflected light. In order for the VM to be a true petrological microscope it is necessary to recreate the features of a rotating stage and perform observations using filters to produce polarised light. Thus the petrological VM includes the capability of seeing changes in optical properties (pleochroism and birefringence) during rotation allowing mineral identification. The second microscope in the system provides the functions of the rotating stage. To this microscope we have added a robotically controlled motor to acquire seventy-two images (5 degree intervals) in plane polarised light and between crossed polars. To process the images acquired from the two microscopes involves a combination of proprietary software (Photoshop) and our own in-house code. The final stage involves assembling all the components in an HTML5 environment. Pathfinder investigations: We have undertaken a number of pilot studies to demonstrate the efficacy of the petrological microscope with lunar samples. The first was to make available on-line images collected from the Educational Package of Apollo samples provided by NASA to the UK STFC (Science and Technical Facilities Council) for loan as educational material e.g. for schools. The real PTSs of the samples are now no longer sent out to schools removing the risks associated with transport, accidental breakage and eliminating the possibility of loss. The availability of lunar sample VM-related material was further extended to include twenty-eight specimens from all of the Apollo missions. Some of these samples were made more generally available through an ibook entitled "Moon Rocks: an introduction to the Geology of the Moon," free from the Apple Bookstore. Research possibilities: Although the Virtual Microscope was originally conceived as a teaching aid and was later recognised as a means of public outreach and engagement, we now realize that it also has enormous potential as a high level research tool. Following discussions with the JSC Curators we have received Curation and Analysis Planning Team for Extraterrestrial Materials (CAPTEM) permission to embark on a programme of digitizing the entire lunar sample PTS collection for all three of the above purposes. By the time of the 47th Lunar and Planetary Science Conference (LPSC) we will have completed 81 rocks collected during the Apollo 11 and 12 missions and the data, with cross-links to the Lunar Sample Compendium will go live on the Web at the 47th LPSC. The VM images of the Apollo 11 (41 VM images) and 12 (40 VM images) missions can be viewed at: http:/www.virtualmicroscope.org/content/apollo. The lunar sample VM will enable large numbers of skilled/unskilled microscopists (professional and amateur researchers, educators and students, enthusiasts and the simply curious non-scientists) to share the information from a single sample. It will mean that all the PTSs already cut, even historical ones, could be available for new joint investigations or private study. The scientific return from the collection will increase exponentially as a result of further debate and discussion. Simultaneously the VM will remove the need for making unnecessary multiple samplings, avoid consignment of delicate/breakable specimens (all of which are priceless) to insecure mail/courier services and reduce direct labour and indirect costs, travel budgets and unproductive travelling time necessary for co-location of collaborating researchers. For the future we have already recognized further potential for virtual technology. There is nothing that a petrologist likes more than to see the original rock as a hand specimen. It is entirely possible to recreate virtual hand specimens with 3-D hard and software, already developed for viewing fossils, located within the Curatorial Facility, http://curator.jsc.nasa.gov/lunar/lsc/index.cfm.

Gibson, E. K.↗

An Offload NIC for NASA, NLR, and Grid Computing

This work addresses distributed data management and access dynamically configurable high-speed access to data distributed and shared over wide-area high-speed network environments. An offload engine NIC (network interface card) is proposed that scales at nX10-Gbps increments through 100-Gbps full duplex. The Globus de facto standard was used in projects requiring secure, robust, high-speed bulk data transport. Novel extension mechanisms were derived that will combine these technologies for use by GridFTP, bandwidth management resources, and host CPU (central processing unit) acceleration. The result will be wire-rate encrypted Globus grid data transactions through offload for splintering, encryption, and compression. As the need for greater network bandwidth increases, there is an inherent need for faster CPUs. The best way to accelerate CPUs is through a network acceleration engine. Grid computing data transfers for the Globus tool set did not have wire-rate encryption or compression. Existing technology cannot keep pace with the greater bandwidths of backplane and network connections. Present offload engines with ports to Ethernet are 32 to 40 Gbps f-d at best. The best of ultra-high-speed offload engines use expensive ASICs (application specific integrated circuits) or NPUs (network processing units). The present state of the art also includes bonding and the use of multiple NICs that are also in the planning stages for future portability to ASICs and software to accommodate data rates at 100 Gbps. The remaining industry solutions are for carrier-grade equipment manufacturers, with costly line cards having multiples of 10-Gbps ports, or 100-Gbps ports such as CFP modules that interface to costly ASICs and related circuitry. All of the existing solutions vary in configuration based on requirements of the host, motherboard, or carriergrade equipment. The purpose of the innovation is to eliminate data bottlenecks within cluster, grid, and cloud computing systems, and to add several more capabilities while reducing space consumption and cost. Provisions were designed for interoperability with systems used in the NASA HEC (High-End Computing) program. The new acceleration engine consists of state-ofthe- art FPGA (field-programmable gate array) core IP, C, and Verilog code; novel communication protocol; and extensions to the Globus structure. The engine provides the functions of network acceleration, encryption, compression, packet-ordering, and security added to Globus grid or for cloud data transfer. This system is scalable in nX10-Gbps increments through 100-Gbps f-d. It can be interfaced to industry-standard system-side or network-side devices or core IP in increments of 10 GigE, scaling to provide IEEE 40/100 GigE compliance.

Awrach, James↗

Geodata Modeling and Query in Geographic Information Systems

Geographic information systems (GIS) deal with collecting, modeling, man- aging, analyzing, and integrating spatial (locational) and non-spatial (attribute) data required for geographic applications. Examples of spatial data are digital maps, administrative boundaries, road networks, and those of non-spatial data are census counts, land elevations and soil characteristics. GIS shares common areas with a number of other disciplines such as computer- aided design, computer cartography, database management, and remote sensing. None of these disciplines however, can by themselves fully meet the requirements of a GIS application. Examples of such requirements include: the ability to use locational data to produce high quality plots, perform complex operations such as network analysis, enable spatial searching and overlay operations, support spatial analysis and modeling, and provide data management functions such as efficient storage, retrieval, and modification of large datasets; independence, integrity, and security of data; and concurrent access to multiple users. It is on the data management issues that we devote our discussions in this monograph. Traditionally, database management technology have been developed for business applications. Such applications require, among other things, capturing the data requirements of high-level business functions and developing machine- level implementations; supporting multiple views of data and yet providing integration that would minimize redundancy and maintain data integrity and security; providing a high-level language for data definition and manipulation; allowing concurrent access to multiple users; and processing user transactions in an efficient manner. The demands on database management systems have been for speed, reliability, efficiency, cost effectiveness, and user-friendliness. Significant progress have been made in all of these areas over the last two decades to the point that many generalized database platforms are now available for developing data intensive applications that run in real-time. While continuous improvement is still being made at a very fast-paced and competitive rate, new application areas such as computer aided design, image processing, VLSI design, and GIS have been identified by many as the next generation of database applications. These new application areas pose serious challenges to the currently available database technology. At the core of these challenges is the nature of data that is manipulated. In traditional database applications, the database objects do not have any spatial dimension, and as such, can be thought of as point data in a multi-dimensional space. For example, each instance of an entity EMPLOYEE will have a unique value corresponding to every attribute such as employee id, employee name, employee address and so on. Thus, every Employee instance can be thought of as a point in a multi-dimensional space where each dimension is represented by an attribute. Furthermore, all operations on such data are one-dimensional. Thus, users may retrieve all entities satisfying one or more constraints. Examples of such constraints include employees with addresses in a certain area code, or salaries within a certain range. Even though constraints can be specified on multiple attributes (dimensions), the search for such data is essentially orthogonal across these dimensions.

Adam, Nabil↗