Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “schedules”

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 235 records · Page 13
All sourcesNASA NTRSDOE OSTI
NASA NTRS2007

In-Space Crew-Collaborative Task Scheduling

For all past and current human space missions, the final scheduling of tasks to be done in space has been devoid of crew control, flexibility, and insight. Ground controllers, with minimal input from the crew, schedule the tasks and uplink the timeline to the crew or uplink the command sequences to the hardware. Prior to the International Space Station (ISS), the crew could make requests about tomorrow s timeline, they could omit a task, or they could request that something in the timeline be delayed. This lack of control over one's own schedule has had negative consequences. There is anecdotal consensus among astronauts that control over their own schedules will mitigate the stresses of long duration missions. On ISS, a modicum of crew control is provided by the job jar. Ground controllers prepare a task list (a.k.a. "job jar") of non-conflicting tasks from which jobs can be chosen by the in space crew. Because there is little free time and few interesting non-conflicting activities, the task-list approach provides little relief from the tedium of being micro-managed by the timeline. Scheduling for space missions is a complex and laborious undertaking which usually requires a large cadre of trained specialists and suites of complex software tools. It is a giant leap from today s ground prepared timeline (with a job jar) to full crew control of the timeline. However, technological advances, currently in-work or proposed, make it reasonable to consider scheduling a collaborative effort by the ground-based teams and the in-space crew. Collaboration would allow the crew to make minor adjustments, add tasks according to their preferences, understand the reasons for the placement of tasks on the timeline, and provide them a sense of control. In foreseeable but extraordinary situations, such as a quick response to anomalies and extended or unexpected loss of signal, the crew should have the autonomous ability to make appropriate modifications to the timeline, extend the timeline, or even start over with a new timeline. The Vision for Space Exploration (VSE), currently being pursued by the National Aeronautics and Space Administration (NASA), will send humans to Mars in a few decades. Stresses on the human mind will be exacerbated by the longer durations and greater distances, and it will be imperative to implement stress-reducing innovations such as giving the crew control of their daily activities.

Jaap, John↗
NASA NTRS2011

Prescribed Travel Schedules for Fatigue Management

The NASA Fatigue Management Team is developing recommendations for managing fatigue during travel and for shift work operations, as Clinical Practice Guidelines for the Management of Circadian Desynchrony in ISS Operations. The Guidelines provide the International Space Station (ISS ) flight surgeons and other operational clinicians with evidence-based recommendations for mitigating fatigue and other factors related to sleep loss and circadian desynchronization. As much international travel is involved both before and after flight, the guidelines provide recommendations for: pre-flight training, in-flight operations, and post-flight rehabilitation. The objective of is to standardize the process by which care is provided to crewmembers, ground controllers, and other support personnel such as trainers, when overseas travel or schedule shifting is required. Proper scheduling of countermeasures - light, darkness, melatonin, diet, exercise, and medications - is the cornerstone for facilitating circadian adaptation, improving sleep, enhancing alertness, and optimizing performance. The Guidelines provide, among other things, prescribed travel schedules that outline the specific implementation of these mitigation strategies. Each travel schedule offers evidence based protocols for properly using the NASA identified countermeasures for fatigue. This presentation will describe the travel implementation schedules and how these can be used to alleviate the effects of jet lag and/or schedule shifts.

Whitmire, Alexandra↗
NASA NTRS2013

Scheduling Operations for Massive Heterogeneous Clusters

