Search NASA⌕ Search

SEARCH · Search NASA

Results for “execution”

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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
DOE OSTI2012

VOLTTRON: An Agent Execution Platform for the Electric Power System

Volttron is an agent execution platform that is engineered for use in the electric power system. Volttron provides resource guarantees for agents and the platform including memory and processor utilization; authentication and authorization services; directory services for agent and resource location; and agent mobility. Unlike most other agent platforms, Volttron does not depend on a single agent authoring language. Instead, we chose to design and implement Volttron as a platform service and framework that is decoupled from the agent execution environment. A prototype implementation of Volttron has been written in Python (using Python v2.7.2) and we have executed agents written in Python and Java and as shell scripts. The intended use of Volttron is in the power distribution system for managing distributed generation, demand-response, and plug-in electric vehicles.

Multi-Agent Systems↗
DOE OSTI2017

Build and Execute Environment

At exascale, the challenge becomes to develop applications that run at scale and use exascale platforms reliably, efficiently, and flexibly. Workflows become much more complex because they must seamlessly integrate simulation and data analytics. They must include down-sampling, post-processing, feature extraction, and visualization. Power and data transfer limitations require these analysis tasks to be run in-situ or in-transit. We expect successful workflows will comprise multiple linked simulations along with tens of analysis routines. Users will have limited development time at scale and, therefore, must have rich tools to develop, debug, test, and deploy applications. At this scale, successful workflows will compose linked computations from an assortment of reliable, well-defined computation elements, ones that can come and go as required, based on the needs of the workflow over time. We propose a novel framework that utilizes both virtual machines (VMs) and software containers to create a workflow system that establishes a uniform build and execution environment (BEE) beyond the capabilities of current systems. In this environment, applications will run reliably and repeatably across heterogeneous hardware and software. Containers, both commercial (Docker and Rocket) and open-source (LXC and LXD), define a runtime that isolates all software dependencies from the machine operating system. Workflows may contain multiple containers that run different operating systems, different software, and even different versions of the same software. We will run containers in open-source virtual machines (KVM) and emulators (QEMU) so that workflows run on any machine entirely in user-space. On this platform of containers and virtual machines, we will deliver workflow software that provides services, including repeatable execution, provenance, checkpointing, and future proofing. We will capture provenance about how containers were launched and how they interact to annotate workflows for repeatable and partial re-execution. We will coordinate the physical snapshots of virtual machines with parallel programming constructs, such as barriers, to automate checkpoint and restart. We will also integrate with HPC-specific container runtimes to gain access to accelerators and other specialized hardware to preserve native performance. Containers will link development to continuous integration. When application developers check code in, it will automatically be tested on a suite of different software and hardware architectures.

Guan, Qiang↗
DOE OSTI2016

Using redundant transactions to verify the correctness of program code execution

In the described embodiments, a processor core (e.g., a GPU core) receives a section of program code to be executed in a transaction from another entity in a computing device. The processor core sends the section of program code to one or more compute units in the processor core to be executed in a first transaction and concurrently executed in a second transaction, thereby creating a “redundant transaction pair.” When the first transaction and the second transaction are completed, the processor core compares a read-set of the first transaction to a read-set of the second transaction and compares a write-set of the first transaction to a write-set of the second transaction. When the read-sets and the write-sets match and no transactional error condition has occurred, the processor core allows results from the first transaction to be committed to an architectural state of the computing device.

Gurumurthi, Sudhanva↗
DOE OSTI2020

Heterogeneous graphics processing unit for scheduling thread groups for execution on variable width SIMD units

A compute unit configured to execute multiple threads in parallel is presented. The compute unit includes one or more single instruction multiple data (SIMD) units and a fetch and decode logic. The SIMD units have differing numbers of arithmetic logic units (ALUs), such that each SIMD unit can execute a different number of threads. The fetch and decode logic is in communication with each of the SIMD units, and is configured to assign the threads to the SIMD units for execution based on such differing numbers of ALUs.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2013

Back from the Brink with Something for Everyone - The Final Executed Memorandum of Agreement for Interpretation of the East Tennessee Technology Park and the K-25 Building - 13370

