Search NASA⌕ Search

SEARCH · Search NASA

Results for “Offloading”

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 181 records · Page 10

A Preliminary Assessment of Physical Demand During Simulated Lunar Surface Extravehicular Activities

Future Artemis missions will require more advanced spacesuits to support exploration and science activities on the Lunar surface. Preparing for these missions requires an understanding of the physical and cognitive demand of performing common surface extravehicular activity (EVA) tasks in a suited partial-gravity environment. This study aims to characterize physical demand during exploration EVA tasks in the Artificial Gravity Offload System (ARGOS) as a function of the task and operational environment itself. Two subjects completed two days of EVA simulations at ARGOS in the Mark III spacesuit offloaded to Lunar gravity (1/6G). Metabolic rate (MR) and heart rate (HR) were continuously recorded while subjects completed an end-to-end EVA as well as standalone tasks. Understanding the physical demand to complete exploration EVA tasks will be instrumental to the future success of exploration spacesuit designs and missions. Further work in this study will be needed to characterize MR during exploration EVA tasks, including expanding the subject pool and testing new suit designs.

Taylor E Schlotman↗

Evaluation of Aerobic Capacity in Relation to Simulated Lunar Surface Extravehicular Activities

INTRODUCTION Astronauts will need to be physically prepared to successfully execute strenuous Extravehicular Activities (EVA)on the Lunar surface. Compared to Apollo missions, Artemis missions will include EVAs of increased physical demand, frequency, and duration, thus requiring adequate fitness to successfully and safely complete mission objectives and potential contingency scenarios. Currently, aerobic fitness standards for partial gravity (g)surface EVAs are not well supported by high-fidelity EVA analog data. This investigation aims to characterize metabolic demands from Lunar analog EVA simulations in relation to the current NASA standards for celestial partial-g aerobic fitness(aerobic capacity (VO2pk) ≥36.5ml/kg/min). METHODS To evaluate current Lunar EVA aerobic fitness requirements, a pilot study was performed to characterize metabolic ratesduring6 hour simulated EVAs. The EVAs were performed in pressurized MKIII (n=2male) and xEMU (n=3 female) spacesuits offloaded to 1/6 g in the NASA Active Response Gravity Offload System. VO2pk was assessed via graded exercise testing on acycle ergometer and physical workload was quantified as percent ofVO2pk. RESULTS Four out of five subjects did not meet the current NASA celestial surface EVA aerobic standard (3 xEMU, 1MKIII;35.1±0.9 ml/kg/min). During simulated EVAs, subjects (xEMU: 35±1ml/kg/min; MKIII: 44±10ml/kg/min) worked at an average 36%VO2pk(xEMU) and 31% VO2pk(MKIII). For xEMU subjects, the tasks with the greatest average metabolic rates were 2km treadmill traverse(0% grade: 47.2%VO2pk[max 69.1%]), object relocation (45.2%VO2pk[max 60.5%]), and 1.5km traverse (0% grade: 45%VO2pk[max 59.7%]). For MKIII subjects, the tasks with the greatest average metabolic rates were 0.5km treadmill traverse (30% grade: 35.4% VO2pk[max 45.5%]), object relocation(31% VO2pk[max 40.8%]), and treadmill traverse (0% grade: 29.9%VO2pk[max 45.9%]). CONCLUSIONS While average metabolic rates for simulated Lunar EVA fall within sustainable work ranges of30–40% VO2pkand life support system limitations, task-specific metabolic rates exceed this range and may indicate that greater fitness is necessary for more strenuous tasks expected to be performed on the Lunar surface. As few subjects met the standard, more data is needed to adequately evaluate the NASA 3001 standard.

N C Strock↗

Plugin for Integrated Exoskeleton Simulations (PIES)

