Search NASA⌕ Search

SEARCH · Search NASA

Results for “Parallelization Strategy”

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 343 records · Page 19

Aligning parallel arrays to reduce communication

Axis and stride alignment is an important optimization in compiling data-parallel programs for distributed-memory machines. We previously developed an optimal algorithm for aligning array expressions. Here, we examine alignment for more general program graphs. We show that optimal alignment is NP-complete in this setting, so we study heuristic methods. This paper makes two contributions. First, we show how local graph transformations can reduce the size of the problem significantly without changing the best solution. This allows more complex and effective heuristics to be used. Second, we give a heuristic that can explore the space of possible solutions in a number of ways. We show that some of these strategies can give better solutions than a simple greedy approach proposed earlier. Our algorithms have been implemented; we present experimental results showing their effect on the performance of some example programs running on the CM-5.

Sheffler, Thomas J.↗

Relationships between pigment composition variation and reflectance for plant species from a coastal savannah in California

Advances in imaging spectroscopy have indicated that remotely sensed reflectance measurements of the plant canopy may be used to identify and qualify some classes of canopy biochemicals; however, the manner in which differences in biochemical compositions translate into differences is not well understood. Most frequently, multiple linear regression routines have been used to correlate narrow band reflectance values with measured biochemical concentrations. Although some success has been achieved with such methods for given data sets, the bands selected by multiple regression are not consistent between data sets, nor is it always clear what physical or biological basis underlies the correlation. To examine the relationship between biochemical concentration and leaf reflectance signal we chose to focus on the visible spectrum where the primary biochemical absorbances are due to photosynthetic pigments. Pigments provide a range of absorbance features, occur over a range of concentrations in natural samples, and are ecophysiologically important. Concentrations of chlorophyll, for example, have been strongly correlated to foliar nitrogen levels within a species and to photosynthetic capacity across many species. In addition pigments effectively absorb most of the photosynthetically active radiation between 400-700 nm, a spectral region for which silicon detectors have good signal/noise characteristics. Our strategy has been to sample a variety of naturally occurring species to measure leaf reflectance and pigment compositions. We hope to extend our understanding of pigment reflectance effects to interpret small overlapping absorbances of other biochemicals in the infrared region. For this reason, selected samples were also tested to determine total nitrogen, crude protein, cellulose, and lignin levels. Leaf reflectance spectra measured with AVIRIS bandwidths and wavelengths were compared between species and within species and for differences between seasons, for changes in the the shape of the spectra. We attempt to statistically correlate these shape changes with differences in pigment compositions. In parallel with our comparisons of pigment composition and leaf reflectance, we have modified the PROSPECT leaf reflectance model to test the contributions of pigments or pigment group concentrations. PROSPECT considers a leaf as a multi-layer dielectric plane with an uneven surface. Jacquemoud adapted the basic analysis of Allen for surface effects, a leaf thickness factor, and the absorption of water and chlorophyll (actually all pigments) and the plant matrix. Our modifications to PROSPECT in the forward direction include breaking out the pigment concentration parameter into separate components for chlorophyll a and b and a number of xanthophylls and carotenes, and introducing a shift and convolution function to model the spread and shift from their in vitro measurements to their in vivo state. Further, we have considered how the matrix elements (i.e., all biochemicals and structural effects not modeled explicity) vary with species.

Ustin, Susan L.↗

On Improving Efficiency of Differential Evolution for Aerodynamic Shape Optimization Applications

Differential Evolution (DE) is a simple and robust evolutionary strategy that has been provEn effective in determining the global optimum for several difficult optimization problems. Although DE offers several advantages over traditional optimization approaches, its use in applications such as aerodynamic shape optimization where the objective function evaluations are computationally expensive is limited by the large number of function evaluations often required. In this paper various approaches for improving the efficiency of DE are reviewed and discussed. Several approaches that have proven effective for other evolutionary algorithms are modified and implemented in a DE-based aerodynamic shape optimization method that uses a Navier-Stokes solver for the objective function evaluations. Parallelization techniques on distributed computers are used to reduce turnaround times. Results are presented for standard test optimization problems and for the inverse design of a turbine airfoil. The efficiency improvements achieved by the different approaches are evaluated and compared.

