Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “executive”

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 217 records · Page 12

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↗

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↗

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↗

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↗

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↗

Agreement Execution Process Study: CRADAs and NF-WFO Agreements and the Speed of Business

This report summarizes the findings of a study on the execution of Cooperative Research and Development Agreements (CRADAs) and Non-Federal Work for Others (NF-WFO) agreements across the U.S. Department of Energy (DOE) laboratory complex. The study provides quantitiative estimates of times required to negotiate and execute these agreements across the DOE complex. It identifies factors impacting on cycle times and describes best practicies used at various laboratories and site offices that reduce cycle times.

99 GENERAL AND MISCELLANEOUS↗

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↗

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↗

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↗

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↗

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↗

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↗

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↗

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↗

Implementing Directive-Based Deferred Execution for Effective Network Aggregation

Remote direct memory access technology provides an efficient mechanism for one-sided communication that can be leveraged to implement a distributed shared memory programming model. However, when applications generate large numbers of small, irregular messages, network congestion often arises. Existing solutions address this small message problem by facilitating message aggregation but typically require disruptive code transformations that detract from the algorithmic intent of applications, or can be limited by dependent operations on aggregated data between synchronisation points. A solution is to use a directive-assisted approach that enables compilers to transform code dependent on aggregated communication for deferred execution. This paper presents an algorithm that a compiler can use to implement and optimise deferred execution for code dependent on aggregated data, based on an "aggregation context" extension for the OpenSHMEM partitioned global address space library. This new capability addresses a key challenge of message aggregation, allowing its full potential to reduce network congestion and enhance programmability to be realised.

Welch, Aaron [ORNL]↗

Design, Preparation, and Execution of the 100-AV Field Test for the CIRCLES Consortium: Methodology and Implementation of the Largest Mobile Traffic Control Experiment to Date

This article presents the comprehensive design, setup, execution, and evaluation of the MegaVanderTest (MVT) experiment conducted by the Congestion Impacts Reduction via CAV-in-the-Loop Lagrangian Energy Smoothing (CIRCLES) Consortium, which aimed to mitigate traffic congestion using partially autonomous vehicles (AVs) (see “Summary”). The experiment involved 100 vehicles on Nashville’s Interstate 24 (I-24) highway, utilizing various control algorithms to smooth stop-and-go traffic waves. The execution of the MVT experiment required a coordinated effort from multiple teams. This article details the meticulous planning process, the coordinated efforts of multiple teams, and the innovative use of a dynamic agent-based simulation framework for traffic evaluation. Here, the contributions of this work include demonstrating and providing a detailed roadmap for large-scale live traffic experiments, illustrating the lessons learned from the MVT experiment, and introducing the other articles in this issue and their complementary relationship in the MVT experiment.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Exploiting Redundancy and Application Scalability for Cost-Effective, Time-Constrained Execution of HPC Applications on Amazon EC2

The use of clouds to execute high-performance computing (HPC) applications has greatly increased recently. Clouds provide several potential advantages over traditional supercomputers and in-house clusters. The most popular cloud is currently Amazon EC2, which provides fixed-cost and variable-cost, auction-based options. The auction market trades lower cost for potential interruptions that necessitate checkpointing; if the market price exceeds the bid price, a node is taken away from the user without warning. We explore techniques to maximize performance per dollar given a time constraint within which an application must complete. Specifically, we design and implement multiple techniques to reduce expected cost by exploiting redundancy in the EC2 auction market. We then design an adaptive algorithm that selects a scheduling algorithm and determines the bid price. We show that our adaptive algorithm executes programs up to seven times cheaper than using the on-demand market and up to 44 percent cheaper than the best non-redundant, auction-market algorithm. We extend our adaptive algorithm to incorporate application scalability characteristics for further cost savings. In conclusion, we show that the adaptive algorithm informed with scalability characteristics of applications achieves up to 56 percent cost savings compared to the expected cost for the base adaptive algorithm run at a fixed, user-defined scale.

97 MATHEMATICS AND COMPUTING↗

Simulated execution of hybrid quantum computing systems

We use modeling and simulation to study the behavior and performance of hybrid quantum computing systems. Our approach is based on a layered design with abstract machine models, which identify the key components and interfaces for quantum processing units, quantum programming models, and hybrid execution models. We use discrete-event simulating to track the dynamical state of hierarchical abstract machine models while executing test programs, and we collect statistics on time and energy consumption to forecast the resources required by quantum processors for future scientific computation.

Humble, Travis↗