Search NASA⌕ Search

SEARCH · Search NASA

Results for “concurrent programs”

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 163 records · Page 9
All sourcesNASA NTRSDOE OSTI
DOE OSTI2015

The Role of the CEBAF Element Database in Commissioning the 12GeV Accelerator Upgrade

The CEBAF Element Database (CED) was first developed in 2010 as a resource to support model-driven configuration of the Jefferson Lab Continuous Electron Beam Accelerator (CEBAF). Since that time, its uniquely flexible schema design, robust programming interface, and support for multiple concurrent versions has permitted it to evolve into a more broadly useful operational and control system tool. The CED played a critical role before and during the 2013 startup and commissioning of CEBAF following its 18-month long shutdown and upgrade. Information in the CED about hardware components and their relations to one-another facilitated a thorough Hot Checkout process involving more than 18,000 system checks. New software relies on the CED to generate EDM screens for operators on-demand thereby ensuring that the information on those screens is correct and up-to-date. The CED also continues to fulfill its original mission of supporting model-driven accelerator setup. Using the new ced2elegant and eDT (elegant Download Tool), accelerator physicists have proven able to compute and apply energy-dependant set points with greater efficiency than ever before.

Larrieu, T.↗
NASA NTRS1992

Activities relating to understanding the initiation, organization and structure of moist convection in the Southeast environment

In the spring and summer of 1986, NASA/Marshall Space Flight Center (MSFC) will sponsor the Satellite Precipitation And Cloud Experiment (SPACE) to be conducted in the Central Tennessee, Northern Alabama, and Northeastern Mississippi area. The field program will incorporate high altitude flight experiments associated with meteorological remote sensor development for future space flight, and an investigation of precipitation processes associated with mesoscale and small convective systems. In addition to SPACE, the MIcroburst and Severe Thunderstorm (MIST) program, sponsored by the National Science Foundation (NSF), and the FAA-Lincoln Laboratory Operational Weather Study (FLOWS), sponsored by the Federal Aviation Administration (FAA), will take place concurrently within the SPACE experiment area. All three programs (under the joint acronym COHMEX (COoperative Huntsville Meteorological EXperiment)) will provide a data base for detailed analysis of mesoscale convective systems while providing ground truth comparisons for remote sensor evaluation. The purpose of this document is to outline the experiment design criteria for SPACE, and describe the special observing facilities and data sets that will be available under the COHMEX joint program. In addition to the planning of SPACE-COHMEX, this document covers three other parts of the program. The field program observations' main activity was the operation of an upper air rawinsonde network to provide ground truth for aircraft and spacecraft observations. Another part of the COHMEX program involved using boundary layer mesoscale models to study and simulate the initiation and organization of moist convection due to mesoscale thermal and mechanical circulations. The last part of the program was the collection, archival and distribution of the resulting COHMEX-SPACE data sets.

Mcnider, Richard T.↗
NASA NTRS1990

Space Station Freedom - Configuration management approach to supporting concurrent engineering and total quality management

Some experiences of NASA configuration management in providing concurrent engineering support to the Space Station Freedom program for the achievement of life cycle benefits and total quality are discussed. Three change decision experiences involving tracing requirements and automated information systems of the electrical power system are described. The potential benefits of concurrent engineering and total quality management include improved operational effectiveness, reduced logistics and support requirements, prevention of schedule slippages, and life cycle cost savings. It is shown how configuration management can influence the benefits attained through disciplined approaches and innovations that compel consideration of all the technical elements of engineering and quality factors that apply to the program development, transition to operations and in operations. Configuration management experiences involving the Space Station program's tiered management structure, the work package contractors, international partners, and the participating NASA centers are discussed.

Gavert, Raymond B.↗
NASA NTRS2019

Development and Analysis of the Automated Object Reentry Survival Analysis Tool Parametric Study Wrapper