Madavan, Nateri K.↗

Exploring the Connection Between Sampling Problems in Bayesian Inference and Statistical Mechanics

The Bayesian and statistical mechanical communities often share the same objective in their work - estimating and integrating probability distribution functions (pdfs) describing stochastic systems, models or processes. Frequently, these pdfs are complex functions of random variables exhibiting multiple, well separated local minima. Conventional strategies for sampling such pdfs are inefficient, sometimes leading to an apparent non-ergodic behavior. Several recently developed techniques for handling this problem have been successfully applied in statistical mechanics. In the multicanonical and Wang-Landau Monte Carlo (MC) methods, the correct pdfs are recovered from uniform sampling of the parameter space by iteratively establishing proper weighting factors connecting these distributions. Trivial generalizations allow for sampling from any chosen pdf. The closely related transition matrix method relies on estimating transition probabilities between different states. All these methods proved to generate estimates of pdfs with high statistical accuracy. In another MC technique, parallel tempering, several random walks, each corresponding to a different value of a parameter (e.g. "temperature"), are generated and occasionally exchanged using the Metropolis criterion. This method can be considered as a statistically correct version of simulated annealing. An alternative approach is to represent the set of independent variables as a Hamiltonian system. Considerab!e progress has been made in understanding how to ensure that the system obeys the equipartition theorem or, equivalently, that coupling between the variables is correctly described. Then a host of techniques developed for dynamical systems can be used. Among them, probably the most powerful is the Adaptive Biasing Force method, in which thermodynamic integration and biased sampling are combined to yield very efficient estimates of pdfs. The third class of methods deals with transitions between states described by rate constants. These problems are isomorphic with chemical kinetics problems. Recently, several efficient techniques for this purpose have been developed based on the approach originally proposed by Gillespie. Although the utility of the techniques mentioned above for Bayesian problems has not been determined, further research along these lines is warranted

Pohorille, Andrew↗

C++ Resource Intelligent Compilation for GPU Enabled Applications

We are nearing the limits of Moore's Law with current computing technology. As industries push for more performance from smaller systems, alternate methods of computation such as Graphics Processing Units (GPUs) should be considered. Many of these systems utilize the Compute Unified Device Architecture (CUDA) to give programmers access to individual compute elements of the GPU for general purpose computing tasks. Direct access to the GPU's parallel multi-core architecture enables highly efficient computation and can drastically reduce the time required for complex algorithms or data analysis. Of course not all systems have a CUDA-enabled device to leverage, and so applications must consider optional support for users with these devices. Resource Intelligent Compilation (RIC) addresses this situation by enabling GPU-based acceleration of existing applications without affecting users without GPUs. Resource Intelligent Compilation (RIC) creates C/C++ modules that can be compiled to create a standard CPU version or GPU accelerated version of a program, depending on hardware availability. This is accomplished through a toolbox of programming strategies based on features of the CUDA API. Using this toolbox, existing applications can be modified with ease to support GPU acceleration, and new applications can be generated with just a few simple modifications. All of this culminates in an accelerated application for users with the appropriate hardware, with no performance impact to standard systems. This memorandum presents all the important features involved in supporting and implementing RIC and an example of using RIC to accelerate an existing mathematical model, without removing support for standard users. Through this memorandum, NASA engineers can acquire a set of guidelines to follow for RIC-compliant development, seamlessly accelerating C/C++ applications.

GPU↗

On the factorization of block-tridiagonals without storage constraints

In many programs solving difference equations, problem size is restricted by the number of available memory cells. A strategy has been developed to permit trade-offs between the number of floating point operations required and storage requirements for the solution of certain problems such as block tridiagonal systems of equations. This is done by recomputing some intermediate results instead of storing them. Reducing the storage to the square root of the current requirement will roughly double the number of computations. In theory, if m is the order of each sub-matrix in the block tridiagonal matrix, one can solve any linear system with only 5 sq m + 1 temporary storage cells. This method lends itself to efficient use on computers with parallel processing or vector processing architectures. On these computers the larger number of floating point operations is more than offset by the decrease in I/O and the increased percentage of vector operations made possible by this algorithm.

