Results for “Programming model” — Page 27

NASA NTRS2001

Radiation transport modeling and assessment to better predict radiation exposure, dose, and toxicological effects to human organs on long duration space flights

NASA is very interested in improving its ability to monitor and forecast the radiation levels that pose a health risk to space-walking astronauts as they construct the International Space Station and astronauts that will participate in long-term and deep-space missions. Human exploratory missions to the moon and Mars within the next quarter century, will expose crews to transient radiation from solar particle events which include high-energy galactic cosmic rays and high-energy protons. Because the radiation levels in space are high and solar activity is presently unpredictable, adequate shielding is needed to minimize the deleterious health effects of exposure to radiation. Today, numerous models have been developed and used to predict radiation exposure. Such a model is the Space Environment Information Systems (SPENVIS) modeling program, developed by the Belgian Institute for Space Aeronautics. SPENVIS, which has been assessed to be an excellent tool in characterizing the radiation environment for microelectronics and investigating orbital debris, is being evaluated for its usefulness with determining the dose and dose-equivalent for human exposure. Thus far. the calculations for dose-depth relations under varying shielding conditions have been in agreement with calculations done using HZETRN and PDOSE, which are well-known and widely used models for characterizing the environments for human exploratory missions. There is disagreement when assessing the impact of secondary radiation particles since SPENVIS does a crude estimation of the secondary radiation particles when calculating LET versus Flux. SPENVIS was used to model dose-depth relations for the blood-forming organs. Radiation sickness and cancer are life-threatening consequences resulting from radiation exposure. In space. exposure to radiation generally includes all of the critical organs. Biological and toxicological impacts have been included for discussion along with alternative risk mitigation methods--shielding and anti-carcinogens. c 2001. Elsevier Science Ltd. All rights reserved.

STS-91 Shuttle Project↗

DOE OSTI2023

Special Topic on High Performance Computing in Chemical Physics

Computational modeling and simulation have become indispensable scientific tools in virtually all areas of chemical, biomolecular, and materials systems research. Computation can provide unique and detailed atomic level information that is difficult or impossible to obtain through analytical theories and experimental investigations. In addition, recent advances in micro-electronics have resulted in computer architectures with unprecedented computational capabilities, from the largest supercomputers to common desktop computers. In conclusion, combined with the development of new computational domain science methodologies and novel programming models and techniques, this has resulted in modeling and simulation resources capable of providing results at or better than experimental chemical accuracy and for systems in increasingly realistic chemical environments.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

NASA NTRS1999

NASA Nebraska Space Grant Consortium 1995-1999 Self Evaluation

The NASA Nebraska Space Grant Consortium receives funds from NASA to allow Nebraska colleges and universities to implement balanced programs of research, education and public service related to aeronautics, space science and technology. Nebraska is a capability enhancement state which directs efforts and resources toward developing research infrastructure and enhancing the quality of aerospace research and education for all Nebraskans. Furthermore, the Nebraska Space Grant strives to provide national leadership in applied aspects of aeronautics. Nebraska has met, meets and will continue to meet all requirements set forth by NASA. Nebraska is a top-tier consortium and will continue to be a model program.

Schaaf, Michaela M.↗

DOE OSTI2025

The Viskores User's Guide, Release 1.1

High-performance computing relies on ever finer threading. Advances in processor technology include ever greater numbers of cores, hyperthreading, accelerators with integrated blocks of cores, and special vectorized instructions, all of which require more software parallelism to achieve peak performance. Traditional visualization solutions cannot support this extreme level of concurrency. Extreme scale systems require a new programming model and a fundamental change in how we design algorithms. To address these issues we created Viskores: the visualization toolkit for multi/many-core architectures. Viskores supports a number of algorithms and the ability to design further algorithms through a top-down design with an emphasis on extreme parallelism. Viskores also provides support for finding and building links across topologies, making it possible to perform operations that determine manifold surfaces, interpolate generated values, and find adjacencies. Although Viskores provides a simplified high-level interface for programming, its template-based code removes the overhead of abstraction.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

The Viskores User's Guide (V.1.0)