The NASA Orbital Debris Program Office (ODPO) Safety Group at the Johnson Space Center analyzes reentering spacecraft at the end of life. The program primarily used by ODPO in this effort is the Object Reentry Survival Analysis Tool (ORSAT). ORSAT utilizes shape primitives as well as a variety of other parameters (material, size, thickness, aerodynamic mass, orbit inclination, etc.) to simulate the reentry process and ultimately, to determine if a spacecraft could be hazardous to the population on the ground. The NASA ODPO plans to automate the ORSAT process to run multiple ORSAT input files either concurrently or consecutively. This type of automation program will provide several benefits. First, there is a need to run large parametric studies for ORSAT analysts to gain a greater understanding of reentering object’s sensitivity to certain input variables. Secondly, a database of pre-run ORSAT cases will be used to develop a survivability model, which could be made available to spacecraft developers as a design for demise (D4D) tool. The recently completed Automated Object Reentry Survival Analysis Tool (AutoORSAT) Wrapper is currently being used to build a survivability database, the first step in developing a survivability model. Already, the data that AutoORSAT has produced provides a greater understanding of the sensitivity of variables such as the initial temperature of the spacecraft, spacecraft breakup altitude, and the aerodynamic mass of spacecraft.

Smith, Andrew N.↗
NASA NTRS1994

Composite chronicles: A study of the lessons learned in the development, production, and service of composite structures

A study of past composite aircraft structures programs was conducted to determine the lessons learned during the programs. The study focused on finding major underlying principles and practices that experience showed have significant effects on the development process and should be recognized and understood by those responsible for using of composites. Published information on programs was reviewed and interviews were conducted with personnel associated with current and past major development programs. In all, interviews were conducted with about 56 people representing 32 organizations. Most of the people interviewed have been involved in the engineering and manufacturing development of composites for the past 20 to 25 years. Although composites technology has made great advances over the past 30 years, the effective application of composites to aircraft is still a complex problem that requires experienced personnel with special knowledge. All disciplines involved in the development process must work together in real time to minimize risk and assure total product quality and performance at acceptable costs. The most successful programs have made effective use of integrated, collocated, concurrent engineering teams, and most often used well-planned, systematic development efforts wherein the design and manufacturing processes are validated in a step-by-step or 'building block' approach. Such approaches reduce program risk and are cost effective.

Vosteen, Louis F.↗
DOE OSTI2021

Implementing Arbitrary/Common Concurrent Writes of CRCW PRAM

The Parallel Random Access Machines (PRAM) abstraction is the simplest and most elegant algorithmic model for the design and analysis of parallel algorithms. It consists of different models categorized based on the underlying memory access mode used, the most powerful of which is the Concurrent Read Concurrent Write (CRCW) model. A PRAM algorithm describes a series of rounds, each of which consists of a collection of operations that can be executed concurrently within the same time step. However, the lack of support for concurrent memory accesses and the prevalence of asynchronous programming models led to the belief that implementing CRCW PRAM algorithms is unattainable and prompted many to avoid this model except for theoretical studies of optimal performance.In this work, we study the arbitrary and common concurrent writes in the CRCW PRAM model and explore implementation challenges on general-purpose systems. Moreover, we examine current practices for implementing common/arbitrary concurrent writes and propose a new efficient lightweight and thread-safe method to implement concurrent writes through leveraging atomic instructions. To demonstrate the efficacy of our method, we developed OpenMP kernels for classical CRCW PRAM algorithms and provide experimental results and comparisons based on run time performance measured over the x86 multicore architecture. Our results show a performance speedup compared to current practices up to 4.5x across all our benchmarks.

Ghanim, Fady↗
NASA NTRS1991

F-15 composite engine access door

This paper presents a summary of the successfully concluded phase 1 of the two-phase Design and Manufacture of Advanced Thermoplastic Structures (DMATS) program. It addresses the design, manufacture, and validation testing of a thermoplastic F-15E forward engine access door and includes lessons learned during the concurrent product and process design development phases of the program.

Ramkumar, Ramaswamy L.↗
NASA NTRS2005

X-43 Hypersonic Vehicle Technology Development