High-performance computing (HPC) programming has become increasingly difficult with the advent of hybrid supercomputers consisting of multicore CPUs and accelerator boards such as the GPU. Manual tuning of software to achieve high performance on this type of machine has been performed by programmers. This is needlessly difficult and prone to being invalidated by new hardware, new software, or changes in the underlying code. A system was developed for task-based representation of programs, which when coupled with a scheduler and runtime system, allows for many benefits, including higher performance and utilization of computational resources, easier programming and porting, and adaptations of code during runtime. The system consists of a method of representing computer algorithms as a series of data-dependent tasks. The series forms a graph, which can be scheduled for execution on many nodes of a supercomputer efficiently by a computer algorithm. The schedule is executed by a dispatch component, which is tailored to understand all of the hardware types that may be available within the system. The scheduler is informed by a cluster mapping tool, which generates a topology of available resources and their strengths and communication costs. Software is decoupled from its hardware, which aids in porting to future architectures. A computer algorithm schedules all operations, which for systems of high complexity (i.e., most NASA codes), cannot be performed optimally by a human. The system aids in reducing repetitive code, such as communication code, and aids in the reduction of redundant code across projects. It adds new features to code automatically, such as recovering from a lost node or the ability to modify the code while running. In this project, the innovators at the time of this reporting intend to develop two distinct technologies that build upon each other and both of which serve as building blocks for more efficient HPC usage. First is the scheduling and dynamic execution framework, and the second is scalable linear algebra libraries that are built directly on the former.

Humphrey, John↗
NASA NTRS2014

Design Principles and Algorithms for Air Traffic Arrival Scheduling

This report presents design principles and algorithms for building a real-time scheduler of arrival aircraft based on a first-come-first-served (FCFS) scheduling protocol. The algorithms provide the conceptual and computational foundation for the Traffic Management Advisor (TMA) of the Center/terminal radar approach control facilities (TRACON) automation system, which comprises a set of decision support tools for managing arrival traffic at major airports in the United States. The primary objective of the scheduler is to assign arrival aircraft to a favorable landing runway and schedule them to land at times that minimize delays. A further objective of the scheduler is to allocate delays between high-altitude airspace far away from the airport and low-altitude airspace near the airport. A method of delay allocation is described that minimizes the average operating cost in the presence of errors in controlling aircraft to a specified landing time. This report is a revision of an earlier paper first presented as part of an Advisory Group for Aerospace Research and Development (AGARD) lecture series in September 1995. The authors, during vigorous discussions over the details of this paper, felt it was important to the air-trafficmanagement (ATM) community to revise and extend the original 1995 paper, providing more detail and clarity and thereby allowing future researchers to understand this foundational work as the basis for the TMA's scheduling algorithms.

Center TRACON↗
NASA NTRS2019

Evolving Management Strategies to Improve NASA Flagship's Cost and Schedule Performance: LUVOIR as a Case Study

The large ultraviolet optical infrared surveyor (LUVOIR) study process has brought to fruition an extremely exciting scientific mission concept. The 3.5 year LUVOIR study duration enabled an unprecedented level of scientific, engineering, and technology thoroughness prior to the Astro2020 Decadal. This detail also shed light on many technical and programmatic challenges for efficiently developing a mission of this scale within the context of NASA’s flagships cost and schedule performances to date. While NASA’s flagships perform exquisitely once on orbit, there is understandable growing frustration in their development cost and schedule overruns. We felt it incumbent upon ourselves to ask how we could improve on delivering LUVOIR (or any of NASA’s future flagships) on schedule and on budget, not just for the next mission, but for all NASA large strategic missions to come. We researched past and current NASA flagship’s lessons learned publications and other large government projects that pointed to some systemic challenges that will only grow with larger and more complex strategic missions. Our findings pointed us to some ways that could potentially evolve NASA’s current flagship management practices to help improve on their development cost and schedule performance despite their growing complexity. This paper briefly comments on the motivations for NASA’s flagships and on the science motivations for a LUVOIR-like mission. We argue the incentives for improving NASA’s flagships development cost and schedule performance. We review the specific additional challenges of NASA’s flagships to acknowledge their specific issues. We then examine the most repeated systemic challenges we found from previous NASA flagships and other large government projects lessons learned/observed. Lastly, we offer recommendations to tackle these repeated systemic challenges facing NASA’s flagships. The recommendations culminate into a proactive integrated development and funding framework to enable improving the execution of NASA’s future flagship’s cost and schedule performance.

Crooke, Julie A.↗
NASA NTRS2019

A Scheduling Algorithm Compatible with a Distributed Management of Arrivals in the National Airspace System