High-performance computing relies on ever finer threading. Advances in processor technology include ever greater numbers of cores, hyperthreading, accelerators with integrated blocks of cores, and special vectorized instructions, all of which require more software parallelism to achieve peak performance. Traditional visualization solutions cannot support this extreme level of concurrency. Extreme scale systems require a new programming model and a fundamental change in how we design algorithms. To address these issues we created Viskores: the visualization toolkit for multi-/many-core architectures. Viskores supports a number of algorithms and the ability to design further algorithms through a top-down design with an emphasis on extreme parallelism. Viskores also provides support for finding and building links across topologies, making it possible to perform operations that determine manifold surfaces, interpolate generated values, and find adjacencies. Although Viskores provides a simplified high-level interface for programming, its template-based code removes the overhead of abstraction.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1981

Modelling the high-latitude ionosphere

Results of an ionospheric model program are presented which demonstrate the extreme variability of the steady state, daytime, ionospheric F region electron density and ion composition due to both neutral atmospheric changes with solar cycle, season and magnetic activity, and to the effects of ionospheric drifts caused by perpendicular electric fields. Consideration is given to the time history of the ionospheric plasma as it undergoes convective motion due to the combined effects of corotation forces and electromagnetic forces which results from the mapping of the magnetospheric cross tail electric field to the rotating ionosphere. A simple model of the convection pattern is described. The model calculates the net effect of the tendency for the plasma to corotate about the geographic pole and the E sub Bar times B sub Bar velocity induced by a perpendicular electric field mapped to a circle centered about a point 5 deg antisunward of the geomagnetic pole and oriented such that the equipotentials are parallel to the noon midnight meridian. This convection pattern shows the generally accepted features of high latitude convection, but because of the offset between the geographic and geomagnetic poles a marked universal time dependence in these features is predicted.

Raitt, W. J.↗

NASA NTRS2003

Automated Modeling and Simulation Using the Bond Graph Method for the Aerospace Industry

Bond graph modeling was originally developed in the late 1950s by the late Prof. Henry M. Paynter of M.I.T. Prof. Paynter acted well before his time as the main advantage of his creation, other than the modeling insight that it provides and the ability of effectively dealing with Mechatronics, came into fruition only with the recent advent of modern computer technology and the tools derived as a result of it, including symbolic manipulation, MATLAB, and SIMULINK and the Computer Aided Modeling Program (CAMPG). Thus, only recently have these tools been available allowing one to fully utilize the advantages that the bond graph method has to offer. The purpose of this paper is to help fill the knowledge void concerning its use of bond graphs in the aerospace industry. The paper first presents simple examples to serve as a tutorial on bond graphs for those not familiar with the technique. The reader is given the basic understanding needed to appreciate the applications that follow. After that, several aerospace applications are developed such as modeling of an arresting system for aircraft carrier landings, suspension models used for landing gears and multibody dynamics. The paper presents also an update on NASA's progress in modeling the International Space Station (ISS) using bond graph techniques, and an advanced actuation system utilizing shape memory alloys. The later covers the Mechatronics advantages of the bond graph method, applications that simultaneously involves mechanical, hydraulic, thermal, and electrical subsystem modeling.

Granda, Jose J.↗

DOE OSTI2021

VTK-m User's' Guide (V.1.7)

High-performance computing relies on ever finer threading. Advances in processor technology include ever greater numbers of cores, hyperthreading, accelerators with integrated blocks of cores, and special vectorized instructions, all of which require more software parallelism to achieve peak performance. Traditional visualization solutions cannot support this extreme level of concurrency. Extreme scale systems require a new programming model and a fundamental change in how we design algorithms. To address these issues we created VTK-m: the visualization toolkit for multi-/many-core architectures. VTK-m supports a number of algorithms and the ability to design further algorithms through a top-down design with an emphasis on extreme parallelism. VTK-m also provides support for finding and building links across topologies, making it possible to perform operations that determine manifold surfaces, interpolate generated values, and find adjacencies. Although VTK-m provides a simplified high-level interface for programming, its template-based code removes the overhead of abstraction. VTK-m simplifies the development of parallel scientific visualization algorithms by providing a framework of supporting functionality that allows developers to focus on visualization operations. Consider the listings in Figure 1.1 that compares the size of the implementation for the Marching Cubes algorithm in VTK-m with the equivalent reference implementation in the CUDA software development kit. Because VTK-m internally manages the parallel distribution of work and data, the VTK-m implementation is shorter and easier to maintain. Additionally, VTK-m provides data abstractions not provided by other libraries that make code written in VTK-m more versatile.This book includes contributions from the VTK-m community including the VTK-m development team and the user community.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