NASA recently completed two major programs in Hypersonics: Hyper-X, with the record-breaking flights of the X-43A, and the Next Generation Launch Technology (NGLT) Program. The X-43A flights, the culmination of the Hyper-X Program, were the first-ever examples of a scramjet engine propelling a hypersonic vehicle and provided unique, convincing, detailed flight data required to validate the design tools needed for design and development of future operational hypersonic airbreathing vehicles. Concurrent with Hyper-X, NASA's NGLT Program focused on technologies needed for future revolutionary launch vehicles. The NGLT was "competed" by NASA in response to the President s redirection of the agency to space exploration, after making significant progress towards maturing technologies required to enable airbreathing hypersonic launch vehicles. NGLT quantified the benefits, identified technology needs, developed airframe and propulsion technology, chartered a broad University base, and developed detailed plans to mature and validate hypersonic airbreathing technology for space access. NASA is currently in the process of defining plans for a new Hypersonic Technology Program. Details of that plan are not currently available. This paper highlights results from the successful Mach 7 and 10 flights of the X-43A, and the current state of hypersonic technology.

Voland, Randall T.↗
NASA NTRS2005

Electronic Router

Electronic Router (E-Router) is an application program for routing documents among the cognizant individuals in a government agency or other organization. E-Router supplants a prior 14 NASA Tech Briefs, May 2005 system in which paper documents were routed physically in packages by use of paper slips, packages could be lost, routing times were unacceptably long, tracking of packages was difficult, and there was a need for much photocopying. E-Router enables a user to create a digital package to be routed. Input accepted by E-Router includes the title of the package, the person(s) to whom the package is to be routed, attached files, and comments to reviewers. Electronic mail is used to notify reviewers of needed actions. The creator of the package can, at any time, see the status of the package in the routing structure. At the end of the routing process, E-Router keeps a record of the package and of approvals and/or concurrences of the reviewers. There are commercial programs that perform the general functions of E-Router, but they are more complicated. E-Router is Web-based, easy to use, and does not require the installation or use of client software.

Crusan, Jason↗
DOE OSTI2016

Reaching bandwidth saturation using transparent injection parallelization

Although logically available, applications may not exploit enough instantaneous communication concurrency to maximize network utilization on HPC systems. This is exacerbated in hybrid programming models that combine single program multiple data with OpenMP or CUDA. We present the design of a “multi-threaded” runtime able to transparently increase the instantaneous network concurrency and to provide near saturation bandwidth, independent of the application configuration and dynamic behavior. The runtime offloads communication requests from application level tasks to multiple communication servers. The servers use system specific performance models to attain network saturation. Our techniques alleviate the need for spatial and temporal application level message concurrency optimizations. Experimental results show improved message throughput and bandwidth by as much as 150% for 4 KB messages on InfiniBand and by as much as 120% for 4 KB messages on Cray Aries. For more complex operations such as all-to-all collectives, we observe as much as 30% speedup. This translates into 23% speedup on 12,288 cores for a NAS FT implemented using FFTW. We observe as much as 76% speedup on 1500 cores for an already optimized UPC+OpenMP geometric multigrid application using hybrid parallelism. For the geometric multigrid GPU implementation, we observe as much as 44% speedup on 512 GPUs.

Chaimov, Nicholas↗
DOE OSTI2015

Controlling Combinatorial Complexity in Software and Malware Behavior Computation

Virtually all software is out of intellectual control in that no one knows its full behavior. Software Behavior Computation (SBC) is a new technology for understanding everything software does. SBC applies the mathematics of denotational semantics implemented by function composition in Functional Trace Tables (FTTs) to compute the behavior of programs, expressed as disjoint cases of conditional concurrent assignments. In some circumstances, combinatorial explosions in the number of cases can occur when calculating the behavior of sequences of multiple branching structures. This paper describes computational methods that avoid combinatorial explosions. The predicates that control branching structures such as ifthenelses can be organized into three categories: 1) Independent, resulting in no behavior case explosion, 2) Coordinated, resulting in two behavior cases, or 3) Goaloriented, with potential exponential growth in the number of cases. Traditional FTT-based behavior computation can be augmented by two additional computational methods, namely, Single-Value Function Abstractions (SVFAs) and, introduced in this paper, Relational Trace Tables (RTTs). These methods can be applied to the three predicate categories to avoid combinatorial growth in behavior cases while maintaining mathematical correctness.

Hyperion system↗
DOE OSTI2021

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

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.

97 MATHEMATICS AND COMPUTING↗
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

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 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↗
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↗