Upper extremity offload is a new capability to be developed for the Active Response Gravity Offload System (ARGOS) at the Johnson Space Center. To address the need, the Actuated Real-time Control for ARGOS Negation of Gravitational Effects on the Limbs (ARC-ANGEL) system is being designed and developed by the HumanWorks team in the Flight Systems Branch (ER3). The Plugin for Integrated Exoskeleton Simulations (PIES) is a multibody modeling and analysis capability developed by the Digital Astronaut Simulation (DAS) team in the Simulation and Graphics Branch (ER7). The C++ plugin is used in the open source biomechanics software, OpenSim (Stanford University), and integrates human multibody modeling with system dynamic modeling. The latest ‘flavor’ is the ANGEL with Passive and Powered Line of force Evaluation (APPLE) PIES.

Kaitlin Lostroscio↗

Experimental Setup for Mechanically Testing Subscale Triangular, Rollable, and Collapsible Deployable Composite Booms

High-strain composite deployable space structures are used for space infrastructure and science applications such as solar array supports, antennae, camera masts, and lightweight structures supporting solar sailing propulsion ele-ments. Triangular, Rollable, and Collapsible (TRAC) deployable composite booms are one example of a high-strain composite deployable structure and were studied using novel experimental test and characterization methods developed under the Gravity Offloading and Analysis of Long Imperfection-sensitive Ele-ments (GOALIE) project. In the present work, a subscale 7-m-long TRAC boom was suspended vertically to orient gravity along the length of the boom. By ori-enting vertically, highly nonlinear and unstable behavior often encountered dur-ing horizontally oriented gravity offload testing of similar structures was reduced. Pretest analytical predictions of TRAC booms indicated three unique failure modes, loads, and locations for three unique loading cases of in-plane bending, out-of-plane bending, and axial compression. To investigate the predicted behav-ior, an experimental test was set up to impart mechanical loads to a subscale TRAC boom. The experimental setup, loading cases, and instrumentation used to characterize the mechanical response of a subscale TRAC boom are described in this paper.

High-strain composites↗

Experimental Setup for Mechanically Testing Subscale Triangular, Rollable, and Collapsible Deployable Composite Booms

High-strain composite deployable space structures are used for space infrastructure and science applications such as solar array supports, antennae, camera masts, and lightweight structures supporting solar sailing propulsion elements. Triangular, Rollable, and Collapsible (TRAC) deployable composite booms are one example of a high-strain composite deployable structure and were studied using novel experimental test and characterization methods developed under the Gravity Offloading and Analysis of Long Imperfection-sensitive Elements (GOALIE) project. In the present work, a subscale 7-m-long TRAC boom was suspended vertically to orient gravity along the length of the boom. By orienting vertically, highly nonlinear and unstable behavior often encountered during horizontally oriented gravity offload testing of similar structures was reduced. Pretest analytical predictions of TRAC booms indicated three unique failure modes, loads, and locations for three unique loading cases of in-plane bending, out-of-plane bending, and axial compression. To investigate the predicted behavior, an experimental test was set up to impart mechanical loads to a subscale TRAC boom. The experimental setup, loading cases, and instrumentation used to characterize the mechanical response of a subscale TRAC boom are described in this paper.

Experimental testing↗

How to program 122,400 heterogeneous cores and retain your sanity

Current technology trends favor hybrid architectures, typically with each node in a cluster containing both general-purpose and specialized 'accelerator' processors. The typical model for programming such systems is host-centric: The general-purpose processor orchestrates the computation, offloading performance-critical work to the accelerator, and data is communicated only among general-purpose processors. In this talk we propose a radically different hybrid-programming approach, which we call the 'reverse-acceleration model'. In this model the accelerators orchestrate the computation, offloading unacceleratable work to the general-purpose processors. Data is communicated among accelerators, not among general-purpose processors. We present the Cell Messaging Layer (CML), an implementation of the reverse-acceleration model for Los Alamos National Laboratory's Roadrunner supercomputer, a complex conglomerate of 122,400 processor cores of various types, multiple memory domains, and multiple network types, all with radically different performance characteristics but which together make Roadrunner the world's second-fastest supercomputer. CML demonstrates a new messaging-layer implementation technique called 'receiver-initiated message passing', which reduces communication latency by up to a third. Our thesis is that the reverse-acceleration model simplifies porting codes to heterogeneous systems and facilitates performance optimization. We present a case study of a legacy neutron-transport code that we modified to use reverse acceleration. Performance results from running this code across the full Roadrunner system indicate a substantial performance improvement over the unaccelerated version of the code.

