Search NASA⌕ Search

SEARCH · Search NASA

Results for “computing systems”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,531 records · Page 85
All sourcesNASA NTRSDOE OSTI
NASA NTRS1992

Linear analysis of opto-mechanical systems

A general framework is presented for the matrix-form, linear optical model analysis of controlled optomechanical systems; the models are conjoined with linear models of structures and controls to compute system performance as a function of optics, structures, and control parameters. Covariance analysis, optimization, and estimation/simulation are used. Attention is given to a tolerancing example for the Hubble Space Telescope's Wide Field and Planetary Camera, which involves the creation of a linear model of residual pupil shear.

Redding, David C.↗
NASA NTRS2008

Integrated Docking Simulation and Testing with the Johnson Space Center Six-Degree of Freedom Dynamic Test System

The Exploration Systems Architecture defines missions that require rendezvous, proximity operations, and docking (RPOD) of two spacecraft both in Low Earth Orbit (LEO) and in Low Lunar Orbit (LLO). Uncrewed spacecraft must perform automated and/or autonomous rendezvous, proximity operations and docking operations (commonly known as Automated Rendezvous and Docking, AR&D). The crewed versions may also perform AR&D, possibly with a different level of automation and/or autonomy, and must also provide the crew with relative navigation information for manual piloting. The capabilities of the RPOD sensors are critical to the success of the Constellation Program; this is carried as one of the CEV Project top risks. The Exploration Technology Development Program (ETDP) AR&D Sensor Technology Project seeks to reduce this risk by increasing technology maturation of selected relative navigation sensor technologies through testing and simulation. One of the project activities is a series of "pathfinder" testing and simulation activities to integrate relative navigation sensors with the Johnson Space Center Six-Degree-of-Freedom Test System (SDTS). The SDTS will be the primary testing location for the Orion spacecraft s Low Impact Docking System (LIDS). Project team members have integrated the Orion simulation with the SDTS computer system so that real-time closed loop testing can be performed with relative navigation sensors and the docking system in the loop during docking and undocking scenarios. Two relative navigation sensors are being used as part of a "pathfinder" activity in order to pave the way for future testing with the actual Orion sensors. This paper describes the test configuration and test results.

Mitchell, Jennifer D.↗
DOE OSTI2018

Register files for I/O packet compression

Systems, apparatuses, and methods for reducing inter-node bandwidth are contemplated. A computer system includes requesting nodes sending transactions to target nodes. A requesting node sends a packet that includes a register identifier (ID) in place of a data value in the packet. The register ID indicates a register in the target node storing the data value. The register ID uses fewer bits in the packet than the data value. The data value may be a memory address referencing a memory location in the target node. The received packet may also include an opcode indicating an operation to perform on the targeted data value.

Roberts, David A.↗
DOE OSTI2021

Integrated system failure analysis software toolchain (IS-FAST)

Systems and methods are provided for generating faults and analyzing fault propagation and its effects. Starting from the ontologies of components, functions, flows, and faults, systems and methods are provided that describe, generate and track faults in a computer system across multiple domains throughout design and/or development. In order to construct the system and fault models, a series of concepts is introduced in the form of ontologies and their dependencies. An investigation is performed into the faults, including their type, cause, life-cycle aspects, and effect. Principles and rules are created to generate various faults based on system configurations. After the modeling process, a simulation engine is described to execute actions and simulate the process of fault generation and propagation. As a result, fault paths that impact components and functions can be obtained.

Diao, Xiaoxu↗
DOE OSTI2020

Systems, methods and computer program products for constructing complex geometries using layered and linked hexahedral element meshes

Systems, methods and computer program products for creating 3D representations of bodies are disclosed. The systems, methods and computer program products include the construction of FE meshes representing complex geometries. The complex geometries may be artificially or naturally formed or designed geometries. The techniques reduce the number of elements as much as possible to save on computer run time while maintaining computational accuracy.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

EXAGRAPH: Graph and combinatorial methods for enabling exascale applications

Combinatorial algorithms in general and graph algorithms in particular play a critical enabling role in numerous scientific applications. However, the irregular memory access nature of these algorithms makes them one of the hardest algorithmic kernels to implement on parallel systems. With tens of billions of hardware threads and deep memory hierarchies, the exascale computing systems in particular pose extreme challenges in scaling graph algorithms. The codesign center on combinatorial algorithms, ExaGraph, was established to design and develop methods and techniques for efficient implementation of key combinatorial (graph) algorithms chosen from a diverse set of exascale applications. Algebraic and combinatorial methods have a complementary role in the advancement of computational science and engineering, including playing an enabling role on each other. In this paper, we survey the algorithmic and software development activities performed under the auspices of ExaGraph from both a combinatorial and an algebraic perspective. In particular, we detail our recent efforts in porting the algorithms to manycore accelerator (GPU) architectures. We also provide a brief survey of the applications that have benefited from the scalable implementations of different combinatorial algorithms to enable scientific discovery at scale. We believe that several applications will benefit from the algorithmic and software tools developed by the ExaGraph team.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Comparative evaluation of deep learning workloads for leadership-class systems