VTK-m User's Guide (V.1.8)

Extreme scale systems require a new programming model and a fundamental change in how we design algorithms. To address these issues we created VTK-m: the visualization toolkit for multi-/many-core architectures. VTK-m supports a number of algorithms and the ability to design further algorithms through a top-down design with an emphasis on extreme parallelism. VTK-m also provides support for finding and building links across topologies, making it possible to perform operations that determine manifold surfaces, interpolate generated values, and find adjacencies. Although VTK-m provides a simplified high-level interface for programming, its template-based code removes the overhead of abstraction. VTK-m simplifies the development of parallel scientific visualization algorithms by providing a framework of supporting functionality that allows developers to focus on visualization operations. Additionally, VTK-m provides data abstractions not provided by other libraries that make code written in VTK-m more versatile.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

The VTK-m Users' Guide (V.1.9)

High-performance computing relies on ever finer threading. Advances in processor technology include ever greater numbers of cores, hyperthreading, accelerators with integrated blocks of cores, and special vectorized instructions, all of which require more software parallelism to achieve peak performance. Traditional visualization solutions cannot support this extreme level of concurrency. Extreme scale systems require a new programming model and a fundamental change in how we design algorithms. To address these issues we created VTK-m: the visualization toolkit for multi-/many-core architectures. VTK-m supports a number of algorithms and the ability to design further algorithms through a top-down design with an emphasis on extreme parallelism. VTK-m also provides support for finding and building links across topologies, making it possible to perform operations that determine manifold surfaces, interpolate generated values, and find adjacencies. Although VTK-m provides a simplified high-level interface for programming, its template-based code removes the overhead of abstraction. VTK-m simplifies the development of parallel scientific visualization algorithms by providing a framework of supporting functionality that allows developers to focus on visualization operations. Consider the listings in Figure 1.1 that compares the size of the implementation for the Marching Cubes algorithm in VTK-m with the equivalent reference implementation in the CUDA software development kit. Because VTK-m internally manages the parallel distribution of work and data, the VTK-m implementation is shorter and easier to maintain. Additionally, VTK-m provides data abstractions not provided by other libraries that make code written in VTK-m more versatile.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

The VTK-m Users' Guide (V.2.0)

High-performance computing relies on ever finer threading. Advances in processor technology include ever greater numbers of cores, hyperthreading, accelerators with integrated blocks of cores, and special vectorized instructions, all of which require more software parallelism to achieve peak performance. Traditional visualization solutions cannot support this extreme level of concurrency. Extreme scale systems require a new programming model and a fundamental change in how we design algorithms. To address these issues we created VTK-m: the visualization toolkit for multi-/many-core architectures. VTK-m supports a number of algorithms and the ability to design further algorithms through a top-down design with an emphasis on extreme parallelism. VTK-m also provides support for finding and building links across topologies, making it possible to perform operations that determine manifold surfaces, interpolate generated values, and find adjacencies. Although VTK-m provides a simplified high-level interface for programming, its template-based code removes the overhead of abstraction. VTK-m simplifies the development of parallel scientific visualization algorithms by providing a framework of supporting functionality that allows developers to focus on visualization operations. Consider the listings in Figure 1.1 that compares the size of the implementation for the Marching Cubes algorithm in VTK-m with the equivalent reference implementation in the CUDA software development kit. Because VTK-m internally manages the parallel distribution of work and data, the VTK-m implementation is shorter and easier to maintain. Additionally, VTK-m provides data abstractions not provided by other libraries that make code written in VTK-m more versatile.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

The VTK-m User's Guide (V. 2.2)