97 MATHEMATICS AND COMPUTING↗

Portals Reference Implementation v. 1.0

The Portals reference implementation is based on the Portals 4.X API, published by Sandia National Laboratories as a freely available public document. It is designed to be an implementation of the Portals Networking Application Programming Interface and is used by several other upper layer protocols like SHMEM, GASNet and MPI. It is implemented over existing networks, specifically Ethernet and InfiniBand networks. This implementation provides Portals networks functionality and serves as a software emulation of Portals compliant networking hardware. It can be used to develop software using the Portals API prior to the debut of Portals networking hardware, such as Bull’s BXI interconnect, as well as a substitute for portals hardware on development platforms that do not have Portals compliant hardware. The reference implementation provides new capabilities beyond that of a typical network, namely the ability to have messages matched in hardware in a way compatible with upper layer software such as MPI or SHMEM. It also offers methods of offloading network operations via triggered operations, which can be used to create offloaded collective operations. Specific details on the Portals API can be found at http://portals4.org.

Grant, Ryan E.↗

Exploiting Hierarchical Parallelism in an Astrophysical Equation of State Using OpenACC and OpenMP

Modeling thermonuclear supernovae is a premier application for leadership-class supercomputers and requires multi-physics simulation codes to capture hydrodynamics, nuclear burning, gravitational forces, etc. As a nuclear detonation burns through the stellar material, it also increases the temperature. An equation of state (EOS) is then required to determine, for example, the new pressure associated with this temperature increase. In fact, an EOS is needed after thermodynamic conditions are changed by any physics routines. This means it is called many times throughout a simulation, requiring the need for a fast EOS implementation. Fortunately, these calculations can be performed independently during each time step, so the work can be offloaded to GPUs. Using results from the IBM/NVIDIA early test system (Summitdev, a precursor to the upcoming Summit supercomputer) at Oak Ridge National Laboratory, we describe a hybrid OpenMP implementation with offloaded work to GPUs. We compare performance results between the two implementations, with a discussion of some of the currently available features of OpenACC and OpenMP 4.5.

Messer, Bronson↗

Scalable All-pairs Shortest Paths for Huge Graphs on Multi-GPU Clusters

We present an optimized Floyd-Warshall (Floyd-Warshall) algorithm that computes the All-pairs shortest path (APSP) for GPU accelerated clusters. The Floyd-Warshall algorithm due to its structural similarities to matrix-multiplication is well suited for highly parallel GPU architectures. To achieve high parallel efficiency, we address two key algorithmic challenges: reducing high communication overhead and addressing limited GPU memory. To reduce high communication costs, we redesign the parallel (a) to expose more parallelism, (b) aggressively overlap communication and computation with pipelined and asynchronous scheduling of operations, and (c) tailored MPI-collective. To cope with limited GPU memory, we employ an offload model, where the data resides on the host and is transferred to GPU on-demand. The proposed optimizations are supported with detailed performance models for tuning. Our optimized parallel Floyd-Warshall implementation is up to 5x faster than a strong baseline and achieves 8.1 PetaFLOPS/sec on 256~nodes of the Summit supercomputer at Oak Ridge National Laboratory. This performance represents 70% of the theoretical peak and 80% parallel efficiency. The offload algorithm can handle 2.5x larger graphs with a 20% increase in overall running time.

Sao, Piyush↗

ConnectX2 In niBand Management Queues: New support for Network Of oaded