Merriam, M. L.↗

Algorithms for Automatic Alignment of Arrays

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

Chatterjee, Siddhartha↗

Glenn-ht/bem Conjugate Heat Transfer Solver for Large-scale Turbomachinery Models

A coupled Boundary Element/Finite Volume Method temperature-forward/flux-hack algorithm is developed for conjugate heat transfer (CHT) applications. A loosely coupled strategy is adopted with each field solution providing boundary conditions for the other in an iteration seeking continuity of temperature and heat flux at the fluid-solid interface. The NASA Glenn Navier-Stokes code Glenn-HT is coupled to a 3-D BEM steady state heat conduction code developed at the University of Central Florida. Results from CHT simulation of a 3-D film-cooled blade section are presented and compared with those computed by a two-temperature approach. Also presented are current developments of an iterative domain decomposition strategy accommodating large numbers of unknowns in the BEM. The blade is artificially sub-sectioned in the span-wise direction, 3-D BEM solutions are obtained in the subdomains, and interface temperatures are averaged symmetrically when the flux is updated while the fluxes are averaged anti-symmetrically to maintain continuity of heat flux when the temperatures are updated. An initial guess for interface temperatures uses a physically-based 1-D conduction argument to provide an effective starting point and significantly reduce iteration. 2-D and 3-D results show the process converges efficiently and offers substantial computational and storage savings. Future developments include a parallel multi-grid implementation of the approach under MPI for computation on PC clusters.

Divo, E.↗

Strategies for the GPU Implementation of the OVERFLOW CFD Code

Wondering how to port a large, computational fluid dynamics (CFD) solver, written in Fortran, to run effectively on GPUs? Join this talk to learn about the strategies NASA’s OVERFLOW CFD code has used to effectively utilize GPUs to greatly improve the time to solution compared to CPUs. OVERFLOW is an overset, structured grid, computational fluid dynamics (CFD) flow solver developed by NASA and widely used by government, US industry, and academia. It is known for its effective use of CPU hardware, but this talk will discuss recent efforts to modify the code to run efficiently on GPUs. We will describe our use of OpenACC, CUDA Fortran, and CUDA C++, discussing why and how we use each to map our problem onto NVIDIA GPUs. We will also describe structural changes we made in the code to expose enough parallelism to effectively use the GPU hardware. Finally, we will present the performance benefits from running OVERFLOW on GPUs compared to the well optimized CPU version of the code.

GPU Programming↗

Hubble Tarantula Treasury Project: Unraveling Tarantula's Web. I. Observational Overview and First Results

The Hubble Tarantula Treasury Project (HTTP) is an ongoing panchromatic imaging survey of stellar populations in the Tarantula Nebula in the Large Magellanic Cloud that reaches into the sub-solar mass regime (<0.5 Stellar Mass). HTTP utilizes the capability of the Hubble Space Telescope to operate the Advanced Camera for Surveys and the Wide Field Camera 3 in parallel to study this remarkable region in the near-ultraviolet, optical, and near-infrared spectral regions, including narrow-band H(alpha) images. The combination of all these bands provides a unique multi-band view. The resulting maps of the stellar content of the Tarantula Nebula within its main body provide the basis for investigations of star formation in an environment resembling the extreme conditions found in starburst galaxies and in the early universe. Access to detailed properties of individual stars allows us to begin to reconstruct the temporal and spatial evolution of the stellar skeleton of the Tarantula Nebula over space and time on a sub-parsec scale. In this first paper we describe the observing strategy, the photometric techniques, and the upcoming data products from this survey and present preliminary results obtained from the analysis of the initial set of near-infrared observations.

Tarantula↗

Adaptive Mesh Refinement for Microelectronic Device Design

