SEARCH · Engineering Papers
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.
The goal of this system is to provide a universal method of capturing and integrating campaign level target requirements for experiments at the National Ignition Facility (NIF) prior to establishing a baseline schedule. The expected outcome is a more resilient schedule able to accurately incorporate long lead target requirements.
Schedule risk and cost risk analyses use statistical techniques to predict a level of confidence in meeting a program’s completion date and cost. This paper describes how to interpret key Schedule Risk Analysis (SRA) and Cost Risk Analysis (CRA) results to determine the likelihood that the program completion dates are met, how much management reserve (MR) is needed to provide the acceptable certainty of completion by a specific date, and the risks and activities that are most likely to delay or add cost to a project. The combined process is often called a Schedule/Cost Uncertainty and Risk Analysis or “SCURA.”
The purpose of this study is to evaluate the nuclear waste attributes of Small Modular Reactors (SMRs) scheduled for deployment within this decade using available data and established nuclear waste metrics, with the results compared to a reference large Pressurized Water Reactor (PWR). The current fleet of commercial nuclear reactors in the U.S. is composed of 92 large Light Water Reactors (LWR) with an average electricity generating capacity of over 1,000 MWe each. These large LWRs built on-site in massive construction projects have been the mainstay of the industry for the last 50 years. However, new construction soon is expected to include several designs of smaller reactors primarily fabricated in factories and installed in the field in modules. Some of these SMRs will also be LWRs, while some will use other coolants such as liquid metals, molten salts or gases, and different types of fuels. The technologies and economics of SMRs have been the focus of many studies, but there has been only minimal information published on the amount of nuclear waste different types of SMRs are expected to generate and no reports focused on near-term-deployable designs. In this study, the nuclear waste attributes of three small reactors scheduled for near-term-deployment, VOYGR TM (from NuScale Power), Natrium TM ab (from TerraPower), and Xe-100 (from X-energy), were assessed by comparing nuclear waste metrics with those of a reference large Pressurized Water Reactor (PWR).
Advanced reactor designs differ from the traditional light-water reactor designs and operational requirements in nearly every facet, including the heat transfer fluids, operating temperatures and pressures, and fuel cycle requirements. To account for these differences, significant effort will be required to ensure appropriate safeguards implementation for US-based reactors intended for global deployment. This is the second in a series of three reports that examine facets of this issue. The first paper (ORNL/TM-2021/2142) examines potential construction schedules for advanced reactors to create a baseline understanding of the timeframes involved. This second report characterizes International Atomic Energy Agency (IAEA) safeguards implementation schedules for potential advanced reactors. Finally, the third report (ORNL/TM-2021/2208) examines existing gaps for safeguards implementation at advanced reactors.
The Western Area Power Administration (WAPA) plays a vital role in delivering reliable and cost-effective hydroelectric power to millions of customers across the western United States. The Colorado River Storage Project (CRSP) carries out WAPA’s mission in Arizona, Utah, Colorado, New Mexico, Nevada, Wyoming and Texas. Achieving this mission requires effective management of the Colorado River system, and depends on the use of advanced analytical tools and modeling methodologies. For many years, CRSP has relied on the Generation and Transmission Maximization Superlite (GTMax SL) model for its mid-term and long-term hydroscheduling needs. However, the evolving energy market, power system operations, environmental rules, and hydrology conditions, coupled with advancements in computational capabilities, have necessitated the development of a more modern and robust solution. This report introduces the Colorado River Storage Project Python-based (CRiSPPy) model, a new, advanced hydropower scheduling tool developed to address CRSP ever-evolving challenges. CRiSPPy represents a significant leap forward in our ability to model and optimize the operation of the Colorado River system. It incorporates state-of-the-art optimization algorithms, enhanced data management capabilities, and an advanced graphical user interface, providing WAPA CRSP personnel with unprecedented insights and decision-making support. This document details the development, capabilities, and implementation of CRiSPPy. It is intended to serve as a comprehensive resource for WAPA staff, stakeholders, and anyone interested in the future of hydropower scheduling in the Colorado River Basin. We are confident that CRiSPPy will enhance WAPA's mission while adapting to the challenges of a dynamic and increasingly complex environment. The version of CRiSPPy described in this report is the version 2.3. New versions of CRiSPPy will be developed as the tool keeps evolving to address CRSP challenges.
The NSF-DOE Vera C. Rubin Observatory scheduling team is providing a set of tools for monitoring the scheduler and progress on the Legacy Survey of Space and Time (LSST). These slides provide an overview of available pages and assorted figures on them: the night summary provides an overview of a completed night of observing, including maps of exposures and plots of data quality metrics; the pre-night briefing, an analysis of a simulation of an upcoming night; and a handful of figures that provide information on long-term progress toward LSST survey goals.
Algorithms for sort-last parallel volume rendering on large distributed memory machines usually divide a dataset equally across all nodes for rendering. Depending on the features that a user wants to see in a dataset, all the nodes will rarely finish rendering at the same time. Here, existing compositing algorithms do not often take this into consideration, which can lead to significant delays when nodes that are compositing wait for other nodes that are still rendering. In this paper, we present an image compositing algorithm that uses spatial and temporal awareness to dynamically schedule the exchange of regions in an image and progressively composite images as they become available. Running on the Edison supercomputer at NERSC, we show that a scheduler-based algorithm with awareness of the spatial contribution from each rendering node can outperform traditional image compositing algorithms.
Most parallel scientific programs contain compiler directives (pragmas) such as those from OpenMP, explicit calls to runtime library procedures such as those implementing the Message Passing Interface (MPI), or compiler-specific language extensions such as those provided by CUDA. By contrast, the recent Fortran standards empower developers to express parallel algorithms without directly referencing lower-level parallel programming models. Fortran’s parallel features place the language within the Partitioned Global Address Space (PGAS) class of programming models. When writing programs that exploit data-parallelism, application developers often find it straightforward to develop custom parallel algorithms. Problems involving complex, heterogeneous, staged calculations, however, pose much greater challenges. Such applications require careful coordination of tasks in a manner that respects dependencies prescribed by a directed acyclic graph. When rolling one’s own solution proves difficult, extending a customizable framework becomes attractive. The paper presents the design, implementation, and use of the Framework for Extensible Asynchronous Task Scheduling (FEATS), which we believe to be the first task-scheduling tool written in modern Fortran. We describe the benefits and compromises associated with choosing Fortran as the implementation language, and we propose ways in which future Fortran standards can best support the use case in this paper.
With the great increase of renewable generation as well as the DC loads in the distribution network; DC distribution technology is receiving more attention; since the DC distribution network can improve operating efficiency and power quality by reducing the energy conversion stages. This paper presents a new architecture for the medium voltage AC/DC hybrid distribution network; where the AC and DC subgrids are looped by normally closed AC soft open point (ACSOP) and DC soft open point (DCSOP); respectively. The proposed AC/DC hybrid distribution systems contain renewable generation (i.e., wind power and photovoltaic (PV) generation); energy storage systems (ESSs); soft open points (SOPs); and both AC and DC flexible demands. An energy management strategy for the hybrid system is presented based on the dynamic optimal power flow (DOPF) method. The main objective of the proposed power scheduling strategy is to minimize the operating cost and reduce the curtailment of renewable generation while meeting operational and technical constraints. The proposed approach is verified in five scenarios. The five scenarios are classified as pure AC system; hybrid AC/DC system; hybrid system with interlinking converter; hybrid system with DC flexible demand; and hybrid system with SOPs. Results show that the proposed scheduling method can successfully dispatch the controllable elements; and that the presented architecture for the AC/DC hybrid distribution system is beneficial for reducing operating cost and renewable generation curtailment.
Deep Space Network scheduling program allocates resources based on the users requirements. The system reviews and allocates the requests for equipment and resources. Depending upon the program input either the seven day or the twelve week schedule is generated.
Scheduling Analysis Model for Mission Integrated Experiments /SAMMIE/ for crew rotation cycle scheduling by digital computer within mission plan constraints
In-flight F-111 data on total and static pressure from left inlet during automatically scheduled and manually controlled off-schedule positioning of spike at Mach 0.68 to 2.18
The development of the Skylab crew activities schedule is discussed. The results are presented for the experiment and operations scheduling procedure evaluation.
A general scheduling algorithm for aircraft from terminal area entry to touchdown is developed. The method has the following novel features: (1) many speed classes of aircraft are considered and speed variations within classes and along portions of the flight path are permitted; (2) multiple paths are considered which may merge or diverge - the analysis is not restricted to a single runway nor to departures only; (3) landings are scheduled along conflict free flight paths in minimum time. The algorithm is currently being incorporated in a fast-time simulation of a STOL air traffic system.
The capabilities of the specified scheduling language and the program module library are outlined. The summary is written with the potential user in mind and, therefore, provides maximum insight on how the capabilities will be helpful in writing scheduling programs. Simple examples and illustrations are provided to assist the potential user in applying the capabilities of his problem.
Description of the development and operation of a vehicle-scheduling algorithm which has applications to the NASA problem of assigning payloads to space delivery vehicles. The algorithm is based on a discrete, integer-valued, nonserial, dynamic-programming solution to the classical problem of developing resource utilization plans with limited resources. The algorithm places special emphasis on incorporating interpayload (precedence) relationships; maintaining optimal alternate schedule definitions (a unique feature of dynamic programming) in the event of contingencies (namely, resource inventory changes) without problem resolution; and, by using a special information storage technique, reducing the computational complexity of solving realistic problems.
An attempt is made to extend the generality of timeouts from positive reinforcement to more complex performances. Pigeons were provided with three continuously available options. Responses on one key resulted in food reinforcement under a progressive-ratio schedule, which requires a larger number of responses for successive reinforcements; responses on a second key, which were shocked, reset the progressive-ratio schedule to its first step; and responses on a third key produced a 3-min timeout. Some of these conditions have been studied previously (Dardano, 1968, 1973; Findley, 1958). Questions of general interest included the frequency and stability of response-produced timeouts, changes in the properties of the progressive-ratio performance resulting from the occurrence of timeouts, and the similarity of the relationships between timeouts and the reinforced behavior to relationships found under simpler conditions of reinforcement.
Travel markets which would be served by high speed commercial transport aircraft and the ability of the airlines to schedule and route the aircraft in a way that would achieve good daily utilization and productivity are examined. The following areas are considered: (1) identification of the major long-haul city pairs that would most likely demand nonstop service; (2) selection of flight tracks observing alternative sonic boom restrictions; (3) estimation of flight times for all city pairs for the various sonic boom constraints; (4) impact of airport curfews on possible departure and arrival schedules; (5) projection of passenger traffic volumes on the selected city pairs; and (6) potential daily utilization and aircraft productivity.