The current system used by the FAA to schedule arrivals is the Traffic Based Flow Manager (TBFM). It is a centralized system that gives an operator (airline) no influence over scheduled times of arrival assigned to its flights. Future systems for managing arrival scheduling are proposed as distributed systems. Such a system is called upon to give operators influence to schedule and negotiate resources for their flights, and to resolve other technical challenges, such as eliminating a single point of failure. A distributed system for managing diverse air traffic will need the capability of computing a schedule for the given arriving flights in a way that complies with the operational constraints. This paper contributes an algorithm that computes such a schedule. Although developed as part of an effort toward a distributed system, the algorithm itself is neither inherently distributed nor inherently centralized and can be used in either type of system.

Sadovsky, A.↗
NASA NTRS2020

Dynamic Scheduling: Target of Opportunity Observations of Gravitational Wave Events

The simultaneous detection of electromagnetic and gravitational waves from the coalescence of two neutron stars (GW170817 and GRB170817A) has ushered in a new era of ‘multimessenger’ astronomy, with electromagnetic detections spanning from gamma to radio. This great opportunity for new scientific investigations raises the issue of how the available multimessenger tools can best be integrated to constitute a powerful method to study the transient Universe in particular. To facilitate the classification of possible optical counterparts to gravitational wave events, it is important to optimize the scheduling of observations and the filtering of transients, both key elements of the follow-up process. In this work, we describe the existing workflow whereby telescope networks such as GRANDMA and GROWTH are currently scheduled; we then present modifications we have developed for the scheduling process specifically, so as to face the relevant challenges that have appeared during the latest observing run of Advanced LIGO and Advanced Virgo. We address issues with scheduling more than one epoch for multiple fields within a skymap, especially for large and disjointed localizations. This is done in two ways: by optimizing the maximum number of fields that can be scheduled and by splitting up the lobes within the skymap by right ascension to be scheduled individually. In addition, we implement the ability to take previously observed fields into consideration when rescheduling. We show the improvements that these modifications produce in making the search for optical counterparts more efficient, and we point to areas needing further improvement.

Gravitational waves↗
NASA NTRSDate not supplied

The First Year of KOKEE12M-WETTZ13S VGOS Intensive Scheduling: Status and Efforts Towards Improvement

The KOKEE12M-WETTZ13S (K2-Ws) Intensive series began on January 4, 2021. Evaluation of the first year of schedules has shown that the series is performing reasonably weel, but the schedules could be improved. For example, the number of scheduled observations in a typical 2021 K2-Ws session is approximately half that of the first few MACGO12M-WETTZ13S Intensive sessions, and scheduling fewer observations negatively impats UT1 results. Also, preliminary analysis of the scheduled and achieve SNRs of the K2-Ws observations and the SNRs' ratios shows examples where the achieved SNRs are either too high, indicating long observations that could have been replaced by a greater number of shorter observations, or too low, indicating a lack of robustness that could lead to observation loss. In this poster, we describe key aspects of how the K2-Ws Intensives have been scheduled in 2021. Then we discuss the areas of concern and the status of efforts to make improvements in these areas.

Karen Baver↗
DOE OSTI2020

Locality-Aware Scheduling for Scalable Heterogeneous Environments

Heterogeneous computing promise boost performance of scientific applications by allowing massively parallel execution of computational tasks. However, manually managing extremely heterogeneous, multi-device systems is complicated and may result in sub-optimal performance. Specifically, data management is an extremely challenging problem on multi-device systems. In this work, we introduce two locality-aware schedulers for the Minos Computing Library (MCL), an asynchronous, task-based programming model and runtime for extremely heterogeneous systems. The first scheduler implements a pure locality-aware algorithm to maximize data reuse, though it might incur in ”hot-spots” that limit system utilization. The second scheduler mitigates this drawback by dynamically targeting between locality-awareness and system utilization based on the current workload and available computing devices. Our results show that locality-awareness greatly benefit applications that exhibit data reuse, providing up to 6.9x and 7.9x over the original MCL scheduler and equivalent OpenCL implementations, respectively. Moreover, our schedulers introduce negligible overhead compared with the original MCL scheduler and achieve similar performance for applications that don’t benefit from data locality.