Finite element and finite volume methods are used in a variety of design simulations when it is necessary to compute fields throughout regions that contain varying materials or geometry. Convergence of the simulation can be assessed by uniformly increasing the mesh density until an observable quantity stabilizes. Depending on the electrical size of the problem, uniform refinement of the mesh may be computationally infeasible due to memory limitations. Similarly, depending on the geometric complexity of the object being modeled, uniform refinement can be inefficient since regions that do not need refinement add to the computational expense. In either case, convergence to the correct (measured) solution is not guaranteed. Adaptive mesh refinement methods attempt to selectively refine the region of the mesh that is estimated to contain proportionally higher solution errors. The refinement may be obtained by decreasing the element size (h-refinement), by increasing the order of the element (p-refinement) or by a combination of the two (h-p refinement). A successful adaptive strategy refines the mesh to produce an accurate solution measured against the correct fields without undue computational expense. This is accomplished by the use of a) reliable a posteriori error estimates, b) hierarchal elements, and c) automatic adaptive mesh generation. Adaptive methods are also useful when problems with multi-scale field variations are encountered. These occur in active electronic devices that have thin doped layers and also when mixed physics is used in the calculation. The mesh needs to be fine at and near the thin layer to capture rapid field or charge variations, but can coarsen away from these layers where field variations smoothen and charge densities are uniform. This poster will present an adaptive mesh refinement package that runs on parallel computers and is applied to specific microelectronic device simulations. Passive sensors that operate in the infrared portion of the spectrum as well as active device simulations that model charge transport and Maxwell's equations will be presented.

Cwik, Tom↗

Affordable Development and Demonstration of a Small Nuclear Thermal Rocket (NTR) Engine and Stage: How Small Is Big Enough?

The Nuclear Thermal Rocket (NTR) derives its energy from fission of uranium-235 atoms contained within fuel elements that comprise the engine's reactor core. It generates high thrust and has a specific impulse potential of approximately 900 specific impulse - a 100 percent increase over today's best chemical rockets. The Nuclear Thermal Propulsion (NTP) project, funded by NASA's Advanced Exploration Systems (AES) program, includes five key task activities: (1) Recapture, demonstration, and validation of heritage graphite composite (GC) fuel (selected as the Lead Fuel option); (2) Engine Conceptual Design; (3) Operating Requirements Definition; (4) Identification of Affordable Options for Ground Testing; and (5) Formulation of an Affordable Development Strategy. During fiscal year (FY) 2014, a preliminary Design Development Test and Evaluation (DDT&E) plan and schedule for NTP development was outlined by the NASA Glenn Research Center (GRC), Department of Energy (DOE) and industry that involved significant system-level demonstration projects that included Ground Technology Demonstration (GTD) tests at the Nevada National Security Site (NNSS), followed by a Flight Technology Demonstration (FTD) mission. To reduce cost for the GTD tests and FTD mission, small NTR engines, in either the 7.5 or 16.5 kilopound-force thrust class, were considered. Both engine options used GC fuel and a common fuel element (FE) design. The small approximately 7.5 kilopound-force criticality-limited engine produces approximately157 thermal megawatts and its core is configured with parallel rows of hexagonal-shaped FEs and tie tubes (TTs) with a FE to TT ratio of approximately 1:1. The larger approximately 16.5 kilopound-force Small Nuclear Rocket Engine (SNRE), developed by Los Alamos National Laboratory (LANL) at the end of the Rover program, produces approximately 367 thermal megawatts and has a FE to TT ratio of approximately 2:1. Although both engines use a common 35-inch (approximately 89-centimeters) -long FE, the SNRE's larger diameter core contains approximately 300 more FEs needed to produce an additional 210 thermal megawatts of power. To reduce the cost of the FTD mission, a simple one-burn lunar flyby mission was considered to reduce the liquid hydrogen (LH2) propellant loading, the stage size and complexity. Use of existing and flight proven liquid rocket and stage hardware (e.g., from the RL10B-2 engine and Delta Cryogenic Second Stage) was also maximized to further aid affordability. This paper examines the pros and cons of using these two small engine options, including their potential to support future human exploration missions to the Moon, near Earth asteroids (NEA), and Mars, and recommends a preferred size. It also provides a preliminary assessment of the key activities, development options, and schedule required to affordably build, ground test and fly a small NTR engine and stage within a 10-year timeframe.

Spacecraft design↗