When the Environmental Management (EM) Program at the Oak Ridge Office of the Department of Energy (DOE) began its major decontamination and decommissioning (D and D) program activities in the mid-1990's, it was understood that the work to demolish the gaseous diffusion process buildings at the K-25 Site, as it was then known, would be challenging. Nothing of that size and breadth had ever been done within the DOE complex and the job brought about a full menu of unique attributes: radiological contamination with enriched materials entrained in certain areas of the system, a facility that was never designed not to operate but had been shut down since 1964, and a loyal following of individuals and organizations who were committed to the physical preservation of at least some portion of the historic Manhattan Project property. DOE was able to solve and resolve the issues related to nuclear materials management, contamination control, and determining the best way to safely and efficiently deconstruct the massive building. However, for a variety of reasons, resolution of the historic preservation questions - what and how much to preserve, how to preserve it, where to preserve it, how to interpret it, how much to spend on preservation, and by and for whom preservation should occur - remained open to debate for over a decade. After a dozen years, countless meetings, phone calls, discussions and other exchanges, and four National Historic Preservation Act (NHPA) [1] Memoranda of Agreement (MOA), a final MOA [2] has been executed. The final executed MOA's measures are robust, creative, substantive, and will be effective. They include a multi-story replica of a portion of the K-25 Building, the dedication of the K-25 Building footprint for preservation purposes, an equipment building to house authentic Manhattan Project and Cold War equipment, a virtual museum, an on-site history center, a grant to preserve a historically-significant Manhattan Project-era hotel in Oak Ridge, and more. The MOA was designed to offer something for everyone. The MOA for the K- 25 Building and interpretation of the East Tennessee Technology Park (ETTP; formerly the K-25 Site) was executed by all of the signatory parties on August 7, 2012 - almost 67 years to-the-day after the 'product' of the K-25 process building became known to more than just a small group of scientists and engineers working on a secret project for the Army Corps of Engineers Manhattan District. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗
DOE OSTI2017

Further Development of an Execution Strategy Analysis (ESA) Capability and Tool for the Management of Spent Nuclear Fuel (SNF) - 17146

An Execution Strategy Analysis (ESA) capability and tool are being developed to evaluate alternative execution strategies for the potential future deployment of a consolidated Interim Storage Facility as part of an integrated waste management system. Application of the ESA approach not only leverages but also goes beyond traditional project analysis tools. The ESA tool allows for ongoing performance assessment of the evolving project execution plans that take into account significant assumptions, risks, and uncertainties throughout the project lifecycle. Development and application of the ESA capability and tool continued in 2016, primarily focusing on enhancing its flexibility to model a range of scenarios regarding how an integrated system for managing spent nuclear fuel and high-level radioactive waste could be deployed. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗
DOE OSTI2015

Nuclear aircraft carrier inactivation - Execution of waste management initiatives - 15565

After 6 years of planning efforts, in June 2013, Newport News Shipbuilding (NNS) began the execution phase of the inactivation of the USS Enterprise. The USS Enterprise decommissioning involves implementation of a new approach to defueling aircraft carriers, utilizing new processes for defueling and shipment of spent nuclear fuel and waste. During planning for this complex endeavor, NNS developed several process improvement initiatives including streamlining waste management processes and technology insertion using modeling and simulation (M and S) capabilities. One of the new approaches involves the establishment of a Waste Packaging Area (WPA) onboard the ship. The process assists with maximizing waste loading and shipments directly from the ship. Another waste management initiative includes the NNS/ Waste Vendor teaming effort to facilitate more efficient loading and shipment of inactivation waste. With execution underway, these initiatives are being put to the test to see if they can withstand the rigors of day-to-day production. NNS has implemented the use of the Modeling and Simulation (M and S) technology. During the planning phase, the M and S 3D Spatial Arrangement Tool was utilized to determine the optimal equipment layout within the new M-290 facility used for spent fuel packaging and ship-out and to determine the appropriate shipping container placement on the ship to maximize waste loading. The M and S technology proved to be a beneficial application resulting in continued utilization through the execution phase of the carrier inactivation. NNS is currently expanding the M-290 Facility Model to provide a visual representation of the facility, its processes, resources, and variable parameters that can be utilized as a decision support tool through simulation of the spent fuel packaging and ship-out process through the facility's life-cycle. NNS is also expanding the application of the waste management model to effectively predict waste forecast. The simulation model is linked with the defueling schedule which captures the operational elements of the waste flow process. The model extrapolates the data to provide waste generation output to assess the most efficient and cost effective path for radiological waste shipments offsite. The ability to conduct waste forecasting allows streamlining of the waste management process in support of complex defueling operations. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗
DOE OSTI2016

Development of an Execution Strategy Analysis (ESA) Capability and Tool for the Management of Spent Nuclear Fuel (SNF) - 16575

An Execution Strategy Analysis (ESA) capability and tool are being developed to evaluate alternative execution strategies for future deployment of a consolidated Interim Storage Facility using a consent-based siting process per the Administration's Strategy for the Management and Disposal of Used Nuclear Fuel and High-Level Radioactive Waste (Strategy). Application of an ESA approach not only leverages but also goes beyond traditional project analysis tools. The ESA tool allows for ongoing performance assessment of the evolving project execution plan that takes into account significant assumptions, risks, and uncertainties throughout the project lifecycle. The ESA process and tool will be used to support the development of plans, budgets, and alternative execution/implementation strategies for meeting the goals of the Strategy. This paper describes the development of the ESA capability and tool and identifies the value of applying such a capability in implementing a long-term strategy for managing spent nuclear fuel and high-level radioactive waste. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗
DOE OSTI2024