This paper introduces the newly developed InfiniBand (IB) Management Queue capability, used by the Host Channel Adapter (HCA) to manage network task data flow dependancies, and progress the communications associated with such flows. These tasks include sends, receives, and the newly supported wait task, and are scheduled by the HCA based on a data dependency description provided by the user. This functionality is supported by the ConnectX-2 HCA, and provides the means for delegating collective communication management and progress to the HCA, also known as collective communication offload. This provides a means for overlapping collective communications managed by the HCA and computation on the Central Processing Unit (CPU), thus making it possible to reduce the impact of system noise on parallel applications using collective operations. This paper further describes how this new capability can be used to implement scalable Message Passing Interface (MPI) collective operations, describing the high level details of how this new capability is used to implement the MPI Barrier collective operation, focusing on the latency sensitive performance aspects of this new capability. This paper concludes with small scale benchmark experiments comparing implementations of the barrier collective operation, using the new network offload capabilities, with established point-to-point based implementations of these same algorithms, which manage the data flow using the central processing unit. These early results demonstrate the promise this new capability provides to improve the scalability of high-performance applications using collective communications. The latency of the HCA based implementation of the barrier is similar to that of the best performing point-to-point based implementation managed by the central processing unit, starting to outperform these as the number of processes involved in the collective operation increases.

99 GENERAL AND MISCELLANEOUS↗

Energy-efficient cooperative resource allocation and task scheduling for Internet of Things environments

Offloading Internet of Things (IoT) tasks to the cloud for further processing might not always lead to an optimal execution time, particularly in situations such as resource contention, under-provisioning, over-provisioning, and fragmentation. In addition, dynamically optimizing the number of Virtual Machines (VMs) for resource scheduling in order to meet application requirements remains a major research challenge. Further, existing resource scheduling algorithms focus primarily on minimizing operational costs while maximizing resource sharing and utilization. Considering energy utilization as part of the resource allocation and scheduling process as an optimization objective for maintaining load balancing has often been neglected. To address these challenges and more, we propose a cooperative energy-aware resource allocation and scheduling strategy based on a Technique for Order of Preference by Similarity to Ideal Solution (TOPSIS) multi-criteria decision-making method. Here we used the Grid Workloads Archive dataset to evaluate our proposed approach named TOPREAL. Experimental results with respect to the allocation of VM resources when considering processing a large segment of tasks indicate that TOPREAL outperforms existing algorithms in terms of energy savings, with an average improvement of 40.25%, while maintaining an average improvement of 16.21% when it comes to execution time. Results also demonstrate that our method can save an average of 78.06 processing hours and 63,215kJ of energy when compared to existing scheduling algorithms. These results demonstrate the effectiveness of our proposed model and the viability of using multi-criteria decision-making techniques such as TOPSIS to solve the resource allocation and scheduling problem in edge environments.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

GenASiS Mathematics: Object-oriented manifolds, operations, and solvers for large-scale physics simulations (version 2)

We report GenASiS Mathematics provides modern Fortran classes furnishing extensible object-oriented functionality for the solution of fields governed by selected partial differential equations. The initial release included extensible object-oriented implementations of simple meshes and the evolution of generic conserved currents thereon. This revision - Version 2 of Mathematics - includes significant reorganization and streamlining of these classes, higher-order reconstruction by a different method, a Poisson solver, coarsening to avoid Courant time step limitations near coordinate singularities, and the offloading of computational kernels to GPUs.

97 MATHEMATICS AND COMPUTING↗

Acceleration of the Parameterization of Unified Microphysics Across Scales (PUMAS) on the Graphics Processing Unit (GPU) With Directive-Based Methods

Cloud microphysics is one of the most time-consuming components in a climate model. In this study, we port the cloud microphysics parameterization in the Community Atmosphere Model (CAM), known as Parameterization of Unified Microphysics Across Scales (PUMAS), from CPU to GPU to seek a computational speedup. The directive-based methods (OpenACC and OpenMP target offload) are determined as the best fit specifically for our development practices, which enable a single version of source code to run either on the CPU or GPU, and yield a better portability and maintainability. Their performance is first examined in a PUMAS stand-alone kernel and the directive-based methods can outperform a CPU node as long as there is enough computational burden on the GPU. A consistent behavior is observed when we run PUMAS on the GPU in a practical CAM simulation. A 3.6× speedup of the PUMAS execution time, including data movement between CPU and GPU, is achieved at a coarse horizontal resolution (8 NVIDIA V100 GPUs against 36 Intel Skylake CPU cores). This speedup further increases up to 5.4× at a high resolution (24 NVIDIA V100 GPUs against 108 Intel Skylake CPU cores), which highlights the fact that GPU favors larger problem size. This study demonstrates that using GPU in a CAM simulation can save noticeable computational costs even with a small portion of code being GPU-enabled. Therefore, we are encouraged to port more parameterizations to GPU to take advantage of its computational benefit.