CALIPSO Lidar Calibration at 532 nm: Version 4 Nighttime Algorithm

Data products from the Cloud-Aerosol Lidar with Orthogonal Polarization (CALIOP) on board Cloud-Aerosol Lidar and Infrared Pathfinder Satellite Observations (CALIPSO) were recently updated following the implementation of new (version 4) calibration algorithms for all of the level 1 attenuated backscatter measurements. In this work we present the motivation for and the implementation of the version 4 nighttime 532 nm parallel channel calibration. The nighttime 532 nm calibration is the most fundamental calibration of CALIOP data, since all of CALIOP’s other radiometric calibration procedures – i.e., the 532 nm daytime calibration and the 1064 nm calibrations during both nighttime and daytime – depend either directly or indirectly on the 532 nm nighttime calibration. The accuracy of the 532 nm nighttime calibration has been significantly improved by raising the molecular normalization altitude from 30-34 km to 36-39 km to substantially reduce stratospheric aerosol contamination. Due to the greatly reduced molecular number density and consequently reduced signal-to-noise ratio (SNR) at these higher altitudes, the signal is now averaged over a larger number of samples using data from multiple adjacent granules. As well, an enhanced strategy for filtering the radiation-induced noise from high energy particles was adopted. Further, the meteorological model used in the earlier versions has been replaced by the improved MERRA-2 model. An aerosol scattering ratio of 1.01 ± 0.01 is now explicitly used for the calibration altitude. These modifications lead to globally revised calibration coefficients which are, on average, 2-3% lower than in previous data releases. Further, the new calibration procedure is shown to eliminate biases at high altitudes that were present in earlier versions and consequently leads to an improved representation of stratospheric aerosols. Validation results using airborne lidar measurements are also presented. Biases relative to collocated measurements acquired by the Langley Research Center (LaRC) airborne high spectral resolution lidar (HSRL) are reduced from 3.6% ± 2.2% in the version 3 data set to 1.6% ± 2.4 % in the version 4 release.

Jayanta Kar↗

Overview of the Mars 2020 Parachute Risk Reduction Activity

In 2012, the Mars Science Laboratory (MSL) landed safely on the surface of Mars using a supersonic Disk-Gap-Band (DGB) parachute, which was structurally qualified for flight via a subsonic wind tunnel test program. Results of the Low Density Supersonic Decelerators (LDSD) program have called into question the methodology and principles that form the foundation of the MSL subsonic test program. LDSD discovered that quasi-static subsonic proof loading a parachute via ground testing may not provide canopy stresses that sufficiently bound the stresses experienced during a rapid supersonic inflation at Mars. Additionally, deeper scrutiny of the materials and structural margins present in previously successful supersonic DGBs indicated that the MSL parachute flew with lowest margins of any previous parachute. These factors have increased the perceived risk of reusing a heritage MSL DGB parachute design with a subsonic test program for Mars 2020. To reduce this risk,a series of risk reduction steps were initiated starting in 2016. First, two parachute assemblies have been pursued in parallel: a Build-to-Print (BTP) MSL parachute, designed and manufactured by Pioneer Aerospace Corporation, which maintains the heritage of the successful MSL parachute, and a strengthened parachute, designed and manufactured by Airborne Systems North America, which uses higher strength materials throughout the parachute assembly but maintains the same overall size as the MSL parachute. Second, each parachute system was tested in a subsonic wind tunnel to examine the canopies in their fully inflated state and assess the workmanship of each canopy. Finally, full-scale parachutes from each vendor will experience at least one supersonic inflation at Mars relevant Mach numbers and atmospheric densities at Earth via a supersonic sounding rocket test campaign. This paper presents high-level details regarding the risk reduction strategy, the two candidate parachute configurations, the ground test program, and the supersonic flight test program, and brief results from each of the test programs.

Chen, Allen↗

Parallel Proximity Detection for Computer Simulation