Deep learning (DL) workloads and their performance at scale are becoming important factors to consider as we design, develop and deploy next-generation high-performance computing systems. Since DL applications rely heavily on DL frameworks and underlying compute (CPU/GPU) stacks, it is essential to gain a holistic understanding from compute kernels, models, and frameworks of popular DL stacks, and to assess their impact on science-driven, mission-critical applications. At Oak Ridge Leadership Computing Facility (OLCF), we employ a set of micro and macro DL benchmarks established through the Collaboration of Oak Ridge, Argonne, and Livermore (CORAL) to evaluate the AI readiness of our next-generation supercomputers. In this paper, we present our early observations and performance benchmark comparisons between the Nvidia V100 based Summit system with its CUDA stack and an AMD MI100 based testbed system with its ROCm stack. We take a layered perspective on DL benchmarking and point to opportunities for future optimizations in the technologies that we consider.

Yin, Junqi↗
NASA NTRS2021

A Simulation Study of Bin-and-Sort Policies in a Distributed System for Flights Scheduling

This is a report on the results of a simulation experiment conducted on an automated distributed system for scheduling flights in a shared airspace. The scheduling is carried out by computer systems owned by the private operators of the flights, which interface through a centralized independent server. The scheduling requires determining which of the group of flights at hand (whether owned by the same operator or different ones) are to have the advantage of being scheduled before the others. A chosen method of grouping and prioritizing flights must: have the ability to schedule a flight promptly, prevent scheduling conflicts between pairs of overlapping flight routes, and be computationally feasible. Scheduling flights one by one is the First Come First Served policy. Scheduling too many at a time is infeasible. The type of scheduling policy proposed herein, called bin-and-sort, is an attempt to reach a compromise between these two extremes. Bin-and-sort allows for each operator to choose its criteria for prioritizing its flights, and for the centralized component to use different arbitration criteria. A number of these criteria are used in the simulation presented herein. The results of each criterion choice are reported and analyzed.

flight scheduling↗
NASA NTRS2021

A Simulation Study of Bin-and-Sort Policies in a Distributed System for Flights Scheduling

This is a report on the results of a simulation experiment conducted on an automated distributed system for scheduling flights in a shared airspace. The scheduling is carried out by computer systems owned by the private operators of the flights, which interface through a centralized independent server. The scheduling requires determining which of the group of flights at hand (whether owned by the same operator or different ones) are to have the advantage of being scheduled before the others. A chosen method of grouping and prioritizing flights must: have the ability to schedule a flight promptly, prevent scheduling conflicts between pairs of overlapping flight routes, and be computationally feasible. Scheduling flights one by one is the First Come First Served policy. Scheduling too many at a time is infeasible. The type of scheduling policy proposed herein, called bin-and-sort, is an attempt to reach a compromise between these two extremes. Bin-and-sort allows for each operator to choose its criteria for prioritizing its flights, and for the centralized component to use different arbitration criteria. A number of these criteria are used in the simulation presented herein. The results of each criterion choice are reported and analyzed.

flight scheduling↗
DOE OSTI2019

Memristors learn to play

A hybrid analogue–digital computing system built upon memristive devices is capable of solving classic control problems with potentially a lower energy consumption and higher speed than fully digital systems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Systems Security Architecture Research and Development

The general technical goals of the project were to better understand the assumptions of security guarantees using secure commercial off-the-shelf (COTS) technologies, to identify possible security weaknesses introduced during system integration, and to create improved security hardware and software which result in well understood reference architectures for critical computing systems and applications.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2003

Toward a Dynamically Reconfigurable Computing and Communication System for Small Spacecraft