High-performance computing relies on ever finer threading. Advances in processor technology include ever greater numbers of cores, hyperthreading, accelerators with integrated blocks of cores, and special vectorized instructions, all of which require more software parallelism to achieve peak performance. Traditional visualization solutions cannot support this extreme level of concurrency. Extreme scale systems require a new programming model and a fundamental change in how we design algorithms. To address these issues we created VTK-m: the visualization toolkit for multi-/many-core architectures. VTK-m supports a number of algorithms and the ability to design further algorithms through a top-down design with an emphasis on extreme parallelism. VTK-m also provides support for finding and building links across topologies, making it possible to perform operations that determine manifold surfaces, interpolate generated values, and find adjacencies. Although VTK-m provides a simplified high-level interface for programming, its template-based code removes the overhead of abstraction.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

Model for Collaboration among Carriers to Reduce Empty Container Truck Trips

In recent years, intermodal transport has become an increasingly attractive alternative to freight shippers. However, the current intermodal freight transport is not as efficient as it could be. Oftentimes an empty container needs to be transported from the empty container depot to the shipper, and conversely, an empty container needs to be transported from the receiver to the empty container depot. These empty container movements decrease the freight carrier’s profit, as well as increase traffic congestion, decrease roadway safety, and add unnecessary emissions to the environment. To this end, our study evaluates a potential collaboration strategy to be used by carriers for domestic intermodal freight transport based on an optimization approach to reduce the number of empty container trips. A binary integer-linear programming model is developed to determine each freight carrier’s optimal schedule while minimizing its operating cost. The model ensures that the cost for each carrier with collaboration is less than or equal to its cost without collaboration. It also ensures that average savings from the collaboration are shared equally among all participating carriers. Additionally, two stochastic models are provided to account for uncertainty in truck travel times. The proposed collaboration strategy is tested using empirical data and is demonstrated to be effective in meeting all of the shipment constraints.

42 ENGINEERING↗

NASA NTRSDate not supplied

Examining Artifacts from GLOBE Program Research Symposia & Using Network Analysis Techniques to Characterize Students’ Authentic STEM Investigations

For the past several years, the GLOBE Program's International Virtual Science Symposia (IVSS) and Student Research Symposia (SRS) have provided opportunities for U.S. and international students to present their Earth science research investigations to the GLOBE community through online or in-person events. This presentation will share the techniques and findings of an evaluation study that used student posters and written reports to characterize their research investigations through multiple lenses and frameworks. The study began with a list of characteristics drawn from a literature review, an analysis of sample projects, and several reviews by expert stakeholders and scientists, which comprehensively covered diverse relevant frameworks including citizen science, student STEM learning through authentic experiences, and The GLOBE Program model. Once applied to 207 student projects, this list of codes revealed the frequency and prevalence of various qualities and experiences represented by GLOBE student research investigations. An innovative application of social network analysis techniques to the coded dataset revealed frequently cooccurring characteristics. This networking approach identified and conceptually mapped several "clusters" of characteristics that typified student projects, empirically based on the submitted projects themselves. The basic quantitative investigation of frequencies indicates the extent to which various characteristics are present in - or absent from - GLOBE SRS and IVSS projects, while the network analysis provides a descriptive framework for typifying projects. Ultimately, the descriptive framework fostered a suite of assessment tools to help The GLOBE Program's staff, scientists, and research project judges understand the diversity of student research projects. GLOBE can use these tools to identify and respond to areas of need; for instance, the descriptive framework illustrates the potential for further education and training resources related to data analysis, interpretation of data, and credibility of scientific claims. This presentation will share the novel utilization of network analysis techniques to holistically assess and react to student research contributions.

Ann Martin↗

DOE OSTI2021

Evaluation of Portable Acceleration Solutions for LArTPC Simulation Using Wire-Cell Toolkit

The Liquid Argon Time Projection Chamber (LArTPC) technology plays an essential role in many current and future neutrino experiments. Accurate and fast simulation is critical to developing efficient analysis algorithms and precise physics model projections. The speed of simulation becomes more important as Deep Learning algorithms are getting more widely used in LArTPC analysis and their training requires a large simulated dataset. Heterogeneous computing is an efficient way to delegate computationally intensive tasks to specialized hardware. However, as the landscape of compute accelerators quickly evolves, it becomes increasingly difficult to manually adapt the code to the latest hardware or software environments. A solution which is portable to multiple hardware architectures without substantially compromising performance would thus be very beneficial, especially for long-term projects such as the LArTPC simulations. In search of a portable, scalable and maintainable software solution for LArTPC simulations, we have started to explore high-level portable programming frameworks that support several hardware backends. In this paper, we present our experience porting the LArTPC simulation code in the Wire-Cell Toolkit to NVIDIA GPUs, first with the CUDA programming model and then with a portable library called Kokkos. Preliminary performance results on NVIDIA V100 GPUs and multi-core CPUs are presented, followed by a discussion of the factors affiecting the performance and plans for future improvements.