Architecture, co-design, Task-based programming mo↗
DOE OSTI2022

Compressing micro-operations in scheduler entries in a processor

An electronic device includes a processor having a micro-operation queue, multiple scheduler entries, and scheduler compression logic. When a pair of micro-operations in the micro-operation queue is compressible in accordance with one or more compressibility rules, the scheduler compression logic acquires the pair of micro-operations from the micro-operation queue and stores information from both micro-operations of the pair of micro-operations into different portions in a single scheduler entry. In this way, the scheduler compression logic compresses the pair of micro-operations into the single scheduler entry.

Boyer, Michael W.↗
DOE OSTI2020

14 Steps to Creating Value in Cost and Schedule Resources for Nuclear Waste Management - 20188

While Waste Management budgets are shrinking, DOE required cost and schedule controls are becoming increasingly stringent. At the same time, there is a scarcity of adept, qualified, and competent projects controls staff who both understand nuclear waste management and are capable of addressing today's cost and schedule challenges. In response, we have developed a systematic approach to training and mentoring project controls staff. The approach is based on the observations and lessons learned on projects, both successful and unsuccessful, over the past 20 years. During that time, we evaluated staff development and used that experience to design a program that progresses the maturity, knowledge and experience of the individual. The program is based on the unique needs of cost and schedule specialists while incorporating the best leadership and managerial applications. The system is not limited to developing individual software skills, which is a primary focus of many project controls training programs. Instead, our system develops an individual's soft and hard skill sets. The system develops the user's skill, talent, attitude, and drive to do the best job possible. It focuses on all aspects of becoming a more productive technical team while accepting responsibility for individual growth. It also enhances the project controls team by setting up checks and balances that everyone is aware of and participates in. The system is based on 14 steps of increasing complexity in knowledge and application. The system clarifies roles, responsibilities and expectations. It helps eliminate uncertainty and reduces stress on staff and managers. It contains everyday routine actions and is simple to implement. It allows the development of a consistent rhythm to staff growth and development. Mastering the steps will allow the user to achieve excellence in cost and schedule control. The 14 steps are: 1 - Key Performance Objectives, 2 - Check Lists, 3 - Desktop Guides, 4 - System Description, 5 - Procedures, 6 - Software and On the Job Training (OTJ), 7 - Traceability Checks, 8 - Surveillances, 9 - 32 Criteria, 10 - The Contract, 11 - Customer/Government Guidance, 12 - Training and Mentoring Others, 13 - Master your weekly and daily schedules, 14 - Improving your interpersonal skills. Application and mastery of this system will produce better cost and schedule control results. Your project controls staff will write better reports, analyze data better, make better use of their time, and be more valuable to decision makers. If followed rigorously, our system will produce a great project controls team, which is invaluable to the success of each project. (authors)

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

Three practical workflow schedulers for easy maximum parallelism

Runtime scheduling and workflow systems are an increasingly popular algorithmic component in HPC because they allow full system utilization with relaxed synchronization requirements. There are so many special-purpose tools for task scheduling, one might wonder why more are needed. Use cases seen on the Summit supercomputer needed better integration with MPI and greater flexibility in job launch configurations. Preparation, execution, and analysis of computational chemistry simulations at the scale of tens of thousands of processors revealed three distinct workflow patterns. A separate job scheduler was implemented for each one using extremely simple and robust designs: file-based, task-list based, and bulk-synchronous. Comparing to existing methods shows unique benefits of this work, including simplicity of design, suitability for HPC centers, short startup time, and well-understood per-task overhead. All three new tools have been shown to scale to full utilization of Summit, and have been made publicly available with tests and documentation. This work presents a complete characterization of the minimum effective task granularity for efficient scheduler usage scenarios. Here, these schedulers have the same bottlenecks, and hence similar task granularities as those reported for existing tools following comparable paradigms.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

An exploration of online-simulation-driven portfolio scheduling in Workflow Management Systems