Future science missions will require the use of multiple spacecraft with multiple sensor nodes autonomously responding and adapting to a dynamically changing space environment. The acquisition of random scientific events will require rapidly changing network topologies, distributed processing power, and a dynamic resource management strategy. Optimum utilization and configuration of spacecraft communications and navigation resources will be critical in meeting the demand of these stringent mission requirements. There are two important trends to follow with respect to NASA's (National Aeronautics and Space Administration) future scientific missions: the use of multiple satellite systems and the development of an integrated space communications network. Reconfigurable computing and communication systems may enable versatile adaptation of a spacecraft system's resources by dynamic allocation of the processor hardware to perform new operations or to maintain functionality due to malfunctions or hardware faults. Advancements in FPGA (Field Programmable Gate Array) technology make it possible to incorporate major communication and network functionalities in FPGA chips and provide the basis for a dynamically reconfigurable communication system. Advantages of higher computation speeds and accuracy are envisioned with tremendous hardware flexibility to ensure maximum survivability of future science mission spacecraft. This paper discusses the requirements, enabling technologies, and challenges associated with dynamically reconfigurable space communications systems.

Kifle, Muli↗
DOE OSTI2021

Full-field imaging learning machine (FILM)

A method of determining dynamic properties of a structure (linear or nonlinear) includes receiving spatio-temporal inputs, generating mode shapes and modal components corresponding to the spatio-temporal inputs using a trained deep complexity coding artificial neural network, and subsequently generating the dynamic properties by analyzing each modal component using a trained learning machine. A computing system for non-contact determination of dynamic properties of a structure includes a camera, a processor, and a memory including computer-executable instructions. When the instructions are executed, the system is caused to receive spatio-temporal image data, decompose the spatio-temporal image data into constituent manifold components using an autoencoder, and analyze the constituent manifold components using a trained learning machine to determine the dynamic properties.

Yang, Yongchao↗
DOE OSTI2020

Power-oriented bus encoding for data transmission

Systems, apparatuses, and methods for reducing the toggle rates on buses are disclosed. A computing system includes a source which provides packets for transmission on a bus. The packet is compressed by a compression engine. The compressed data format of the packet includes locations (bit positions) referred to as holes which do not include valid data. A bus configuration module identifies the locations of the holes and replaces the holes with information from a previous packet transmitted earlier on the bus. The bus configuration module also determines a new transmission bus width for the packet for lowering the bus toggle rate on the bus during transmission.

42 ENGINEERING↗
DOE OSTI2024

DIRAC current, upcoming and planned capabilities and technologies

DIRAC is the interware for building and operating large scale distributed computing systems. It is adopted by multiple collaborations from various scientific domains for implementing their computing models. DIRAC provides a framework and a rich set of ready-to-use services for Workload, Data and Production Management tasks of small, medium and large scientific communities having different computing requirements. The base functionality can be easily extended by custom components supporting community specific workflows. DIRAC is at the same time an aging project, and a new DiracX project is taking shape for replacing DIRAC in the long term. This contribution will highlight DIRAC’s current, upcoming and planned capabilities and technologies, and how the transition to DiracX will take place. Examples include, but are not limited to, adoption of security tokens and interactions with Identity Provider services, integration of Clouds and High Performance Computers, interface with Rucio, improved monitoring and deployment procedures.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

Visual Data-Analytics of Large-Scale Parallel Discrete-Event Simulations

Parallel discrete-event simulation (PDES) is an important tool in the codesign of extreme-scale systems because PDES provides a cost-effective way to evaluate designs of highperformance computing systems. Optimistic synchronization algorithms for PDES, such as Time Warp, allow events to be processed without global synchronization among the processing elements. A rollback mechanism is provided when events are processed out of timestamp order. Although optimistic synchronization protocols enable the scalability of large-scale PDES, the performance of the simulations must be tuned to reduce the number of rollbacks and provide an improved simulation runtime. To enable efficient large-scale optimistic simulations, one has to gain insight into the factors that affect the rollback behavior and simulation performance. We developed a tool for ROSS model developers that gives them detailed metrics on the performance of their large-scale optimistic simulations at varying levels of simulation granularity. Model developers can use this information for parameter tuning of optimistic simulations in order to achieve better runtime and fewer rollbacks. In this work, we instrument the ROSS optimistic PDES framework to gather detailed statistics about the simulation engine. We have also developed an interactive visualization interface that uses the data collected by the ROSS instrumentation to understand the underlying behavior of the simulation engine. The interface connects real time to virtual time in the simulation and provides the ability to view simulation data at different granularities. We demonstrate the usefulness of our framework by performing a visual analysis of the dragonfly network topology model provided by the CODES simulation framework built on top of ROSS. The instrumentation needs to minimize overhead in order to accurately collect data about the simulation performance. To ensure that the instrumentation does not introduce unnecessary overhead, we perform a scaling study that compares instrumented ROSS simulations with their noninstrumented counterparts in order to determine the amount of perturbation when running at different simulation scales.

Ross, Caitlin↗