Yu, Haiwang↗

NASA NTRS2003

Performance Characteristics of the Multi-Zone NAS Parallel Benchmarks

We describe a new suite of computational benchmarks that models applications featuring multiple levels of parallelism. Such parallelism is often available in realistic flow computations on systems of grids, but had not previously been captured in bench-marks. The new suite, named NPB Multi-Zone, is extended from the NAS Parallel Benchmarks suite, and involves solving the application benchmarks LU, BT and SP on collections of loosely coupled discretization meshes. The solutions on the meshes are updated independently, but after each time step they exchange boundary value information. This strategy provides relatively easily exploitable coarse-grain parallelism between meshes. Three reference implementations are available: one serial, one hybrid using the Message Passing Interface (MPI) and OpenMP, and another hybrid using a shared memory multi-level programming model (SMP+OpenMP). We examine the effectiveness of hybrid parallelization paradigms in these implementations on three different parallel computers. We also use an empirical formula to investigate the performance characteristics of the multi-zone benchmarks.

Jin, Haoqiang↗

NASA NTRS2015

Physiological Health Challenges for Human Missions to Mars

During the next decades, manned space missions are expected to be aiming at the Lagrange points, near Earth asteroids, and Mars flyby and/or landing. The question is therefore: Are we ready to go? To answer this with a yes, we are currently using the International Space Station to develop an integrated human physiological countermeasure suite. The integrated countermeasure suite will most likely encounter: 1) Exercise devices for aerobic, dynamic and resistive exercise training; 2) sensory‐motor computer training programs and anti‐motion sickness medication for preparing EVAs and G‐transitions; 3) lower limb bracelets for preventing and/or treating the VIIP (vision impairment and intracranial pressure) syndrome; 4) nutritional components for maintenance of bone, muscle, the cardiovascular system and preventing oxidative stress and damage and immune deficiencies (e. g. omega‐3 fatty acids, PRO/K, anti‐oxidants and less salt and iron); 5) bisphosphonates for preventing bone degradation.; 6) lower body compression garment and oral salt and fluid loading for landing on a planetary surface to combat orthostatic intolerance; 7) laboratory analysis equipment for individualized monitoring of biomarkers in blood, urine and saliva for estimation of health status in; 8) advanced ultrasound techniques for monitoring bone and cardiovascular health; and 9) computer modeling programs for individual health status assessments of efficiency and subsequent adjustments of countermeasures. In particular for future missions into deep space, we are concerned with the synergistic effects of weightlessness, radiation, operational constraints and other spaceflight environmental factors. Therefore, increased collaboration between physiological, behavioral, radiation and space vehicle design disciplines are strongly warranted. Another venue we are exploring in NASA's Human Research Program is the usefulness of artificial gravity for mitigating the health risks of long duration weightlessness.

Norsk, Peter↗

DOE OSTI2021

GPU-accelerated multitiered iterative phasing algorithm for fluctuation X-ray scattering

The multitiered iterative phasing (MTIP) algorithm is used to determine the biological structures of macromolecules from fluctuation scattering data. It is an iterative algorithm that reconstructs the electron density of the sample by matching the computed fluctuation X-ray scattering data to the external observations, and by simultaneously enforcing constraints in real and Fourier space. This paper presents the first ever MTIP algorithm acceleration efforts on contemporary graphics processing units (GPUs). The Compute Unified Device Architecture (CUDA) programming model is used to accelerate the MTIP algorithm on NVIDIA GPUs. The computational performance of the CUDA-based MTIP algorithm implementation outperforms the CPU-based version by an order of magnitude. Furthermore, the Heterogeneous-Compute Interface for Portability (HIP) runtime APIs are used to demonstrate portability by accelerating the MTIP algorithm across NVIDIA and AMD GPUs.

97 MATHEMATICS AND COMPUTING↗