54 ENVIRONMENTAL SCIENCES↗

Webinar Presentation for Lunar Delivery Challenge

This presentation is a public webinar presentation to promote and to answer questions for the NASA STMD sponsored challenge for solutions towards offloading cargo on the lunar surface. The challenge is managed by contractor partner Hero-X.

Artemis↗

Final Technical Report for CMSC 838L

This paper describes Rahul Vishnoi’s final project supporting in his Graduate School curriculum CMSC 838L, Advanced Topics in Programming Languages and Computer Architecture. This project was selected to intersect with his work as a Pathways Intern supporting Code 583, the Ground Software Systems Branch, at NASA’s Goddard Space Flight Center (GSFC). In this project, Field Programmable Gate Array (FPGA) hardware from Xilinx is used to replace and offload processor and memory-intensive computations from a microcontroller/Processing System (PS) to the FPGA Programmable Logic (PL). An interface between the PL and PS in the form of a C library allows for this bridging of capability.

Microcontroller, FPGA, Embedded Development, Xilin↗

ActiveSpaces: Exploring dynamic code deployment for extreme scale data processing: ActiveSpaces: Exploring dynamic code deployment for extreme scale data processing

Managing the large volumes of data produced by emerging scientific and engineering simulations running on leadership-class resources has become a critical challenge. The data have to be extracted off the computing nodes and transported to consumer nodes so that it can be processed, analyzed, visualized, archived, and so on. Several recent research efforts have addressed data-related challenges at different levels. One attractive approach is to offload expensive input/output operations to a smaller set of dedicated computing nodes known as a staging area. However, even using this approach, the data still have to be moved from the staging area to consumer nodes for processing, which continues to be a bottleneck. In this paper, we investigate an alternate approach, namely moving the data-processing code to the staging area instead of moving the data to the data-processing code. Specifically, we describe the ActiveSpaces framework, which provides (1) programming support for defining the data-processing routines to be downloaded to the staging area and (2) runtime mechanisms for transporting codes associated with these routines to the staging area, executing the routines on the nodes that are part of the staging area, and returning the results. We also present an experimental performance evaluation of ActiveSpaces using applications running on the Cray XT5 at Oak Ridge National Laboratory. Finally, we use a coupled fusion application workflow to explore the trade-offs between transporting data and transporting the code required for data processing during coupling, and we characterize sweet spots for each option.

97 MATHEMATICS AND COMPUTING↗

Understanding the use of message passing interface in exascale proxy applications

The Exascale Computing Project (ECP) focuses on the development of future exascale-capable applications. Most ECP applications use the message passing interface (MPI) as their parallel programming model with mini-apps serving as proxies. This paper explores the explicit usage of MPI in such ECP proxy applications. We empirically analyze 14 proxy applications from the ECP Proxy Apps Suite. We use the MPI profiling interface (PMPI) to collect MPI usage patterns in ECP proxy apps. Our analysis shows that a small subset of features from MPI is commonly used in the proxies of exascale-capable applications, even when they reference third-party libraries. Overall, this study is intended to provide a better understanding of the use of MPI in current exascale applications. The findings can help focus software investments made for exascale systems in the MPI middleware including optimization, fault-tolerance, tuning, and hardware-offload.

97 MATHEMATICS AND COMPUTING↗

An identity privacy scheme for blockchain‐based on edge computing

Abstract Blockchain has decentralization characteristics and requires more targeted security schemes to protect user privacy. In contrast, existing signature schemes have many high‐complexity operations and impose an enormous computational burden on wireless nodes. This article proposes a light‐weighted identity privacy scheme for blockchain‐based on edge computing. We construct linkable identity privacy and non‐linkable identity privacy, which can resist collusion attacks while virtually guaranteeing blockchain nodes' identity privacy. Since edge computing offloads heavily, the proposed scheme has lower computational complexity than the existing techniques.

Mu, Rui↗