Workflow Management Systems used to automate the execution of scientific workflow applications on parallel and distributed computing platforms must make scheduling decisions at runtime. A large number of workflow scheduling algorithms have been proposed in the literature, but often these algorithms are evaluated based on simplifying assumptions that may not hold in practice. Furthermore, published algorithm evaluation and/or comparison results are necessarily only for a subset of all possible scenarios, and thus may not include scenarios relevant to particular use-cases. Consequently, it is difficult for Workflow Management Systems (WMSs) developers to decide which scheduling algorithm should be implemented. To obviate this difficulty, one possible approach is to implement a portfolio of scheduling algorithms and select the most effective algorithm at runtime. One method for performing this selection is to run an online simulation for each algorithm in the portfolio. The algorithm that leads to the best performance, in simulation, is selected for future use. The above simulation-driven portfolio scheduling (SDPS) approach has been proposed in a few parallel and distributed computing contexts. The main objective of this work is to evaluate the feasibility and potential merit of SDPS if implemented in WMSs. Here we perform this evaluation using simulated WMS executions, where the simulations are instantiated from real-world platform and workflow configurations. Our main finding is that SDPS is on par with or outperforms an approach in which a single algorithm is used, where this algorithm is the one that performs best on average across all our experimental scenarios. Furthermore, we find that SDPS remains an attractive proposition even in the presence of high levels of simulation error and for simulators with relatively low levels of sophistication. In many of our experimental scenarios we find that mitigating simulation error at runtime can further improve performance. Finally, we show that simulation overhead can be made sufficiently low for SDPS to be feasible in practice.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Integrated charging infrastructure planning and charging scheduling for battery electric bus systems

We report studies on the electric bus system planning problem have typically focused exclusively on either the deployment of charging infrastructure or the scheduling of charging events; few have examined the impact of charging facility deployment on charging activities. Considering the interdependence of system design and operational strategies, this study proposes a two-phase optimization framework for charging infrastructure planning and charging scheduling for battery electric bus systems. An integrated optimization model is first developed to simultaneously optimize charger deployment, on-board battery capacity, and charging schedules. A charging scheduling model is further proposed and a rolling horizon approach is utilized in the second phase to optimize the real-time charging scheduling of electric buses. Compared to existing electric bus system planning methods, the proposed integrated model can reduce the total system cost by 19.5%. In addition, compared to uncontrolled charging, the proposed rolling horizon-based charging strategy can reduce the total charging cost by 68.3%.

25 ENERGY STORAGE↗
DOE OSTI2023

Hydropower Scheduling Toolchains: Comparing Experiences in Brazil, Norway, and USA and Implications for Synergistic Research

While hydropower scheduling is a well-defined problem, there are institutional differences that need to be identified to promote constructive and synergistic research. We study how established toolchains of computer models are organized to assist operational hydropower scheduling in Brazil, Norway, and the United States’ Colorado River System (CRS). These three systems have vast hydropower resources, with numerous, geographically widespread, and complex reservoir systems. Although the underlying objective of hydropower scheduling is essentially the same, the systems are operated in different market contexts and with different alternative uses of water, where the stakeholders’ objectives clearly differ. This in turn leads to different approaches when it comes to the scope, organization, and use of models for operational hydropower scheduling and the information flow between the models. Here, we describe these hydropower scheduling toolchains, identify the similarities and differences, and shed light on the original ideas that motivated their creation. We then discuss the need to improve and extend the current toolchains and the opportunities to synergistic research that embrace those contextual differences.

13 HYDRO ENERGY↗
DOE OSTI2025

Link Scheduling in Satellite Networks via Machine Learning Over Riemannian Manifolds