The present invention discloses a system for performing proximity detection in computer simulations on parallel processing architectures utilizing a distribution list which includes movers and sensor coverages which check in and out of grids. Each mover maintains a list of sensors that detect the mover's motion as the mover and sensor coverages check in and out of the grids. Fuzzy grids are includes by fuzzy resolution parameters to allow movers and sensor coverages to check in and out of grids without computing exact grid crossings. The movers check in and out of grids while moving sensors periodically inform the grids of their coverage. In addition, a lookahead function is also included for providing a generalized capability without making any limiting assumptions about the particular application to which it is applied. The lookahead function is initiated so that risk-free synchronization strategies never roll back grid events. The lookahead function adds fixed delays as events are scheduled for objects on other nodes.

Steinman, Jeffrey S.↗

Parallel Proximity Detection for Computer Simulations

The present invention discloses a system for performing proximity detection in computer simulations on parallel processing architectures utilizing a distribution list which includes movers and sensor coverages which check in and out of grids. Each mover maintains a list of sensors that detect the mover's motion as the mover and sensor coverages check in and out of the grids. Fuzzy grids are included by fuzzy resolution parameters to allow movers and sensor coverages to check in and out of grids without computing exact grid crossings. The movers check in and out of grids while moving sensors periodically inform the grids of their coverage. In addition, a lookahead function is also included for providing a generalized capability without making any limiting assumptions about the particular application to which it is applied. The lookahead function is initiated so that risk-free synchronization strategies never roll back grid events. The lookahead function adds fixed delays as events are scheduled for objects on other nodes.

Steinman, Jeffrey S.↗

Investigating Surface Mineralogy, Alteration Processes, and Biomarkers on Mars Using Laser Raman Spectroscopy

Despite a wealth of information from past and ongoing missions to Mars, the capability to determine the mineralogy of surface materials and to connect mineralogy with lithologic characteristics that are diagnostic of the environment in which those materials formed remains inadequate. The 2003 Mars Exploration Rovers (MER) will carry a Mini-TES and a Mossbauer spectrometer, which will provide some detailed mineralogy information. For general characterization of minerals and/or biogenic phases (reduced carbon, PAHs, etc) on the surface of Mars, we have been developing a miniaturized laser Raman spectrometer for in situ analyses -- the Mars Microbeam Raman Spectrometer, MMRS. We are also developing strategies to use Raman spectroscopy as a stand-alone technique and to be used synergistically with other in situ analysis methods in future planetary missions. Through studies of Martian meteorites and terrestrial analogs, we are gaining experience of what compositional and structural information can be obtained on key mineral groups using in-situ Raman measurements. We are developing methods for determining mineral proportions in rocks or soils and identifying rock types from sets of closely spaced, rapidly acquired spectra. We are studying how weathering and alteration affect the Raman and luminescence features of minerals and rocks, and we are investigating the Raman characteristics of biogenic organisms and their remains. These studies form the scientific basis for in-situ planetary Raman spectroscopy, and they are being done in parallel with instrument development towards a flight version of the MMRS.

Alian Wang↗

Refueling with In-Situ Produced Propellants

In-situ produced propellants have been identified in many architecture studies as key to implementing feasible chemical propulsion missions to destinations beyond lunar orbit. Some of the more noteworthy ones include: launching from Mars to return to Earth (either direct from the surface, or via an orbital rendezvous); using the Earth-Moon Lagrange point as a place to refuel Mars transfer stages with Lunar surface produced propellants; and using Mars Moon Phobos as a place to produce propellants for descent and ascent stages bound for the Mars surface. However successful implementation of these strategies require an ability to successfully transfer propellants from the in-situ production equipment into the propellant tankage of the rocket stage used to move to the desired location. In many circumstances the most desirable location for this transfer to occur is in the low-gravity environment of space. In support of low earth orbit propellant depot concepts, extensive studies have been conducted on transferring propellants in-space. Most of these propellant transfer techniques will be applicable to low gravity operations in other locations. Even ground-based transfer operations on the Moon, Mars, and especially Phobos could benefit from the propellant conserving techniques used for depot refueling. This paper will review the literature of in-situ propellants and refueling to: assess the performance benefits of the use in-situ propellants for mission concepts; review the parallels with propellant depot efforts; assess the progress of the techniques required; and provide recommendations for future research.

In-Situ Propellants↗