Techniques for recovering from errors when executing software applications on parallel processors

In various embodiments, a software program uses hardware features of a parallel processor to checkpoint a context associated with an execution of a software application on the parallel processor. The software program uses a preemption feature of the parallel processor to cause the parallel processor to stop executing instructions in accordance with the context. The software program then causes the parallel processor to collect state data associated with the context. After generating a checkpoint based on the state data, the software program causes the parallel processor to resume executing instructions in accordance with the context.

Hukerikar, Saurabh↗
DOE OSTI2013

Optimizing Tensor Contraction Expressions for Hybrid CPU-GPU Execution

Tensor contractions are generalized multidimensional matrix multiplication operations that widely occur in quantum chemistry. Efficient execution of tensor contractions on Graphics Processing Units (GPUs) requires several challenges to be addressed, including index permutation and small dimension-sizes reducing thread block utilization. Moreover, to apply the same optimizations to various expressions, we need a code generation tool. In this paper, we present our approach to automatically generate CUDA code to execute tensor contractions on GPUs, including management of data movement between CPU and GPU. To evaluate our tool, GPU-enabled code is generated for the most expensive contractions in CCSD(T), a key coupled cluster method, and incorporated into NWChem, a popular computational chemistry suite. For this method, we demonstrate speedup over a factor of 8.4 using one GPU (instead of one core per node) and over 2.6 when utilizing the entire system using hybrid CPU+GPU solution with 2 GPUs and 5 cores (instead of 7 cores per node). Finally, we analyze the implementation behavior on future GPU systems.

CUDA↗
DOE OSTI2017

Guidance for Federal Agencies on Executive Order 13693 - Federal Fleet Management

Document contains guidance on the federal fleet requirements of Executive Order 13693: Planning for Federal Sustainability in the Next Decade and helps federal agencies subject to the executive order develop an overall approach for reducing total fleet greenhouse gas (GHG) emissions and fleet-wide per-mile GHG emissions.

99 GENERAL AND MISCELLANEOUS↗
DOE OSTI2015

Solving a Large Scale Thermal Radiation Problem Using an Interoperable Executive Library Framework on Petascale Supercomputers

We present a novel methodology to compute the transient thermal condi- tion of a set of objects in an open space environment. The governing energy equa- tion and the convective energy transfer are solved by the sparse iterative solvers. The average radiating energy on a set of surfaces is represented by a linear system of the radiosity equations, which is factorized by an out-of-core parallel Cholesky decomposition solver. The coupling and interplay of the direct radiosity solver us- ing GPUs and the CPU-based sparse solver are handled by a light weight software integrator called Interoperable Executive Library (IEL). IEL manages the distribu- tion of data and memory, coordinates communication among parallel processes, and also directs execution of the set of loosely coupled physics tasks as warranted by the thermal condition of the simulated object and its surrounding environment.

Wong, Kwai↗
DOE OSTI2013

ViennaX: a parallel plugin execution framework for scientific computing

We present the free open source plugin execution framework ViennaX for modularizing and parallelizing scientific simulations. In general, functionality is abstracted by the notion of a task, which is implemented as a plugin. The plugin system facilitates the utilization of both, already available functionality as well as new implementations. Each task can define arbitrary data dependencies which are used by ViennaX to build a task graph. The framework supports the execution of this dependence graph based on the message passing interface in either a serial or a parallel fashion. The applied modular approach allows for defining highly flexible simulations, as plugins can be easily exchanged. The framework's general design as well as implementation details are discussed. Applications based on the Mandelbrot set and the solution of a partial differential equation are investigated, and performance results are shown.

Weinbub, Josef↗
DOE OSTI2013

Efficient Heterogeneous Execution on Large Multicore and Accelerator Platforms: Case Study Using a Block Tridiagonal Solver

The algorithmic and implementation principles are explored in gainfully exploiting GPU accelerators in conjunction with multicore processors on high-end systems with large numbers of compute nodes, and evaluated in an implementation of a scalable block tridiagonal solver. The accelerator of each compute node is exploited in combination with multicore processors of that node in performing block-level linear algebra operations in the overall, distributed solver algorithm. Optimizations incorporated include: (1) an efficient memory mapping and synchronization interface to minimize data movement, (2) multi-process sharing of the accelerator within a node to obtain balanced load with multicore processors, and (3) an automatic memory management system to efficiently utilize accelerator memory when sub-matrices spill over the limits of device memory. Results are reported from our novel implementation that uses MAGMA and CUBLAS accelerator software systems simultaneously with ACML for multithreaded execution on processors. Overall, using 940 nVidia Tesla X2090 accelerators and 15,040 cores, the best heterogeneous execution delivers a 10.9-fold reduction in run time relative to an already efficient parallel multicore-only baseline implementation that is highly optimized with intra-node and inter-node concurrency and computation-communication overlap. Detailed quantitative results are presented to explain all critical runtime components contributing to hybrid performance.