Low Earth Orbit (LEO) satellites play a crucial role in enhancing global connectivity, serving a complementary solution to existing terrestrial systems. In wireless networks, scheduling is a vital process that allocates time-frequency resources to users for interference management. However, LEO satellite networks face significant challenges in scheduling their links towards ground users due to the satellites’ mobility and overlapping coverage. This paper addresses the dynamic link scheduling problem in LEO satellite networks by considering spatio-temporal correlations introduced by the satellites’ movements. The first step in the proposed solution involves modeling the network over Riemannian manifolds, thanks to their representation as symmetric positive definite matrices. We introduce two machine learning (ML)-based link scheduling techniques that model the dynamic evolution of satellite positions and link conditions over time and space. To accurately predict satellite link states, we present a recurrent neural network (RNN) over Riemannian manifolds, which captures spatio-temporal characteristics over time. Furthermore, we introduce a separate model, the convolutional neural network (CNN) over Riemannian manifolds, which captures geometric relationships between satellites and users by extracting spatial features from the network topology across all links. Simulation results demonstrate that both RNN and CNN over Riemannian manifolds deliver comparable performance to the fractional programming-based link scheduling (FPLinQ) benchmark. Remarkably, unlike other ML-based models that require extensive training data, both models only need 30 training samples to achieve over 99% of the sum rate while maintaining similar computational complexity relative to the benchmark.

42 ENGINEERING↗
DOE OSTI2021

Stochastic Continuous-time Flexibility Scheduling and Pricing in Wholesale Electricity Markets

Large-scale integration of intermittent renewable energy sources (RES) is calling for additional flexibility resources as well as more advanced modeling and optimization techniques to account for the increasing uncertainty and variability in power systems operation. As the RES integration gains momentum, the magnitude and frequency of their variations increase, which may trigger ramping scarcity events in real-time power systems operation. This necessitates revisiting the present definition of power systems flexibility and reserve services to reflect their robustness and adequacy towards sub-interval variations of the load and RES, as well as adjusting the operation models to accommodate the new reserve services. This project took a fundamental approach and aimed at developing continuous-time scheduling and pricing model that accurately models the continuous-time variations of load and RES and efficiently deploys the ramping capability of flexible resources to compensate the sources of variability and uncertainty in the market. In this regard, this project pursued the following goals: Developing stochastic multi-fidelity continuous-time optimization models for scheduling of energy storage (ES) systems and flexible loads in wholesale energy markets; Developing the theory and practices of continuous-time locational marginal pricing for valuating energy storage systems and flexible loads in wholesale energy markets; Developing function space solution approach to convert the proposed stochastic multi-fidelity continuous-time optimization models into tractable mixed-integer linear optimization models; and Defining flexibility reserve as a new type of reserve in markets that would enable ultimate participation of energy storage devices in provision of services to compensate the variability and uncertainty of RES in electricity markets. This project successfully completed all five major tasks defined in the SOPO, and produced 8 high-impact journal papers, 6 conference papers, 3 published U.S. patents, and one web-based software for continuous-time operation optimization of power systems. The application of the proposed flexibility reserve and the stochastic multi-fidelity continuous-time operation scheduling models would modify the forward commitment and schedule of generating units, ES devices and flexible loads, and would line up the resources in such a way that the composition of available resources is better prepared to respond to the sub-hourly variations of the load and renewable resources in real-time operation. Therefore, this project paves the way to sustainable, reliable, and economic integration of renewable energy resources in power system, supporting the progress towards reaching the national targets on energy independence. Even if the proposed models offers a radically different point of view as compared to existing models, it does not alter fundamentally the architecture of power systems operations, nor the complexity of the scheduling problem, so the integration of this project in power systems is extremely practical.

24 POWER TRANSMISSION AND DISTRIBUTION↗
NASA NTRS2011

Multi-Objective Scheduling for the Cluster II Constellation

This paper describes the application of the MUSE multiobjecctive scheduling framework to the Cluster II WBD scheduling domain. Cluster II is an ESA four-spacecraft constellation designed to study the plasma environment of the Earth and it's magnetosphere. One of the instruments on each of the four spacecraft is the Wide Band Data (WBD) plasma wave experiment. We have applied the MUSE evolutionary algorithm to the scheduling problem represented by this instrument, and the result has been adopted and utilized by the WBD schedulers for nearly a year. This paper describes the WBD scheduling problem, its representation in MUSE, and some of the visualization elements that provide insight into objective value tradeoffs.

observatory scheduilng↗