Park, Alfred J↗
DOE OSTI2026

An end-to-end workflow for executing a classically bootstrapped variational quantum algorithm on an academic quantum computer

Academic quantum computing platforms often face unique challenges in executing quantum workloads due to fragmented software environments and limited engineering support. Unlike commercial ecosystems, academic devices typically evolve without full-stack integration in mind, making it difficult to run complex applications—such as variational quantum algorithms (VQA)—reliably and efficiently. Issues such as incompatible software layers and lack of automated job management significantly increase the overhead of theory-experiment collaboration. To address these challenges, we develop a modular, end-to-end workflow that decouples application-layer code from low-level hardware control, automates circuit submission and result collection, and supports fine-grained circuit-level job scheduling and recovery. The architecture employs a dual-end application programming interface (API) design, enabling robust operation across unstable or resource-constrained hardware backends. For practical use, the framework is lightweight and user-friendly, allowing rapid prototyping of full-stack workflows using basic Python tools. We validate this workflow on a high-fidelity trapped-ion quantum computer by demonstrating a variational quantum eigensolver (VQE) experiment with a classically bootstrapped ansatz initialization technique. The system successfully executed over 60,000 circuits across multiple molecular test cases with minimal human intervention, highlighting the framework’s effectiveness in enabling reproducible, resilient quantum experimentation in academic settings.

Clifford↗
DOE OSTI2012

Global Futures: a multithreaded execution model for Global Arrays-based applications

We present Global Futures (GF), an execution model extension to Global Arrays, which is based on a PGAS-compatible Active Message-based paradigm. We describe the design and implementation of Global Futures and illustrate its use in a computational chemistry application benchmark (Hartree-Fock matrix construction using the Self-Consistent Field method). Our results show how we used GF to increase the scalability of the Hartree-Fock matrix build to up to 6,144 cores of an Infiniband cluster. We also show how GF's multithreaded execution has comparable performance to the traditional process-based SPMD model.

99 GENERAL AND MISCELLANEOUS↗
DOE OSTI2012

Enabling In-situ Execution of Coupled Scientific Workflow on Multi-core Platform

Emerging scientific application workflows are composed of heterogeneous coupled component applications that simulate different aspects of the physical phenomena being modeled, and that interact and exchange significant volumes of data at runtime. With the increasing performance gap between on-chip data sharing and off-chip data transfers in current systems based on multicore processors, moving large volumes of data using communication network fabric can significantly impact performance. As a result, minimizing the amount of inter-application data exchanges that are across compute nodes and use the network is critical to achieving overall application performance and system efficiency. In this paper, we investigate the in-situ execution of the coupled components of a scientific application workflow so as to maximize on-chip exchange of data. Specifically, we present a distributed data sharing and task execution framework that (1) employs data-centric task placement to map computations from the coupled applications onto processor cores so that a large portion of the data exchanges can be performed using the intra-node shared memory, (2) provides a shared space programming abstraction that supplements existing parallel programming models (e.g., message passing) with specialized one-sided asynchronous data access operators and can be used to express coordination and data exchanges between the coupled components. We also present the implementation of the framework and its experimental evaluation on the Jaguar Cray XT5 at Oak Ridge National Laboratory.

Computer Science↗
DOE OSTI2021

Coding the Computing Continuum: Fluid Function Execution in Heterogeneous Computing Environments

Advances in network technologies have greatly decreased barriers to accessing physically distributed computers. This newfound accessibility coincides with increasing hardware specialization, creating exciting new opportunities to dispatch workloads to the best resource for a specific purpose, rather than those that are closest or most easily accessible. We present Delta, a service designed to intelligently schedule function-based workloads across a distributed set of heterogeneous computing resources. Delta implements an extensible architecture in which different predictors and scheduling algorithms can be integrated to provide dynamically evolving estimates of function execution times on different resources-estimates that can be used to determine the most appropriate location for execution. We describe predictors for function runtime, data transfer time, and cold-start resource provisioning and configuration delay; dynamic learning methods that update predictor models over time; and scheduling strategies that take into account both function and endpoint information. We show that these methods can halve workload makespan when compared with a strategy that selects the fastest resource, and decrease makespan by a factor of five when compared to a round robin strategy, when deployed on a heterogeneous testbed with resources ranging from a Raspberry Pi to a GPU node in an academic cloud.

Computing continuum↗